Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
5,400 | 5,400 | 12,771,520 | 2,178 | Methods and apparatus are provided to promote interoperability between devices having different user input devices by correlating user input that is provided via one or more input mechanisms of a client device to touch events on the server device. The method may maintain a terminal session between a server device and a client device in which the client device simulates at least a portion of a display generated at the server device. The method may access a mapping between touch events on the server device and actuation of respective input mechanisms of the client device. The method may also interpret one or more control signals provided in response to actuation of an input mechanism based upon the mapping and may then cause a user interface state of the server device to updated based on the actuation of the input mechanism of the client device. | 1. A method comprising:
maintaining a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; accessing a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpreting one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and causing a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 2. A method according to claim 1 further comprising:
receiving an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generating the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 3. A method according to claim 2 further comprising receiving an indication of a range of values associated with one or more input mechanisms, wherein generating the mapping comprises mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 4. A method according to claim 2 wherein receiving the functional category of each input mechanism comprises receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 5. A method according to claim 1 further comprising receiving the one or more control signals prior to interpreting the one or more control signals. 6. A method according to claim 1 wherein causing the user interface state to be updated comprises causing a focus of the display of the server device to be changed, and wherein the method further comprises causing a display of the client device to be updated in accordance with the display of the server device. 7. A method according to claim 1 wherein causing the user interface state to be updated comprises causing an element of the display of the server device to be selected. 8. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:
maintain a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; access a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpret one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and cause a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 9. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to:
receive an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generate the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 10. An apparatus according to claim 9 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive an indication of a range of values associated with one or more input mechanisms, and to generate the mapping by mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 11. An apparatus according to claim 9 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive the functional category of each input mechanism by receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 12. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive the one or more control signals prior to interpreting the one or more control signals. 13. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to cause the user interface state to be updated by causing a focus of the display of the server device to be changed, and to cause a display of the client device to be updated in accordance with the display of the server device. 14. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to cause the user interface state to be updated by causing an element of the display of the server device to be selected. 15. An apparatus according to claim 8 further comprising user interface circuitry configured to:
facilitate user control of at least some functions of the apparatus through use of a display; and
cause at least a portion of a user interface of the apparatus to be displayed on the display to facilitate user control of at least some functions of the apparatus. 16. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
maintaining a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; accessing a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpreting one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and causing a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 17. A computer program product according to claim 16 wherein the computer-executable program code portions further comprise program code instructions for:
receiving an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generating the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 18. A computer program product according to claim 17 wherein the computer-executable program code portions further comprise program code instructions for receiving an indication of a range of values associated with one or more input mechanisms, wherein the program code instructions for generating the mapping comprise program code instructions for mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 19. A computer program product according to claim 17 wherein the program code instructions for receiving the functional category of each input mechanism comprise program code instructions for receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 20. A computer program product according to claim 16 wherein the computer-executable program code portions further comprise program code instructions for receiving the one or more control signals prior to interpreting the one or more control signals. | Methods and apparatus are provided to promote interoperability between devices having different user input devices by correlating user input that is provided via one or more input mechanisms of a client device to touch events on the server device. The method may maintain a terminal session between a server device and a client device in which the client device simulates at least a portion of a display generated at the server device. The method may access a mapping between touch events on the server device and actuation of respective input mechanisms of the client device. The method may also interpret one or more control signals provided in response to actuation of an input mechanism based upon the mapping and may then cause a user interface state of the server device to updated based on the actuation of the input mechanism of the client device.1. A method comprising:
maintaining a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; accessing a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpreting one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and causing a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 2. A method according to claim 1 further comprising:
receiving an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generating the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 3. A method according to claim 2 further comprising receiving an indication of a range of values associated with one or more input mechanisms, wherein generating the mapping comprises mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 4. A method according to claim 2 wherein receiving the functional category of each input mechanism comprises receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 5. A method according to claim 1 further comprising receiving the one or more control signals prior to interpreting the one or more control signals. 6. A method according to claim 1 wherein causing the user interface state to be updated comprises causing a focus of the display of the server device to be changed, and wherein the method further comprises causing a display of the client device to be updated in accordance with the display of the server device. 7. A method according to claim 1 wherein causing the user interface state to be updated comprises causing an element of the display of the server device to be selected. 8. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:
maintain a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; access a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpret one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and cause a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 9. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to:
receive an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generate the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 10. An apparatus according to claim 9 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive an indication of a range of values associated with one or more input mechanisms, and to generate the mapping by mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 11. An apparatus according to claim 9 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive the functional category of each input mechanism by receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 12. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive the one or more control signals prior to interpreting the one or more control signals. 13. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to cause the user interface state to be updated by causing a focus of the display of the server device to be changed, and to cause a display of the client device to be updated in accordance with the display of the server device. 14. An apparatus according to claim 8 wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to cause the user interface state to be updated by causing an element of the display of the server device to be selected. 15. An apparatus according to claim 8 further comprising user interface circuitry configured to:
facilitate user control of at least some functions of the apparatus through use of a display; and
cause at least a portion of a user interface of the apparatus to be displayed on the display to facilitate user control of at least some functions of the apparatus. 16. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
maintaining a terminal session between a server device and a client device in which the client device emulates at least a portion of a display generated at the server device; accessing a mapping between touch events on the server device and actuation of respective input mechanisms of the client device; interpreting one or more control signals provided responsive to actuation of an input mechanism based upon the mapping; and causing a user interface state of the server device to be updated based on the actuation of the input mechanism of the client device. 17. A computer program product according to claim 16 wherein the computer-executable program code portions further comprise program code instructions for:
receiving an indication of one or more input mechanisms of the client device and a functional category of each input mechanism; and
generating the mapping by mapping the touch events on the server device to actuation of respective input mechanisms based upon the functional category of each input mechanism. 18. A computer program product according to claim 17 wherein the computer-executable program code portions further comprise program code instructions for receiving an indication of a range of values associated with one or more input mechanisms, wherein the program code instructions for generating the mapping comprise program code instructions for mapping the touch events to actuation of respective input mechanisms further based on the range of values associated with one or more input mechanisms. 19. A computer program product according to claim 17 wherein the program code instructions for receiving the functional category of each input mechanism comprise program code instructions for receiving an indication that the functional category of a respective input mechanism comprises selection, change in focus or toggle. 20. A computer program product according to claim 16 wherein the computer-executable program code portions further comprise program code instructions for receiving the one or more control signals prior to interpreting the one or more control signals. | 2,100 |
5,401 | 5,401 | 13,830,526 | 2,158 | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing knowledge panels with search results. In one aspect, a method includes receiving a query. Search results that are responsive to the received query are obtained. A first set of factual entities referenced by the received query are identified. A particular factual entity is selected from the first set. It is determined that a knowledge panel for the particular factual entity is to be provided with the search results based, at least in part, on content of the knowledge panel and characteristics of the search results. The knowledge panel can include at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource. The knowledge panel is provided. | 1. A method performed by data processing apparatus, the method comprising:
receiving a query; obtaining search results that are responsive to the received query; identifying a first set of factual entities referenced by the received query; selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results; determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and providing the knowledge panel. 2. The method of claim 1, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 3. The method of claim 2, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 4. The method of claim 3, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. 5. The method of claim 4, wherein determining the overall topicality score for the factual entity based on the partial topicality scores for the factual entity comprises determining a weighted sum of the partial topicality scores for the factual entity. 6. The method of claim 1, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
for each obtained search result, determining a topicality score for the search result with respect to each factual entity of the first set of factual entities, the topicality score for a search result with respect to a factual entity being a measure of topical relatedness of the search result with respect to the factual entity; comparing each topicality score to a topicality threshold to identify a proper subset of the topicality scores that satisfy the topicality threshold; determining which one of the proper subset of topicality scores corresponds to a highest ranking search result for the proper subset of topicality scores; and selecting the factual entity that corresponds to the one partial topicality score as the particular factual entity. 7. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a click-through rate for each obtained search result with respect to the received query; determining that the identified click-through rates do not satisfy a threshold click-through rate; and determining to provide the knowledge panel in response to determining that the identified click-through rates do not satisfy the threshold click-through rate. 8. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a top ranked search result for the received query; identifying a click-through rate for the top ranked search result with respect to the received query; determining that the identified click-through rate does not satisfy a click-through rate threshold; and determining to provide the knowledge panel in response to determining that the identified click-through rate does not satisfy the click-through rate threshold. 9. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying content for inclusion in the knowledge panel; determining that the identified content includes at least a threshold amount of content; and determining to provide the knowledge panel in response to determining that the identified content includes at least a threshold amount of content. 10. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
determining whether the knowledge panel includes links to query refinements for the received query; and determining to provide the knowledge panel in response to determining that the knowledge panel includes links to query refinements for the received query. 11. A system comprising:
a processing apparatus; a memory storage apparatus in data communication with the data processing apparatus, the memory storage apparatus storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving a query;
obtaining search results that are responsive to the received query;
identifying a first set of factual entities referenced by the received query;
selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results;
determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and
providing the knowledge panel. 12. The system of claim 11, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 13. The system of claim 12, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 14. The system of claim 13, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. 15. The system of claim 11, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
for each obtained search result, determining a topicality score for the search result with respect to each factual entity of the first set of factual entities, the topicality score for a search result with respect to a factual entity being a measure of topical relatedness of the search result with respect to the factual entity; comparing each topicality score to a topicality threshold to identify a proper subset of the topicality scores that satisfy the topicality threshold; determining which one of the proper subset of topicality scores corresponds to a highest ranking search result for the proper subset of topicality scores; and selecting the factual entity that corresponds to the one partial topicality score as the particular factual entity. 16. The system of claim 11, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a click-through rate for each obtained search result with respect to the received query; determining that the identified click-through rates do not satisfy a threshold click-through rate; and determining to provide the knowledge panel in response to determining that the identified click-through rates do not satisfy the threshold click-through rate. 17. The system of claim 11, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a top ranked search result for the received query; identifying a click-through rate for the top ranked search result with respect to the received query; determining that the identified click-through rate does not satisfy a click-through rate threshold; and determining to provide the knowledge panel in response to determining that the identified click-through rate does not satisfy the click-through rate threshold. 18. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising:
receiving a query;
obtaining search results that are responsive to the received query;
identifying a first set of factual entities referenced by the received query;
selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results;
determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and
providing the knowledge panel. 19. The computer storage medium of claim 18, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 20. The computer storage medium of claim 19, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 21. The computer storage medium of claim 20, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing knowledge panels with search results. In one aspect, a method includes receiving a query. Search results that are responsive to the received query are obtained. A first set of factual entities referenced by the received query are identified. A particular factual entity is selected from the first set. It is determined that a knowledge panel for the particular factual entity is to be provided with the search results based, at least in part, on content of the knowledge panel and characteristics of the search results. The knowledge panel can include at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource. The knowledge panel is provided.1. A method performed by data processing apparatus, the method comprising:
receiving a query; obtaining search results that are responsive to the received query; identifying a first set of factual entities referenced by the received query; selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results; determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and providing the knowledge panel. 2. The method of claim 1, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 3. The method of claim 2, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 4. The method of claim 3, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. 5. The method of claim 4, wherein determining the overall topicality score for the factual entity based on the partial topicality scores for the factual entity comprises determining a weighted sum of the partial topicality scores for the factual entity. 6. The method of claim 1, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
for each obtained search result, determining a topicality score for the search result with respect to each factual entity of the first set of factual entities, the topicality score for a search result with respect to a factual entity being a measure of topical relatedness of the search result with respect to the factual entity; comparing each topicality score to a topicality threshold to identify a proper subset of the topicality scores that satisfy the topicality threshold; determining which one of the proper subset of topicality scores corresponds to a highest ranking search result for the proper subset of topicality scores; and selecting the factual entity that corresponds to the one partial topicality score as the particular factual entity. 7. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a click-through rate for each obtained search result with respect to the received query; determining that the identified click-through rates do not satisfy a threshold click-through rate; and determining to provide the knowledge panel in response to determining that the identified click-through rates do not satisfy the threshold click-through rate. 8. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a top ranked search result for the received query; identifying a click-through rate for the top ranked search result with respect to the received query; determining that the identified click-through rate does not satisfy a click-through rate threshold; and determining to provide the knowledge panel in response to determining that the identified click-through rate does not satisfy the click-through rate threshold. 9. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying content for inclusion in the knowledge panel; determining that the identified content includes at least a threshold amount of content; and determining to provide the knowledge panel in response to determining that the identified content includes at least a threshold amount of content. 10. The method of claim 1, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
determining whether the knowledge panel includes links to query refinements for the received query; and determining to provide the knowledge panel in response to determining that the knowledge panel includes links to query refinements for the received query. 11. A system comprising:
a processing apparatus; a memory storage apparatus in data communication with the data processing apparatus, the memory storage apparatus storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving a query;
obtaining search results that are responsive to the received query;
identifying a first set of factual entities referenced by the received query;
selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results;
determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and
providing the knowledge panel. 12. The system of claim 11, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 13. The system of claim 12, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 14. The system of claim 13, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. 15. The system of claim 11, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
for each obtained search result, determining a topicality score for the search result with respect to each factual entity of the first set of factual entities, the topicality score for a search result with respect to a factual entity being a measure of topical relatedness of the search result with respect to the factual entity; comparing each topicality score to a topicality threshold to identify a proper subset of the topicality scores that satisfy the topicality threshold; determining which one of the proper subset of topicality scores corresponds to a highest ranking search result for the proper subset of topicality scores; and selecting the factual entity that corresponds to the one partial topicality score as the particular factual entity. 16. The system of claim 11, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a click-through rate for each obtained search result with respect to the received query; determining that the identified click-through rates do not satisfy a threshold click-through rate; and determining to provide the knowledge panel in response to determining that the identified click-through rates do not satisfy the threshold click-through rate. 17. The system of claim 11, wherein determining that the knowledge panel for the particular factual entity is to be provided with the search results comprises:
identifying a top ranked search result for the received query; identifying a click-through rate for the top ranked search result with respect to the received query; determining that the identified click-through rate does not satisfy a click-through rate threshold; and determining to provide the knowledge panel in response to determining that the identified click-through rate does not satisfy the click-through rate threshold. 18. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising:
receiving a query;
obtaining search results that are responsive to the received query;
identifying a first set of factual entities referenced by the received query;
selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results, the selection being based, at least in part, on a measure of topicality between each identified factual entity in the first set and one or more of the obtained search results;
determining that the knowledge panel for the particular factual entity is to be provided with the search results, the determination being based, at least in part, on content of the knowledge panel and characteristics of the search results, the knowledge panel including at least one content item, for the selected factual entity, received from a first resource and at least one content item, for the selected factual entity, received from a second resource different than the first resource; and
providing the knowledge panel. 19. The computer storage medium of claim 18, wherein selecting, from among the first set of factual entities, a particular factual entity for which a knowledge panel is eligible to be provided with the search results comprises:
identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results; identifying one or more factual entities included in the set of factual entities and in the second set of factual entities; and selecting one of the one or more factual entities as the identified factual entity. 20. The computer storage medium of claim 19, wherein identifying a second set of factual entities, each factual entity of the second set being a factual entity determined to be topical to the obtained search results, comprises:
identifying a third set of factual entities, each factual entity of the third set being a factual entity referenced in at least one of the obtained search results; identifying a proper subset of the obtained search results, the proper subset including a particular number of higher ranked obtained search results; for each factual entity of the third set of factual entities, determining, relative to the factual entity, a partial topicality score for each search result in the proper subset of obtained search results, the partial topicality score for each search result being a measure of topical relatedness between the search result and the factual entity; and selecting, from the third set of factual entities, the second set of factual entities based on the partial topicality scores. 21. The computer storage medium of claim 20, wherein selecting the second set of factual entities based on the partial topicality scores comprises:
for each factual entity of the third set, determining an overall topicality score for the factual entity based on the partial topicality scores for the factual entity; and selecting the second set of factual entities based on the overall topicality scores. | 2,100 |
5,402 | 5,402 | 15,224,988 | 2,114 | In various examples, a device comprises a memory. The memory comprises a plurality of dies and logic. The logic may: determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed, and adjust a parameter of the memory based on the tolerable BER. | 1. A method comprising:
determining a tolerable bit error rate (BER) of a memory based on whether a die of the memory has failed; responsive to determining the BER, adjusting a parameter of the memory based on the tolerable BER. 2. The method of claim 1, wherein determining the BER comprises:
determining a first tolerable BER if a die of the memory has not failed; and determining a second, different tolerable BER if a die of the memory has failed, wherein adjusting the parameter comprises:
adjusting at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. 3. The method of claim 1, wherein adjusting the parameter comprises a rate of performing data scrub operations on the memory, the method comprising:
adjusting the rate of performing the data scrub operations on the memory. 4. The method of claim 1, wherein adjusting the parameter comprises:
increasing at least one of: a number of write cycles, or a latency of a write cycle used to write data to the memory. 5. The method of claim 1, wherein the parameter comprises a latency to wait for read signal levels to stabilize, the method comprising:
causing the memory to adjust the latency to wait before triggering read sense amplifiers of the memory. 6. The method of claim 1, wherein the parameter comprises a temperature of the memory, the method comprising:
adjusting the temperature of the memory based on the BER. 7. The method of claim 1, wherein the parameter comprises an electrical parameter of the memory, the method comprising:
adjusting an electrical parameter used to read or write the memory. 8. A device comprising a memory, the memory comprising:
a plurality of dies; and logic, the logic to:
determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed; and
adjust a parameter of the memory based on the tolerable BER. 9. The device of claim 8, the logic to:
determine a first tolerable BER if a die of the memory has not failed; and determine a second, different tolerable BER if a die of the memory has failed, wherein to adjust the parameter of the memory, the logic to adjust at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. 10. The device of claim 8, wherein the parameter comprises a rate of performing data scrub operations on the memory, the logic to:
adjust the rate of performing the data scrub operations based on the tolerable BER. 11. The device of claim 8, comprising:
read sense amplifiers coupled to the dies, wherein the parameter comprises a latency to wait for read signal levels to stabilize, the logic to: adjust the latency to wait for read signal levels to stabilize before triggering the read sense amplifiers based on the tolerable BER. 12. The device of claim 8, wherein the parameter comprises a temperature of the memory, the logic to:
adjust the temperature of the memory based on the tolerable BER. 13. The device of claim 8, the logic to:
adjust, based on the tolerable BER, an electrical parameter used to read or write the memory. 14. A system comprising:
a memory comprising a plurality of dies; and a memory controller coupled to the memory, the memory controller to:
determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed; and
adjust a parameter of the memory based on the tolerable BER. 15. The system of claim 14,
the memory controller to: determine a first tolerable BER if one of the dies of the memory has not failed; and determine a second, different tolerable BER if one of the dies has failed, wherein to adjust the parameter of the memory, the memory controller to adjust at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. | In various examples, a device comprises a memory. The memory comprises a plurality of dies and logic. The logic may: determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed, and adjust a parameter of the memory based on the tolerable BER.1. A method comprising:
determining a tolerable bit error rate (BER) of a memory based on whether a die of the memory has failed; responsive to determining the BER, adjusting a parameter of the memory based on the tolerable BER. 2. The method of claim 1, wherein determining the BER comprises:
determining a first tolerable BER if a die of the memory has not failed; and determining a second, different tolerable BER if a die of the memory has failed, wherein adjusting the parameter comprises:
adjusting at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. 3. The method of claim 1, wherein adjusting the parameter comprises a rate of performing data scrub operations on the memory, the method comprising:
adjusting the rate of performing the data scrub operations on the memory. 4. The method of claim 1, wherein adjusting the parameter comprises:
increasing at least one of: a number of write cycles, or a latency of a write cycle used to write data to the memory. 5. The method of claim 1, wherein the parameter comprises a latency to wait for read signal levels to stabilize, the method comprising:
causing the memory to adjust the latency to wait before triggering read sense amplifiers of the memory. 6. The method of claim 1, wherein the parameter comprises a temperature of the memory, the method comprising:
adjusting the temperature of the memory based on the BER. 7. The method of claim 1, wherein the parameter comprises an electrical parameter of the memory, the method comprising:
adjusting an electrical parameter used to read or write the memory. 8. A device comprising a memory, the memory comprising:
a plurality of dies; and logic, the logic to:
determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed; and
adjust a parameter of the memory based on the tolerable BER. 9. The device of claim 8, the logic to:
determine a first tolerable BER if a die of the memory has not failed; and determine a second, different tolerable BER if a die of the memory has failed, wherein to adjust the parameter of the memory, the logic to adjust at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. 10. The device of claim 8, wherein the parameter comprises a rate of performing data scrub operations on the memory, the logic to:
adjust the rate of performing the data scrub operations based on the tolerable BER. 11. The device of claim 8, comprising:
read sense amplifiers coupled to the dies, wherein the parameter comprises a latency to wait for read signal levels to stabilize, the logic to: adjust the latency to wait for read signal levels to stabilize before triggering the read sense amplifiers based on the tolerable BER. 12. The device of claim 8, wherein the parameter comprises a temperature of the memory, the logic to:
adjust the temperature of the memory based on the tolerable BER. 13. The device of claim 8, the logic to:
adjust, based on the tolerable BER, an electrical parameter used to read or write the memory. 14. A system comprising:
a memory comprising a plurality of dies; and a memory controller coupled to the memory, the memory controller to:
determine a tolerable bit error rate (BER) of the memory based on whether one of the plurality of dies has failed; and
adjust a parameter of the memory based on the tolerable BER. 15. The system of claim 14,
the memory controller to: determine a first tolerable BER if one of the dies of the memory has not failed; and determine a second, different tolerable BER if one of the dies has failed, wherein to adjust the parameter of the memory, the memory controller to adjust at least one of: a rate of performing data scrub operations, a latency to wait for read signals to stabilize, a number of write cycles, a latency of a write cycle, a temperature of the memory, or an electrical parameter of the memory. | 2,100 |
5,403 | 5,403 | 13,584,112 | 2,178 | A computer-implemented method includes obtaining an XML document template object in which a subset of fields of the XML document is designated by placeholders. The XML document template object is prepared based on a prior instance of the XML document. The method further involves processing the subset of fields in an instance of the XML document that are designated by placeholders in XML document template object. | 1. A computer-implemented method carried out by causing at least one processor to execute instructions recorded on a computer-readable storage medium, the computer-implemented method comprising:
obtaining an XML document template object in which a subset of fields of an XML document are designated by placeholders; and processing the subset of fields in an instance of the XML document that are designated by placeholders in XML document template object, wherein the XML document template object is prepared based on a prior instance of the XML document. 2. The computer-implemented method of claim 1, wherein the subset of fields of the XML document that are designated by placeholders contain information relevant as input or output data of an application function. 3. The computer-implemented method of claim 1, wherein obtaining an XML document template object in which the subset of fields are designated by placeholders includes preparing the XML document template object based on an instance of the XML document. 4. The computer-implemented method of claim 3, wherein preparing the XML document template object based on an instance of the XML document includes replacing particular elements, attributes and content fields in the instance of the XML document with placeholders. 5. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves processing the XML document only for those fields for which placeholders are defined in the XML document template object. 6. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves extracting information from the subset of fields in the XML document using the XML document template object as reference. 7. The computer-implemented method of claim 6, wherein extracting information from the subset of fields in the XML document using the template object as reference involves parsing the XML document which returns a context object having a dictionary of key-value pairs with the placeholders as keys. 8. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves rendering an XML document by inserting information in the fields associated with the placeholders defined in the XML document template. 9. The computer-implemented method of claim 8, wherein the inserted information is generated at runtime. 10. The computer-implemented method of claim 8, wherein the inserted information is derived from a context object having a dictionary of key-value pairs with the placeholders as keys. 11. A computer program product embodied in non-transitory computer-readable media carrying executable code, the computer program product comprising:
code which when executed, obtains an XML document template object in which a subset of fields of an XML document are designated by placeholders; and processes the subset of fields in the XML document that are designated by placeholders in XML document template object, wherein the XML document template object is prepared based on a prior instance of the XML document. 12. The computer program product of claim 11, wherein the code when executed:
prepares the XML document template object based on an instance of the XML document. 13. The computer program product of claim 12, wherein the code when executed:
replaces particular elements, attributes and content fields in the instance of the XML document with placeholders. 14. The computer program product of claim 11, wherein the code when executed:
processes the XML document only for those fields for which placeholders are defined in the XML document template object. 15. The computer program product of claim 11, wherein the code when executed:
extracts information from the subset of fields in the XML document using the XML document template object as reference. 16. The computer program product of claim 11, wherein the code when executed:
parses the XML document to return a context object having a dictionary of key-value pairs with the placeholders as keys. 17. The computer program product of claim 11, wherein the code when executed:
renders an instance of XML document by inserting information in the subset of fields associated with the placeholders defined in the XML document template. 18. A computer-based system implemented by instructions recorded on a non-transitory computer readable storage medium and executable by at least one processor, the computer-based system comprising:
a processor; and a computer readable storage medium; wherein the computer readable storage medium carries an XML document template object in which a subset of fields of an XML document are designated by placeholders; and wherein the processor is configured to process an instance of the XML document with reference to the XML document template object. 19. The computer-based system of claim 18, wherein the processor is configured to extract information from the subset of fields in the instance of the XML document that are designated by placeholders in the XML document template object. 20. The computer-based system of claim 18, wherein the processor is configured to render an instance of the XML document by inserting information in the subset of fields that are designated by placeholders in the XML document template object. | A computer-implemented method includes obtaining an XML document template object in which a subset of fields of the XML document is designated by placeholders. The XML document template object is prepared based on a prior instance of the XML document. The method further involves processing the subset of fields in an instance of the XML document that are designated by placeholders in XML document template object.1. A computer-implemented method carried out by causing at least one processor to execute instructions recorded on a computer-readable storage medium, the computer-implemented method comprising:
obtaining an XML document template object in which a subset of fields of an XML document are designated by placeholders; and processing the subset of fields in an instance of the XML document that are designated by placeholders in XML document template object, wherein the XML document template object is prepared based on a prior instance of the XML document. 2. The computer-implemented method of claim 1, wherein the subset of fields of the XML document that are designated by placeholders contain information relevant as input or output data of an application function. 3. The computer-implemented method of claim 1, wherein obtaining an XML document template object in which the subset of fields are designated by placeholders includes preparing the XML document template object based on an instance of the XML document. 4. The computer-implemented method of claim 3, wherein preparing the XML document template object based on an instance of the XML document includes replacing particular elements, attributes and content fields in the instance of the XML document with placeholders. 5. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves processing the XML document only for those fields for which placeholders are defined in the XML document template object. 6. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves extracting information from the subset of fields in the XML document using the XML document template object as reference. 7. The computer-implemented method of claim 6, wherein extracting information from the subset of fields in the XML document using the template object as reference involves parsing the XML document which returns a context object having a dictionary of key-value pairs with the placeholders as keys. 8. The computer-implemented method of claim 1, wherein processing the subset of fields of the XML document that are designated by placeholders involves rendering an XML document by inserting information in the fields associated with the placeholders defined in the XML document template. 9. The computer-implemented method of claim 8, wherein the inserted information is generated at runtime. 10. The computer-implemented method of claim 8, wherein the inserted information is derived from a context object having a dictionary of key-value pairs with the placeholders as keys. 11. A computer program product embodied in non-transitory computer-readable media carrying executable code, the computer program product comprising:
code which when executed, obtains an XML document template object in which a subset of fields of an XML document are designated by placeholders; and processes the subset of fields in the XML document that are designated by placeholders in XML document template object, wherein the XML document template object is prepared based on a prior instance of the XML document. 12. The computer program product of claim 11, wherein the code when executed:
prepares the XML document template object based on an instance of the XML document. 13. The computer program product of claim 12, wherein the code when executed:
replaces particular elements, attributes and content fields in the instance of the XML document with placeholders. 14. The computer program product of claim 11, wherein the code when executed:
processes the XML document only for those fields for which placeholders are defined in the XML document template object. 15. The computer program product of claim 11, wherein the code when executed:
extracts information from the subset of fields in the XML document using the XML document template object as reference. 16. The computer program product of claim 11, wherein the code when executed:
parses the XML document to return a context object having a dictionary of key-value pairs with the placeholders as keys. 17. The computer program product of claim 11, wherein the code when executed:
renders an instance of XML document by inserting information in the subset of fields associated with the placeholders defined in the XML document template. 18. A computer-based system implemented by instructions recorded on a non-transitory computer readable storage medium and executable by at least one processor, the computer-based system comprising:
a processor; and a computer readable storage medium; wherein the computer readable storage medium carries an XML document template object in which a subset of fields of an XML document are designated by placeholders; and wherein the processor is configured to process an instance of the XML document with reference to the XML document template object. 19. The computer-based system of claim 18, wherein the processor is configured to extract information from the subset of fields in the instance of the XML document that are designated by placeholders in the XML document template object. 20. The computer-based system of claim 18, wherein the processor is configured to render an instance of the XML document by inserting information in the subset of fields that are designated by placeholders in the XML document template object. | 2,100 |
5,404 | 5,404 | 13,974,301 | 2,128 | A method may be used to specify at least one operating parameter for a blow-molding process. The method comprises: providing a pre-formed geometry; providing a target-object geometry; providing at least one target-object property value range; specifying a value range for the at least one operating parameter; providing a representation of process blow fluid behavior; providing a pre-form resin material model; calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; specifying at least one of the identified operating parameter values as the operating parameter of the blow-molding process. | 1. A method for specifying at least one operating parameter for a blow-molding process, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form resin material model; g. calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; i. specifying at least one of the identified operating parameter values as an operating parameter of the blow-molding process. 2. The method according to claim 1 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 3. The method according to claim 2 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure. 4. The method according to claim 1, wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile; blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 5. The method according to claim 1 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 6. The method according to claim 1 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. 7. The method according to claim 1 wherein the target-object geometry is provided as a set of target-object geometries and the target-object property value range is provided as a set of target-object property value ranges, each value range associated with at least one target-object geometry; and wherein each finished-object property calculation is made according to one target-object geometry and associated target-object property value range selected from these sets. 8. The method according to claim 1 wherein the value of the operating parameter is selected based on a target-object property in order to increase the likeliness of improved target-object properties 9. A method for selecting an blow-molding object design, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for the at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form resin material model; g. calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying finished-object properties within the target-object property value range; and i. specifying at least one finished object. 10. The method according to claim 9 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 11. The method according to claim 10 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure 12. The method according to claim 9, wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile; blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 13. The method according to claim 9 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 14. The method according to claim 9 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. 15. The method according to claim 9 wherein the target-object geometry is provided as a set of target-object geometries and the target-object property value range is provided as a set of target-object property value ranges, each value range associated with at least one target-object geometry; and wherein each finished-object property calculation is made according to one target-object geometry and associated target-object property value range selected from these sets. 16. A method for specifying at least one operating parameter for a blow-molding process, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form-resin material model; g. calculating a finished-object property, the finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; i. specifying at least one of the identified operating parameter values as an operating parameter of the blow-molding process. 17. The method according to claim 16 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 18. The method according to claim 17 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure 19. The method according to claim 14 wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile;
blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 20. The method according to claim 14 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 21. The method according to claim 14 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. | A method may be used to specify at least one operating parameter for a blow-molding process. The method comprises: providing a pre-formed geometry; providing a target-object geometry; providing at least one target-object property value range; specifying a value range for the at least one operating parameter; providing a representation of process blow fluid behavior; providing a pre-form resin material model; calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; specifying at least one of the identified operating parameter values as the operating parameter of the blow-molding process.1. A method for specifying at least one operating parameter for a blow-molding process, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form resin material model; g. calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; i. specifying at least one of the identified operating parameter values as an operating parameter of the blow-molding process. 2. The method according to claim 1 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 3. The method according to claim 2 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure. 4. The method according to claim 1, wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile; blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 5. The method according to claim 1 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 6. The method according to claim 1 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. 7. The method according to claim 1 wherein the target-object geometry is provided as a set of target-object geometries and the target-object property value range is provided as a set of target-object property value ranges, each value range associated with at least one target-object geometry; and wherein each finished-object property calculation is made according to one target-object geometry and associated target-object property value range selected from these sets. 8. The method according to claim 1 wherein the value of the operating parameter is selected based on a target-object property in order to increase the likeliness of improved target-object properties 9. A method for selecting an blow-molding object design, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for the at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form resin material model; g. calculating a finished-object property a plurality of times, each finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying finished-object properties within the target-object property value range; and i. specifying at least one finished object. 10. The method according to claim 9 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 11. The method according to claim 10 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure 12. The method according to claim 9, wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile; blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 13. The method according to claim 9 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 14. The method according to claim 9 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. 15. The method according to claim 9 wherein the target-object geometry is provided as a set of target-object geometries and the target-object property value range is provided as a set of target-object property value ranges, each value range associated with at least one target-object geometry; and wherein each finished-object property calculation is made according to one target-object geometry and associated target-object property value range selected from these sets. 16. A method for specifying at least one operating parameter for a blow-molding process, the method comprising steps of:
a. providing a pre-formed geometry; b. providing a target-object geometry; c. providing at least one target-object property value range; d. specifying a value range for at least one operating parameter; e. providing a representation of process blow fluid behavior; f. providing a pre-form-resin material model; g. calculating a finished-object property, the finished-object property calculated according to the pre-formed geometry, target-object geometry, process blow-fluid behavior, pre-form-resin material model, and a value of the at least one operating parameter within the operating parameter value range; h. identifying operating parameter values associated with the calculation of finished-object properties within the target-object property value range; i. specifying at least one of the identified operating parameter values as an operating parameter of the blow-molding process. 17. The method according to claim 16 wherein the process blow-fluid behavior is determined according to the pressure differential between the fluid supply and a pre-form pressure. 18. The method according to claim 17 wherein the process blow-fluid behavior is further determined according to the average of the fluid supply pressure and the pre-form pressure 19. The method according to claim 14 wherein the at least one operating parameter is selected from the group consisting of:
oven or thermal conditioning setting(s); forming tool geometry factors; forming tool travel distance and travel profile;
blow fluid supply pressure; pre-blow pressure; final blow pressure; blow fluid flow control and timing control. 20. The method according to claim 14 wherein the at least one target-object property is selected from the group consisting of: thickness profile, formation completeness, optical quality, and structural performance. 21. The method according to claim 14 wherein the pre-formed geometry is provided as a set of pre-formed geometries and wherein each finished object property calculation is performed using one pre-formed geometry selected from that set. | 2,100 |
5,405 | 5,405 | 15,808,581 | 2,137 | Apparatuses, methods and storage media associated with memory management in virtualized computing are disclosed herein. In embodiments, an apparatus may include a virtual machine manager to manage operations of a plurality of virtual machines, having a memory manager to manage allocation and de-allocation of physical memory to and from the plurality of virtual machines. Allocation and de-allocation may include de-allocation of unused and used physical memory allocated to a first of the plurality of virtual machines to recover physical memory for allocation to one or more other ones of the plurality of virtual machines, and re-allocation of physical memory for the previously de-allocated unused and used physical memory of the first virtual machine. Other embodiments may be disclosed or claimed. | 1-25. (canceled) 26. An apparatus for virtualized computing, comprising:
one or more processors; physical memory coupled with the one or more processors; and a virtual machine manager to be operated by the one or more processors to manage operations of a plurality of virtual machines operated by the one or more processors, that includes management of allocation and de-allocation of portions of the physical memory to and from the plurality of virtual machines, including: de-allocation of a portion of the physical memory allocated to a first of the plurality of virtual machines to recover the portion of the physical memory for allocation to another virtual machine, and re-allocation of the de-allocated portion of the physical memory to the other virtual machine; wherein to de-allocate the portion of the physical memory allocated to the first of the plurality of virtual machines and re-allocated the portion of the physical memory to another virtual machine, the virtual machine manager is to compress data in the portion of the physical memory being deallocated, make a copy of the compressed data, prior to re-allocation of the portion of the physical memory to the other virtual machine. 27. The apparatus of claim 26, wherein the virtual machine manager is to perform the de-allocation and re-allocation in response to a request. 28. The apparatus of claim 27, wherein the request is made in response to a virtual machine entering or leaving a particular state. 29. The apparatus of claim 26, wherein the apparatus is a cloud computing server. 30. A method for virtualized computing, comprising:
managing, by a virtual machine manager of a computer system, operations of a plurality of virtual machines of the computer system; and de-allocating, by the virtual machine manager, a portion of physical memory of the computer system allocated to a first of the plurality of virtual machines to recover the portion of the physical memory for allocation to another virtual machine; and re-allocating, by the virtual manager, the recovered portion of the physical memory to the other virtual machine; wherein de-allocating the portion of the physical memory allocated to the first of the plurality of virtual machines and re-allocating the physical memory to another virtual machine comprises compressing data in the portion of the physical memory being deallocated, making a copy of the compressed data, prior to re-allocating the portion of the physical memory to the other virtual machine. 31. The method of claim 30, wherein the de-allocating and re-allocating is performed in response to a request. 32. The method of claim 31, wherein the request is made in response to a virtual machine entering or leaving a particular state. 33. The method of claim 30, wherein the computing system is a cloud computing server. 34. At least one non-transitory computer-readable storage medium having instructions that cause a computer system, in response to execution of the instructions by one or more processors of the computer system, to operate a virtual machine manager to:
manage operations of a plurality of virtual machines operated by the one or more processors; de-allocate a portion of physical memory of the computer system allocated to a first of a plurality of virtual machines of the computer system to recover the portion of the physical memory for allocation to another one of the plurality of virtual machines, and re-allocate the portion of the physical memory to the other virtual machine; wherein to de-allocate and reallocate the portion of the physical memory allocated to the first of the plurality of virtual machines, the virtual machine is to compress data in the portion of the physical memory being deallocated, make a copy of the compressed data, prior to the de-allocation and re-allocation of the portion of the physical memory. 35. The non-transitory computer-readable storage medium of claim 34, wherein the computer system is caused to perform the de-allocate and re-allocate in response to a request. 36. The non-transitory computer-readable storage medium of claim 35, wherein the request is made in response to the other virtual machine entering or leaving a particular state. 37. The non-transitory computer-readable storage medium of claim 34, wherein the apparatus is a cloud computing server. | Apparatuses, methods and storage media associated with memory management in virtualized computing are disclosed herein. In embodiments, an apparatus may include a virtual machine manager to manage operations of a plurality of virtual machines, having a memory manager to manage allocation and de-allocation of physical memory to and from the plurality of virtual machines. Allocation and de-allocation may include de-allocation of unused and used physical memory allocated to a first of the plurality of virtual machines to recover physical memory for allocation to one or more other ones of the plurality of virtual machines, and re-allocation of physical memory for the previously de-allocated unused and used physical memory of the first virtual machine. Other embodiments may be disclosed or claimed.1-25. (canceled) 26. An apparatus for virtualized computing, comprising:
one or more processors; physical memory coupled with the one or more processors; and a virtual machine manager to be operated by the one or more processors to manage operations of a plurality of virtual machines operated by the one or more processors, that includes management of allocation and de-allocation of portions of the physical memory to and from the plurality of virtual machines, including: de-allocation of a portion of the physical memory allocated to a first of the plurality of virtual machines to recover the portion of the physical memory for allocation to another virtual machine, and re-allocation of the de-allocated portion of the physical memory to the other virtual machine; wherein to de-allocate the portion of the physical memory allocated to the first of the plurality of virtual machines and re-allocated the portion of the physical memory to another virtual machine, the virtual machine manager is to compress data in the portion of the physical memory being deallocated, make a copy of the compressed data, prior to re-allocation of the portion of the physical memory to the other virtual machine. 27. The apparatus of claim 26, wherein the virtual machine manager is to perform the de-allocation and re-allocation in response to a request. 28. The apparatus of claim 27, wherein the request is made in response to a virtual machine entering or leaving a particular state. 29. The apparatus of claim 26, wherein the apparatus is a cloud computing server. 30. A method for virtualized computing, comprising:
managing, by a virtual machine manager of a computer system, operations of a plurality of virtual machines of the computer system; and de-allocating, by the virtual machine manager, a portion of physical memory of the computer system allocated to a first of the plurality of virtual machines to recover the portion of the physical memory for allocation to another virtual machine; and re-allocating, by the virtual manager, the recovered portion of the physical memory to the other virtual machine; wherein de-allocating the portion of the physical memory allocated to the first of the plurality of virtual machines and re-allocating the physical memory to another virtual machine comprises compressing data in the portion of the physical memory being deallocated, making a copy of the compressed data, prior to re-allocating the portion of the physical memory to the other virtual machine. 31. The method of claim 30, wherein the de-allocating and re-allocating is performed in response to a request. 32. The method of claim 31, wherein the request is made in response to a virtual machine entering or leaving a particular state. 33. The method of claim 30, wherein the computing system is a cloud computing server. 34. At least one non-transitory computer-readable storage medium having instructions that cause a computer system, in response to execution of the instructions by one or more processors of the computer system, to operate a virtual machine manager to:
manage operations of a plurality of virtual machines operated by the one or more processors; de-allocate a portion of physical memory of the computer system allocated to a first of a plurality of virtual machines of the computer system to recover the portion of the physical memory for allocation to another one of the plurality of virtual machines, and re-allocate the portion of the physical memory to the other virtual machine; wherein to de-allocate and reallocate the portion of the physical memory allocated to the first of the plurality of virtual machines, the virtual machine is to compress data in the portion of the physical memory being deallocated, make a copy of the compressed data, prior to the de-allocation and re-allocation of the portion of the physical memory. 35. The non-transitory computer-readable storage medium of claim 34, wherein the computer system is caused to perform the de-allocate and re-allocate in response to a request. 36. The non-transitory computer-readable storage medium of claim 35, wherein the request is made in response to the other virtual machine entering or leaving a particular state. 37. The non-transitory computer-readable storage medium of claim 34, wherein the apparatus is a cloud computing server. | 2,100 |
5,406 | 5,406 | 15,109,375 | 2,135 | A memory management unit receives a transaction request to perform an operation with respect to data in memory, the transaction request including control information. The memory management unit identifies, based on the control information, one of a plurality of versions of a given memory data, where the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version. The memory management unit accesses the identified version of the given memory data in response to the transaction request. | 1. A method comprising:
receiving, by a memory management unit, a transaction request to perform an operation with respect to data in memory, the transaction request including control information; identifying, by the memory management unit based on the control information, one of a plurality of versions of a given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and accessing, by the memory management unit, the identified version of the given memory data in response to the transaction request. 2. The method of claim 1, wherein accessing the identified version of the given memory data comprises reading or writing the identified version of the given memory data. 3. The method of claim 1, wherein the identifying comprises generating a physical resource address based on the control information in the transaction request, wherein different values of the control information map to different physical resource addresses that specify different locations in the memory. 4. The method of claim 1, wherein identifying one of the plurality of versions of the given memory data is based on an address field in the control information. 5. The method of claim 1, wherein identifying one of the plurality of versions of the given memory data is based on an identifier in the control information. 6. The method of claim 1, wherein the transaction request is received from a first requestor associated with a first value in the control information, the method further comprising:
receiving, by the memory management unit, a second transaction request to perform an operation with respect to data in the memory, the second transaction request including control information having a second value; identifying, by the memory management unit based on the second value of the control information in second transaction request, another of the plurality of versions of the given memory data; and accessing, by the memory management unit in response to the second transaction request, the identified another version of the given memory data. 7. The method of claim 1, wherein the plurality of versions of the given memory data are selected from among: logs of transactions, data of different checkpoints, and data versions produced from the given memory data due to different computations by a computation device. 8. The method of claim 1, wherein the plurality of versions of the given memory data are accessible by a plurality of requestors in parallel, the method further comprising:
shuffling the plurality of versions of the given memory data across the plurality of requestors such that the plurality of requestors access different ones of the plurality of versions of the given memory data at different times, wherein the shuffling is performed by modifying a translation data structure in the memory management unit. 9. The method of claim 1, wherein the transaction request is sent by a memory controller associated with a requestor, the method further comprising:
the memory controller interacting with a distinct media controller associated with the memory, the media controller to produce, in response to the transaction request, at least one command according to a specification of the memory. 10. A system comprising:
a memory to store a plurality of versions of given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and a memory management unit to:
receive a transaction request to perform an operation with respect to the given memory data in the memory;
map control information in the transaction request to one of the plurality of versions of the given memory data; and
access, in response to the transaction request, the one of the plurality of versions of the given memory data. 11. The system of claim 10, wherein the transaction request includes at least one from among: a read request, a write request, a rollback request, and a request to perform a computation. 12. The system of claim 10, wherein the mapping is performed using a translation data structure that maps different values of the control information to different ones of the plurality of versions of the given memory data. 13. The system of claim 10, wherein the mapping is performed by using a function to produce an output in response to the control information. 14. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a memory management unit to:
receive a transaction request to perform an operation with respect to data in memory, the transaction request including control information, the transaction request received from a memory controller associated with a requestor; identify, based on the control information, one of a plurality of versions of a given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and access, in response to the transaction request, the identified version of the given memory data in the memory, wherein the accessing uses a media controller distinct from the memory controller, the media controller to produce, in response to the transaction request, at least one command according to a specification of the memory. 15. The article of claim 14, wherein the identifying comprises generating a physical resource address based on the control information in the transaction request, wherein different values of the control information map to different physical resource addresses that specify different locations in the memory. | A memory management unit receives a transaction request to perform an operation with respect to data in memory, the transaction request including control information. The memory management unit identifies, based on the control information, one of a plurality of versions of a given memory data, where the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version. The memory management unit accesses the identified version of the given memory data in response to the transaction request.1. A method comprising:
receiving, by a memory management unit, a transaction request to perform an operation with respect to data in memory, the transaction request including control information; identifying, by the memory management unit based on the control information, one of a plurality of versions of a given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and accessing, by the memory management unit, the identified version of the given memory data in response to the transaction request. 2. The method of claim 1, wherein accessing the identified version of the given memory data comprises reading or writing the identified version of the given memory data. 3. The method of claim 1, wherein the identifying comprises generating a physical resource address based on the control information in the transaction request, wherein different values of the control information map to different physical resource addresses that specify different locations in the memory. 4. The method of claim 1, wherein identifying one of the plurality of versions of the given memory data is based on an address field in the control information. 5. The method of claim 1, wherein identifying one of the plurality of versions of the given memory data is based on an identifier in the control information. 6. The method of claim 1, wherein the transaction request is received from a first requestor associated with a first value in the control information, the method further comprising:
receiving, by the memory management unit, a second transaction request to perform an operation with respect to data in the memory, the second transaction request including control information having a second value; identifying, by the memory management unit based on the second value of the control information in second transaction request, another of the plurality of versions of the given memory data; and accessing, by the memory management unit in response to the second transaction request, the identified another version of the given memory data. 7. The method of claim 1, wherein the plurality of versions of the given memory data are selected from among: logs of transactions, data of different checkpoints, and data versions produced from the given memory data due to different computations by a computation device. 8. The method of claim 1, wherein the plurality of versions of the given memory data are accessible by a plurality of requestors in parallel, the method further comprising:
shuffling the plurality of versions of the given memory data across the plurality of requestors such that the plurality of requestors access different ones of the plurality of versions of the given memory data at different times, wherein the shuffling is performed by modifying a translation data structure in the memory management unit. 9. The method of claim 1, wherein the transaction request is sent by a memory controller associated with a requestor, the method further comprising:
the memory controller interacting with a distinct media controller associated with the memory, the media controller to produce, in response to the transaction request, at least one command according to a specification of the memory. 10. A system comprising:
a memory to store a plurality of versions of given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and a memory management unit to:
receive a transaction request to perform an operation with respect to the given memory data in the memory;
map control information in the transaction request to one of the plurality of versions of the given memory data; and
access, in response to the transaction request, the one of the plurality of versions of the given memory data. 11. The system of claim 10, wherein the transaction request includes at least one from among: a read request, a write request, a rollback request, and a request to perform a computation. 12. The system of claim 10, wherein the mapping is performed using a translation data structure that maps different values of the control information to different ones of the plurality of versions of the given memory data. 13. The system of claim 10, wherein the mapping is performed by using a function to produce an output in response to the control information. 14. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a memory management unit to:
receive a transaction request to perform an operation with respect to data in memory, the transaction request including control information, the transaction request received from a memory controller associated with a requestor; identify, based on the control information, one of a plurality of versions of a given memory data, wherein the plurality of versions of the given memory data include a first version of the given memory data and a second version of the given memory data that is modified from the first version; and access, in response to the transaction request, the identified version of the given memory data in the memory, wherein the accessing uses a media controller distinct from the memory controller, the media controller to produce, in response to the transaction request, at least one command according to a specification of the memory. 15. The article of claim 14, wherein the identifying comprises generating a physical resource address based on the control information in the transaction request, wherein different values of the control information map to different physical resource addresses that specify different locations in the memory. | 2,100 |
5,407 | 5,407 | 14,022,807 | 2,173 | An aspect provides a method, including: displaying content on a display screen of an information handling device; detecting, at the information handling device, a trigger for entering into a slow scrolling mode; and automatically scrolling, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. Other aspects are described and claimed. | 1. A method, comprising:
displaying content on a display screen of an information handling device; detecting, at the information handling device, a trigger for entering into a slow scrolling mode; and automatically scrolling, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. 2. The method of claim 1, wherein the different content is new content. 3. The method of claim 2, wherein the slow scrolling mode scrolling speed is adjusted automatically based on density of the content displayed on the display screen. 4. The method of claim 3, wherein the density of the content displayed on the display screen is ascertained via determining text density of the content. 5. The method of claim 4, wherein the text density is associated with a word count of the content displayed on the display screen. 6. The method of claim 4, wherein the speed of the slow scrolling mode is adjusted downward responsive to determining the text density of the content is above a predetermined threshold. 7. The method of claim 1, wherein the trigger for entering into the slow scrolling mode is selected from the group of triggers consisting of a user input trigger and a trigger derived from data associated with the content displayed on the display screen. 8. The method of claim 1, wherein the content displayed on the display screen is selected from the group of content consisting of web site content, and word processing document content. 9. The method of claim 1, further comprising detecting a trigger for exiting out of the slow scrolling mode. 10. The method of claim 7, wherein the trigger for exiting out of the slow scrolling mode comprises a user input trigger. 11. An information handling device, comprising:
a display screen; one or more processors; a memory device accessible to the one or more processors and storing code executable by the one or more processors to: display content on the display screen; detect a trigger for entering into a slow scrolling mode; and automatically scroll the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. 12. The information handling device of claim 11, wherein the different content is new content. 13. The information handling device of claim 12, wherein the slow scrolling mode scrolling speed is adjusted automatically based on density of the content displayed on the display screen. 14. The information handling device of claim 13, wherein the density of the content displayed on the display screen is ascertained via determining text density of the content. 15. The information handling device of claim 14, wherein the text density is associated with a word count of the content displayed on the display screen. 16. The information handling device of claim 14, wherein the speed of the slow scrolling mode is adjusted downward responsive to determining the text density of the content is above a predetermined threshold. 17. The information handling device of claim 11, wherein the trigger for entering into the slow scrolling mode is selected from the group of triggers consisting of a user input trigger and a trigger derived from data associated with the content displayed on the display screen. 18. The information handling device of claim 11, wherein the content displayed on the display screen is selected from the group of content consisting of web site content, and word processing document content. 19. The information handling device of claim 11, wherein the code is further executable by the one or more processors to detect a trigger for exiting out of the slow scrolling mode. 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 display content on a display screen of an information handling device; computer readable program code configured to detect, at the information handling device, a trigger for entering into a slow scrolling mode; and computer readable program code configured to automatically scroll, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. | An aspect provides a method, including: displaying content on a display screen of an information handling device; detecting, at the information handling device, a trigger for entering into a slow scrolling mode; and automatically scrolling, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. Other aspects are described and claimed.1. A method, comprising:
displaying content on a display screen of an information handling device; detecting, at the information handling device, a trigger for entering into a slow scrolling mode; and automatically scrolling, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. 2. The method of claim 1, wherein the different content is new content. 3. The method of claim 2, wherein the slow scrolling mode scrolling speed is adjusted automatically based on density of the content displayed on the display screen. 4. The method of claim 3, wherein the density of the content displayed on the display screen is ascertained via determining text density of the content. 5. The method of claim 4, wherein the text density is associated with a word count of the content displayed on the display screen. 6. The method of claim 4, wherein the speed of the slow scrolling mode is adjusted downward responsive to determining the text density of the content is above a predetermined threshold. 7. The method of claim 1, wherein the trigger for entering into the slow scrolling mode is selected from the group of triggers consisting of a user input trigger and a trigger derived from data associated with the content displayed on the display screen. 8. The method of claim 1, wherein the content displayed on the display screen is selected from the group of content consisting of web site content, and word processing document content. 9. The method of claim 1, further comprising detecting a trigger for exiting out of the slow scrolling mode. 10. The method of claim 7, wherein the trigger for exiting out of the slow scrolling mode comprises a user input trigger. 11. An information handling device, comprising:
a display screen; one or more processors; a memory device accessible to the one or more processors and storing code executable by the one or more processors to: display content on the display screen; detect a trigger for entering into a slow scrolling mode; and automatically scroll the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. 12. The information handling device of claim 11, wherein the different content is new content. 13. The information handling device of claim 12, wherein the slow scrolling mode scrolling speed is adjusted automatically based on density of the content displayed on the display screen. 14. The information handling device of claim 13, wherein the density of the content displayed on the display screen is ascertained via determining text density of the content. 15. The information handling device of claim 14, wherein the text density is associated with a word count of the content displayed on the display screen. 16. The information handling device of claim 14, wherein the speed of the slow scrolling mode is adjusted downward responsive to determining the text density of the content is above a predetermined threshold. 17. The information handling device of claim 11, wherein the trigger for entering into the slow scrolling mode is selected from the group of triggers consisting of a user input trigger and a trigger derived from data associated with the content displayed on the display screen. 18. The information handling device of claim 11, wherein the content displayed on the display screen is selected from the group of content consisting of web site content, and word processing document content. 19. The information handling device of claim 11, wherein the code is further executable by the one or more processors to detect a trigger for exiting out of the slow scrolling mode. 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 display content on a display screen of an information handling device; computer readable program code configured to detect, at the information handling device, a trigger for entering into a slow scrolling mode; and computer readable program code configured to automatically scroll, using a processor of the information handling device, the content on the display screen in the slow scrolling mode; said slow scrolling mode being a mode wherein the content is scrolled to present different content on the display screen; wherein the slow scrolling mode scrolling speed is adjustable without further user input. | 2,100 |
5,408 | 5,408 | 15,464,855 | 2,138 | A method for minimizing head seek movement and improving I/O performance of a hard disk drive is disclosed. In one embodiment, such a method includes logically dividing storage space of a hard disk drive into storage areas of substantially equal size. The method monitors a temperature of each of the storage areas. The temperature indicates how frequently data in a corresponding storage area is accessed. The method swaps data in storage areas of the hard disk drive based on temperature. These swaps involve moving hotter data toward outer tracks of the disk drive and colder data toward inner tracks of the disk drive. A corresponding system and computer program product are also disclosed. | 1. A method for minimizing head seek movement and improving I/O performance in a disk drive, the method comprising:
receiving data for writing to a disk array; determining a group of tracks of a disk drive to which to write the data; selecting a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and writing the data to the group of tracks on the selected disk drive. 2. The method of claim 1, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 3. The method of claim 2, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 4. The method of claim 1, wherein the group of tracks are a group of outer tracks of the disk drive. 5. The method of claim 1, wherein the group of tracks are a group of inner tracks of the disk drive. 6. The method of claim 1, further comprising adjusting which tracks belong to the group of tracks. 7. The method of claim 6, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. 8. A computer program product for minimizing head seek movement and improving I/O performance in a disk drive, the computer program product comprising a computer-readable medium having computer-usable program code embodied therein, the computer-usable program code configured to perform the following when executed by at least one processor:
receive data for writing to a disk array; determine a group of tracks of a disk drive to which to write the data; select a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and write the data to the group of tracks on the selected disk drive. 9. The computer program product of claim 8, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 10. The computer program product of claim 9, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 11. The computer program product of claim 8, wherein the group of tracks are a group of outer tracks of the disk drive. 12. The computer program product of claim 8, wherein the group of tracks are a group of inner tracks of the disk drive. 13. The computer program product of claim 8, wherein the computer-usable program code is further configured to adjust which tracks belong to the group of tracks. 14. The computer program product of claim 13, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. 15. A system for minimizing head seek movement and improving I/O performance in a disk drive, the system comprising:
at least one processor; at least one memory device coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
receive data for writing to a disk array;
determine a group of tracks of a disk drive to which to write the data;
select a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and
write the data to the group of tracks on the selected disk drive. 16. The system of claim 15, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 17. The system of claim 16, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 18. The system of claim 15, wherein the group of tracks are one of a group of outer tracks and a group of inner tracks of the disk drive. 19. The system of claim 15, wherein the instructions further cause the at least one processor to adjust which tracks belong to the group of tracks. 20. The system of claim 19, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. | A method for minimizing head seek movement and improving I/O performance of a hard disk drive is disclosed. In one embodiment, such a method includes logically dividing storage space of a hard disk drive into storage areas of substantially equal size. The method monitors a temperature of each of the storage areas. The temperature indicates how frequently data in a corresponding storage area is accessed. The method swaps data in storage areas of the hard disk drive based on temperature. These swaps involve moving hotter data toward outer tracks of the disk drive and colder data toward inner tracks of the disk drive. A corresponding system and computer program product are also disclosed.1. A method for minimizing head seek movement and improving I/O performance in a disk drive, the method comprising:
receiving data for writing to a disk array; determining a group of tracks of a disk drive to which to write the data; selecting a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and writing the data to the group of tracks on the selected disk drive. 2. The method of claim 1, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 3. The method of claim 2, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 4. The method of claim 1, wherein the group of tracks are a group of outer tracks of the disk drive. 5. The method of claim 1, wherein the group of tracks are a group of inner tracks of the disk drive. 6. The method of claim 1, further comprising adjusting which tracks belong to the group of tracks. 7. The method of claim 6, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. 8. A computer program product for minimizing head seek movement and improving I/O performance in a disk drive, the computer program product comprising a computer-readable medium having computer-usable program code embodied therein, the computer-usable program code configured to perform the following when executed by at least one processor:
receive data for writing to a disk array; determine a group of tracks of a disk drive to which to write the data; select a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and write the data to the group of tracks on the selected disk drive. 9. The computer program product of claim 8, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 10. The computer program product of claim 9, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 11. The computer program product of claim 8, wherein the group of tracks are a group of outer tracks of the disk drive. 12. The computer program product of claim 8, wherein the group of tracks are a group of inner tracks of the disk drive. 13. The computer program product of claim 8, wherein the computer-usable program code is further configured to adjust which tracks belong to the group of tracks. 14. The computer program product of claim 13, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. 15. A system for minimizing head seek movement and improving I/O performance in a disk drive, the system comprising:
at least one processor; at least one memory device coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
receive data for writing to a disk array;
determine a group of tracks of a disk drive to which to write the data;
select a disk drive in the disk array having a read/write head that is currently reading or writing to the group of tracks; and
write the data to the group of tracks on the selected disk drive. 16. The system of claim 15, wherein determining a group of tracks of a disk drive comprises determining a temperature of the data. 17. The system of claim 16, wherein determining a group of tracks of a disk drive comprises determining a group of tracks that store data of the same temperature. 18. The system of claim 15, wherein the group of tracks are one of a group of outer tracks and a group of inner tracks of the disk drive. 19. The system of claim 15, wherein the instructions further cause the at least one processor to adjust which tracks belong to the group of tracks. 20. The system of claim 19, wherein adjusting comprises dynamically adjusting as a need for storage space in the group of tracks changes. | 2,100 |
5,409 | 5,409 | 14,450,409 | 2,142 | An interface device includes a display unit that displays icons, a rotating unit that orders changes in orientations of the icons, and an executing unit that orders execution of applications corresponding to the icons. The display unit changes and displays the orientations of the icons in response to the icon orientation change order issued by the rotating unit, and also displays, upon accepting that the executing unit has specified an icon and ordered execution of an application, a window with an orientation that coincides with the orientation of the icon, such that users located around the display screen view icons and windows in orientations that are easily comprehensible to each user. | 1. An interface device including:
a display device configured to display icons on a screen; and a processor configured and programmed to define:
a rotating unit configured to order changes in orientations of the icons;
an executing unit configured to select at least one of the icons and order execution of an application program;
a changing and displaying unit configured to change the orientations of the icons and display the changed orientations of the icons in response to the rotating unit ordering the changes in the orientations of the icons; and
a displaying unit configured to, upon accepting that the executing unit has selected the at least one of the icons and ordered execution of the application program, display a window such that an orientation of the window coincides with the orientation of the at least one of the icons. 2. The interface device according to claim 1, further comprising a storage device configured to store phase information that indicates the orientations of the icons relative to a standard orientation set for the screen, the storage device being configured to change the phase information of the icons in response to the rotating unit ordering the changes in the orientations of the icons, and upon accepting that the executing unit has selected the at least one of the icons and ordered execution of the application program, the display device displays the window in an orientation determined by the phase information of the at least one of the icons. 3. The interface device according to claim 1, wherein the rotating unit is configured to change the orientation of each of the icons to an arbitrary orientation. 4. The interface device according to claim 1, wherein the orientation of each of the icons is any of four orientations that face four sides of the screen from a center of each of the icons. 5. The interface device according to claim 1, wherein, upon accepting that the executing unit has selected a plurality of the icons and ordered execution of a plurality of the application programs, the display device displays corresponding windows such that the orientations of the windows coincide with the respective orientations of the selected icons. 6. An interface method comprising the steps of:
displaying icons on a screen; ordering changes in orientations of the icons; and selecting at least one of the icons; ordering execution of an application program; changing the orientations and displaying the changes in the orientations of the icons in response to the step of ordering changes in orientations of the icons; and after the steps of selecting at least one of the icons and ordering execution of an application program, displaying a window such that an orientation of the window coincides with the orientation of the at least one of the icons selected in the step of selecting at least one of the icons. 7. A non-transitory computer-readable medium including a computer program for having a computer equipped with a display device perform, when the computer program runs on the computer, a method comprising the steps of:
displaying icons on a screen of the display device; ordering changes in orientations of the icons; selecting at least one of the icons; ordering execution of an application program; changing the orientations and displaying the changes in the orientations of the icons in response to the step of ordering changes in orientations of the icons; and after the steps of selecting at least one of the icons and ordering execution of an application program, displaying a window such that an orientation of the window coincides with the orientation of the at least one of the icons selected in the step of selecting at least one of the icons. | An interface device includes a display unit that displays icons, a rotating unit that orders changes in orientations of the icons, and an executing unit that orders execution of applications corresponding to the icons. The display unit changes and displays the orientations of the icons in response to the icon orientation change order issued by the rotating unit, and also displays, upon accepting that the executing unit has specified an icon and ordered execution of an application, a window with an orientation that coincides with the orientation of the icon, such that users located around the display screen view icons and windows in orientations that are easily comprehensible to each user.1. An interface device including:
a display device configured to display icons on a screen; and a processor configured and programmed to define:
a rotating unit configured to order changes in orientations of the icons;
an executing unit configured to select at least one of the icons and order execution of an application program;
a changing and displaying unit configured to change the orientations of the icons and display the changed orientations of the icons in response to the rotating unit ordering the changes in the orientations of the icons; and
a displaying unit configured to, upon accepting that the executing unit has selected the at least one of the icons and ordered execution of the application program, display a window such that an orientation of the window coincides with the orientation of the at least one of the icons. 2. The interface device according to claim 1, further comprising a storage device configured to store phase information that indicates the orientations of the icons relative to a standard orientation set for the screen, the storage device being configured to change the phase information of the icons in response to the rotating unit ordering the changes in the orientations of the icons, and upon accepting that the executing unit has selected the at least one of the icons and ordered execution of the application program, the display device displays the window in an orientation determined by the phase information of the at least one of the icons. 3. The interface device according to claim 1, wherein the rotating unit is configured to change the orientation of each of the icons to an arbitrary orientation. 4. The interface device according to claim 1, wherein the orientation of each of the icons is any of four orientations that face four sides of the screen from a center of each of the icons. 5. The interface device according to claim 1, wherein, upon accepting that the executing unit has selected a plurality of the icons and ordered execution of a plurality of the application programs, the display device displays corresponding windows such that the orientations of the windows coincide with the respective orientations of the selected icons. 6. An interface method comprising the steps of:
displaying icons on a screen; ordering changes in orientations of the icons; and selecting at least one of the icons; ordering execution of an application program; changing the orientations and displaying the changes in the orientations of the icons in response to the step of ordering changes in orientations of the icons; and after the steps of selecting at least one of the icons and ordering execution of an application program, displaying a window such that an orientation of the window coincides with the orientation of the at least one of the icons selected in the step of selecting at least one of the icons. 7. A non-transitory computer-readable medium including a computer program for having a computer equipped with a display device perform, when the computer program runs on the computer, a method comprising the steps of:
displaying icons on a screen of the display device; ordering changes in orientations of the icons; selecting at least one of the icons; ordering execution of an application program; changing the orientations and displaying the changes in the orientations of the icons in response to the step of ordering changes in orientations of the icons; and after the steps of selecting at least one of the icons and ordering execution of an application program, displaying a window such that an orientation of the window coincides with the orientation of the at least one of the icons selected in the step of selecting at least one of the icons. | 2,100 |
5,410 | 5,410 | 14,516,643 | 2,182 | In an aspect, a processor includes circuitry for iterative refinement approaches, e.g., Newton-Raphson, to evaluating functions, such as square root, reciprocal, and for division. The circuitry includes circuitry for producing an initial approximation; which can include a LookUp Table (LUT). LUT may produce an output that (with implementation-dependent processing) forms an initial approximation of a value, with a number of bits of precision. A limited-precision multiplier multiplies that initial approximation with another value; an output of the limited precision multiplier goes to a full precision multiplier circuit that performs remaining multiplications required for iteration(s) in the particular refinement process being implemented. For example, in division, the output being calculated is for a reciprocal of the divisor. The full-precision multiplier circuit requires a first number of clock cycles to complete, and both the small multiplier and the initial approximation circuitry complete within the first number of clock cycles. | 1. An apparatus comprising:
initial approximation circuitry for providing an initial approximation of an output value, the output value to be produced to a first number of bits of precision, and the initial approximation of the output value having a second number of bits of precision, the second number being less than the first number; limited precision multiplier circuitry configured to receive the initial approximation and multiply the initial approximation with another value; and full-precision multiplier circuitry coupled to receive an output from the limited precision multiplier circuitry and configured to multiply that output from the limited precision multiplier circuitry with another value, the full-precision multiplier configured to preserve no fewer than the first number of bits of precision in a result of the multiplication, wherein the full-precision multiplier circuitry requires a first number of clock cycles to finish its multiplication, and a combined number of clock cycles required by the initial approximation circuitry to provide the initial approximation and the limited precision multiplier circuitry to complete a multiplication is equal to or less than the first number of clock cycles. 2. The apparatus of claim 1, further comprising control circuitry configured to selectively provide either the output value from the limited precision multiplier circuitry or a result from the full-precision multiplier circuitry as an input to the full-precision multiplier circuitry. 3. The apparatus of claim 1, further comprising control circuitry configured to control the initial approximation circuitry, the limited precision multiplier circuitry and the full-precision multiplier circuitry to produce a mantissa for the output value of the function with at least the first number of bits of precision by conducting an iterative refinement of the initial approximation, wherein only a first multiplication in the iterative refinement is conducted by the limited precision multiplier circuitry. 4. The apparatus of claim 1, wherein the initial approximation circuitry comprises a LookUp Table (LUT) configured to receive at least a portion of bits of the input value and to output a set of bits from which the initial approximation can be constructed. 5. The apparatus of claim 1, wherein the full-precision multiplier circuitry is configured to perform a double-precision multiplication between two mantissas. 6. The apparatus of claim 1, wherein the apparatus is configured to provide a value for a division of a dividend a by a divisor b, and the initial approximation circuitry is configured to produce the initial approximation as an initial approximation of a reciprocal of the divisor b. 7. The apparatus of claim 1, wherein the apparatus is configured to provide a value for a square root of a value b and the initial approximation circuitry is configured to produce the initial approximation as an initial approximation of a reciprocal of the square root of b. 8. A method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration, comprising:
producing an initial approximation of the output value based on the input value, the initial approximation having a first number of bits of precision, the first number of bits of precision being fewer than a required number of bits of precision in the output value; performing a first multiplication of a first iteration by a limited-precision multiplier comprising circuitry capable of maintaining, in an output, at least twice the first number of bits of precision and fewer bits of precision than required to produce a single-precision floating point mantissa, wherein the producing of the initial approximation and the performing of the first multiplication collectively require a first number of clock cycles; performing, in a full-precision multiplier, remaining multiplications for each iteration, each multiplication in the full-precision multiplier requiring the first number of clock cycles. 9. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the full-precision multiplier requires three clock cycles, the producing of the initial approximation of the output value requires one clock cycle and the performing of the first multiplication of the first iteration requires two clock cycles. 10. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the output value is an approximation of a reciprocal of the input value and further comprising multiplying the output value with a dividend. 11. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the output value is an approximation of a reciprocal of the square root of the input value and further comprising multiplying the output value with the input value. 12. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, further comprising performing two iterations in producing a double-precision evaluation of the output value. 13. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, further comprising using the limited-precision multiplier once and the full-precision multiplier twice in producing a single-precision evaluation of the output value. | In an aspect, a processor includes circuitry for iterative refinement approaches, e.g., Newton-Raphson, to evaluating functions, such as square root, reciprocal, and for division. The circuitry includes circuitry for producing an initial approximation; which can include a LookUp Table (LUT). LUT may produce an output that (with implementation-dependent processing) forms an initial approximation of a value, with a number of bits of precision. A limited-precision multiplier multiplies that initial approximation with another value; an output of the limited precision multiplier goes to a full precision multiplier circuit that performs remaining multiplications required for iteration(s) in the particular refinement process being implemented. For example, in division, the output being calculated is for a reciprocal of the divisor. The full-precision multiplier circuit requires a first number of clock cycles to complete, and both the small multiplier and the initial approximation circuitry complete within the first number of clock cycles.1. An apparatus comprising:
initial approximation circuitry for providing an initial approximation of an output value, the output value to be produced to a first number of bits of precision, and the initial approximation of the output value having a second number of bits of precision, the second number being less than the first number; limited precision multiplier circuitry configured to receive the initial approximation and multiply the initial approximation with another value; and full-precision multiplier circuitry coupled to receive an output from the limited precision multiplier circuitry and configured to multiply that output from the limited precision multiplier circuitry with another value, the full-precision multiplier configured to preserve no fewer than the first number of bits of precision in a result of the multiplication, wherein the full-precision multiplier circuitry requires a first number of clock cycles to finish its multiplication, and a combined number of clock cycles required by the initial approximation circuitry to provide the initial approximation and the limited precision multiplier circuitry to complete a multiplication is equal to or less than the first number of clock cycles. 2. The apparatus of claim 1, further comprising control circuitry configured to selectively provide either the output value from the limited precision multiplier circuitry or a result from the full-precision multiplier circuitry as an input to the full-precision multiplier circuitry. 3. The apparatus of claim 1, further comprising control circuitry configured to control the initial approximation circuitry, the limited precision multiplier circuitry and the full-precision multiplier circuitry to produce a mantissa for the output value of the function with at least the first number of bits of precision by conducting an iterative refinement of the initial approximation, wherein only a first multiplication in the iterative refinement is conducted by the limited precision multiplier circuitry. 4. The apparatus of claim 1, wherein the initial approximation circuitry comprises a LookUp Table (LUT) configured to receive at least a portion of bits of the input value and to output a set of bits from which the initial approximation can be constructed. 5. The apparatus of claim 1, wherein the full-precision multiplier circuitry is configured to perform a double-precision multiplication between two mantissas. 6. The apparatus of claim 1, wherein the apparatus is configured to provide a value for a division of a dividend a by a divisor b, and the initial approximation circuitry is configured to produce the initial approximation as an initial approximation of a reciprocal of the divisor b. 7. The apparatus of claim 1, wherein the apparatus is configured to provide a value for a square root of a value b and the initial approximation circuitry is configured to produce the initial approximation as an initial approximation of a reciprocal of the square root of b. 8. A method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration, comprising:
producing an initial approximation of the output value based on the input value, the initial approximation having a first number of bits of precision, the first number of bits of precision being fewer than a required number of bits of precision in the output value; performing a first multiplication of a first iteration by a limited-precision multiplier comprising circuitry capable of maintaining, in an output, at least twice the first number of bits of precision and fewer bits of precision than required to produce a single-precision floating point mantissa, wherein the producing of the initial approximation and the performing of the first multiplication collectively require a first number of clock cycles; performing, in a full-precision multiplier, remaining multiplications for each iteration, each multiplication in the full-precision multiplier requiring the first number of clock cycles. 9. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the full-precision multiplier requires three clock cycles, the producing of the initial approximation of the output value requires one clock cycle and the performing of the first multiplication of the first iteration requires two clock cycles. 10. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the output value is an approximation of a reciprocal of the input value and further comprising multiplying the output value with a dividend. 11. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, wherein the output value is an approximation of a reciprocal of the square root of the input value and further comprising multiplying the output value with the input value. 12. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, further comprising performing two iterations in producing a double-precision evaluation of the output value. 13. The method of evaluating an output value of a function at an input value using an iterative refinement procedure requiring at least two multiplications for each iteration of claim 8, further comprising using the limited-precision multiplier once and the full-precision multiplier twice in producing a single-precision evaluation of the output value. | 2,100 |
5,411 | 5,411 | 15,244,325 | 2,194 | In a group communications system, a group watcher module subscribes to presentities of interest for a particular group by communicating, to at least one presence server module, a set of subscriptions to a plurality of presentities, wherein each subscription contains a set of event notification criteria for a presentity. When the group watcher module detects a change in presence information for the set of subscriptions, it determines current members of the group and distributes the change in presence information to the current members. | 1.-17. (canceled) 18. A method for providing presence information to a group comprising a plurality of members, the method comprising:
at a group watcher module:
communicating, to at least one presence server module, a set of subscriptions to a plurality of presentities, wherein the group watcher module is subscribed to the plurality of presentities by the set of subscriptions and wherein each subscription contains a set of event notification criteria for a presentity;
detecting a change in presence information for the set of subscriptions;
in response to detecting the change in presence information, retrieving, from a group server, group membership information;
determining current members of the group based on the group membership information; and
distributing the change in presence information to each of the current members based on the determination of the current members of the group and without receiving, from any of the determined current members, a subscription that identifies one or more of the plurality of presentities. 19. The method of claim 18, further comprising the group watcher module modifying the set of subscriptions by one or more of:
changing the set of event notification criteria for at least one subscription, which causes different presence information to be sent to the members of the group; adding or removing a presentity from the plurality of presentities, which causes different presence information to be sent to the members of the group; and adding a subscription to the set of subscriptions or deleting a subscription from the set of subscriptions, which causes different presence information to be sent to the members of the group. 20. The method of claim 18, wherein a sub-set of the plurality of presentities is identified by a Presence Resource List. 21. The method of claim 18, wherein the communicating uses a Session Initiation Protocol (SIP) SUBSCRIBE method. 22. The method of claim 18, wherein the distributing uses a SIP NOTIFY method. 23. The method of claim 18, wherein communicating to at least one presence server module comprises sending the set of subscriptions to a plurality of presence servers wherein each presence server receives a sub-set of the subscriptions. 24. The method of claim 18, wherein the set of subscriptions comprises a first event notification criteria for a first presentity and a second event notification criteria that is different from the first event notification criteria for a second presentity that is different than the first presentity. 25. The method of claim 18, wherein determining the current members of the group comprises retrieving identifiers for the current members from a group server. 26. The method of claim 18, wherein determining the current members of the group comprises:
storing identifiers for members of the group; and updating the identifiers for the members of the group upon detecting that a new member is added to the group or an existing member is removed from the group. 26. The method of claim 18, wherein the group watcher module is included in a presence server. 27. The method of claim 18, wherein the group server is a Push-to-Talk server. 28. A presence server comprising:
a processing device that is configured to: receive a set of subscriptions to a plurality of presentities, wherein each subscription contains a set of event notification criteria for a presentity; detect a change in presence information for the set of subscriptions; in response to detecting the change in presence information, retrieve, from a group server, group membership information; determine current members of the group based on the group membership information; and distribute the change in presence information to each of the current members based on the determination of the current members of the group and without receiving, from any of the determined current members, a subscription that identifies one or more of the plurality of presentities. 29. The presence server of claim 28, wherein the group server is a Push-to-Talk server. | In a group communications system, a group watcher module subscribes to presentities of interest for a particular group by communicating, to at least one presence server module, a set of subscriptions to a plurality of presentities, wherein each subscription contains a set of event notification criteria for a presentity. When the group watcher module detects a change in presence information for the set of subscriptions, it determines current members of the group and distributes the change in presence information to the current members.1.-17. (canceled) 18. A method for providing presence information to a group comprising a plurality of members, the method comprising:
at a group watcher module:
communicating, to at least one presence server module, a set of subscriptions to a plurality of presentities, wherein the group watcher module is subscribed to the plurality of presentities by the set of subscriptions and wherein each subscription contains a set of event notification criteria for a presentity;
detecting a change in presence information for the set of subscriptions;
in response to detecting the change in presence information, retrieving, from a group server, group membership information;
determining current members of the group based on the group membership information; and
distributing the change in presence information to each of the current members based on the determination of the current members of the group and without receiving, from any of the determined current members, a subscription that identifies one or more of the plurality of presentities. 19. The method of claim 18, further comprising the group watcher module modifying the set of subscriptions by one or more of:
changing the set of event notification criteria for at least one subscription, which causes different presence information to be sent to the members of the group; adding or removing a presentity from the plurality of presentities, which causes different presence information to be sent to the members of the group; and adding a subscription to the set of subscriptions or deleting a subscription from the set of subscriptions, which causes different presence information to be sent to the members of the group. 20. The method of claim 18, wherein a sub-set of the plurality of presentities is identified by a Presence Resource List. 21. The method of claim 18, wherein the communicating uses a Session Initiation Protocol (SIP) SUBSCRIBE method. 22. The method of claim 18, wherein the distributing uses a SIP NOTIFY method. 23. The method of claim 18, wherein communicating to at least one presence server module comprises sending the set of subscriptions to a plurality of presence servers wherein each presence server receives a sub-set of the subscriptions. 24. The method of claim 18, wherein the set of subscriptions comprises a first event notification criteria for a first presentity and a second event notification criteria that is different from the first event notification criteria for a second presentity that is different than the first presentity. 25. The method of claim 18, wherein determining the current members of the group comprises retrieving identifiers for the current members from a group server. 26. The method of claim 18, wherein determining the current members of the group comprises:
storing identifiers for members of the group; and updating the identifiers for the members of the group upon detecting that a new member is added to the group or an existing member is removed from the group. 26. The method of claim 18, wherein the group watcher module is included in a presence server. 27. The method of claim 18, wherein the group server is a Push-to-Talk server. 28. A presence server comprising:
a processing device that is configured to: receive a set of subscriptions to a plurality of presentities, wherein each subscription contains a set of event notification criteria for a presentity; detect a change in presence information for the set of subscriptions; in response to detecting the change in presence information, retrieve, from a group server, group membership information; determine current members of the group based on the group membership information; and distribute the change in presence information to each of the current members based on the determination of the current members of the group and without receiving, from any of the determined current members, a subscription that identifies one or more of the plurality of presentities. 29. The presence server of claim 28, wherein the group server is a Push-to-Talk server. | 2,100 |
5,412 | 5,412 | 12,749,123 | 2,171 | Disclosed herein are systems, methods, and non-transitory computer-readable storage media for linking participants in a communication session. The method includes presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and a second participant in the communication session, establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant, and displaying a depiction of the bidirectional link to at least one participant in the communication session. The method optionally includes negotiating a calendar event with the second participant via the bidirectional link based on the trusted information. Graphical elements associated with the first and second participants can depict one or more of presence, context, and persona information. | 1. A computer-implemented method of linking participants in a communication session, the method causing a communications device to perform steps comprising:
presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and any second participant in the communication session; establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and displaying a depiction of the bidirectional link to at least one participant in the communication session. 2. The computer-implemented method of claim 1, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 3. The computer-implemented method of claim 2, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 4. The computer-implemented method of claim 1, wherein the trusted information includes calendar events. 5. The computer-implemented method of claim 4, the method further causing the communications device to negotiate a calendar event with the second participant via the bidirectional link based on the trusted information. 6. The computer-implemented method of claim 1, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access. 7. The computer-implemented method of claim 6, wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. 8. A system for linking participants in a communication session, the system comprising:
a processor; a first module controlling the processor to present a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and any second participant in the communication session; a second module controlling the processor to establish a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and a third module controlling the processor to display a depiction of the bidirectional link to at least one participant in the communication session. 9. The system of claim 8, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 10. The system of claim 9, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 11. The system of claim 8, wherein the trusted information includes calendar events. 12. The system of claim 11, the system further comprising a third module controlling the processor to negotiate a calendar event with the second participant via the bidirectional link based on the trusted information. 13. The system of claim 8, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access. 14. The system of claim 13, wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. 15. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to link participants in a communication session, the instructions comprising:
presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and a second participant in the communication session; establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and displaying a depiction of the bidirectional link to at least one participant in the communication session. 16. The non-transitory computer-readable storage medium of claim 15, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 17. The non-transitory computer-readable storage medium of claim 16, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 18. The non-transitory computer-readable storage medium of claim 15, wherein the trusted information includes calendar events. 19. The non-transitory computer-readable storage medium of claim 18, the instructions further comprising negotiating a calendar event with the second participant via the bidirectional link based on the trusted information. 20. The non-transitory computer-readable storage medium of claim 15, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access, and wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. | Disclosed herein are systems, methods, and non-transitory computer-readable storage media for linking participants in a communication session. The method includes presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and a second participant in the communication session, establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant, and displaying a depiction of the bidirectional link to at least one participant in the communication session. The method optionally includes negotiating a calendar event with the second participant via the bidirectional link based on the trusted information. Graphical elements associated with the first and second participants can depict one or more of presence, context, and persona information.1. A computer-implemented method of linking participants in a communication session, the method causing a communications device to perform steps comprising:
presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and any second participant in the communication session; establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and displaying a depiction of the bidirectional link to at least one participant in the communication session. 2. The computer-implemented method of claim 1, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 3. The computer-implemented method of claim 2, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 4. The computer-implemented method of claim 1, wherein the trusted information includes calendar events. 5. The computer-implemented method of claim 4, the method further causing the communications device to negotiate a calendar event with the second participant via the bidirectional link based on the trusted information. 6. The computer-implemented method of claim 1, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access. 7. The computer-implemented method of claim 6, wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. 8. A system for linking participants in a communication session, the system comprising:
a processor; a first module controlling the processor to present a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and any second participant in the communication session; a second module controlling the processor to establish a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and a third module controlling the processor to display a depiction of the bidirectional link to at least one participant in the communication session. 9. The system of claim 8, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 10. The system of claim 9, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 11. The system of claim 8, wherein the trusted information includes calendar events. 12. The system of claim 11, the system further comprising a third module controlling the processor to negotiate a calendar event with the second participant via the bidirectional link based on the trusted information. 13. The system of claim 8, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access. 14. The system of claim 13, wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. 15. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to link participants in a communication session, the instructions comprising:
presenting a set of connected graphical elements on a graphical user interface (GUI) representing a structure of the communication session and a trusted relationship between a first participant and a second participant in the communication session; establishing a bidirectional link between the first participant and the second participant, wherein the communication device exchanges trusted information between the first participant and the second participant; and displaying a depiction of the bidirectional link to at least one participant in the communication session. 16. The non-transitory computer-readable storage medium of claim 15, wherein graphical elements associated with the first participant and the second participant depict one or more of presence, context, and persona information. 17. The non-transitory computer-readable storage medium of claim 16, wherein the graphical elements depicting one or more of presence, context, and persona information comprise a dashboard of trusted options between the first participant and the second participant. 18. The non-transitory computer-readable storage medium of claim 15, wherein the trusted information includes calendar events. 19. The non-transitory computer-readable storage medium of claim 18, the instructions further comprising negotiating a calendar event with the second participant via the bidirectional link based on the trusted information. 20. The non-transitory computer-readable storage medium of claim 15, wherein the bidirectional link is selected from one of a hierarchy of types, each type indicating a different level of trust and access, and wherein the bidirectional link appearance signifies the selected one of the hierarchy of types. | 2,100 |
5,413 | 5,413 | 14,234,108 | 2,144 | Methods, computer readable medium, and systems for mapping geologic features are described. In one example, a selection of a template describing a theoretical geologic depositional profile is received. In addition, paleo-elevations and/or paleo-depths of actual geologic facies in an actual geologic depositional profile are received. A graphical map that represents the actual geologic depositional profile is generated by mapping the received paleo-elevations and/or paleo-depths onto the theoretical depositional profile. | 1. A method for mapping geologic data performed with one or more computing systems, the method comprising:
receiving, through a user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies; receiving, through the user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile; mapping the received paleo-elevation or the paleo-depth to the theoretical geologic profile generating a graphical map representing the actual geologic depositional profile based on the mapping; and displaying the generated graphical map in the user interface. 2. The method of claim 1, further comprising generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 3. The method of claim 2, wherein receiving the selection of the template comprises presenting in the user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 4. The method of claim 1, further comprising, in response to receiving the selection of the template, displaying an image of the theoretical geologic depositional profile in the user interface. 5. The method of claim 1, wherein mapping the paleo-elevation or the paleo-depth of the actual facies to the theoretical geologic profile comprises correlating the received paleo-elevation or paleo-depth of the actual facies to the theoretical geologic facies. 6. The method of claim 5, further comprising:
receiving, in the user interface, another paleo-elevation or paleo-depth of another actual facies in the actual geologic depositional profile; and correlating the other paleo-elevation or paleo-depth to the theoretical geologic facies. 7. The method of claim 6, wherein correlating the received paleo-elevation or paleo-depth of the actual facies to the theoretical geologic facies comprises determining a corresponding theoretical paleo-elevation or paleo-depth for a theoretical facies in the theoretical geologic profile that corresponds to the actual facies. 8. The method of claim 7, wherein determining the corresponding paleo-elevation or paleo-depth comprises interpolating the theoretical paleo-elevation or paleo-depth for the corresponding theoretical facies based on the received paleo-elevation or paleo-depth. 9. The method of claim 7, wherein determining the corresponding paleo-elevation or paleo-depth comprises extrapolating the theoretical paleo-elevation or paleo-depth for the corresponding theoretical facies based on the received paleo-elevation or paleo-depth. 10. The method of claim 1, further comprising:
receiving a plurality of paleo-elevations or paleo-depths relative to sea level of a corresponding plurality of actual facies in the actual geologic depositional profile; and mapping the plurality of paleo-elevations or paleo-depths to the theoretical geologic profile in accordance with Walther's Law. 11. The method of claim 10, wherein mapping the plurality of paleo-elevations or paleo-depths to the theoretical geologic profile comprises building a table having at least one of a row or column including descriptions of the plurality of actual geologic facies and at least one of a corresponding row or column including the corresponding paleo-elevations or paleo-depths. 12. The method of claim 1, further comprising:
receiving input to position one or more secondary facies in the actual geologic depositional profile; and in response to receiving the input, displaying one or more objects that represent corresponding one or more secondary facies in the graphical map. 13. The method of claim 12, wherein the one or more secondary facies comprises at least one of a river, a submarine fan, or a channel. 14. The method of claim 12, further comprising modeling the one or more secondary facies based on object metrics included in the selected template. 15. An apparatus comprising a non-transitory and tangible computer readable media, the media comprising instructions operable when executed to cause one or more computing systems to perform operations comprising:
receiving, through a user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies; receiving, through the user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile; mapping the received paleo-elevation or the paleo-depth to the theoretical geologic profile; generating a graphical map representing the actual geologic depositional profile based on the mapping; and displaying the generated graphical map in the user interface. 16. The apparatus of claim 15, wherein the operations further comprise generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 17. The apparatus of claim 16, wherein receiving the selection of the template comprises presenting in the user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 18-28. (canceled) 29. A computing system, comprising
one or more memory modules; one or more processors; a graphical user interface; and a geologic mapping tool stored on one or more of the memory modules, the geologic mapping tool operable when executed by the one or more processors to perform operations comprising:
receiving, through the graphical user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies;
receiving, through the graphical user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile;
mapping the received paleo-elevation or the paleo-depth of the actual facies to the theoretical geologic profile;
generating a graphical map representing the actual geologic depositional profile based on the mapping; and
displaying the generated graphical map in the graphical user interface. 30. The system of claim 29, wherein the operations further comprise generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 31. The system of claim 30, wherein receiving the selection of the template comprises presenting in the graphical user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 32-42. (canceled) | Methods, computer readable medium, and systems for mapping geologic features are described. In one example, a selection of a template describing a theoretical geologic depositional profile is received. In addition, paleo-elevations and/or paleo-depths of actual geologic facies in an actual geologic depositional profile are received. A graphical map that represents the actual geologic depositional profile is generated by mapping the received paleo-elevations and/or paleo-depths onto the theoretical depositional profile.1. A method for mapping geologic data performed with one or more computing systems, the method comprising:
receiving, through a user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies; receiving, through the user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile; mapping the received paleo-elevation or the paleo-depth to the theoretical geologic profile generating a graphical map representing the actual geologic depositional profile based on the mapping; and displaying the generated graphical map in the user interface. 2. The method of claim 1, further comprising generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 3. The method of claim 2, wherein receiving the selection of the template comprises presenting in the user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 4. The method of claim 1, further comprising, in response to receiving the selection of the template, displaying an image of the theoretical geologic depositional profile in the user interface. 5. The method of claim 1, wherein mapping the paleo-elevation or the paleo-depth of the actual facies to the theoretical geologic profile comprises correlating the received paleo-elevation or paleo-depth of the actual facies to the theoretical geologic facies. 6. The method of claim 5, further comprising:
receiving, in the user interface, another paleo-elevation or paleo-depth of another actual facies in the actual geologic depositional profile; and correlating the other paleo-elevation or paleo-depth to the theoretical geologic facies. 7. The method of claim 6, wherein correlating the received paleo-elevation or paleo-depth of the actual facies to the theoretical geologic facies comprises determining a corresponding theoretical paleo-elevation or paleo-depth for a theoretical facies in the theoretical geologic profile that corresponds to the actual facies. 8. The method of claim 7, wherein determining the corresponding paleo-elevation or paleo-depth comprises interpolating the theoretical paleo-elevation or paleo-depth for the corresponding theoretical facies based on the received paleo-elevation or paleo-depth. 9. The method of claim 7, wherein determining the corresponding paleo-elevation or paleo-depth comprises extrapolating the theoretical paleo-elevation or paleo-depth for the corresponding theoretical facies based on the received paleo-elevation or paleo-depth. 10. The method of claim 1, further comprising:
receiving a plurality of paleo-elevations or paleo-depths relative to sea level of a corresponding plurality of actual facies in the actual geologic depositional profile; and mapping the plurality of paleo-elevations or paleo-depths to the theoretical geologic profile in accordance with Walther's Law. 11. The method of claim 10, wherein mapping the plurality of paleo-elevations or paleo-depths to the theoretical geologic profile comprises building a table having at least one of a row or column including descriptions of the plurality of actual geologic facies and at least one of a corresponding row or column including the corresponding paleo-elevations or paleo-depths. 12. The method of claim 1, further comprising:
receiving input to position one or more secondary facies in the actual geologic depositional profile; and in response to receiving the input, displaying one or more objects that represent corresponding one or more secondary facies in the graphical map. 13. The method of claim 12, wherein the one or more secondary facies comprises at least one of a river, a submarine fan, or a channel. 14. The method of claim 12, further comprising modeling the one or more secondary facies based on object metrics included in the selected template. 15. An apparatus comprising a non-transitory and tangible computer readable media, the media comprising instructions operable when executed to cause one or more computing systems to perform operations comprising:
receiving, through a user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies; receiving, through the user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile; mapping the received paleo-elevation or the paleo-depth to the theoretical geologic profile; generating a graphical map representing the actual geologic depositional profile based on the mapping; and displaying the generated graphical map in the user interface. 16. The apparatus of claim 15, wherein the operations further comprise generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 17. The apparatus of claim 16, wherein receiving the selection of the template comprises presenting in the user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 18-28. (canceled) 29. A computing system, comprising
one or more memory modules; one or more processors; a graphical user interface; and a geologic mapping tool stored on one or more of the memory modules, the geologic mapping tool operable when executed by the one or more processors to perform operations comprising:
receiving, through the graphical user interface, a selection of a template describing a theoretical geologic depositional profile representing an arrangement of a plurality of theoretical geologic facies;
receiving, through the graphical user interface, at least one of a paleo-elevation or a paleo-depth relative to sea level of an actual facies in an actual geologic depositional profile;
mapping the received paleo-elevation or the paleo-depth of the actual facies to the theoretical geologic profile;
generating a graphical map representing the actual geologic depositional profile based on the mapping; and
displaying the generated graphical map in the graphical user interface. 30. The system of claim 29, wherein the operations further comprise generating a plurality of templates that each describes a corresponding theoretical geologic profile representing a corresponding arrangement of a plurality of theoretical geologic facies, the plurality of templates including the selected template. 31. The system of claim 30, wherein receiving the selection of the template comprises presenting in the graphical user interface a plurality of unique templates comprising a plurality of theoretical geologic depositional systems, wherein the received selection is one of the plurality of unique templates. 32-42. (canceled) | 2,100 |
5,414 | 5,414 | 14,885,505 | 2,184 | A vehicle-mounted electronic system includes a vehicle-mounted device and a mobile terminal connected to the vehicle-mounted device through a connection unit. The vehicle-mounted device includes a request unit configured to request the mobile terminal to provide start-up notification for an application stared in the mobile terminal, a reception unit configured to receive the start-up notification through the connection unit, and a control unit configured to control selection of an operation mode such that the operation mode corresponding to the application identified by the start-up notification is selected. | 1. An electronic device comprising:
a connection unit configured to enable connection between the electronic device and an external device that stores one or more applications; a selection unit configured to select at least one operation mode from among a plurality of operation modes; an output unit configured to output information on the basis of the operation mode selected by the selection unit; a request unit configured to request the external device to provide start-up notification for an application started in the external device, in response to connection by the connection unit; a reception unit configured to receive the start-up notification through the connection unit; and a control unit configured to control the selection unit so as to select an operation mode corresponding to the application identified by the start-up notification. 2. The electronic device according to claim 1, wherein the control unit includes a determination unit configured to determine whether switching of the operation mode is feasible, and wherein:
when the determination unit determines that the switching is feasible, the control unit is configured to cause the selection unit to change the operation mode, and when the determination unit determines that the switching is unfeasible, the control unit is configured not to cause the selection unit to change the operation mode. 3. The electronic device according to claim 1, wherein the selection unit includes an input screen on which the plurality of operation modes is selectable, and one or more icons for starting up one or more applications stored in the external device are displayed on the input screen, and
wherein when an icon on the input screen is selected by a user, the selection unit is configured to select the operation mode corresponding to the application associated with the icon. 4. The electronic device according to claim 3, wherein when the control unit receives the start-up notification, the control unit is configured to cause the selection unit to automatically select the icon corresponding to the application identified by the start-up notification. 5. The electronic device according to claim 3, wherein the request unit is configured to provide the external device with identification information for the applications associated with the icons displayed on the input screen. 6. The electronic device according to claim 1, further comprising a unit configured to receive closing information indicating closing of the application started in the external device,
wherein the control unit is configured to control the selection unit so as to select a last operation mode. 7. The electronic device according to claim 2, wherein when the output unit outputs emergency information or interruption information, the determination unit is configured to determine that the switching of the operation mode is unfeasible. 8. The electronic device according to claim 7, wherein when the determination unit determines that the switching of the operation mode is unfeasible, the control unit is configured to display a user input screen that prompts a user to determine whether the operation mode is to be switched. 9. The electronic device according to claim 1, wherein the output unit is configured to receive video data or audio data created by the application started in the external device through the connection unit and is configured to output the received video data or the audio data. 10. The electronic device according to claim 1, wherein the electronic device is mounted on a movable vehicle, and the external device is a mobile terminal connected to the electronic device in the vehicle. 11. A system comprising:
an electronic device comprising:
a connection unit configured to enable connection between the electronic device and an external device that stores one or more applications;
a selection unit configured to select at least one operation mode from among a plurality of operation modes;
an output unit configured to output information on the basis of the operation mode selected by the selection unit;
a request unit configured to request the external device to provide start-up notification for an application started in the external device, in response to connection by the connection unit;
a reception unit configured to receive the start-up notification through the connection unit; and
a control unit configured to control the selection unit so as to select an operation mode corresponding to the application identified by the start-up notification; and
an external device connected to the electronic device through the connection unit, wherein the external device includes:
a storage unit configured to store one or more applications,
a user input unit,
an execution unit configured to execute an application in response to an instruction to start up the application received through the user input unit, and
a start-up notification providing unit configured to provide start-up notification for the application started by the execution unit in response to the request from the request unit. 12. The system according to claim 11, wherein the external device further includes a display unit configured to display one or more icons for starting up the one or more applications, and
wherein at least one icon displayed on the input screen in the electronic device is identical with at least one of the icons displayed by the display unit. 13. The system according to claim 11, wherein the external device further includes a transmission unit configured to transmit audio data or video data obtained by the execution of the application to the electronic device through the connection unit when the execution unit executes the application, and
wherein the output unit in the electronic device is configured to output the audio data or video data received through the connection unit. 14. The system according to claim 11, wherein the external device is further configured to provide the electronic device with closing information indicating closing of the started application when the started application is closed. 15. A non-transitory computer-readable storage medium storing an operation-mode selection program executable by an electronic device connectable to an external device that stores one or more applications, the operation-mode selection program configured to direct the electronic device to perform:
a step of detecting connection to the external device; a step of requesting the external device to provide start-up notification for an application started in the external device; a step of selecting an operation mode corresponding to an application identified by the received start-up notification; and a step of executing the selected operation mode. 16. The non-transitory computer-readable storage medium according to claim 15, wherein in the step of requesting the external device to provide the start-up notification, identification information for an application that is able to be started in the electronic device is provided. 17. The non-transitory computer-readable storage medium according to claim 15, wherein the operation-mode selection program further comprises a determination step of determining whether switching to an operation mode corresponding to the application is feasible when the start-up notification is received,
wherein when it is determined in the determination step that the switching is feasible, the operation mode is switched. 18. The non-transitory computer-readable storage medium according to claim 15, wherein in the step of executing the operation mode, video data or audio data created by the application executed in the external device is received, and the received video data or audio data is output. 19. An operation-mode selection method for use in an electronic device connectable to an external device that stores one or more applications, the operation-mode selection method comprising:
a step of detecting connection to the external device; a step of requesting the external device to provide start-up notification for an application started in the external device; a step of selecting an operation mode corresponding to an application identified by the received start-up notification; and a step of executing the selected operation mode. 20. The operation-mode selection method according to claim 19, wherein in the step of requesting the external device to provide the start-up notification, identification information for an application that is able to be started in the electronic device is provided. | A vehicle-mounted electronic system includes a vehicle-mounted device and a mobile terminal connected to the vehicle-mounted device through a connection unit. The vehicle-mounted device includes a request unit configured to request the mobile terminal to provide start-up notification for an application stared in the mobile terminal, a reception unit configured to receive the start-up notification through the connection unit, and a control unit configured to control selection of an operation mode such that the operation mode corresponding to the application identified by the start-up notification is selected.1. An electronic device comprising:
a connection unit configured to enable connection between the electronic device and an external device that stores one or more applications; a selection unit configured to select at least one operation mode from among a plurality of operation modes; an output unit configured to output information on the basis of the operation mode selected by the selection unit; a request unit configured to request the external device to provide start-up notification for an application started in the external device, in response to connection by the connection unit; a reception unit configured to receive the start-up notification through the connection unit; and a control unit configured to control the selection unit so as to select an operation mode corresponding to the application identified by the start-up notification. 2. The electronic device according to claim 1, wherein the control unit includes a determination unit configured to determine whether switching of the operation mode is feasible, and wherein:
when the determination unit determines that the switching is feasible, the control unit is configured to cause the selection unit to change the operation mode, and when the determination unit determines that the switching is unfeasible, the control unit is configured not to cause the selection unit to change the operation mode. 3. The electronic device according to claim 1, wherein the selection unit includes an input screen on which the plurality of operation modes is selectable, and one or more icons for starting up one or more applications stored in the external device are displayed on the input screen, and
wherein when an icon on the input screen is selected by a user, the selection unit is configured to select the operation mode corresponding to the application associated with the icon. 4. The electronic device according to claim 3, wherein when the control unit receives the start-up notification, the control unit is configured to cause the selection unit to automatically select the icon corresponding to the application identified by the start-up notification. 5. The electronic device according to claim 3, wherein the request unit is configured to provide the external device with identification information for the applications associated with the icons displayed on the input screen. 6. The electronic device according to claim 1, further comprising a unit configured to receive closing information indicating closing of the application started in the external device,
wherein the control unit is configured to control the selection unit so as to select a last operation mode. 7. The electronic device according to claim 2, wherein when the output unit outputs emergency information or interruption information, the determination unit is configured to determine that the switching of the operation mode is unfeasible. 8. The electronic device according to claim 7, wherein when the determination unit determines that the switching of the operation mode is unfeasible, the control unit is configured to display a user input screen that prompts a user to determine whether the operation mode is to be switched. 9. The electronic device according to claim 1, wherein the output unit is configured to receive video data or audio data created by the application started in the external device through the connection unit and is configured to output the received video data or the audio data. 10. The electronic device according to claim 1, wherein the electronic device is mounted on a movable vehicle, and the external device is a mobile terminal connected to the electronic device in the vehicle. 11. A system comprising:
an electronic device comprising:
a connection unit configured to enable connection between the electronic device and an external device that stores one or more applications;
a selection unit configured to select at least one operation mode from among a plurality of operation modes;
an output unit configured to output information on the basis of the operation mode selected by the selection unit;
a request unit configured to request the external device to provide start-up notification for an application started in the external device, in response to connection by the connection unit;
a reception unit configured to receive the start-up notification through the connection unit; and
a control unit configured to control the selection unit so as to select an operation mode corresponding to the application identified by the start-up notification; and
an external device connected to the electronic device through the connection unit, wherein the external device includes:
a storage unit configured to store one or more applications,
a user input unit,
an execution unit configured to execute an application in response to an instruction to start up the application received through the user input unit, and
a start-up notification providing unit configured to provide start-up notification for the application started by the execution unit in response to the request from the request unit. 12. The system according to claim 11, wherein the external device further includes a display unit configured to display one or more icons for starting up the one or more applications, and
wherein at least one icon displayed on the input screen in the electronic device is identical with at least one of the icons displayed by the display unit. 13. The system according to claim 11, wherein the external device further includes a transmission unit configured to transmit audio data or video data obtained by the execution of the application to the electronic device through the connection unit when the execution unit executes the application, and
wherein the output unit in the electronic device is configured to output the audio data or video data received through the connection unit. 14. The system according to claim 11, wherein the external device is further configured to provide the electronic device with closing information indicating closing of the started application when the started application is closed. 15. A non-transitory computer-readable storage medium storing an operation-mode selection program executable by an electronic device connectable to an external device that stores one or more applications, the operation-mode selection program configured to direct the electronic device to perform:
a step of detecting connection to the external device; a step of requesting the external device to provide start-up notification for an application started in the external device; a step of selecting an operation mode corresponding to an application identified by the received start-up notification; and a step of executing the selected operation mode. 16. The non-transitory computer-readable storage medium according to claim 15, wherein in the step of requesting the external device to provide the start-up notification, identification information for an application that is able to be started in the electronic device is provided. 17. The non-transitory computer-readable storage medium according to claim 15, wherein the operation-mode selection program further comprises a determination step of determining whether switching to an operation mode corresponding to the application is feasible when the start-up notification is received,
wherein when it is determined in the determination step that the switching is feasible, the operation mode is switched. 18. The non-transitory computer-readable storage medium according to claim 15, wherein in the step of executing the operation mode, video data or audio data created by the application executed in the external device is received, and the received video data or audio data is output. 19. An operation-mode selection method for use in an electronic device connectable to an external device that stores one or more applications, the operation-mode selection method comprising:
a step of detecting connection to the external device; a step of requesting the external device to provide start-up notification for an application started in the external device; a step of selecting an operation mode corresponding to an application identified by the received start-up notification; and a step of executing the selected operation mode. 20. The operation-mode selection method according to claim 19, wherein in the step of requesting the external device to provide the start-up notification, identification information for an application that is able to be started in the electronic device is provided. | 2,100 |
5,415 | 5,415 | 15,083,666 | 2,142 | A dependency graph is created that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application. In response to selection of a first attribute of a plurality of attributes, the plurality of components are differentiated into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute. Dependencies among the first plurality of sets of components are determined based, at least in part, on the dependency graph. A first attribute based perspective of the application is determined, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components. | 1. A method comprising:
creating a dependency graph that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application; in response to selection of a first attribute of a plurality of attributes, differentiating the plurality of components into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute; determining dependencies among the first plurality of sets of components based, at least in part, on the dependency graph; and displaying a first attribute based perspective of the application, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components. 2. The method of claim 1 further comprising:
presenting, via a user interface, a graphical depiction of the dependency graph prior to selection of the first attribute, wherein the graphical depiction depicts the plurality of components and the dependencies,
wherein displaying comprises updating the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 3. The method of claim 1 further comprising determining the interactions among the plurality of components from at least one execution of the application. 4. The method of claim 1 further comprising:
in response to selection of a second attribute of the plurality of attributes, differentiating the plurality of components into a second plurality of sets of the plurality of components based, at least in part, on having values in common for the second attribute;
determining dependencies among the second plurality of sets of components based, at least in part, on the dependency graph; and
displaying a second attribute based perspective of the application, wherein the second attribute based perspective comprises a graphical container for each of the second plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the second plurality of sets components. 5. The method of claim 4 further comprising:
iteratively selecting each of a set of the plurality of attributes; and
storing each attribute based perspective displayed based on the iterative selections. 6. The method of claim 5,
wherein each graphical container includes any alerts associated with components contained in the graphical container, wherein each of the alerts provides a notification of at least one of an error and performance issue associated with a component, wherein the method comprises traversing through each attribute based perspective to identify at least one attribute based perspective that includes a minimum number of containers having alerts. 7. The method of claim 6 further comprising:
determining a responsible entity of components having the alerts; and
transmitting, to the responsible entity, notification of the alerts. 8. The method of claim 1, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. 9. One or more machine-readable storage media having program code stored therein, the program code comprising instructions to:
determine dependencies among a plurality of components for an application based, at least in part, on interactions among the plurality of components observed from at least one execution of the application; in response to selection of an attribute from a plurality of attributes associated with the plurality of components, determine components of the plurality of components that have values in common for the selected attribute; and graphically organize the plurality of components into graphical containers based, at least in part, on the determination of components with values in common for the selected attribute. 10. The one or more machine-readable storage media of claim 9, wherein the program code comprises instructions to:
present, via a user interface, a graphical depiction of a dependency graph that includes the dependencies among the plurality of components prior to selection of the attribute; and update the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 11. The one or more machine-readable storage media of claim 9, wherein the program code comprises instructions to determine the interactions among the plurality of components from at least one execution of the application. 12. The one or more machine-readable storage media of claim 9, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. 13. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
create a dependency graph that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application;
in response to selection of a first attribute of a plurality of attributes, differentiate the plurality of components into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute;
determine dependencies among the first plurality of sets of components based, at least in part, on the dependency graph; and
display a first attribute based perspective of the application, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components. 14. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to:
present, via a user interface, a graphical depiction of the dependency graph prior to selection of the first attribute, wherein the graphical depiction depicts the plurality of components and the dependencies, wherein the program code to cause the apparatus to display comprises program code to cause the apparatus to update the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 15. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to determine the interactions among the plurality of components from at least one execution of the application. 16. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to:
in response to selection of a second attribute of the plurality of attributes, differentiate the plurality of components into a second plurality of sets of the plurality of components based, at least in part, on having values in common for the second attribute; determine dependencies among the second plurality of sets of components based, at least in part, on the dependency graph; and display a second attribute based perspective of the application, wherein the second attribute based perspective comprises a graphical container for each of the second plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the second plurality of sets components. 17. The apparatus of claim 16, wherein the program code comprises program code to cause the apparatus to:
iteratively select each of a set of the plurality of attributes; and store each attribute based perspective displayed based on the iterative selections. 18. The apparatus of claim 17,
wherein each graphical container includes any alerts associated with components contained in the graphical container, wherein each of the alerts provides a notification of at least one of an error and performance issue associated with a component, wherein the program code comprises program code to cause the apparatus to traverse through each attribute based perspective to identify at least one attribute based perspective that includes a minimum number of containers having alerts. 19. The apparatus of claim 18, wherein the program code comprises program code to cause the apparatus to:
determine a responsible entity of components having the alerts; and transmit, to the responsible entity, notification of the alerts. 20. The apparatus of claim 13, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. | A dependency graph is created that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application. In response to selection of a first attribute of a plurality of attributes, the plurality of components are differentiated into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute. Dependencies among the first plurality of sets of components are determined based, at least in part, on the dependency graph. A first attribute based perspective of the application is determined, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components.1. A method comprising:
creating a dependency graph that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application; in response to selection of a first attribute of a plurality of attributes, differentiating the plurality of components into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute; determining dependencies among the first plurality of sets of components based, at least in part, on the dependency graph; and displaying a first attribute based perspective of the application, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components. 2. The method of claim 1 further comprising:
presenting, via a user interface, a graphical depiction of the dependency graph prior to selection of the first attribute, wherein the graphical depiction depicts the plurality of components and the dependencies,
wherein displaying comprises updating the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 3. The method of claim 1 further comprising determining the interactions among the plurality of components from at least one execution of the application. 4. The method of claim 1 further comprising:
in response to selection of a second attribute of the plurality of attributes, differentiating the plurality of components into a second plurality of sets of the plurality of components based, at least in part, on having values in common for the second attribute;
determining dependencies among the second plurality of sets of components based, at least in part, on the dependency graph; and
displaying a second attribute based perspective of the application, wherein the second attribute based perspective comprises a graphical container for each of the second plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the second plurality of sets components. 5. The method of claim 4 further comprising:
iteratively selecting each of a set of the plurality of attributes; and
storing each attribute based perspective displayed based on the iterative selections. 6. The method of claim 5,
wherein each graphical container includes any alerts associated with components contained in the graphical container, wherein each of the alerts provides a notification of at least one of an error and performance issue associated with a component, wherein the method comprises traversing through each attribute based perspective to identify at least one attribute based perspective that includes a minimum number of containers having alerts. 7. The method of claim 6 further comprising:
determining a responsible entity of components having the alerts; and
transmitting, to the responsible entity, notification of the alerts. 8. The method of claim 1, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. 9. One or more machine-readable storage media having program code stored therein, the program code comprising instructions to:
determine dependencies among a plurality of components for an application based, at least in part, on interactions among the plurality of components observed from at least one execution of the application; in response to selection of an attribute from a plurality of attributes associated with the plurality of components, determine components of the plurality of components that have values in common for the selected attribute; and graphically organize the plurality of components into graphical containers based, at least in part, on the determination of components with values in common for the selected attribute. 10. The one or more machine-readable storage media of claim 9, wherein the program code comprises instructions to:
present, via a user interface, a graphical depiction of a dependency graph that includes the dependencies among the plurality of components prior to selection of the attribute; and update the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 11. The one or more machine-readable storage media of claim 9, wherein the program code comprises instructions to determine the interactions among the plurality of components from at least one execution of the application. 12. The one or more machine-readable storage media of claim 9, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. 13. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
create a dependency graph that indicates dependencies among a plurality of components of an application based, at least in part, on interactions among the plurality of components determined from at least one execution of the application;
in response to selection of a first attribute of a plurality of attributes, differentiate the plurality of components into a first plurality of sets of the plurality of components based, at least in part, on having values in common for the first attribute;
determine dependencies among the first plurality of sets of components based, at least in part, on the dependency graph; and
display a first attribute based perspective of the application, wherein the first attribute based perspective comprises a graphical container for each of the first plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the first plurality of sets of components. 14. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to:
present, via a user interface, a graphical depiction of the dependency graph prior to selection of the first attribute, wherein the graphical depiction depicts the plurality of components and the dependencies, wherein the program code to cause the apparatus to display comprises program code to cause the apparatus to update the user interface to graphically rearrange the graphical depiction of the plurality of components to be within respective ones of the graphical containers. 15. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to determine the interactions among the plurality of components from at least one execution of the application. 16. The apparatus of claim 13, wherein the program code comprises program code to cause the apparatus to:
in response to selection of a second attribute of the plurality of attributes, differentiate the plurality of components into a second plurality of sets of the plurality of components based, at least in part, on having values in common for the second attribute; determine dependencies among the second plurality of sets of components based, at least in part, on the dependency graph; and display a second attribute based perspective of the application, wherein the second attribute based perspective comprises a graphical container for each of the second plurality of sets of components and graphical connections between the graphical containers corresponding to the dependencies among the second plurality of sets components. 17. The apparatus of claim 16, wherein the program code comprises program code to cause the apparatus to:
iteratively select each of a set of the plurality of attributes; and store each attribute based perspective displayed based on the iterative selections. 18. The apparatus of claim 17,
wherein each graphical container includes any alerts associated with components contained in the graphical container, wherein each of the alerts provides a notification of at least one of an error and performance issue associated with a component, wherein the program code comprises program code to cause the apparatus to traverse through each attribute based perspective to identify at least one attribute based perspective that includes a minimum number of containers having alerts. 19. The apparatus of claim 18, wherein the program code comprises program code to cause the apparatus to:
determine a responsible entity of components having the alerts; and transmit, to the responsible entity, notification of the alerts. 20. The apparatus of claim 13, wherein the plurality of attributes comprise at least one of an owner of the component and a geographic location where the component is being executed. | 2,100 |
5,416 | 5,416 | 15,596,164 | 2,176 | A plurality of annotations can be received for a presentation presented in a web conference. A respective relevance parameter can be assigned to each of the annotations. Each relevance parameter can indicate a relevance of a respective annotation to a portion of the presentation to which the annotation pertains. For each of the annotations, a decay model based on the respective relevance parameter can be generated. The decay model can indicate different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants. Each respective annotation can be presented with the presentation in accordance with the decay model generated for the respective annotation. | 1. A method comprising:
receiving a plurality of annotations for a presentation presented in a web conference; assigning to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating, using a processor, for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 2. The method of claim 1, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 3. The method of claim 1, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 4. The method of claim 1, further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 5. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 6. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 7. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. 8-20. (canceled) | A plurality of annotations can be received for a presentation presented in a web conference. A respective relevance parameter can be assigned to each of the annotations. Each relevance parameter can indicate a relevance of a respective annotation to a portion of the presentation to which the annotation pertains. For each of the annotations, a decay model based on the respective relevance parameter can be generated. The decay model can indicate different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants. Each respective annotation can be presented with the presentation in accordance with the decay model generated for the respective annotation.1. A method comprising:
receiving a plurality of annotations for a presentation presented in a web conference; assigning to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating, using a processor, for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 2. The method of claim 1, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 3. The method of claim 1, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 4. The method of claim 1, further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 5. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 6. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 7. The method of claim 1, further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. 8-20. (canceled) | 2,100 |
5,417 | 5,417 | 15,067,271 | 2,176 | A plurality of annotations can be received for a presentation presented in a web conference. A respective relevance parameter can be assigned to each of the annotations. Each relevance parameter can indicate a relevance of a respective annotation to a portion of the presentation to which the annotation pertains. For each of the annotations, a decay model based on the respective relevance parameter can be generated. The decay model can indicate different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants. Each respective annotation can be presented with the presentation in accordance with the decay model generated for the respective annotation. | 1-7. (canceled) 8. A system, comprising:
a processor programmed to initiate executable operations comprising: receiving a plurality of annotations for a presentation presented in a web conference; assigning to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 9. The system of claim 8, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 10. The system of claim 8, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 11. The system of claim 8, the executable operations further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 12. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 13. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 14. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of annotations for a presentation presented in a web conference; assigning, by the processor, to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating, by the processor, for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting, by the processor, each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 16. The computer program product of claim 15, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 17. The computer program product of claim 15, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 18. The computer program product of claim 15, the method further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 19. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 20. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 21. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. | A plurality of annotations can be received for a presentation presented in a web conference. A respective relevance parameter can be assigned to each of the annotations. Each relevance parameter can indicate a relevance of a respective annotation to a portion of the presentation to which the annotation pertains. For each of the annotations, a decay model based on the respective relevance parameter can be generated. The decay model can indicate different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants. Each respective annotation can be presented with the presentation in accordance with the decay model generated for the respective annotation.1-7. (canceled) 8. A system, comprising:
a processor programmed to initiate executable operations comprising: receiving a plurality of annotations for a presentation presented in a web conference; assigning to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 9. The system of claim 8, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 10. The system of claim 8, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 11. The system of claim 8, the executable operations further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 12. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 13. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 14. The system of claim 8, the executable operations further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of annotations for a presentation presented in a web conference; assigning, by the processor, to each of the plurality of annotations a respective relevance parameter, wherein each relevance parameter indicates a relevance of a respective one of the plurality of annotations to a portion of the presentation to which the annotation pertains; generating, by the processor, for each of the annotations, a decay model based on the respective relevance parameter, wherein the decay model indicates different durations of time the annotation is to be visible to different participants participating in the web conference based on respective expertise levels of the participants; and presenting, by the processor, each respective annotation with the presentation in accordance with the decay model generated for the respective annotation. 16. The computer program product of claim 15, wherein the decay model for each annotation further controls availability of the annotation to users who are not participants in the web conference, but who view the web conference. 17. The computer program product of claim 15, wherein at least one of the annotations is selectively made visible during the web conference to certain participants in the web conference based on the expertise levels of the certain participants. 18. The computer program product of claim 15, the method further comprising:
determining, for each of the plurality of annotations, a respective location where to place the annotation in a virtual white board used to present the presentation presented in the web conference, wherein determining the respective location is based on the respective relevance parameter assigned to the annotation. 19. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically persisting the identified annotation to the presentation. 20. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically updating the presentation to include in the presentation content contained in the annotation. 21. The computer program product of claim 15, the method further comprising:
identifying at least one annotation assigned a respective relevance parameter that exceeds a threshold value; and responsive to identifying the at least one annotation assigned a respective relevance parameter that exceeds the threshold value, automatically generating a notification to a presenter of the presentation indicating to the presenter that the presenter should consider updating the presentation to include in the presentation content of the annotation. | 2,100 |
5,418 | 5,418 | 14,034,866 | 2,185 | Systems and methods for managing interrupts generated by network interface controllers. An example method may comprise: responsive to determining that a memory pressure metric in a computer system does not exceed a threshold value, disabling interrupts that signal completion of a packet transmission by a network interface controller; transmitting a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, releasing a memory buffer allocated to a data packet of the plurality of data packets. | 1. A method, comprising:
responsive to determining, by a computer system, that a memory pressure metric in the computer system does not exceed a threshold value, disabling interrupts that signal completion of a packet transmission by a network interface controller; transmitting a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, releasing a memory buffer allocated to a data packet of the plurality of data packets. 2. The method of claim 1, further comprising determining that one or more data packets have been transmitted by the network interface controller, responsive to detecting that the memory pressure metric exceeds the threshold value. 3. The method of claim 1, further comprising:
responsive to detecting that the memory pressure metric exceeds the threshold value, enabling interrupts that signal completion of packet transmission by the network interface controller. 4. The method of claim 1, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 5. The method of claim 1, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 6. The method of claim 1, wherein the memory pressure metric comprises a period of time during which an application being executed by the computer system has been blocked by a memory allocation operation. 7. The method of claim 1, wherein the memory pressure metric comprises a page fault frequency. 8. A system comprising:
a memory; and one or more processors, coupled to the memory, to:
responsive to determining that a memory pressure metric in the computer system does not exceed a threshold value, disable interrupts that signal completion of a packet transmission by a network interface controller;
transmit a plurality of data packets by the network interface controller; and
responsive to detecting that the memory pressure metric exceeds the threshold value, release a memory buffer allocated to a data packet of the plurality of data packets. 9. The system of claim 8, wherein the processors are further to:
responsive to detecting that the memory pressure metric exceeds the threshold value, enable interrupts that signal completion of packet transmission by the network interface controller. 10. The system of claim 8, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 11. The system of claim 8, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 12. The system of claim 8, wherein the memory pressure metric comprises a period of time during which an application being executed by the system has been blocked by a memory allocation operation. 13. The system of claim 8, wherein the memory pressure metric comprises a page fault frequency. 14. The system of claim 8, wherein disabling interrupts is performed by writing a pre-defined value into one of: a network interface controller or an interrupt controller. 15. A computer-readable non-transitory storage medium comprising executable instructions that, when executed by a computer system, cause the computer system to:
responsive to determining, by a computer system, that a memory pressure metric in the computer system does not exceed a threshold value, disable interrupts that signal completion of a packet transmission by a network interface controller; transmit a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, release a memory buffer allocated to a data packet of the plurality of data packets. 16. The computer-readable non-transitory storage medium of claim 15, further comprising instructions that, when executed by a computer system, cause the computer system to:
responsive to detecting that the memory pressure metric exceeds the threshold value, enabling interrupts that signal completion of packet transmission by the network interface controller. 17. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 18. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 19. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a period of time during which an application being executed by the computer system has been blocked by a memory allocation operation. 20. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a page fault frequency. | Systems and methods for managing interrupts generated by network interface controllers. An example method may comprise: responsive to determining that a memory pressure metric in a computer system does not exceed a threshold value, disabling interrupts that signal completion of a packet transmission by a network interface controller; transmitting a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, releasing a memory buffer allocated to a data packet of the plurality of data packets.1. A method, comprising:
responsive to determining, by a computer system, that a memory pressure metric in the computer system does not exceed a threshold value, disabling interrupts that signal completion of a packet transmission by a network interface controller; transmitting a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, releasing a memory buffer allocated to a data packet of the plurality of data packets. 2. The method of claim 1, further comprising determining that one or more data packets have been transmitted by the network interface controller, responsive to detecting that the memory pressure metric exceeds the threshold value. 3. The method of claim 1, further comprising:
responsive to detecting that the memory pressure metric exceeds the threshold value, enabling interrupts that signal completion of packet transmission by the network interface controller. 4. The method of claim 1, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 5. The method of claim 1, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 6. The method of claim 1, wherein the memory pressure metric comprises a period of time during which an application being executed by the computer system has been blocked by a memory allocation operation. 7. The method of claim 1, wherein the memory pressure metric comprises a page fault frequency. 8. A system comprising:
a memory; and one or more processors, coupled to the memory, to:
responsive to determining that a memory pressure metric in the computer system does not exceed a threshold value, disable interrupts that signal completion of a packet transmission by a network interface controller;
transmit a plurality of data packets by the network interface controller; and
responsive to detecting that the memory pressure metric exceeds the threshold value, release a memory buffer allocated to a data packet of the plurality of data packets. 9. The system of claim 8, wherein the processors are further to:
responsive to detecting that the memory pressure metric exceeds the threshold value, enable interrupts that signal completion of packet transmission by the network interface controller. 10. The system of claim 8, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 11. The system of claim 8, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 12. The system of claim 8, wherein the memory pressure metric comprises a period of time during which an application being executed by the system has been blocked by a memory allocation operation. 13. The system of claim 8, wherein the memory pressure metric comprises a page fault frequency. 14. The system of claim 8, wherein disabling interrupts is performed by writing a pre-defined value into one of: a network interface controller or an interrupt controller. 15. A computer-readable non-transitory storage medium comprising executable instructions that, when executed by a computer system, cause the computer system to:
responsive to determining, by a computer system, that a memory pressure metric in the computer system does not exceed a threshold value, disable interrupts that signal completion of a packet transmission by a network interface controller; transmit a plurality of data packets by the network interface controller; and responsive to detecting that the memory pressure metric exceeds the threshold value, release a memory buffer allocated to a data packet of the plurality of data packets. 16. The computer-readable non-transitory storage medium of claim 15, further comprising instructions that, when executed by a computer system, cause the computer system to:
responsive to detecting that the memory pressure metric exceeds the threshold value, enabling interrupts that signal completion of packet transmission by the network interface controller. 17. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a total size of memory buffers allocated to the plurality of transmitted data packets. 18. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a difference between a pre-defined value and an amount of free memory in the computer system. 19. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a period of time during which an application being executed by the computer system has been blocked by a memory allocation operation. 20. The computer-readable non-transitory storage medium of claim 15, wherein the memory pressure metric comprises a page fault frequency. | 2,100 |
5,419 | 5,419 | 11,873,114 | 2,156 | A system and method for providing collaborative resources to a user. A search expression is received from a user. One more keywords are determined from the search expression. One or more resources are determined responsive to the keywords and based on information related to the user, and the at least one resource is provided to the user. The one or more resources may be determined responsive to and prioritized to at least one of, for example, information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the resource, a language preference of the user, or a keyword match confidence. The resource may include at least one person and presence information associated with the at least one person. | 1. A method for providing collaborative resources comprising:
receiving a search expression from a user; determining at least one keyword from the search expression; determining at least one resource responsive to the at least one keyword and responsive to information related to the user; and providing an indication of the at least one resource to the user. 2. The method according to claim 1, further comprising the indication of at least one resource comprising contact information for at least one person and providing presence information associated with the at least one person to the user. 3. The method according to claim 2, further comprising providing an indication of resources to the user comprising only the at least one person having active presence information. 4. The method according to claim 1, further comprising determining the at least one resource responsive to at least one of information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the at least one resource, a language preference of the user, or a keyword match confidence. 5. The method according to claim 1, further comprising determining the at least one resource responsive to at least one second keyword in information in email of the user. 6. The method according to claim 1, further comprising providing to the user the at least one resource responsive to at least one of information in email of the user, the organization of the user, the search history of the user, the organizational position of the user, the level of experience of the user, the geographical location of the user, the geographical location of the at least one resource, the language preference of the user. 7. The method according to claim 1, further comprising determining at least one resource comprising contact information and presence information for at least one person, the presence information comprising whether the at least one person is receptive to ad hoc requests. 8. The method according to claim 1, further comprising determining at least one resource comprising presence information for at least one person, the presence information comprising subjects the at least one person is receptive to receiving ad hoc requests for. 9. The method according to claim 1, further comprising determining at least one resource comprising contact information and presence information for at least one person. 10. The method according to claim 9, further comprising receiving an instant message from the user directed to the at least one resource. 11. The method according to claim 9, further comprising indicating whether a previous exchange during an instant message with the at least one person was satisfactory. 12. The method according to claim 11, further comprising sending instant messages by the user only to at least one persons having a record of satisfactory exchanges. 13. The method according to claim 1, further comprising extracting the at least one keyword from the search expression in a first subsystem, and determining the at least one resource from at least one of a network, the first subsystem or at least one second subsystem, the first subsystem and the at least one second subsystem being operatively connected to the network. 14. The method according to claim 1, further comprising receiving the search expression from the user at a network device, the network device determining the at least one keyword from the search expression, determining the at least one resource responsive to the at least one keyword and responsive to information related to the user, and providing the indication of the at least one resource to the user. 15. A method for providing collaborative resources comprising:
receiving a keyword and information related to a user; determining at least one resource responsive to the at least one keyword and responsive to the information related to the user; and providing contact information for at least one person and providing presence information associated with the at least one person to the user. 16. The method according to claim 15, further comprising determining the at least one resource responsive to at least one of information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the at least one resource, a language preference of the user, or a keyword match confidence. 17. The method according to claim 15, further comprising determining the at least one resource responsive to at least one second keyword in information in email of the user. 18. The method according to claim 15, further comprising the presence information comprising whether the at least one person is receptive to ad hoc requests. 19. The method according to claim 15, further comprising the presence information comprising subjects the at least one person is receptive to receiving ad hoc requests for. | A system and method for providing collaborative resources to a user. A search expression is received from a user. One more keywords are determined from the search expression. One or more resources are determined responsive to the keywords and based on information related to the user, and the at least one resource is provided to the user. The one or more resources may be determined responsive to and prioritized to at least one of, for example, information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the resource, a language preference of the user, or a keyword match confidence. The resource may include at least one person and presence information associated with the at least one person.1. A method for providing collaborative resources comprising:
receiving a search expression from a user; determining at least one keyword from the search expression; determining at least one resource responsive to the at least one keyword and responsive to information related to the user; and providing an indication of the at least one resource to the user. 2. The method according to claim 1, further comprising the indication of at least one resource comprising contact information for at least one person and providing presence information associated with the at least one person to the user. 3. The method according to claim 2, further comprising providing an indication of resources to the user comprising only the at least one person having active presence information. 4. The method according to claim 1, further comprising determining the at least one resource responsive to at least one of information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the at least one resource, a language preference of the user, or a keyword match confidence. 5. The method according to claim 1, further comprising determining the at least one resource responsive to at least one second keyword in information in email of the user. 6. The method according to claim 1, further comprising providing to the user the at least one resource responsive to at least one of information in email of the user, the organization of the user, the search history of the user, the organizational position of the user, the level of experience of the user, the geographical location of the user, the geographical location of the at least one resource, the language preference of the user. 7. The method according to claim 1, further comprising determining at least one resource comprising contact information and presence information for at least one person, the presence information comprising whether the at least one person is receptive to ad hoc requests. 8. The method according to claim 1, further comprising determining at least one resource comprising presence information for at least one person, the presence information comprising subjects the at least one person is receptive to receiving ad hoc requests for. 9. The method according to claim 1, further comprising determining at least one resource comprising contact information and presence information for at least one person. 10. The method according to claim 9, further comprising receiving an instant message from the user directed to the at least one resource. 11. The method according to claim 9, further comprising indicating whether a previous exchange during an instant message with the at least one person was satisfactory. 12. The method according to claim 11, further comprising sending instant messages by the user only to at least one persons having a record of satisfactory exchanges. 13. The method according to claim 1, further comprising extracting the at least one keyword from the search expression in a first subsystem, and determining the at least one resource from at least one of a network, the first subsystem or at least one second subsystem, the first subsystem and the at least one second subsystem being operatively connected to the network. 14. The method according to claim 1, further comprising receiving the search expression from the user at a network device, the network device determining the at least one keyword from the search expression, determining the at least one resource responsive to the at least one keyword and responsive to information related to the user, and providing the indication of the at least one resource to the user. 15. A method for providing collaborative resources comprising:
receiving a keyword and information related to a user; determining at least one resource responsive to the at least one keyword and responsive to the information related to the user; and providing contact information for at least one person and providing presence information associated with the at least one person to the user. 16. The method according to claim 15, further comprising determining the at least one resource responsive to at least one of information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the at least one resource, a language preference of the user, or a keyword match confidence. 17. The method according to claim 15, further comprising determining the at least one resource responsive to at least one second keyword in information in email of the user. 18. The method according to claim 15, further comprising the presence information comprising whether the at least one person is receptive to ad hoc requests. 19. The method according to claim 15, further comprising the presence information comprising subjects the at least one person is receptive to receiving ad hoc requests for. | 2,100 |
5,420 | 5,420 | 14,603,322 | 2,177 | A method includes displaying at least a first portion of a chart at a first magnification, the first portion containing a plurality of data marks. The method also includes detecting a first input at a location that corresponds to the first portion of the chart and, in response, zooming in to display a second portion of the chart at a second magnification, the second portion including a first data mark in the plurality of data marks. The method further includes detecting a second touch input at a location that corresponds to the second portion of the chart, and, in response: if one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion including the first data mark; and, if the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark. | 1. A method, comprising:
at an electronic device with a touch-sensitive surface and a display:
displaying at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks;
detecting a first touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the first portion of the chart;
in response to detecting the first touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zooming in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks;
while displaying the second portion of the chart at the second magnification, detecting a second touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the second portion of the chart; and,
in response to detecting the second touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark. 2. The method of claim 1, wherein the second touch input is a same type of touch input as the first touch input. 3. The method of claim 1, wherein the information about the first data mark comprises a data record that corresponds to the first data mark. 4. The method of claim 1, wherein the data-mark-information-display criteria include the second magnification being a predefined magnification. 5. The method of claim 1, wherein the data-mark-information-display criteria include the first data mark in the plurality of data marks being the only data mark displayed at the second magnification after the first touch input. 6. The method of claim 1, wherein the data-mark-information-display criteria include the first data mark reaching a predefined magnification during the second touch input. 7. The method of claim 1, wherein the data-mark-information-display criteria include the device zooming in to display only the first data mark in the plurality of data marks during the second touch input. 8. The method of claim 1, including, in accordance with the determination that one or more predefined data-mark-information-display criteria are met, ceasing to display the first data mark. 9. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; 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 at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks;
detecting a first touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the first portion of the chart;
in response to detecting the first touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zooming in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks;
while displaying the second portion of the chart at the second magnification, detecting a second touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the second portion of the chart; and,
in response to detecting the second touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark. 10. The device of claim 9, wherein the second touch input is a same type of touch input as the first touch input. 11. The device of claim 9, wherein the information about the first data mark comprises a data record that corresponds to the first data mark. 12. The device of claim 9, wherein the data-mark-information-display criteria include the second magnification being a predefined magnification. 13. The device of claim 9, wherein the data-mark-information-display criteria include the first data mark in the plurality of data marks being the only data mark displayed at the second magnification after the first touch input. 14. The device of claim 9, wherein the data-mark-information-display criteria include the first data mark reaching a predefined magnification during the second touch input. 15. The device of claim 9, wherein the data-mark-information-display criteria include the device zooming in to display only the first data mark in the plurality of data marks during the second touch input. 16. The device of claim 9, the one or more programs further including instructions for, in accordance with the determination that one or more predefined data-mark-information-display criteria are met, ceasing to display the first data mark. 17. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, and a touch-sensitive surface, cause the device to:
display at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks; in response to detecting a first touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zoom in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks; and, while displaying the second portion of the chart at the second magnification and in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zoom in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, display information about the first data mark. 18. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks; wherein:
a second portion of the chart is displayed by zooming in to a second magnification in response to detecting a first touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, the second portion of the chart including a first data mark in the plurality of data marks;
a third portion of the chart is displayed by zooming in to a third magnification in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart while displaying the second portion of the chart at the second magnification and in accordance with a determination that one or more predefined data-mark-information-display criteria are not met; wherein the third portion of the chart includes the first data mark in the plurality of data marks; and
information about the first data mark is displayed in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart while displaying the second portion of the chart at the second magnification and in accordance with a determination that one or more predefined data-mark-information-display criteria are met. | A method includes displaying at least a first portion of a chart at a first magnification, the first portion containing a plurality of data marks. The method also includes detecting a first input at a location that corresponds to the first portion of the chart and, in response, zooming in to display a second portion of the chart at a second magnification, the second portion including a first data mark in the plurality of data marks. The method further includes detecting a second touch input at a location that corresponds to the second portion of the chart, and, in response: if one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion including the first data mark; and, if the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark.1. A method, comprising:
at an electronic device with a touch-sensitive surface and a display:
displaying at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks;
detecting a first touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the first portion of the chart;
in response to detecting the first touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zooming in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks;
while displaying the second portion of the chart at the second magnification, detecting a second touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the second portion of the chart; and,
in response to detecting the second touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark. 2. The method of claim 1, wherein the second touch input is a same type of touch input as the first touch input. 3. The method of claim 1, wherein the information about the first data mark comprises a data record that corresponds to the first data mark. 4. The method of claim 1, wherein the data-mark-information-display criteria include the second magnification being a predefined magnification. 5. The method of claim 1, wherein the data-mark-information-display criteria include the first data mark in the plurality of data marks being the only data mark displayed at the second magnification after the first touch input. 6. The method of claim 1, wherein the data-mark-information-display criteria include the first data mark reaching a predefined magnification during the second touch input. 7. The method of claim 1, wherein the data-mark-information-display criteria include the device zooming in to display only the first data mark in the plurality of data marks during the second touch input. 8. The method of claim 1, including, in accordance with the determination that one or more predefined data-mark-information-display criteria are met, ceasing to display the first data mark. 9. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; 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 at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks;
detecting a first touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the first portion of the chart;
in response to detecting the first touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zooming in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks;
while displaying the second portion of the chart at the second magnification, detecting a second touch input at a location on the touch-sensitive surface that corresponds to a location on the display of the second portion of the chart; and,
in response to detecting the second touch input at the location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zooming in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, displaying information about the first data mark. 10. The device of claim 9, wherein the second touch input is a same type of touch input as the first touch input. 11. The device of claim 9, wherein the information about the first data mark comprises a data record that corresponds to the first data mark. 12. The device of claim 9, wherein the data-mark-information-display criteria include the second magnification being a predefined magnification. 13. The device of claim 9, wherein the data-mark-information-display criteria include the first data mark in the plurality of data marks being the only data mark displayed at the second magnification after the first touch input. 14. The device of claim 9, wherein the data-mark-information-display criteria include the first data mark reaching a predefined magnification during the second touch input. 15. The device of claim 9, wherein the data-mark-information-display criteria include the device zooming in to display only the first data mark in the plurality of data marks during the second touch input. 16. The device of claim 9, the one or more programs further including instructions for, in accordance with the determination that one or more predefined data-mark-information-display criteria are met, ceasing to display the first data mark. 17. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, and a touch-sensitive surface, cause the device to:
display at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks; in response to detecting a first touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, zoom in to display a second portion of the chart at a second magnification, the second portion of the chart including a first data mark in the plurality of data marks; and, while displaying the second portion of the chart at the second magnification and in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart:
in accordance with a determination that one or more predefined data-mark-information-display criteria are not met, zoom in to display a third portion of the chart at a third magnification, the third portion of the chart including the first data mark in the plurality of data marks; and,
in accordance with a determination that the one or more predefined data-mark-information-display criteria are met, display information about the first data mark. 18. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
at least a first portion of a chart on the display at a first magnification, the first portion of the chart containing a plurality of data marks; wherein:
a second portion of the chart is displayed by zooming in to a second magnification in response to detecting a first touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the first portion of the chart, the second portion of the chart including a first data mark in the plurality of data marks;
a third portion of the chart is displayed by zooming in to a third magnification in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart while displaying the second portion of the chart at the second magnification and in accordance with a determination that one or more predefined data-mark-information-display criteria are not met; wherein the third portion of the chart includes the first data mark in the plurality of data marks; and
information about the first data mark is displayed in response to detecting a second touch input at a location on the touch-sensitive surface that corresponds to the location on the display of the second portion of the chart while displaying the second portion of the chart at the second magnification and in accordance with a determination that one or more predefined data-mark-information-display criteria are met. | 2,100 |
5,421 | 5,421 | 14,462,264 | 2,194 | Methods of evaluating performance of simulated drilling operations may involve accepting characteristics of an earth formation. A drill path, a plurality of quality evaluation standards, and selection of a bottom hole assembly (BHA) and at least one earth-boring tool may be accepted. A drilling operation attempting to follow the drill path using the BHA and the drill bit may be simulated. Performance of the BHA and the drill bit in the drilling operation may be evaluated relative to the quality evaluation standards. At least one aspect of the simulated drilling operation may be changed, and simulation of the drilling operation, performance evaluation, and change of the aspects of the drilling operation may be iterated. Performance of each drilling operation may be compared to the other drilling operations, and an improved aspect of a drilling operation may be output relative to the comparative performance of the drilling operations. | 1. A method of selecting earth-boring tools for a drill string, comprising:
accepting at a processor information representing characteristics of an earth formation; accepting at the processor information defining a drill path extending into the earth formation; accepting at the processor a plurality of quality evaluation standards; accepting at the processor selection of a first bottom hole assembly (BHA) and a first drill bit; simulating at the processor a first drilling operation attempting to follow the drill path using the first BHA and the first drill bit; evaluating performance of the first BHA and the first drill bit in the first drilling operation relative to the quality evaluation standards; accepting at the processor selection of a second, different BHA, a second, different drill bit, or the second, different BHA and the second, different drill bit; simulating at the processor a second drilling operation attempting to follow the drill path using the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit; evaluating at the processor performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit in the second drilling operation relative to the quality evaluation standards; comparing at the processor performance of the first BHA and the first drill bit in the first drilling operation to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit in the second drilling operation; and outputting from the processor a BHA and drill bit combination to deploy in a drill string responsive to the comparative performance of the first BHA and the first drill bit to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit. 2. The method of claim 1, wherein accepting the plurality of quality evaluation standards comprises accepting a plurality of quality evaluation standards selected from a group comprising at least some of rate of penetration, total drilling time, total elapsed time, ratio of time spent rotating the entire drill string to time spent rotating only the first BHA, total tool wear, build up rate of the first BHA and the first drill bit, borehole wall smoothness, maximum variation in borehole diameter, number of directional corrections, maximum deviation from the drill path, and ability to drill an acceptable borehole through earth formations exhibiting different characteristics from the input characteristics of the earth formation. 3. The method of claim 1, further comprising accepting at the processor a prioritization of each quality evaluation standard relative to the other quality evaluation standards. 4. The method of claim 3, wherein outputting from the processor the BHA and drill bit combination to deploy in the drill string responsive to the comparative performance of the first BHA and the first drill bit to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit comprises assigning a weight to each quality evaluation standard based on the prioritization, multiplying each quality evaluation standard outcome by its associated weight, determining a composite evaluation value for the first BHA and the first drill bit and for the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit, and outputting the BHA and drill bit combination having the highest composite evaluation value. 5. The method of claim 1, further comprising accepting at the processor ranges for operating parameters to be used when simulating drilling through the earth formation along the drill path. 6. The method of claim 5, wherein accepting at the processor the ranges for the operating parameters comprises accepting ranges for operating parameters selected from a group comprising weight on bit (WOB), WOB when rotating an entire drill string, WOB when rotating only the first drill bit using the first BHA, torque, torque when rotating the entire drill string, torque when rotating only the first drill bit using the first BHA, flow rate of drilling fluid, side forces acting on the first BHA and the first drill bit, and orientation of the first drill bit. 7. The method of claim 5, wherein accepting at the processor the ranges for the operating parameters comprises generating at the processor the ranges for the operating parameters by accessing a database comprising operating parameters used for the same or similar BHAs and drill bits in the same or similar earth formations and selecting operating parameters corresponding to the most similar BHA, drill bit, and earth formation. 8. The method of claim 1, further comprising:
changing at least one of the characteristics of the earth formation, operating parameters used during the simulation, and the characteristics of the earth formation and the operating parameters used during the simulation; simulating at the processor another drilling operation attempting to follow the drill path using the first BHA and the first drill bit; evaluating performance of the first BHA and the first drill bit in the other drilling operation relative to the quality evaluation standards; comparing at the processor performance of the first BHA and the first drill bit in the first drilling operation to the performance of the first BHA and the first drill bit in the other drilling operation; and outputting from the processor a sequence of operating parameters to follow as a drilling plan responsive to the comparative performance of the first drilling operation to the other drilling operation. 9. The method of claim 1, wherein simulating the first drilling operation comprises automatically changing operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. 10. The method of claim 1, wherein accepting at the processor the selection of the first BHA and the first drill bit comprises accepting from a user input device selection of the first BHA and the first drill bit from a plurality of BHAs and a plurality of drill bits. 11. The method of claim 1, wherein accepting at the processor the selection of the first BHA and the first drill bit comprises automatically selecting at the processor the first BHA and the first drill bit from a plurality of BHAs and a plurality of drill bits. 12. The method of claim 1, wherein accepting at the processor the information representing the characteristics of the earth formation comprises extrapolating at the processor the information representing the characteristics of the earth formation from a database of known characteristics of geographically closest earth formations. 13. A method of improving a drilling operation, comprising:
accepting at a processor input from at least one sensor indicating characteristics of an earth formation being drilled by a BHA and a drill bit; accepting at the processor information defining a predetermined drill path extending into the earth formation; accepting at the processor selection of the BHA and the drill bit used to drill the earth formation; accepting at the processor input from at least one sensor indicating an actual drill path of the borehole being drilled in the earth formation; accepting at the processor input from at least one sensor indicating operating parameters employed when drilling the earth formation; accepting at the processor a plurality of quality evaluation standards; simulating at the processor a first drilling operation attempting to follow the drill path using the BHA and the drill bit and sensed operating parameters; evaluating performance of the BHA and the drill bit in the first drilling operation relative to the quality evaluation standards; simulating at the processor a second drilling operation attempting to follow the drill path using at least one simulated change in operating parameters from the sensed operating parameters; evaluating performance of the BHA and the drill bit in the second drilling operation relative to the quality evaluation standards; comparing at the processor performance of the BHA and first drill bit in the first drilling operation to the performance of the BHA and the drill bit in the second drilling operation; and outputting from the processor a change in one or more operating parameters to follow as a drilling plan responsive to the comparative evaluation of the first drilling operation to the second drilling operation. 14. The method of claim 13, wherein outputting from the processor the change in one or more operating parameters to follow as the drilling plan comprises outputting a sequence of operating parameters to change. 15. The method of claim 13, wherein outputting the one or more operating parameter to change comprises outputting at least one operating parameter selected from a group comprising weight on bit (WOB), WOB when rotating an entire drill string, WOB when rotating only the first drill bit using the first BHA, torque, torque when rotating the entire drill string, torque when rotating only the first drill bit using the first BHA, flow rate of drilling fluid, side forces acting on the first BHA and the first drill bit, and orientation of the first drill bit to change. 16. The method of claim 13, wherein simulating the second drilling operation comprises automatically changing operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. 17. A method of improving a plan for drilling a borehole in an earth formation, comprising:
accepting at a processor an input indicating characteristics of an earth formation; accepting at the processor information defining a drill path extending into the earth formation; accepting at the processor a plurality of quality evaluation standards; accepting at the processor selection of a BHA and a drill bit; determining using the processor a first sequence of operating parameters used during a first simulated drilling operation attempting to follow the drill path using the BHA and the drill bit; evaluating performance of the BHA and the drill bit in the first simulated drilling operation relative to the quality evaluation standards; determining using the processor a second, different sequence of operating parameters used during a second simulated drilling operation attempting to follow the drill path using the BHA and the drill bit; evaluating performance of the BHA and the drill bit in the second simulated drilling operation relative to the quality evaluation standards; comparing at the processor performance of the BHA and first drill bit in the first drilling operation to the performance of the BHA and the drill bit in the second drilling operation; and outputting from the processor a sequence of operating parameters to follow as a drilling plan based on the comparative evaluation of the first drilling operation to the second drilling operation. 18. The method of claim 17, further comprising accepting a prioritization of each quality evaluation standard relative to the other quality evaluation standards. 19. The method of claim 18, wherein outputting from the processor sequence of operating parameters to follow as a drilling plan based on the comparative evaluation of the first drilling operation to the second drilling operation comprises assigning a weight to each quality evaluation standard based on the prioritization, multiplying each quality evaluation standard outcome by its associated weight, determining a composite evaluation value for the first sequence of operation parameters and for the second sequence of operation parameters, and outputting the sequence of operation parameters having the highest composite evaluation value. 20. The method of claim 17, wherein determining the first sequence of operating parameters comprises automatically selecting operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. | Methods of evaluating performance of simulated drilling operations may involve accepting characteristics of an earth formation. A drill path, a plurality of quality evaluation standards, and selection of a bottom hole assembly (BHA) and at least one earth-boring tool may be accepted. A drilling operation attempting to follow the drill path using the BHA and the drill bit may be simulated. Performance of the BHA and the drill bit in the drilling operation may be evaluated relative to the quality evaluation standards. At least one aspect of the simulated drilling operation may be changed, and simulation of the drilling operation, performance evaluation, and change of the aspects of the drilling operation may be iterated. Performance of each drilling operation may be compared to the other drilling operations, and an improved aspect of a drilling operation may be output relative to the comparative performance of the drilling operations.1. A method of selecting earth-boring tools for a drill string, comprising:
accepting at a processor information representing characteristics of an earth formation; accepting at the processor information defining a drill path extending into the earth formation; accepting at the processor a plurality of quality evaluation standards; accepting at the processor selection of a first bottom hole assembly (BHA) and a first drill bit; simulating at the processor a first drilling operation attempting to follow the drill path using the first BHA and the first drill bit; evaluating performance of the first BHA and the first drill bit in the first drilling operation relative to the quality evaluation standards; accepting at the processor selection of a second, different BHA, a second, different drill bit, or the second, different BHA and the second, different drill bit; simulating at the processor a second drilling operation attempting to follow the drill path using the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit; evaluating at the processor performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit in the second drilling operation relative to the quality evaluation standards; comparing at the processor performance of the first BHA and the first drill bit in the first drilling operation to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit in the second drilling operation; and outputting from the processor a BHA and drill bit combination to deploy in a drill string responsive to the comparative performance of the first BHA and the first drill bit to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit. 2. The method of claim 1, wherein accepting the plurality of quality evaluation standards comprises accepting a plurality of quality evaluation standards selected from a group comprising at least some of rate of penetration, total drilling time, total elapsed time, ratio of time spent rotating the entire drill string to time spent rotating only the first BHA, total tool wear, build up rate of the first BHA and the first drill bit, borehole wall smoothness, maximum variation in borehole diameter, number of directional corrections, maximum deviation from the drill path, and ability to drill an acceptable borehole through earth formations exhibiting different characteristics from the input characteristics of the earth formation. 3. The method of claim 1, further comprising accepting at the processor a prioritization of each quality evaluation standard relative to the other quality evaluation standards. 4. The method of claim 3, wherein outputting from the processor the BHA and drill bit combination to deploy in the drill string responsive to the comparative performance of the first BHA and the first drill bit to the performance of the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit comprises assigning a weight to each quality evaluation standard based on the prioritization, multiplying each quality evaluation standard outcome by its associated weight, determining a composite evaluation value for the first BHA and the first drill bit and for the second BHA and the first drill bit, the first BHA and the second drill bit, or the second BHA and the second drill bit, and outputting the BHA and drill bit combination having the highest composite evaluation value. 5. The method of claim 1, further comprising accepting at the processor ranges for operating parameters to be used when simulating drilling through the earth formation along the drill path. 6. The method of claim 5, wherein accepting at the processor the ranges for the operating parameters comprises accepting ranges for operating parameters selected from a group comprising weight on bit (WOB), WOB when rotating an entire drill string, WOB when rotating only the first drill bit using the first BHA, torque, torque when rotating the entire drill string, torque when rotating only the first drill bit using the first BHA, flow rate of drilling fluid, side forces acting on the first BHA and the first drill bit, and orientation of the first drill bit. 7. The method of claim 5, wherein accepting at the processor the ranges for the operating parameters comprises generating at the processor the ranges for the operating parameters by accessing a database comprising operating parameters used for the same or similar BHAs and drill bits in the same or similar earth formations and selecting operating parameters corresponding to the most similar BHA, drill bit, and earth formation. 8. The method of claim 1, further comprising:
changing at least one of the characteristics of the earth formation, operating parameters used during the simulation, and the characteristics of the earth formation and the operating parameters used during the simulation; simulating at the processor another drilling operation attempting to follow the drill path using the first BHA and the first drill bit; evaluating performance of the first BHA and the first drill bit in the other drilling operation relative to the quality evaluation standards; comparing at the processor performance of the first BHA and the first drill bit in the first drilling operation to the performance of the first BHA and the first drill bit in the other drilling operation; and outputting from the processor a sequence of operating parameters to follow as a drilling plan responsive to the comparative performance of the first drilling operation to the other drilling operation. 9. The method of claim 1, wherein simulating the first drilling operation comprises automatically changing operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. 10. The method of claim 1, wherein accepting at the processor the selection of the first BHA and the first drill bit comprises accepting from a user input device selection of the first BHA and the first drill bit from a plurality of BHAs and a plurality of drill bits. 11. The method of claim 1, wherein accepting at the processor the selection of the first BHA and the first drill bit comprises automatically selecting at the processor the first BHA and the first drill bit from a plurality of BHAs and a plurality of drill bits. 12. The method of claim 1, wherein accepting at the processor the information representing the characteristics of the earth formation comprises extrapolating at the processor the information representing the characteristics of the earth formation from a database of known characteristics of geographically closest earth formations. 13. A method of improving a drilling operation, comprising:
accepting at a processor input from at least one sensor indicating characteristics of an earth formation being drilled by a BHA and a drill bit; accepting at the processor information defining a predetermined drill path extending into the earth formation; accepting at the processor selection of the BHA and the drill bit used to drill the earth formation; accepting at the processor input from at least one sensor indicating an actual drill path of the borehole being drilled in the earth formation; accepting at the processor input from at least one sensor indicating operating parameters employed when drilling the earth formation; accepting at the processor a plurality of quality evaluation standards; simulating at the processor a first drilling operation attempting to follow the drill path using the BHA and the drill bit and sensed operating parameters; evaluating performance of the BHA and the drill bit in the first drilling operation relative to the quality evaluation standards; simulating at the processor a second drilling operation attempting to follow the drill path using at least one simulated change in operating parameters from the sensed operating parameters; evaluating performance of the BHA and the drill bit in the second drilling operation relative to the quality evaluation standards; comparing at the processor performance of the BHA and first drill bit in the first drilling operation to the performance of the BHA and the drill bit in the second drilling operation; and outputting from the processor a change in one or more operating parameters to follow as a drilling plan responsive to the comparative evaluation of the first drilling operation to the second drilling operation. 14. The method of claim 13, wherein outputting from the processor the change in one or more operating parameters to follow as the drilling plan comprises outputting a sequence of operating parameters to change. 15. The method of claim 13, wherein outputting the one or more operating parameter to change comprises outputting at least one operating parameter selected from a group comprising weight on bit (WOB), WOB when rotating an entire drill string, WOB when rotating only the first drill bit using the first BHA, torque, torque when rotating the entire drill string, torque when rotating only the first drill bit using the first BHA, flow rate of drilling fluid, side forces acting on the first BHA and the first drill bit, and orientation of the first drill bit to change. 16. The method of claim 13, wherein simulating the second drilling operation comprises automatically changing operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. 17. A method of improving a plan for drilling a borehole in an earth formation, comprising:
accepting at a processor an input indicating characteristics of an earth formation; accepting at the processor information defining a drill path extending into the earth formation; accepting at the processor a plurality of quality evaluation standards; accepting at the processor selection of a BHA and a drill bit; determining using the processor a first sequence of operating parameters used during a first simulated drilling operation attempting to follow the drill path using the BHA and the drill bit; evaluating performance of the BHA and the drill bit in the first simulated drilling operation relative to the quality evaluation standards; determining using the processor a second, different sequence of operating parameters used during a second simulated drilling operation attempting to follow the drill path using the BHA and the drill bit; evaluating performance of the BHA and the drill bit in the second simulated drilling operation relative to the quality evaluation standards; comparing at the processor performance of the BHA and first drill bit in the first drilling operation to the performance of the BHA and the drill bit in the second drilling operation; and outputting from the processor a sequence of operating parameters to follow as a drilling plan based on the comparative evaluation of the first drilling operation to the second drilling operation. 18. The method of claim 17, further comprising accepting a prioritization of each quality evaluation standard relative to the other quality evaluation standards. 19. The method of claim 18, wherein outputting from the processor sequence of operating parameters to follow as a drilling plan based on the comparative evaluation of the first drilling operation to the second drilling operation comprises assigning a weight to each quality evaluation standard based on the prioritization, multiplying each quality evaluation standard outcome by its associated weight, determining a composite evaluation value for the first sequence of operation parameters and for the second sequence of operation parameters, and outputting the sequence of operation parameters having the highest composite evaluation value. 20. The method of claim 17, wherein determining the first sequence of operating parameters comprises automatically selecting operating parameters based on a database of strategies for changing operating parameters to correct for deviations from the drill path and recording each change. | 2,100 |
5,422 | 5,422 | 15,134,523 | 2,167 | Techniques for searching and providing geographical regions are described. The process searches and recommends points of interests based on a user-specified region. Points of interests include spatial objects (e.g., buildings, landmarks, rivers, parks) and their distributions in a geographical region. The process searches and recommends points of interests by partitioning a spatial map into grids to identify representative categories located in each of the grids. In response to the user-specified region, a set of geographical candidates containing the representative categories is retrieved. The process determines whether the user-specified region and the set of geographical candidates include similar or common representative categories and similar or common spatial distributions of the representative categories. Then the process provides the top ranked set of geographical candidates that have similar content information. | 1.-20. (canceled) 21. A method comprising:
identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 22. The method of claim 21, further comprising providing a visual representation of a spatial map from which the query region is identified. 23. The method of claim 21, further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 24. The method of claim 21, further comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 25. The method of claim 21, further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 26. The method of claim 25, wherein the determining comprises calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest. 27. The method of claim 25, wherein the determining comprises calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. 28. A system comprising:
one or more processors; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 29. The system of claim 28, the acts further comprising providing a visual representation of a spatial map from which the query region is identified. 30. The system of claim 28, the acts further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 31. The system of claim 28, the acts comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 32. The system of claim 28, the acts further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 33. The system of claim 32, wherein the determining comprises calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest. 34. The system of claim 32, wherein the determining comprises calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. 35. A computing device comprising:
one or more processors; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 36. The computing device of claim 35, the acts further comprising providing a visual representation of a spatial map from which the query region is identified. 37. The computing device of claim 35, the acts further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 38. The computing device of claim 35, the acts comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 39. The computing device of claim 35, the acts further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 40. The computing device of claim 39, wherein the determining comprises one or more of:
calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest; or calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. | Techniques for searching and providing geographical regions are described. The process searches and recommends points of interests based on a user-specified region. Points of interests include spatial objects (e.g., buildings, landmarks, rivers, parks) and their distributions in a geographical region. The process searches and recommends points of interests by partitioning a spatial map into grids to identify representative categories located in each of the grids. In response to the user-specified region, a set of geographical candidates containing the representative categories is retrieved. The process determines whether the user-specified region and the set of geographical candidates include similar or common representative categories and similar or common spatial distributions of the representative categories. Then the process provides the top ranked set of geographical candidates that have similar content information.1.-20. (canceled) 21. A method comprising:
identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 22. The method of claim 21, further comprising providing a visual representation of a spatial map from which the query region is identified. 23. The method of claim 21, further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 24. The method of claim 21, further comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 25. The method of claim 21, further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 26. The method of claim 25, wherein the determining comprises calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest. 27. The method of claim 25, wherein the determining comprises calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. 28. A system comprising:
one or more processors; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 29. The system of claim 28, the acts further comprising providing a visual representation of a spatial map from which the query region is identified. 30. The system of claim 28, the acts further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 31. The system of claim 28, the acts comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 32. The system of claim 28, the acts further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 33. The system of claim 32, wherein the determining comprises calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest. 34. The system of claim 32, wherein the determining comprises calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. 35. A computing device comprising:
one or more processors; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: identifying a query region having a first plurality of points of interests in one or more representative categories; searching for a plurality of geographical region candidates having a second plurality of points of interest and a distribution of the second plurality of points of interest in the one or more representative categories, the second plurality of points of interest and the distribution of the second plurality of points of interest being comparable to the first plurality of points of interest and a distribution of the first plurality of points of interest in the query region; and providing a predefined number of geographical region candidates of the plurality of geographical region candidates for presentation based at least in part in a result of the searching. 36. The computing device of claim 35, the acts further comprising providing a visual representation of a spatial map from which the query region is identified. 37. The computing device of claim 35, the acts further comprising determining the first plurality of points of interest in the one or more representative categories for the query region. 38. The computing device of claim 35, the acts comprising pruning a set of geographical regions to obtain the plurality of geographical region candidates. 39. The computing device of claim 35, the acts further comprising determining a similarity between the distribution of the first plurality of points of interest and the distribution of the second plurality of interest. 40. The computing device of claim 39, wherein the determining comprises one or more of:
calculating mutual distances between the first plurality of points of interest and the second plurality of points of interest; or calculating first distances of the first plurality of points of interest with respect to a plurality of reference points and second distance of the second plurality of points of interest with respect to the plurality of reference points. | 2,100 |
5,423 | 5,423 | 14,710,492 | 2,136 | A scalable software stack is disclosed. In particular, the present disclosure provides a system and a method directed at allocating logical ownership of memory locations in a shared storage device among two or more associated compute devices that have access to the storage device. The logical ownership allocation can minimize potential conflicts between two simultaneous accesses occurring within the same memory location of the storage device. | 1. A method for coordinating reading and writing processes among a plurality of processors sharing memory devices, the method comprising:
identifying, for each memory device, a corresponding number of computing devices capable of storing data to a particular memory device; creating, for each memory device, a corresponding number of subdivisions within the particular memory device, wherein the number of subdivisions is based on the number of computing devices capable of storing data to the particular memory device; and assigning, for each memory device, a unique subdivision within the particular memory device to each of the computing devices capable of storing data to that particular memory device, wherein the computing device assigned to the unique subdivision has the sole ability to manage data in the unique subdivision. 2. The method of claim 1, wherein computing device assigned to a particular unique subdivision performs the following steps:
receives a read request from a requesting computing device, the read request for requesting access to data stored in a particular memory location within the unique subdivision, wherein the requesting computing device performs a read operation corresponding to the read request to obtain the requested data stored in the particular memory location within the unique subdivision; and transmits a completion status when the data transmission for the requesting computing device is completed, wherein the completion status is transmitted to the requesting computing device. 3. The method of claim 1, wherein requesting computing device assigned to a unique subdivision performs a write operation, the write operation requesting to store data in a particular memory location within the unique subdivision of the memory device. 4. The method of claim 2, wherein computing devices not assigned to the particular unique subdivision performs the following steps:
initiates an initial read of data stored in the particular unique subdivision not assigned to the computing device; transmits to the computing device assigned to the particular unique subdivision a request for information regarding the data stored in the particular unique subdivision, wherein the information regarding the data includes current ownership of the data and status of the data; receives a completion status from the computing device assigned to the particular unique subdivision if the ownership assignment and status of the data is current. 5. The method of claim 4, further comprising:
receiving an indication from the computing device assigned to the particular unique subdivision that the data being read is no longer current, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to perform a re-read of this or another memory location to obtain the up-to-date version of data. 6. The method of claim 4, further comprising:
receiving an indication that the computing device assigned to the particular unique subdivision is no longer the current owner of the unique subdivision, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to re-evaluate ownership of the unique subdivision, re-requesting data about the particular unique subdivision from the re-evaluated owner of the unique subdivision, and re-reading of this or another memory location to obtain the up-to-date version of data. 7. The method of claim 2, wherein the receipt of the read request from the requesting computing device and the requesting computing device performance of the read operation corresponding to the read request is performed simultaneously. 8. The method of claim 1, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is static. 9. The method of claim 1, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is dynamic. 10. The method of claim 1, wherein a size of the unique subdivision assigned to a particular memory device is based on frequency of operation of a particular computing device with the particular memory device. 11. The method of claim 1, wherein the sole ability to manage data includes an ability to write into a memory location or modify data in the memory location. 12. A system for coordinating reading and writing processes among a plurality of processors sharing memory devices, the system comprising:
a plurality of memory devices, the memory devices including data stored in various memory locations; a plurality of computing devices, the computing devices for performing various operations with the memory devices, wherein each compute device includes memory and executes instructions stored in memory to:
identify, for each memory device, a corresponding number of computing devices capable of storing data to a particular memory device;
create, for each memory device, a corresponding number of subdivisions within the particular memory device, wherein the number of subdivisions is based on the number of computing devices capable of storing data to the particular memory device; and
assign, for each memory device, a unique subdivision within the particular memory device to each of the computing devices capable of storing data to that particular memory device, wherein the computing device assigned to the unique subdivision has the sole ability to manage data in the unique subdivision. 13. The system of claim 12, wherein each computing device assigned to a unique subdivision performs the following steps:
receives a read request from a requesting computing device, the read request for requesting access to data stored in a particular memory location within the unique subdivision, wherein the requesting computing device performs a read operation corresponding to the read request to obtain the requested data stored in the particular memory location within the unique subdivision; and transmits a completion status when the data transmission for the requesting computing device is completed, wherein the completion status is transmitted to the requesting computing device. 14. The system of claim 12, wherein requesting computing device assigned to a unique subdivision performs a write operation, the write operation requesting to store data in a particular memory location within the unique subdivision of the memory device. 15. The system of claim 13, wherein computing devices not assigned to the particular unique subdivision performs the following steps:
initiates an initial read of data stored in the particular unique subdivision not assigned to the computing device; transmits to the computing device assigned to the particular unique subdivision a request for information regarding the data stored in the particular unique subdivision, wherein the information regarding the data includes current ownership of the data and status of the data; receives a completion status from the computing device assigned to the particular unique subdivision if the ownership assignment and status of the data is current. 16. The system of claim 15, further comprising:
receiving an indication from the computing device assigned to the particular unique subdivision that the data being read is no longer current, wherein the indication is received either prior or during the transmission of the completion status; and transmits instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to perform a re-read of this or another memory location to obtain the up-to-date version of data. 17. The system of claim 15, further comprising:
receiving an indication that the computing device assigned to the particular unique subdivision is no longer the current owner of the unique subdivision, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to re-evaluate ownership of the unique subdivision, re-requesting data about the particular unique subdivision from the re-evaluated owner of the unique subdivision, and re-reading of this or another memory location to obtain the up-to-date version of data. 18. The system of claim 13, wherein the receipt of the read request from the requesting computing device and the requesting computing device performance of the read operation corresponding to the read request is performed simultaneously. 19. The system of claim 12, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is static. 20. The system of claim 12, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is dynamic. 21. The system of claim 12, wherein a size of the unique subdivision assigned to a particular memory device is based on frequency of operation of a particular computing device with the particular memory device. 22. The system of claim 12, wherein the sole ability to manage data includes an ability to write into a memory location or modify data in the memory location. | A scalable software stack is disclosed. In particular, the present disclosure provides a system and a method directed at allocating logical ownership of memory locations in a shared storage device among two or more associated compute devices that have access to the storage device. The logical ownership allocation can minimize potential conflicts between two simultaneous accesses occurring within the same memory location of the storage device.1. A method for coordinating reading and writing processes among a plurality of processors sharing memory devices, the method comprising:
identifying, for each memory device, a corresponding number of computing devices capable of storing data to a particular memory device; creating, for each memory device, a corresponding number of subdivisions within the particular memory device, wherein the number of subdivisions is based on the number of computing devices capable of storing data to the particular memory device; and assigning, for each memory device, a unique subdivision within the particular memory device to each of the computing devices capable of storing data to that particular memory device, wherein the computing device assigned to the unique subdivision has the sole ability to manage data in the unique subdivision. 2. The method of claim 1, wherein computing device assigned to a particular unique subdivision performs the following steps:
receives a read request from a requesting computing device, the read request for requesting access to data stored in a particular memory location within the unique subdivision, wherein the requesting computing device performs a read operation corresponding to the read request to obtain the requested data stored in the particular memory location within the unique subdivision; and transmits a completion status when the data transmission for the requesting computing device is completed, wherein the completion status is transmitted to the requesting computing device. 3. The method of claim 1, wherein requesting computing device assigned to a unique subdivision performs a write operation, the write operation requesting to store data in a particular memory location within the unique subdivision of the memory device. 4. The method of claim 2, wherein computing devices not assigned to the particular unique subdivision performs the following steps:
initiates an initial read of data stored in the particular unique subdivision not assigned to the computing device; transmits to the computing device assigned to the particular unique subdivision a request for information regarding the data stored in the particular unique subdivision, wherein the information regarding the data includes current ownership of the data and status of the data; receives a completion status from the computing device assigned to the particular unique subdivision if the ownership assignment and status of the data is current. 5. The method of claim 4, further comprising:
receiving an indication from the computing device assigned to the particular unique subdivision that the data being read is no longer current, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to perform a re-read of this or another memory location to obtain the up-to-date version of data. 6. The method of claim 4, further comprising:
receiving an indication that the computing device assigned to the particular unique subdivision is no longer the current owner of the unique subdivision, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to re-evaluate ownership of the unique subdivision, re-requesting data about the particular unique subdivision from the re-evaluated owner of the unique subdivision, and re-reading of this or another memory location to obtain the up-to-date version of data. 7. The method of claim 2, wherein the receipt of the read request from the requesting computing device and the requesting computing device performance of the read operation corresponding to the read request is performed simultaneously. 8. The method of claim 1, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is static. 9. The method of claim 1, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is dynamic. 10. The method of claim 1, wherein a size of the unique subdivision assigned to a particular memory device is based on frequency of operation of a particular computing device with the particular memory device. 11. The method of claim 1, wherein the sole ability to manage data includes an ability to write into a memory location or modify data in the memory location. 12. A system for coordinating reading and writing processes among a plurality of processors sharing memory devices, the system comprising:
a plurality of memory devices, the memory devices including data stored in various memory locations; a plurality of computing devices, the computing devices for performing various operations with the memory devices, wherein each compute device includes memory and executes instructions stored in memory to:
identify, for each memory device, a corresponding number of computing devices capable of storing data to a particular memory device;
create, for each memory device, a corresponding number of subdivisions within the particular memory device, wherein the number of subdivisions is based on the number of computing devices capable of storing data to the particular memory device; and
assign, for each memory device, a unique subdivision within the particular memory device to each of the computing devices capable of storing data to that particular memory device, wherein the computing device assigned to the unique subdivision has the sole ability to manage data in the unique subdivision. 13. The system of claim 12, wherein each computing device assigned to a unique subdivision performs the following steps:
receives a read request from a requesting computing device, the read request for requesting access to data stored in a particular memory location within the unique subdivision, wherein the requesting computing device performs a read operation corresponding to the read request to obtain the requested data stored in the particular memory location within the unique subdivision; and transmits a completion status when the data transmission for the requesting computing device is completed, wherein the completion status is transmitted to the requesting computing device. 14. The system of claim 12, wherein requesting computing device assigned to a unique subdivision performs a write operation, the write operation requesting to store data in a particular memory location within the unique subdivision of the memory device. 15. The system of claim 13, wherein computing devices not assigned to the particular unique subdivision performs the following steps:
initiates an initial read of data stored in the particular unique subdivision not assigned to the computing device; transmits to the computing device assigned to the particular unique subdivision a request for information regarding the data stored in the particular unique subdivision, wherein the information regarding the data includes current ownership of the data and status of the data; receives a completion status from the computing device assigned to the particular unique subdivision if the ownership assignment and status of the data is current. 16. The system of claim 15, further comprising:
receiving an indication from the computing device assigned to the particular unique subdivision that the data being read is no longer current, wherein the indication is received either prior or during the transmission of the completion status; and transmits instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to perform a re-read of this or another memory location to obtain the up-to-date version of data. 17. The system of claim 15, further comprising:
receiving an indication that the computing device assigned to the particular unique subdivision is no longer the current owner of the unique subdivision, wherein the indication is received either prior or during the transmission of the completion status; and transmitting instructions to the computing device not assigned to the particular unique subdivision performing the read process, wherein the instructions include directions to re-evaluate ownership of the unique subdivision, re-requesting data about the particular unique subdivision from the re-evaluated owner of the unique subdivision, and re-reading of this or another memory location to obtain the up-to-date version of data. 18. The system of claim 13, wherein the receipt of the read request from the requesting computing device and the requesting computing device performance of the read operation corresponding to the read request is performed simultaneously. 19. The system of claim 12, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is static. 20. The system of claim 12, wherein the assigning, for each memory device, the unique subdivision with the particular memory device to each of the computing devices that are connected to the particular memory device is dynamic. 21. The system of claim 12, wherein a size of the unique subdivision assigned to a particular memory device is based on frequency of operation of a particular computing device with the particular memory device. 22. The system of claim 12, wherein the sole ability to manage data includes an ability to write into a memory location or modify data in the memory location. | 2,100 |
5,424 | 5,424 | 14,998,222 | 2,181 | An embedded controller is provided for a computer, including a processor, first one or more logic elements providing a serial peripheral interface (SPI) module to communicatively couple the embedded controller to an SPI bus as an SPI slave, and second one or more logic elements providing a platform environment control interface (PECI)-over-SPI engine, to build an SPI packet providing an encapsulated PECI command and send a notification to an SPI master that the packet is available. | 1. An embedded controller for a computer, comprising:
a processor; first one or more logic elements comprising a serial peripheral interface (SPI) module to communicatively couple the embedded controller to an SPI bus as an SPI slave; second one or more logic elements comprising a platform environment control interface (PECI)-over-SPI engine, to:
build an SPI packet comprising an encapsulated PECI command; and
send a notification to an SPI master that the packet is available. 2. The embedded controller of claim 1, wherein the SPI bus is an enhanced SPI (eSPI) bus. 3. The embedded controller of claim 2, wherein the packet is an eSPI out-of-band (OOB) packet. 4. The embedded controller of claim 3, wherein the OOB packet comprises an eSPI header and a PECI OOB payload. 5. The embedded controller of claim 1, wherein the PECI-over-SPI engine is further to receive a PECI response via the SPI bus. 6. The embedded controller of claim 5, wherein the PECI response comprises an SPI header and a PECI response payload. 7. A platform controller hub (PCH), comprising:
a processor; an SPI network module to communicatively couple the PCH to a serial peripheral interface (SPI) bus as an SPI master; and a platform environment control interface (PECI)-over-SPI master engine to:
receive via the SPI bus a notification that an encapsulated PECI packet is ready on an SPI slave;
fetch the encapsulated PECI packet from the SPI slave via the SPI bus; and
send the encapsulated PECI packet to a processor via the SPI bus. 8. The platform controller hub of claim 7, wherein the PECI-over-Platform controller hub engine is further to:
receive a PECI response from the processor; and send the response packet to the SPI slave via the SPI bus. 9. The platform controller hub of claim 8, wherein the PECI-over-Platform controller hub engine is to reformat the response packet before forwarding it to the EC. 10. The platform controller hub of claim 9, wherein reformatting the packet comprises reformatting it into a format comprising an SPI header and an out-of-band PECI response payload. 11. The platform controller hub of claim 7, wherein the SPI bus is an enhanced SPI (eSPI) bus. 12. The platform controller hub of claim 11, wherein the encapsulated PECI packet is an eSPI out-of-band (OOB) packet. 13. The platform controller hub of claim 12, wherein the OOB packet comprises an SPI header and a PECI OOB payload. 14. At least one machine accessible storage medium having code stored thereon, the code when executed on a machine, causes the machine to:
communicatively couple an embedded controller to a serial peripheral bus (SPI) bus as an SPI slave; build an SPI packet comprising an encapsulated platform environment control interface (PECI) command; and send a notification to an SPI master that the packet is available. 15. The at least one machine accessible storage medium of claim 14, wherein the SPI bus is an enhanced SPI (eSPI) bus. 16. The at least one machine accessible storage medium of claim 15, wherein the packet is an eSPI out-of-band (OOB) packet. 17. The at least one machine accessible storage medium of claim 16, wherein the OOB packet comprises an eSPI header and a PECI OOB payload. 18. The at least one machine accessible storage medium of claim 14, wherein the code further instructs the machine to receive a PECI response via the SPI bus. 19. The at least one machine accessible storage medium of claim 18, wherein the PECI response comprises an SPI header and a PECI response payload. 20. At least one machine accessible storage medium having code stored thereon, the code when executed on a machine, causes the machine to:
communicatively couple a platform controller hub (PCH) to a serial peripheral interface (SPI) bus as an SPI master; receive via the SPI bus a notification that an encapsulated platform environment control interface (PECI) packet is ready on an SPI slave; fetch the encapsulated PECI packet from the SPI slave via the SPI bus; and send the encapsulated PECI packet to a processor via the SPI bus. 21. The at least one machine accessible storage mediums of claim 20, wherein the code further causes the machine to:
receive a PECI response from the processor; and send the response packet to the SPI slave via the SPI bus. 22. The at least one machine accessible storage mediums of claim 21, wherein the code further causes the machine to reformat the response packet before forwarding it to the EC. 23. The at least one machine accessible storage mediums of claim 22, wherein reformatting the packet comprises reformatting it into a format comprising an SPI header and an out-of-band PECI response payload. 24. The at least one machine accessible storage mediums of claim 20, wherein the SPI bus is an enhanced SPI (eSPI) bus. 25. The at least one machine accessible storage mediums of claim 24, wherein the encapsulated PECI packet is an eSPI out-of-band (OOB) packet. 26. The at least one machine accessible storage mediums of claim 25, wherein the OOB packet comprises an SPI header and a PECI OOB payload. | An embedded controller is provided for a computer, including a processor, first one or more logic elements providing a serial peripheral interface (SPI) module to communicatively couple the embedded controller to an SPI bus as an SPI slave, and second one or more logic elements providing a platform environment control interface (PECI)-over-SPI engine, to build an SPI packet providing an encapsulated PECI command and send a notification to an SPI master that the packet is available.1. An embedded controller for a computer, comprising:
a processor; first one or more logic elements comprising a serial peripheral interface (SPI) module to communicatively couple the embedded controller to an SPI bus as an SPI slave; second one or more logic elements comprising a platform environment control interface (PECI)-over-SPI engine, to:
build an SPI packet comprising an encapsulated PECI command; and
send a notification to an SPI master that the packet is available. 2. The embedded controller of claim 1, wherein the SPI bus is an enhanced SPI (eSPI) bus. 3. The embedded controller of claim 2, wherein the packet is an eSPI out-of-band (OOB) packet. 4. The embedded controller of claim 3, wherein the OOB packet comprises an eSPI header and a PECI OOB payload. 5. The embedded controller of claim 1, wherein the PECI-over-SPI engine is further to receive a PECI response via the SPI bus. 6. The embedded controller of claim 5, wherein the PECI response comprises an SPI header and a PECI response payload. 7. A platform controller hub (PCH), comprising:
a processor; an SPI network module to communicatively couple the PCH to a serial peripheral interface (SPI) bus as an SPI master; and a platform environment control interface (PECI)-over-SPI master engine to:
receive via the SPI bus a notification that an encapsulated PECI packet is ready on an SPI slave;
fetch the encapsulated PECI packet from the SPI slave via the SPI bus; and
send the encapsulated PECI packet to a processor via the SPI bus. 8. The platform controller hub of claim 7, wherein the PECI-over-Platform controller hub engine is further to:
receive a PECI response from the processor; and send the response packet to the SPI slave via the SPI bus. 9. The platform controller hub of claim 8, wherein the PECI-over-Platform controller hub engine is to reformat the response packet before forwarding it to the EC. 10. The platform controller hub of claim 9, wherein reformatting the packet comprises reformatting it into a format comprising an SPI header and an out-of-band PECI response payload. 11. The platform controller hub of claim 7, wherein the SPI bus is an enhanced SPI (eSPI) bus. 12. The platform controller hub of claim 11, wherein the encapsulated PECI packet is an eSPI out-of-band (OOB) packet. 13. The platform controller hub of claim 12, wherein the OOB packet comprises an SPI header and a PECI OOB payload. 14. At least one machine accessible storage medium having code stored thereon, the code when executed on a machine, causes the machine to:
communicatively couple an embedded controller to a serial peripheral bus (SPI) bus as an SPI slave; build an SPI packet comprising an encapsulated platform environment control interface (PECI) command; and send a notification to an SPI master that the packet is available. 15. The at least one machine accessible storage medium of claim 14, wherein the SPI bus is an enhanced SPI (eSPI) bus. 16. The at least one machine accessible storage medium of claim 15, wherein the packet is an eSPI out-of-band (OOB) packet. 17. The at least one machine accessible storage medium of claim 16, wherein the OOB packet comprises an eSPI header and a PECI OOB payload. 18. The at least one machine accessible storage medium of claim 14, wherein the code further instructs the machine to receive a PECI response via the SPI bus. 19. The at least one machine accessible storage medium of claim 18, wherein the PECI response comprises an SPI header and a PECI response payload. 20. At least one machine accessible storage medium having code stored thereon, the code when executed on a machine, causes the machine to:
communicatively couple a platform controller hub (PCH) to a serial peripheral interface (SPI) bus as an SPI master; receive via the SPI bus a notification that an encapsulated platform environment control interface (PECI) packet is ready on an SPI slave; fetch the encapsulated PECI packet from the SPI slave via the SPI bus; and send the encapsulated PECI packet to a processor via the SPI bus. 21. The at least one machine accessible storage mediums of claim 20, wherein the code further causes the machine to:
receive a PECI response from the processor; and send the response packet to the SPI slave via the SPI bus. 22. The at least one machine accessible storage mediums of claim 21, wherein the code further causes the machine to reformat the response packet before forwarding it to the EC. 23. The at least one machine accessible storage mediums of claim 22, wherein reformatting the packet comprises reformatting it into a format comprising an SPI header and an out-of-band PECI response payload. 24. The at least one machine accessible storage mediums of claim 20, wherein the SPI bus is an enhanced SPI (eSPI) bus. 25. The at least one machine accessible storage mediums of claim 24, wherein the encapsulated PECI packet is an eSPI out-of-band (OOB) packet. 26. The at least one machine accessible storage mediums of claim 25, wherein the OOB packet comprises an SPI header and a PECI OOB payload. | 2,100 |
5,425 | 5,425 | 15,421,816 | 2,177 | At step ST 2 , an assign key changing item is selected from menu items. At step ST 3 , an assign key to which a function is assigned is selected. At step ST 4 , a function to be assigned is selected. The selected function is assigned to the selected assign key. At step ST 5 , a setting result indication screen appears. When one of two paired functions is assigned, a message which prompts a user to assign the other function. After the message has appeared for a predetermined time, the latest assigned states appear. At step ST 6 , the latest assign key information is stored to a non-volatile memory. To quit an assigning process, a menu button 8 is pressed and the menu is closed (at step ST 8 ). | 1. An image processing apparatus, comprising:
signal processing circuitry configured to:
process an image signal output from an imager, and
cause a display device to display an image based on the processed image signal; and
control circuitry configured, in response to an input at a key device, to:
assign a first function to a first operation key of the key device, and
automatically assign a second function to a second operation key of the key device, the first function and the second function being paired functions. 2. The image processing apparatus according to claim 1, wherein the signal processing circuitry is configured to cause the display device to display a menu. 3. The image processing apparatus according to claim 2, wherein the signal processing circuitry is configured to cause the display device to display the image and the menu simultaneously. 4. The image processing apparatus according to claim 2, wherein the signal processing circuitry is configured to cause the display device to display the image and the menu alternately. 5. The image processing apparatus according to claim 2, wherein the key device includes the first operation key, the second operation key, and a menu key. 6. The image processing apparatus according to claim 5, wherein the signal processing circuitry is configured to cause the display device to display the menu in response to an input at the menu key. 7. The image processing apparatus according to claim 2, wherein the menu includes a first menu item for assigning an assignable function to a part of the key device. 8. The image processing apparatus according to claim 7, wherein the menu includes a second menu item related to processing the image signal. 9. The image processing apparatus according to claim 8, wherein the second menu item is related to a sharpness of the image. 10. The image processing apparatus according to claim 8, wherein the second menu item is related to a gain level of the image. 11. The image processing apparatus according to claim 1, wherein the image processing circuitry is configured to cause the display device to display a first assigned state of the first operation key and a second assigned state of the second operation key. 12. The image processing apparatus according to claim 1, wherein the control circuitry is configured to assign a plurality of functions to the first operation key, the plurality of functions including at least a record starting function. 13. The image processing apparatus according to claim 1, wherein the first function and the second function are related to a field of view. 14. The image processing apparatus according to claim 1, wherein the first function and the second function are related to an increase and a decrease, respectively, in an image parameter. 15. The image processing apparatus according to claim 1, wherein the key device includes three operation keys. 16. The image processing apparatus according to claim 15, wherein the operation keys are the first operation key, the second operation key, and a dial key. 17. The image processing apparatus according to claim 16, wherein the dial key is pushable for accepting a selection input. 18. The image processing apparatus according to claim 16, wherein the dial key is rotatable for changing a selection input. 19. The image processing apparatus according to claim 1, wherein the key device includes a ring that controls a camera operation, and the first operation key and the second operation key are disposed adjacent the ring. 20. The image processing apparatus according to claim 19, wherein the camera operation is a zoom. 21. The image processing apparatus according to claim 19, wherein the first operation key and the second operation key are disposed along a plane, and an axis of the plane is parallel to a rotation axis of the ring. 22. The image processing apparatus according to claim 1, wherein the first operation key and the second operation key are hard keys. 23. The image processing apparatus according to claim 22, wherein at least one of the first operation key and the second operation key is a pushbutton key. 24. An image processing method, comprising:
processing an image signal output from an imager; causing a display device to display an image based on the processed image signal; and in response to an input at a key device:
assigning a first function to a first operation key of the key device, and
automatically assigning a second function to a second operation key of the key device, the first function and the second function being paired functions. 25. The image processing method according to claim 24, wherein the first and second functions are related to a field of view. 26. The image processing method according to claim 24, further comprising causing the display device to display a first assigned state of the first operation key and a second assigned state of the second operation key. 27. An image processing method, comprising:
processing an image signal output from an imager; causing a display device to display an image based on the processed image signal; in response to a first input at a menu key of a key device, causing the display device to display a menu and the image simultaneously; and in response to a second input at the key device:
assigning a first function to a first operation key of the key device, the first function being related to an image setting, and
automatically assigning a second function to a second operation key of the key device, the first function and the second function being paired functions. 28. An imaging system, comprising:
an imager configured to output an image signal; and circuitry configured to:
process an image signal output from an imager,
cause a display device to display an image based on the processed image signal,
in response to an input at a key device:
assign a first function to a first operation key of the key device, and
automatically assign a second function to a second operation key of the key device, the first function and the second function being paired functions,
cause the first function to be performed in response to an input at the first operation key, and
cause the second function to be performed in response to an input at the second operation key. | At step ST 2 , an assign key changing item is selected from menu items. At step ST 3 , an assign key to which a function is assigned is selected. At step ST 4 , a function to be assigned is selected. The selected function is assigned to the selected assign key. At step ST 5 , a setting result indication screen appears. When one of two paired functions is assigned, a message which prompts a user to assign the other function. After the message has appeared for a predetermined time, the latest assigned states appear. At step ST 6 , the latest assign key information is stored to a non-volatile memory. To quit an assigning process, a menu button 8 is pressed and the menu is closed (at step ST 8 ).1. An image processing apparatus, comprising:
signal processing circuitry configured to:
process an image signal output from an imager, and
cause a display device to display an image based on the processed image signal; and
control circuitry configured, in response to an input at a key device, to:
assign a first function to a first operation key of the key device, and
automatically assign a second function to a second operation key of the key device, the first function and the second function being paired functions. 2. The image processing apparatus according to claim 1, wherein the signal processing circuitry is configured to cause the display device to display a menu. 3. The image processing apparatus according to claim 2, wherein the signal processing circuitry is configured to cause the display device to display the image and the menu simultaneously. 4. The image processing apparatus according to claim 2, wherein the signal processing circuitry is configured to cause the display device to display the image and the menu alternately. 5. The image processing apparatus according to claim 2, wherein the key device includes the first operation key, the second operation key, and a menu key. 6. The image processing apparatus according to claim 5, wherein the signal processing circuitry is configured to cause the display device to display the menu in response to an input at the menu key. 7. The image processing apparatus according to claim 2, wherein the menu includes a first menu item for assigning an assignable function to a part of the key device. 8. The image processing apparatus according to claim 7, wherein the menu includes a second menu item related to processing the image signal. 9. The image processing apparatus according to claim 8, wherein the second menu item is related to a sharpness of the image. 10. The image processing apparatus according to claim 8, wherein the second menu item is related to a gain level of the image. 11. The image processing apparatus according to claim 1, wherein the image processing circuitry is configured to cause the display device to display a first assigned state of the first operation key and a second assigned state of the second operation key. 12. The image processing apparatus according to claim 1, wherein the control circuitry is configured to assign a plurality of functions to the first operation key, the plurality of functions including at least a record starting function. 13. The image processing apparatus according to claim 1, wherein the first function and the second function are related to a field of view. 14. The image processing apparatus according to claim 1, wherein the first function and the second function are related to an increase and a decrease, respectively, in an image parameter. 15. The image processing apparatus according to claim 1, wherein the key device includes three operation keys. 16. The image processing apparatus according to claim 15, wherein the operation keys are the first operation key, the second operation key, and a dial key. 17. The image processing apparatus according to claim 16, wherein the dial key is pushable for accepting a selection input. 18. The image processing apparatus according to claim 16, wherein the dial key is rotatable for changing a selection input. 19. The image processing apparatus according to claim 1, wherein the key device includes a ring that controls a camera operation, and the first operation key and the second operation key are disposed adjacent the ring. 20. The image processing apparatus according to claim 19, wherein the camera operation is a zoom. 21. The image processing apparatus according to claim 19, wherein the first operation key and the second operation key are disposed along a plane, and an axis of the plane is parallel to a rotation axis of the ring. 22. The image processing apparatus according to claim 1, wherein the first operation key and the second operation key are hard keys. 23. The image processing apparatus according to claim 22, wherein at least one of the first operation key and the second operation key is a pushbutton key. 24. An image processing method, comprising:
processing an image signal output from an imager; causing a display device to display an image based on the processed image signal; and in response to an input at a key device:
assigning a first function to a first operation key of the key device, and
automatically assigning a second function to a second operation key of the key device, the first function and the second function being paired functions. 25. The image processing method according to claim 24, wherein the first and second functions are related to a field of view. 26. The image processing method according to claim 24, further comprising causing the display device to display a first assigned state of the first operation key and a second assigned state of the second operation key. 27. An image processing method, comprising:
processing an image signal output from an imager; causing a display device to display an image based on the processed image signal; in response to a first input at a menu key of a key device, causing the display device to display a menu and the image simultaneously; and in response to a second input at the key device:
assigning a first function to a first operation key of the key device, the first function being related to an image setting, and
automatically assigning a second function to a second operation key of the key device, the first function and the second function being paired functions. 28. An imaging system, comprising:
an imager configured to output an image signal; and circuitry configured to:
process an image signal output from an imager,
cause a display device to display an image based on the processed image signal,
in response to an input at a key device:
assign a first function to a first operation key of the key device, and
automatically assign a second function to a second operation key of the key device, the first function and the second function being paired functions,
cause the first function to be performed in response to an input at the first operation key, and
cause the second function to be performed in response to an input at the second operation key. | 2,100 |
5,426 | 5,426 | 14,271,812 | 2,193 | Dynamic load balancing of hardware threads in clustered processor cores using shared hardware resources, and related circuits, methods, and computer readable media are disclosed. In one aspect, a dynamic load balancing circuit comprising a control unit is provided. The control unit is configured to determine whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core. If a suboptimal load condition exists, the control unit is further configured to transfer a content of private register(s) of a first hardware thread of the first cluster to private register(s) of a second hardware thread of the second cluster via shared hardware resources of the first hardware thread and the second hardware thread. The control unit is also configured to exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. | 1. A dynamic load balancing circuit, comprising
a control unit communicatively coupled to a first cluster and a second cluster of a clustered processor core; the control unit configured to:
determine whether a suboptimal load condition exists between the first cluster and the second cluster; and
responsive to determining that the suboptimal load condition exists:
transfer a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 2. The dynamic load balancing circuit of claim 1, wherein the shared hardware resources comprise an execution unit or a cache, or combinations thereof. 3. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting an underutilization of the second cluster. 4. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting a potential reduction in energy consumption of the clustered processor core. 5. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 6. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster by transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 7. The dynamic load balancing circuit of claim 6, wherein:
the one or more control registers comprise the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread; the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. 8. The dynamic load balancing circuit of claim 1 integrated into an integrated circuit. 9. The dynamic load balancing circuit of claim 1 integrated into a device selected from the group consisting of a set top box, an entertainment unit, a navigation device, a communications device, a fixed location data unit, a mobile location data unit, a mobile phone, a cellular phone, a computer, a portable computer, a desktop computer, a personal digital assistant (PDA), a monitor, a computer monitor, a television, a tuner, a radio, a satellite radio, a music player, a digital music player, a portable music player, a digital video player, a video player, a digital video disc (DVD) player, and a portable digital video player. 10. A dynamic load balancing circuit for providing dynamic load balancing of hardware threads in clustered processor cores, comprising:
a means for determining whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; a means for, responsive to determining that the suboptimal load condition exists, transferring a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and a means for, responsive to determining that the suboptimal load condition exists, exchanging a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 11. A method for providing dynamic load balancing of hardware threads in clustered processor cores, comprising:
determining whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; and responsive to determining that the suboptimal load condition exists:
transferring a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchanging a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 12. The method of claim 11, wherein the shared hardware resources comprise an execution unit or a cache, or combinations thereof. 13. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster comprises detecting an underutilization of the second cluster. 14. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster comprises detecting a potential reduction in energy consumption of the clustered processor core. 15. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster is based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 16. The method of claim 11, wherein transferring the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster comprises transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 17. The method of claim 16, wherein:
the one or more control registers comprise the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread; the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. 18. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed, cause a processor to:
determine whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; and responsive to determining that the suboptimal load condition exists:
transfer a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 19. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to:
transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster via an execution unit or a cache, or combinations thereof; and
exchange the first identifier associated with the first hardware thread with the second identifier associated with the second hardware thread via the execution unit or the cache, or combinations thereof. 20. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting an underutilization of the second cluster. 21. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting a potential reduction in energy consumption of the clustered processor core. 22. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 23. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster by transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 24. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions to cause the processor to transfer the content of the one or more control registers comprising the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread;
wherein:
the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and
the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. | Dynamic load balancing of hardware threads in clustered processor cores using shared hardware resources, and related circuits, methods, and computer readable media are disclosed. In one aspect, a dynamic load balancing circuit comprising a control unit is provided. The control unit is configured to determine whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core. If a suboptimal load condition exists, the control unit is further configured to transfer a content of private register(s) of a first hardware thread of the first cluster to private register(s) of a second hardware thread of the second cluster via shared hardware resources of the first hardware thread and the second hardware thread. The control unit is also configured to exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources.1. A dynamic load balancing circuit, comprising
a control unit communicatively coupled to a first cluster and a second cluster of a clustered processor core; the control unit configured to:
determine whether a suboptimal load condition exists between the first cluster and the second cluster; and
responsive to determining that the suboptimal load condition exists:
transfer a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 2. The dynamic load balancing circuit of claim 1, wherein the shared hardware resources comprise an execution unit or a cache, or combinations thereof. 3. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting an underutilization of the second cluster. 4. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting a potential reduction in energy consumption of the clustered processor core. 5. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to determine whether the suboptimal load condition exists between the first cluster and the second cluster based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 6. The dynamic load balancing circuit of claim 1, wherein the control unit is configured to transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster by transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 7. The dynamic load balancing circuit of claim 6, wherein:
the one or more control registers comprise the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread; the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. 8. The dynamic load balancing circuit of claim 1 integrated into an integrated circuit. 9. The dynamic load balancing circuit of claim 1 integrated into a device selected from the group consisting of a set top box, an entertainment unit, a navigation device, a communications device, a fixed location data unit, a mobile location data unit, a mobile phone, a cellular phone, a computer, a portable computer, a desktop computer, a personal digital assistant (PDA), a monitor, a computer monitor, a television, a tuner, a radio, a satellite radio, a music player, a digital music player, a portable music player, a digital video player, a video player, a digital video disc (DVD) player, and a portable digital video player. 10. A dynamic load balancing circuit for providing dynamic load balancing of hardware threads in clustered processor cores, comprising:
a means for determining whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; a means for, responsive to determining that the suboptimal load condition exists, transferring a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and a means for, responsive to determining that the suboptimal load condition exists, exchanging a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 11. A method for providing dynamic load balancing of hardware threads in clustered processor cores, comprising:
determining whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; and responsive to determining that the suboptimal load condition exists:
transferring a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchanging a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 12. The method of claim 11, wherein the shared hardware resources comprise an execution unit or a cache, or combinations thereof. 13. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster comprises detecting an underutilization of the second cluster. 14. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster comprises detecting a potential reduction in energy consumption of the clustered processor core. 15. The method of claim 11, wherein determining whether the suboptimal load condition exists between the first cluster and the second cluster is based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 16. The method of claim 11, wherein transferring the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster comprises transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 17. The method of claim 16, wherein:
the one or more control registers comprise the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread; the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. 18. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed, cause a processor to:
determine whether a suboptimal load condition exists between a first cluster and a second cluster of a clustered processor core; and responsive to determining that the suboptimal load condition exists:
transfer a content of one or more private registers of a first hardware thread of the first cluster to one or more private registers of a second hardware thread of the second cluster via shared hardware resources communicatively coupled to the first hardware thread and the second hardware thread; and
exchange a first identifier associated with the first hardware thread with a second identifier associated with the second hardware thread via the shared hardware resources. 19. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to:
transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster via an execution unit or a cache, or combinations thereof; and
exchange the first identifier associated with the first hardware thread with the second identifier associated with the second hardware thread via the execution unit or the cache, or combinations thereof. 20. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting an underutilization of the second cluster. 21. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster by detecting a potential reduction in energy consumption of the clustered processor core. 22. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to determine whether the suboptimal load condition exists between the first cluster and the second cluster based on load data indicating one or more of processor utilization, utilization of shared cluster resources, a number of executing processes, or power consumption by the first cluster and the second cluster. 23. The non-transitory computer-readable medium of claim 18 having stored thereon computer-executable instructions to cause the processor to transfer the content of the one or more private registers of the first hardware thread of the first cluster to the one or more private registers of the second hardware thread of the second cluster by transferring a content of one or more General Purpose Registers (GPRs) or a content of one or more control registers, or combinations thereof. 24. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions to cause the processor to transfer the content of the one or more control registers comprising the first identifier associated with the first hardware thread and the second identifier associated with the second hardware thread;
wherein:
the first identifier associated with the first hardware thread maps a first software thread to the first hardware thread; and
the second identifier associated with the second hardware thread maps a second software thread to the second hardware thread. | 2,100 |
5,427 | 5,427 | 14,055,530 | 2,165 | Utilizing social information for recommending an application includes providing an application recommendation system based on social characterizations, and responsive to a user searching for an application meeting a criteria, utilizing the application recommendation system by searching for applications meeting the criteria, characterizing the applications according to a social proximity factor to the user, and presenting the applications ordered by the social proximity factor. | 1. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: searching for applications meeting said criteria; characterizing said applications according to a social proximity factor to said user; and presenting said applications ordered by said social proximity factor. 2. The method of claim 1, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof. 3. The method of claim 1, further comprising presenting an alternative recommendation responsive to identifying problems with said applications. 4. The method of claim 3, wherein said alternative recommendation is based on similarities to said applications. 5. The method of claim 3, wherein said alternative recommendation is from an expertise group. 6. The method of claim 1, further comprising annotating said applications by said social proximity factor. 7. The method of claim 6, wherein said annotating said applications includes annotating an icon of a group making a recommendation regarding said applications. 8. The method of claim 7, further comprising providing additional information about said applications from said group. 9. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: searching for applications meeting said criteria; characterizing said applications according to a social proximity factor to said user wherein said proximity factor includes said user's proximity to other users on a social media website, said user's relationship strength with said other users on said social media website, or combinations thereof; presenting said applications ordered by said social proximity factor wherein presenting said application comprises presenting said applications with a higher social proximity factor before said applications with a lower social proximity factor; annotating said applications by said social proximity factor wherein annotating said applications comprises annotating said application with an icon of a group making a recommendation regarding said applications; and providing additional information about said applications from said group wherein said additional information comprises a profile picture of said group that uses said applications, a name of a said group, or combinations thereof. 10. The method of claim 9, wherein searching for said applications meeting said criteria further comprises using said application recommendation system to analyze what said user is searching for in an application store based on said criteria said user selects. 11. The method of claim 9, wherein presenting said applications ordered by said social proximity factor comprises presenting said applications according to aggregated group information. 12. The method of claim 11, wherein presenting said applications according to said aggregated group information comprises presenting a rating for said applications from a group of users. 13. The method of claim 9, wherein presenting said applications ordered by said social proximity factor further comprises, based on said criteria and said social proximity factor, populating an application store with said applications from an application library. 14. The method of claim 9, wherein characterizing said applications according to said social proximity factor comprises analyzing said criteria against said social proximity factor. 15. The method of claim 9, further comprising presenting an alternative recommendation responsive to identifying problems with said applications wherein said alternative recommendation is based on similarities to said applications. 16. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: characterizing said applications according to a social proximity factor to said user to analyze said criteria against said social proximity factor wherein said proximity factor includes said user's proximity to other users on a social media website, said user's relationship strength with said other users on said social media website, or combinations thereof; and presenting said applications ordered by said social proximity factor wherein presenting said application comprises, based on said criteria and said social proximity factor, populating an application store with said applications from an application library. 17. The method of claim 16, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof. 18. The method of claim 16, wherein presenting said applications ordered by said social proximity factor comprises presenting said applications according to aggregated group information wherein said aggregated group information comprises presenting a rating for said applications from a group of users. 19. The method of claim 16, further comprising searching for said applications meeting said criteria, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof and wherein searching for said applications meeting said criteria comprises using said application recommendation system to analyze what said user is searching for in an application store based on said criteria said user selects. 20. The method of claim 16, further comprising annotating said applications by said social proximity factor wherein annotating said applications comprises annotating said application with an icon of a group making a recommendation regarding said applications. | Utilizing social information for recommending an application includes providing an application recommendation system based on social characterizations, and responsive to a user searching for an application meeting a criteria, utilizing the application recommendation system by searching for applications meeting the criteria, characterizing the applications according to a social proximity factor to the user, and presenting the applications ordered by the social proximity factor.1. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: searching for applications meeting said criteria; characterizing said applications according to a social proximity factor to said user; and presenting said applications ordered by said social proximity factor. 2. The method of claim 1, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof. 3. The method of claim 1, further comprising presenting an alternative recommendation responsive to identifying problems with said applications. 4. The method of claim 3, wherein said alternative recommendation is based on similarities to said applications. 5. The method of claim 3, wherein said alternative recommendation is from an expertise group. 6. The method of claim 1, further comprising annotating said applications by said social proximity factor. 7. The method of claim 6, wherein said annotating said applications includes annotating an icon of a group making a recommendation regarding said applications. 8. The method of claim 7, further comprising providing additional information about said applications from said group. 9. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: searching for applications meeting said criteria; characterizing said applications according to a social proximity factor to said user wherein said proximity factor includes said user's proximity to other users on a social media website, said user's relationship strength with said other users on said social media website, or combinations thereof; presenting said applications ordered by said social proximity factor wherein presenting said application comprises presenting said applications with a higher social proximity factor before said applications with a lower social proximity factor; annotating said applications by said social proximity factor wherein annotating said applications comprises annotating said application with an icon of a group making a recommendation regarding said applications; and providing additional information about said applications from said group wherein said additional information comprises a profile picture of said group that uses said applications, a name of a said group, or combinations thereof. 10. The method of claim 9, wherein searching for said applications meeting said criteria further comprises using said application recommendation system to analyze what said user is searching for in an application store based on said criteria said user selects. 11. The method of claim 9, wherein presenting said applications ordered by said social proximity factor comprises presenting said applications according to aggregated group information. 12. The method of claim 11, wherein presenting said applications according to said aggregated group information comprises presenting a rating for said applications from a group of users. 13. The method of claim 9, wherein presenting said applications ordered by said social proximity factor further comprises, based on said criteria and said social proximity factor, populating an application store with said applications from an application library. 14. The method of claim 9, wherein characterizing said applications according to said social proximity factor comprises analyzing said criteria against said social proximity factor. 15. The method of claim 9, further comprising presenting an alternative recommendation responsive to identifying problems with said applications wherein said alternative recommendation is based on similarities to said applications. 16. A method for utilizing social information for recommending an application, said method comprising:
providing an application recommendation system based on social characterizations; and responsive to a user searching for an application meeting a criteria, utilizing said application recommendation system by: characterizing said applications according to a social proximity factor to said user to analyze said criteria against said social proximity factor wherein said proximity factor includes said user's proximity to other users on a social media website, said user's relationship strength with said other users on said social media website, or combinations thereof; and presenting said applications ordered by said social proximity factor wherein presenting said application comprises, based on said criteria and said social proximity factor, populating an application store with said applications from an application library. 17. The method of claim 16, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof. 18. The method of claim 16, wherein presenting said applications ordered by said social proximity factor comprises presenting said applications according to aggregated group information wherein said aggregated group information comprises presenting a rating for said applications from a group of users. 19. The method of claim 16, further comprising searching for said applications meeting said criteria, wherein said criteria is selected from a group consisting of a search string, a category, a social network, an individual, an organization, and combinations thereof and wherein searching for said applications meeting said criteria comprises using said application recommendation system to analyze what said user is searching for in an application store based on said criteria said user selects. 20. The method of claim 16, further comprising annotating said applications by said social proximity factor wherein annotating said applications comprises annotating said application with an icon of a group making a recommendation regarding said applications. | 2,100 |
5,428 | 5,428 | 14,536,464 | 2,143 | An electronic device with a touch-sensitive surface and a display, that includes one or more sensors to detect intensity of contacts with the touch-sensitive surface, displays a plurality of application icons, where the plurality of application icons include a respective application icon corresponding to a respective application. While a focus selector is over the respective application icon, the device detects a gesture that includes a contact on the touch-sensitive surface; and in response to detecting the gesture: when the contact had a maximum intensity during the gesture that was below a respective intensity threshold, the device displays an application window of the respective application; and when the contact reached an intensity during the gesture that was above the respective intensity threshold, the device displays a plurality of user interface objects that correspond to the respective application. | 1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, a touch-sensitive surface and one or more sensors to detect intensity of contacts with the touch-sensitive surface, cause the device to:
display a plurality of application icons, wherein the plurality of application icons includes a respective application icon corresponding to a respective application; while a focus selector is over the respective application icon, detect a gesture that includes a contact on the touch-sensitive surface; and in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, display an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, display a plurality of user interface objects that correspond to the respective application. 2. The non-transitory computer readable storage medium of claim 1, wherein:
the application window of the respective application is displayed when an end of the gesture is detected; and the plurality of user interface objects corresponding to the respective application are displayed during the gesture in response to detecting that the intensity of the contact exceeds the respective intensity threshold. 3. The non-transitory computer readable storage medium of claim 1, wherein:
the application window of the respective application is displayed when an end of the gesture is detected; and the plurality of user interface objects corresponding to the respective application are displayed when the end of the gesture is detected. 4. The non-transitory computer readable storage medium of claim 1, wherein the plurality of user interface objects includes reduced-scale representations of currently open application windows for the application. 5. The non-transitory computer readable storage medium of claim 1, wherein the plurality of user interface objects includes reduced-scale representations of recently opened documents for the respective application. 6. The non-transitory computer readable storage medium of claim 1, wherein:
the plurality of application icons are displayed in a predefined region of the display prior to detecting the gesture; and the plurality of user interface objects are displayed in the predefined region of the display. 7. The non-transitory computer readable storage medium of claim 6, wherein the plurality of user interface objects are displayed in front of and at least partially overlapping one or more of the plurality of application icons in the predefined region of the display. 8. The non-transitory computer readable storage medium of claim 1, wherein, displaying the plurality of user interface objects corresponding to the respective application includes:
displaying an animation of the plurality of application icons shifting backward into the display; and displaying the plurality of user interface objects corresponding to the respective application in a location on the display previously occupied by the plurality of application icons. 9. The non-transitory computer readable storage medium of claim 1, wherein displaying the plurality of user interface objects corresponding to the respective application includes, for a respective user interface object associated with the respective application:
initially displaying the respective user interface object at a location proximate to the respective application icon; and after initially displaying the respective user interface object, displaying an animation of the respective user interface object moving from the location proximate to the respective application icon to a location proximate to another user interface object in the plurality of user interface objects. 10. The non-transitory computer readable storage medium of claim 1, wherein the application window is a new application window that was not displayed on the display prior to detecting the contact. 11. An electronic device, comprising:
a display; a touch-sensitive surface; one or more sensors to detect intensity of contacts with the touch-sensitive surface; one or more processors; 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 plurality of application icons, wherein the plurality of application icons include a respective application icon corresponding to a respective application;
while a focus selector is over the respective application icon, detecting a gesture that includes a contact on the touch-sensitive surface; and
in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, displaying an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, displaying a plurality of user interface objects that correspond to the respective application. 12. A method, comprising:
at an electronic device with a touch-sensitive surface and a display, wherein the device includes one or more sensors to detect intensity of contacts with the touch-sensitive surface:
displaying a plurality of application icons, wherein the plurality of application icons include a respective application icon corresponding to a respective application;
while a focus selector is over the respective application icon, detecting a gesture that includes a contact on the touch-sensitive surface; and
in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, displaying an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, displaying a plurality of user interface objects that correspond to the respective application. | An electronic device with a touch-sensitive surface and a display, that includes one or more sensors to detect intensity of contacts with the touch-sensitive surface, displays a plurality of application icons, where the plurality of application icons include a respective application icon corresponding to a respective application. While a focus selector is over the respective application icon, the device detects a gesture that includes a contact on the touch-sensitive surface; and in response to detecting the gesture: when the contact had a maximum intensity during the gesture that was below a respective intensity threshold, the device displays an application window of the respective application; and when the contact reached an intensity during the gesture that was above the respective intensity threshold, the device displays a plurality of user interface objects that correspond to the respective application.1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, a touch-sensitive surface and one or more sensors to detect intensity of contacts with the touch-sensitive surface, cause the device to:
display a plurality of application icons, wherein the plurality of application icons includes a respective application icon corresponding to a respective application; while a focus selector is over the respective application icon, detect a gesture that includes a contact on the touch-sensitive surface; and in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, display an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, display a plurality of user interface objects that correspond to the respective application. 2. The non-transitory computer readable storage medium of claim 1, wherein:
the application window of the respective application is displayed when an end of the gesture is detected; and the plurality of user interface objects corresponding to the respective application are displayed during the gesture in response to detecting that the intensity of the contact exceeds the respective intensity threshold. 3. The non-transitory computer readable storage medium of claim 1, wherein:
the application window of the respective application is displayed when an end of the gesture is detected; and the plurality of user interface objects corresponding to the respective application are displayed when the end of the gesture is detected. 4. The non-transitory computer readable storage medium of claim 1, wherein the plurality of user interface objects includes reduced-scale representations of currently open application windows for the application. 5. The non-transitory computer readable storage medium of claim 1, wherein the plurality of user interface objects includes reduced-scale representations of recently opened documents for the respective application. 6. The non-transitory computer readable storage medium of claim 1, wherein:
the plurality of application icons are displayed in a predefined region of the display prior to detecting the gesture; and the plurality of user interface objects are displayed in the predefined region of the display. 7. The non-transitory computer readable storage medium of claim 6, wherein the plurality of user interface objects are displayed in front of and at least partially overlapping one or more of the plurality of application icons in the predefined region of the display. 8. The non-transitory computer readable storage medium of claim 1, wherein, displaying the plurality of user interface objects corresponding to the respective application includes:
displaying an animation of the plurality of application icons shifting backward into the display; and displaying the plurality of user interface objects corresponding to the respective application in a location on the display previously occupied by the plurality of application icons. 9. The non-transitory computer readable storage medium of claim 1, wherein displaying the plurality of user interface objects corresponding to the respective application includes, for a respective user interface object associated with the respective application:
initially displaying the respective user interface object at a location proximate to the respective application icon; and after initially displaying the respective user interface object, displaying an animation of the respective user interface object moving from the location proximate to the respective application icon to a location proximate to another user interface object in the plurality of user interface objects. 10. The non-transitory computer readable storage medium of claim 1, wherein the application window is a new application window that was not displayed on the display prior to detecting the contact. 11. An electronic device, comprising:
a display; a touch-sensitive surface; one or more sensors to detect intensity of contacts with the touch-sensitive surface; one or more processors; 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 plurality of application icons, wherein the plurality of application icons include a respective application icon corresponding to a respective application;
while a focus selector is over the respective application icon, detecting a gesture that includes a contact on the touch-sensitive surface; and
in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, displaying an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, displaying a plurality of user interface objects that correspond to the respective application. 12. A method, comprising:
at an electronic device with a touch-sensitive surface and a display, wherein the device includes one or more sensors to detect intensity of contacts with the touch-sensitive surface:
displaying a plurality of application icons, wherein the plurality of application icons include a respective application icon corresponding to a respective application;
while a focus selector is over the respective application icon, detecting a gesture that includes a contact on the touch-sensitive surface; and
in response to detecting the gesture:
in accordance with a determination that the contact had a maximum intensity during the gesture that was below a respective intensity threshold, displaying an application window of the respective application; and
in accordance with a determination that the contact reached an intensity during the gesture that was above the respective intensity threshold, displaying a plurality of user interface objects that correspond to the respective application. | 2,100 |
5,429 | 5,429 | 14,031,391 | 2,167 | A system includes a processor configured to receive a request to assemble a recommended playlist. The processor is also configured to access one or more user-specified social media sites and obtain posted song recommendations from the one or more social media sites. Also, the processor is configured to assemble the song recommendations into a playlist. The processor is further configured to access a song-providing service and request music on the playlist from the song providing service. The processor is additionally configured to play the requested music. | 1. A system comprising:
a processor configured to: receive a request to assemble a playlist; access one or more user-specified social media sites; obtain posted song recommendations from the one or more social media sites; assemble the song recommendations into a playlist; access a song-providing service; request music on the playlist from the song providing service; and play the requested music. 2. The system of claim 1, wherein the social media sites include a site where recommendations are posted for a specified listener. 3. The system of claim 1, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 4. The system of claim 1, wherein at least one song recommendation includes a specified song-providing service, and wherein the processor is configured to access the specified song-providing service for playback of the song recommendation including the specified song-providing service. 5. The system of claim 1, wherein the processor is configured to access a user-specified song providing service to request music. 6. The system of claim 1, wherein the request to assemble a playlist includes a specification of a recommender, and wherein the processor is configured to obtain posted song recommendations from the specified recommender. 7. The system of claim 6, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the processor is configured to obtain posted song recommendations from the specified recommenders and wherein the processor is configured to assemble the song recommendations into a single playlist. 8. The system of claim 6, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the processor is configured to obtain posted song recommendations from the specified recommenders and wherein the processor is configured to assemble the song recommendations into a playlist for each recommender, wherein the playlist for each recommender only includes songs recommended by the recommender. 9. A computer-implemented method comprising:
receiving a request to assemble a playlist; accessing one or more user-specified social media sites; obtaining posted song recommendations from the one or more social media sites; assembling the song recommendations into a playlist; accessing a song-providing service; requesting music on the playlist from the song providing service; and playing the requested music. 10. The method of claim 9, wherein the social media sites include a site where recommendations are posted for a specified listener. 11. The method of claim 9, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 12. The method of claim 9, wherein at least one song recommendation includes a specified song-providing service, and wherein the accessing includes accessing the specified song-providing service for playback of the song recommendation including the specified song-providing service. 13. The method of claim 9, wherein the accessing includes accessing a user-specified song providing service to request music. 14. The method of claim 9, wherein the request to assemble a playlist includes a specification of a recommender, and wherein the obtaining includes obtaining posted song recommendations from the specified recommender. 15. The method of claim 14, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the obtaining includes obtaining posted song recommendations from the specified recommenders and wherein the assembling includes assembling the song recommendations into a single playlist. 16. The method of claim 14, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the obtaining includes obtaining posted song recommendations from the specified recommenders and wherein the assembling includes assembling the song recommendations into a playlist for each recommender, wherein the playlist for each recommender only includes songs recommended by the recommender. 17. A non-transitory computer readable storage medium, storing instructions, that, when executed by a processor, cause the processor to perform a method comprising:
receiving a request to assemble a playlist; accessing one or more user-specified social media sites; obtaining posted song recommendations from the one or more social media sites; assembling the song recommendations into a playlist; accessing a song-providing service; requesting music on the playlist from the song providing service; and playing the requested music. 18. The storage medium of claim 17, wherein the social media sites include a site where recommendations are posted for a specified listener. 19. The storage medium of claim 17, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 20. The storage medium of claim 17, wherein at least one song recommendation includes a specified song-providing service, and wherein the accessing includes accessing the specified song-providing service for playback of the song recommendation including the specified song-providing service. | A system includes a processor configured to receive a request to assemble a recommended playlist. The processor is also configured to access one or more user-specified social media sites and obtain posted song recommendations from the one or more social media sites. Also, the processor is configured to assemble the song recommendations into a playlist. The processor is further configured to access a song-providing service and request music on the playlist from the song providing service. The processor is additionally configured to play the requested music.1. A system comprising:
a processor configured to: receive a request to assemble a playlist; access one or more user-specified social media sites; obtain posted song recommendations from the one or more social media sites; assemble the song recommendations into a playlist; access a song-providing service; request music on the playlist from the song providing service; and play the requested music. 2. The system of claim 1, wherein the social media sites include a site where recommendations are posted for a specified listener. 3. The system of claim 1, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 4. The system of claim 1, wherein at least one song recommendation includes a specified song-providing service, and wherein the processor is configured to access the specified song-providing service for playback of the song recommendation including the specified song-providing service. 5. The system of claim 1, wherein the processor is configured to access a user-specified song providing service to request music. 6. The system of claim 1, wherein the request to assemble a playlist includes a specification of a recommender, and wherein the processor is configured to obtain posted song recommendations from the specified recommender. 7. The system of claim 6, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the processor is configured to obtain posted song recommendations from the specified recommenders and wherein the processor is configured to assemble the song recommendations into a single playlist. 8. The system of claim 6, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the processor is configured to obtain posted song recommendations from the specified recommenders and wherein the processor is configured to assemble the song recommendations into a playlist for each recommender, wherein the playlist for each recommender only includes songs recommended by the recommender. 9. A computer-implemented method comprising:
receiving a request to assemble a playlist; accessing one or more user-specified social media sites; obtaining posted song recommendations from the one or more social media sites; assembling the song recommendations into a playlist; accessing a song-providing service; requesting music on the playlist from the song providing service; and playing the requested music. 10. The method of claim 9, wherein the social media sites include a site where recommendations are posted for a specified listener. 11. The method of claim 9, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 12. The method of claim 9, wherein at least one song recommendation includes a specified song-providing service, and wherein the accessing includes accessing the specified song-providing service for playback of the song recommendation including the specified song-providing service. 13. The method of claim 9, wherein the accessing includes accessing a user-specified song providing service to request music. 14. The method of claim 9, wherein the request to assemble a playlist includes a specification of a recommender, and wherein the obtaining includes obtaining posted song recommendations from the specified recommender. 15. The method of claim 14, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the obtaining includes obtaining posted song recommendations from the specified recommenders and wherein the assembling includes assembling the song recommendations into a single playlist. 16. The method of claim 14, wherein the request to assemble a playlist includes a specification of a plurality of recommenders, and wherein the obtaining includes obtaining posted song recommendations from the specified recommenders and wherein the assembling includes assembling the song recommendations into a playlist for each recommender, wherein the playlist for each recommender only includes songs recommended by the recommender. 17. A non-transitory computer readable storage medium, storing instructions, that, when executed by a processor, cause the processor to perform a method comprising:
receiving a request to assemble a playlist; accessing one or more user-specified social media sites; obtaining posted song recommendations from the one or more social media sites; assembling the song recommendations into a playlist; accessing a song-providing service; requesting music on the playlist from the song providing service; and playing the requested music. 18. The storage medium of claim 17, wherein the social media sites include a site where recommendations are posted for a specified listener. 19. The storage medium of claim 17, wherein the social media sites include a site where a recommendation feed is posted by a recommender. 20. The storage medium of claim 17, wherein at least one song recommendation includes a specified song-providing service, and wherein the accessing includes accessing the specified song-providing service for playback of the song recommendation including the specified song-providing service. | 2,100 |
5,430 | 5,430 | 15,047,722 | 2,191 | A system includes a processor configured to, in response to a notification received from a remote network that an update to vehicle software is available, assemble a list of installed vehicle software versions. The processor is also configured to transmit the list of installed versions to a remote update server. The processor is further configured to receive a list of available updates compatible with the installed vehicle software versions in response to the transmission. Additionally, the processor is configured to download at least one of the available updates and install the downloaded updates. | 1. A system comprising:
a processor configured to: in response to a notification received from a remote network that an update to vehicle software is available, assemble a list of installed vehicle software versions; transmit the list of installed versions to a remote update server; receive a list of available updates compatible with the installed vehicle software versions in response to the transmission; download at least one of the available updates; and install the downloaded updates. 2. The system of claim 1, wherein the list of installed vehicle software versions includes firmware versions. 3. The system of claim 1, wherein versions in the list of available updates include only software and firmware versions to which the update applies. 4. The system of claim 3, wherein the software and firmware versions to which the update applies include versions of software or firmware not to be updated, but which must be at or above a certain version to ensure compatibility with the update. 5. The system of claim 1, wherein the list of installed vehicle component versions includes all installed software and firmware versions. 6. The system of claim 1, wherein the download includes downloading all updates. 7. The system of claim 1, wherein the processor is further configured to download a user-selected subset of the available updates, less than every available update. 8. The system of claim 1, wherein the processor is further configured to determine success or failure for each update installation. 9. The system of claim 8, wherein the processor is configured to report, to a remote server, a log including the success or failure for each update installation. 10. A system comprising:
a processor configured to: receive a list of vehicle identification numbers (VIN)s to which an available software update applies; determine, for each VIN, if a vehicle-owner has approved over the air (OTA) updates; and send a notification to each vehicle, identified by a corresponding VIN, for which the owner has approved OTA updates and an available software update applies. 11. The system of claim 10, wherein the list of VINs is received from a secondary remote server through which the available software update is provided to vehicles. 12. The system of claim 10, wherein the list is received from a database containing currently installed software versions for each vehicle, identified by VIN, in response to a database query. 13. A system comprising:
one or more processors configured to: receive a software update; provide notification to a vehicle, for which a database record indicates an installed software version to which the received update applies; receive a software-update download request from the vehicle; transmit the software update responsive to the request; receive an update log including success or failure of installation of the software update; and update the database record based on the log. 14. The system of claim 13, wherein at least one of the processors is further configured to receive communication from the vehicle, responsive to the notification, including a list of currently installed software versions of the vehicle. 15. The system of claim 14, wherein the at least one of the processors is further configured to update the database record based on the received communication. 16. The system of claim 14, wherein the at least one of the processors is further configured to determine applicability of the update to a currently installed software version identified in the communication; and
transmit confirmation of availability of the update, responsive to the applicability determination. 17. The system of claim 16, wherein the at least one of the processors is further configured to determine the applicability of the update by confirming that the currently installed software version is at or above a certain version. 18. The system of claim 14, wherein the list includes all software and firmware versions currently installed on the vehicle. 19. The system of claim 14, wherein the list includes only software and firmware versions to which the update applies. 20. The system of claim 19, wherein the software and firmware versions to which the update applies include versions of software or firmware not to be updated, but which must be at or above a certain version to ensure compatibility with the update. | A system includes a processor configured to, in response to a notification received from a remote network that an update to vehicle software is available, assemble a list of installed vehicle software versions. The processor is also configured to transmit the list of installed versions to a remote update server. The processor is further configured to receive a list of available updates compatible with the installed vehicle software versions in response to the transmission. Additionally, the processor is configured to download at least one of the available updates and install the downloaded updates.1. A system comprising:
a processor configured to: in response to a notification received from a remote network that an update to vehicle software is available, assemble a list of installed vehicle software versions; transmit the list of installed versions to a remote update server; receive a list of available updates compatible with the installed vehicle software versions in response to the transmission; download at least one of the available updates; and install the downloaded updates. 2. The system of claim 1, wherein the list of installed vehicle software versions includes firmware versions. 3. The system of claim 1, wherein versions in the list of available updates include only software and firmware versions to which the update applies. 4. The system of claim 3, wherein the software and firmware versions to which the update applies include versions of software or firmware not to be updated, but which must be at or above a certain version to ensure compatibility with the update. 5. The system of claim 1, wherein the list of installed vehicle component versions includes all installed software and firmware versions. 6. The system of claim 1, wherein the download includes downloading all updates. 7. The system of claim 1, wherein the processor is further configured to download a user-selected subset of the available updates, less than every available update. 8. The system of claim 1, wherein the processor is further configured to determine success or failure for each update installation. 9. The system of claim 8, wherein the processor is configured to report, to a remote server, a log including the success or failure for each update installation. 10. A system comprising:
a processor configured to: receive a list of vehicle identification numbers (VIN)s to which an available software update applies; determine, for each VIN, if a vehicle-owner has approved over the air (OTA) updates; and send a notification to each vehicle, identified by a corresponding VIN, for which the owner has approved OTA updates and an available software update applies. 11. The system of claim 10, wherein the list of VINs is received from a secondary remote server through which the available software update is provided to vehicles. 12. The system of claim 10, wherein the list is received from a database containing currently installed software versions for each vehicle, identified by VIN, in response to a database query. 13. A system comprising:
one or more processors configured to: receive a software update; provide notification to a vehicle, for which a database record indicates an installed software version to which the received update applies; receive a software-update download request from the vehicle; transmit the software update responsive to the request; receive an update log including success or failure of installation of the software update; and update the database record based on the log. 14. The system of claim 13, wherein at least one of the processors is further configured to receive communication from the vehicle, responsive to the notification, including a list of currently installed software versions of the vehicle. 15. The system of claim 14, wherein the at least one of the processors is further configured to update the database record based on the received communication. 16. The system of claim 14, wherein the at least one of the processors is further configured to determine applicability of the update to a currently installed software version identified in the communication; and
transmit confirmation of availability of the update, responsive to the applicability determination. 17. The system of claim 16, wherein the at least one of the processors is further configured to determine the applicability of the update by confirming that the currently installed software version is at or above a certain version. 18. The system of claim 14, wherein the list includes all software and firmware versions currently installed on the vehicle. 19. The system of claim 14, wherein the list includes only software and firmware versions to which the update applies. 20. The system of claim 19, wherein the software and firmware versions to which the update applies include versions of software or firmware not to be updated, but which must be at or above a certain version to ensure compatibility with the update. | 2,100 |
5,431 | 5,431 | 12,454,012 | 2,164 | The invention is an Internet based Geographic Information System (GIS), which resides totally on Internet servers, allowing users to access and use the system on the Internet from a browser or equivalent, thus requiring no user installed software. The system provides enough core GIS capability to allow creation of GIS data layers but is user friendly enough to provide access to users who are not GIS specialists. The system supports sharing of data among users, and supports data compatibility with platform based GIS installations. Use of the novel GIS permits communities of users sharing common interests associated with a geographical area to communicate using a map base medium. | 1. A process for using a Geographic Information System (GIS), comprising a service provider providing user access to a GIS capable program residing on at least one Internet server, wherein; the program accesses cartographic and other data bases from at least one of the resident servers and from other locations on the Internet,
the program provides a web-site based user interface to users who access the program from the Internet, the users require no GIS specific software resident on the user platforms, only an Internet browser or equivalent; and, the program provides core GIS functionality, including map navigation, viewing of data as discrete layers, and creation of shapefile-equivalent data. 2. The process of claim 1 wherein user data may be stored and accessed from the server, 3rd-party servers, as well as locally. 3. The process of claim 1 wherein the service provider provides the access for a fee, the type of fees including an up-front fee, subscription fees, single-use fees, data storage fees, traffic fees, fees on user to user commerce, transaction fees, or premium data access fees. 4. The process of claim 1 wherein the service provider includes advertising content on the website. 5. A process for using a Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and/or from other locations on the Internet, the program provides a user interface to users who access the program from the internet, the users require no GIS specific software resident on the user platforms, only an internet browser or equivalent, the program enables the user to create GIS data layers composed of shapefile-equivalent data, user created data layers may be stored on at least one server, such that the entire process is online; and, user created data may be made available to other users. 6. The process of claim 5 wherein at least one layer is a map of an area, and other layers contain information about attributes of that area. 7. The process of claim 6 wherein the attributes include;
directions to a given location, local guides to eating, hiking, surfing, etc., w/reviews, crime-incident map, vegetation & wildlife zones' human demographics, real estate data, geologic and other natural science data, reviews of restaurants & clubs, or subway and driving/parking maps. 8. The process of claim 6 wherein a user creates the data and makes it available to other users for a fee. 9. The process of claim 6 wherein users with a common interest share the GIS data. 10. The process of claim 9 wherein users with a common interest form a community which shares and collaboratively creates the GIS data, whereby members have at least one of privileges to view, create or modify the GIS data. 11. The process of claim 10 wherein different levels of users exist within the community, such that not all members have the same privileges. 12. The process of claim 11 wherein differing levels of user privileges depend on a fee based system. | The invention is an Internet based Geographic Information System (GIS), which resides totally on Internet servers, allowing users to access and use the system on the Internet from a browser or equivalent, thus requiring no user installed software. The system provides enough core GIS capability to allow creation of GIS data layers but is user friendly enough to provide access to users who are not GIS specialists. The system supports sharing of data among users, and supports data compatibility with platform based GIS installations. Use of the novel GIS permits communities of users sharing common interests associated with a geographical area to communicate using a map base medium.1. A process for using a Geographic Information System (GIS), comprising a service provider providing user access to a GIS capable program residing on at least one Internet server, wherein; the program accesses cartographic and other data bases from at least one of the resident servers and from other locations on the Internet,
the program provides a web-site based user interface to users who access the program from the Internet, the users require no GIS specific software resident on the user platforms, only an Internet browser or equivalent; and, the program provides core GIS functionality, including map navigation, viewing of data as discrete layers, and creation of shapefile-equivalent data. 2. The process of claim 1 wherein user data may be stored and accessed from the server, 3rd-party servers, as well as locally. 3. The process of claim 1 wherein the service provider provides the access for a fee, the type of fees including an up-front fee, subscription fees, single-use fees, data storage fees, traffic fees, fees on user to user commerce, transaction fees, or premium data access fees. 4. The process of claim 1 wherein the service provider includes advertising content on the website. 5. A process for using a Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and/or from other locations on the Internet, the program provides a user interface to users who access the program from the internet, the users require no GIS specific software resident on the user platforms, only an internet browser or equivalent, the program enables the user to create GIS data layers composed of shapefile-equivalent data, user created data layers may be stored on at least one server, such that the entire process is online; and, user created data may be made available to other users. 6. The process of claim 5 wherein at least one layer is a map of an area, and other layers contain information about attributes of that area. 7. The process of claim 6 wherein the attributes include;
directions to a given location, local guides to eating, hiking, surfing, etc., w/reviews, crime-incident map, vegetation & wildlife zones' human demographics, real estate data, geologic and other natural science data, reviews of restaurants & clubs, or subway and driving/parking maps. 8. The process of claim 6 wherein a user creates the data and makes it available to other users for a fee. 9. The process of claim 6 wherein users with a common interest share the GIS data. 10. The process of claim 9 wherein users with a common interest form a community which shares and collaboratively creates the GIS data, whereby members have at least one of privileges to view, create or modify the GIS data. 11. The process of claim 10 wherein different levels of users exist within the community, such that not all members have the same privileges. 12. The process of claim 11 wherein differing levels of user privileges depend on a fee based system. | 2,100 |
5,432 | 5,432 | 11,038,607 | 2,164 | The invention is an Internet based Geographic Information System (GIS), which resides totally on Internet servers, allowing users to access and use the system on the Internet from a browser or equivalent, thus requiring no user installed software. The system provides enough core GIS capability to allow creation of GIS data layers but is user friendly enough to provide access to users who are not GIS specialists. The system supports sharing of data among users, and supports data compatibility with platform based GIS installations. | 1. A Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and/or from other locations on the Internet, the program provides a user interface to users who access the program from the internet; and, the users require no GIS specific software resident on the user platforms, only an internet browser or equivalent. 2. The GIS of claim 1 wherein the program enables the user to create GIS data layers composed of shapefile-equivalent data. 3. The GIS of claim 2 wherein user created data layers may be stored on at least one server, such that the entire process is online. 4. The GIS of claim 2 wherein user created data is compatible with and may be downloaded to user platform resident GIS programs. 5. The GIS of claim 3 wherein user created data may be made available to other users. 6. A Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and from other locations on the Internet, the program provides a user interface to users who access the program from the Internet, the users require no GIS specific software resident on the user platforms, only an Internet browser or equivalent; and, the program provides core GIS functionality, including map navigation, viewing of data as discrete layers, and creation of shapefile-equivalent data. 7. The GIS of claim 6 wherein the program enables the user to create GIS data layers composed of shapefile-equivalent data. 8. The GIS of claim 7 wherein user created data layers may be stored on at least one server, such that the entire process is online. 9. The GIS of claim 8 wherein user created data is compatible with and may be downloaded to user platform resident GIS programs. 10. The GIS of claim 8 wherein user created data may be made available to other users. 11. The GIS of claim 9 wherein user drawn data is converted to Open-GIS format before being stored on a server. 12. The GIS of claim 6 wherein the program retrieves and displays vector or raster data from one more of private and public data servers. 13. The GIS of claim 6 wherein a custom database may be user created and locations in the user created data may be assigned any number of attributes. | The invention is an Internet based Geographic Information System (GIS), which resides totally on Internet servers, allowing users to access and use the system on the Internet from a browser or equivalent, thus requiring no user installed software. The system provides enough core GIS capability to allow creation of GIS data layers but is user friendly enough to provide access to users who are not GIS specialists. The system supports sharing of data among users, and supports data compatibility with platform based GIS installations.1. A Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and/or from other locations on the Internet, the program provides a user interface to users who access the program from the internet; and, the users require no GIS specific software resident on the user platforms, only an internet browser or equivalent. 2. The GIS of claim 1 wherein the program enables the user to create GIS data layers composed of shapefile-equivalent data. 3. The GIS of claim 2 wherein user created data layers may be stored on at least one server, such that the entire process is online. 4. The GIS of claim 2 wherein user created data is compatible with and may be downloaded to user platform resident GIS programs. 5. The GIS of claim 3 wherein user created data may be made available to other users. 6. A Geographic Information System (GIS), comprising a GIS capable program residing on at least one Internet server, wherein;
the program accesses cartographic and other data bases from at least one of the resident servers and from other locations on the Internet, the program provides a user interface to users who access the program from the Internet, the users require no GIS specific software resident on the user platforms, only an Internet browser or equivalent; and, the program provides core GIS functionality, including map navigation, viewing of data as discrete layers, and creation of shapefile-equivalent data. 7. The GIS of claim 6 wherein the program enables the user to create GIS data layers composed of shapefile-equivalent data. 8. The GIS of claim 7 wherein user created data layers may be stored on at least one server, such that the entire process is online. 9. The GIS of claim 8 wherein user created data is compatible with and may be downloaded to user platform resident GIS programs. 10. The GIS of claim 8 wherein user created data may be made available to other users. 11. The GIS of claim 9 wherein user drawn data is converted to Open-GIS format before being stored on a server. 12. The GIS of claim 6 wherein the program retrieves and displays vector or raster data from one more of private and public data servers. 13. The GIS of claim 6 wherein a custom database may be user created and locations in the user created data may be assigned any number of attributes. | 2,100 |
5,433 | 5,433 | 13,907,319 | 2,137 | A plurality of lines of data from a file are stored in a cache. The lines of data typically come from a file that is being compressed. The process gets an additional line of data to compress. Based on a compression level, the additional line of data is compared with the lines of data in the cache to determine if there is a best matched line of data from the plurality of lines in the cache. In response to determining the best matched line of data, the additional line of data is compressed with a first compression algorithm based on the best matched line of data to create a compressed line. The compressed line is written to the file. In response to not determining the best matched line of data, the additional line of data is written to the file. The additional line of data is stored in the cache. | 1. A method for compressing data, comprising:
storing a plurality of lines of data from a file in a cache; getting an additional line of data; comparing the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache; in response determining the best matched line of data, compressing the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and writing the compressed line to the file; in response to not determining the best matched line of data, writing the additional line of data to the file; and storing the additional line of data in the cache. 2. The method of claim 1, further comprising:
determining if the cache is full; and in response to the cache being full, deleting a least recently matched line of data from the cache. 3. The method of claim 1, wherein the file is a log file stored on a hard disk and the cache is a Random Access Memory (RAM) or a cache in a microprocessor. 4. The method of claim 1, wherein the first compression algorithm comprises:
comparing a repetition of characters in the additional line of data to the best matched line of data to identify a number of matched characters; and replacing the number of matched characters with an identifier representing the number of matched characters and a line number of the best matched line of data in the file. 5. The method of claim 4, wherein a plurality of repetitions of characters in the additional line of data are compared to the best matched line of data. 6. The method of claim 5, wherein the plurality of repetitions of characters in the additional line of data are compared to the best matched line of data and a second best matched line of data. 7. The method of claim 6, wherein the compressed line further comprises a line number of the second best matched line of data in the file. 8. The method of claim 1, further comprising applying a second compression algorithm to the compressed line before writing the compressed line to the file. 9. The method of claim 1, wherein at least one of the stored plurality of lines is a line of data in the file that is after the additional line of data. 10. The method of claim 1, wherein the additional line of data is processed in real-time when the additional line of data is generated by a logging module. 11. The method of claim 1, wherein the first compression algorithm compares software objects in an Input/Output (I/O) stream. 12. A system for compressing data, comprising:
a cache configured to store a plurality of lines of data from a file; and a compression module configured to get an additional line of data, compare the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache, compress the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and writing the compressed additional line of data to the file in response determining the best matched line of data, write the additional line of data to the file in response to not determining the best matched line of data, and store the additional line of data in the cache. 13. The system of claim 12, wherein the compression module is further configured to determine if the cache is full and delete a least recently matched line of data from the cache in response to the cache being full. 14. The system of claim 12, wherein the file is a log file stored on a hard disk and the cache is a Random Access Memory (RAM) or a cache in a microprocessor. 15. The system of claim 12, wherein the compression module is further configured to implement a compression algorithm that compares a repetition of characters in the additional line of data to the best matched line of data to identify a number of matched characters and replaces the number of matched characters with an identifier representing the number of matched characters and a line number of the best matched line of data in the file. 16. The system of claim 15, wherein the compression module compares a plurality of repetitions of characters in the additional line of data to the best matched line of data. 17. The system of claim 16, wherein compression module compares the plurality of repetitions of characters in the additional line of data to the best matched line of data and a second best matched line of data. 18. The system of claim 17, wherein the compressed line further comprises a line number of the second best matched line of data in the file. 19. The system of claim 12, wherein the additional line of data is processed in real-time when the additional line of data is generated by a logging module. 20. A non-transient computer readable medium having stored thereon instructions that cause a processor to execute a method, the method comprising:
instructions to store a plurality of lines of data from a file in a cache; instructions to get an additional line of data; instructions to compare the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache; in response to determining the best matched line of data, instructions to compress the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and instructions to write the compressed line to the file; in response to not determining the best matched line of data, instructions to write the additional line of data to the file; and instructions to store the additional line of data in the cache. | A plurality of lines of data from a file are stored in a cache. The lines of data typically come from a file that is being compressed. The process gets an additional line of data to compress. Based on a compression level, the additional line of data is compared with the lines of data in the cache to determine if there is a best matched line of data from the plurality of lines in the cache. In response to determining the best matched line of data, the additional line of data is compressed with a first compression algorithm based on the best matched line of data to create a compressed line. The compressed line is written to the file. In response to not determining the best matched line of data, the additional line of data is written to the file. The additional line of data is stored in the cache.1. A method for compressing data, comprising:
storing a plurality of lines of data from a file in a cache; getting an additional line of data; comparing the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache; in response determining the best matched line of data, compressing the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and writing the compressed line to the file; in response to not determining the best matched line of data, writing the additional line of data to the file; and storing the additional line of data in the cache. 2. The method of claim 1, further comprising:
determining if the cache is full; and in response to the cache being full, deleting a least recently matched line of data from the cache. 3. The method of claim 1, wherein the file is a log file stored on a hard disk and the cache is a Random Access Memory (RAM) or a cache in a microprocessor. 4. The method of claim 1, wherein the first compression algorithm comprises:
comparing a repetition of characters in the additional line of data to the best matched line of data to identify a number of matched characters; and replacing the number of matched characters with an identifier representing the number of matched characters and a line number of the best matched line of data in the file. 5. The method of claim 4, wherein a plurality of repetitions of characters in the additional line of data are compared to the best matched line of data. 6. The method of claim 5, wherein the plurality of repetitions of characters in the additional line of data are compared to the best matched line of data and a second best matched line of data. 7. The method of claim 6, wherein the compressed line further comprises a line number of the second best matched line of data in the file. 8. The method of claim 1, further comprising applying a second compression algorithm to the compressed line before writing the compressed line to the file. 9. The method of claim 1, wherein at least one of the stored plurality of lines is a line of data in the file that is after the additional line of data. 10. The method of claim 1, wherein the additional line of data is processed in real-time when the additional line of data is generated by a logging module. 11. The method of claim 1, wherein the first compression algorithm compares software objects in an Input/Output (I/O) stream. 12. A system for compressing data, comprising:
a cache configured to store a plurality of lines of data from a file; and a compression module configured to get an additional line of data, compare the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache, compress the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and writing the compressed additional line of data to the file in response determining the best matched line of data, write the additional line of data to the file in response to not determining the best matched line of data, and store the additional line of data in the cache. 13. The system of claim 12, wherein the compression module is further configured to determine if the cache is full and delete a least recently matched line of data from the cache in response to the cache being full. 14. The system of claim 12, wherein the file is a log file stored on a hard disk and the cache is a Random Access Memory (RAM) or a cache in a microprocessor. 15. The system of claim 12, wherein the compression module is further configured to implement a compression algorithm that compares a repetition of characters in the additional line of data to the best matched line of data to identify a number of matched characters and replaces the number of matched characters with an identifier representing the number of matched characters and a line number of the best matched line of data in the file. 16. The system of claim 15, wherein the compression module compares a plurality of repetitions of characters in the additional line of data to the best matched line of data. 17. The system of claim 16, wherein compression module compares the plurality of repetitions of characters in the additional line of data to the best matched line of data and a second best matched line of data. 18. The system of claim 17, wherein the compressed line further comprises a line number of the second best matched line of data in the file. 19. The system of claim 12, wherein the additional line of data is processed in real-time when the additional line of data is generated by a logging module. 20. A non-transient computer readable medium having stored thereon instructions that cause a processor to execute a method, the method comprising:
instructions to store a plurality of lines of data from a file in a cache; instructions to get an additional line of data; instructions to compare the additional line of data with the stored plurality of lines of data in the cache to determine, based on a level of compression, if there is a best matched line of data from the plurality of lines of data in the cache; in response to determining the best matched line of data, instructions to compress the additional line of data with a first compression algorithm based on the best matched line of data to create a compressed line and instructions to write the compressed line to the file; in response to not determining the best matched line of data, instructions to write the additional line of data to the file; and instructions to store the additional line of data in the cache. | 2,100 |
5,434 | 5,434 | 15,420,373 | 2,191 | A system for a vehicle includes a controller configured to receive encrypted software updates including a first signature, decrypt the received software updates using a decryption key received with update instructions indicative of available software updates, and install the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key. | 1. A system for a vehicle comprising:
a controller configured to:
receive encrypted software updates including a first signature,
decrypt the received software updates using a decryption key received with update instructions indicative of available software updates, and
install the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key. 2. The system of claim 1, wherein the update instructions further include a vehicle identifier and the controller receives the encrypted signed software updates in response to detecting that the vehicle identifier matches stored identifier of the vehicle. 3. The system of claim 2, wherein the controller is further configured to disregard the update instructions and forego receiving the encrypted signed software updates in response to detecting that the vehicle identifier differs from the stored identifier of the vehicle. 4. The system of claim 1, wherein the controller is further configured to receive the signature verification key with the update instructions. 5. The system of claim 1, wherein the controller is further configured to receive the software updates from an update server configured to sign the software updates prior to sending the updates to the controller using a signature key corresponding to the signature verification key. 6. The system of claim 5, wherein the update server is further configured to encrypt the software updates using an encryption key prior to sending the updates to the controller. 7. A method for a vehicle comprising:
decrypting software updates, downloaded by a controller from an update server, using a decryption key received from the update server as a part of update instructions specifying the software updates and including a first signature; and installing the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key received from the update server. 8. The method of claim 7, wherein the update instructions further include a vehicle identifier and further comprising receiving the software updates in response to detecting that the vehicle identifier matches a vehicle identifier assigned to the vehicle. 9. The method of claim 8 further comprising disregarding the update instructions and foregoing the receiving of the encrypted signed software updates in response to detecting that the vehicle identifier differs from the identifier assigned to the vehicle. 10. The method of claim 7, wherein the signature verification key is generated by the update server. 11. The method of claim 7, wherein the encrypted signed software updates are received via a network connection with an update server configured to sign the software updates using a signature key prior to sending the updates. 12. The method of claim 11, wherein the update server is further configured to encrypt the software updates using an encryption key prior to sending the updates. 13. A system for a vehicle comprising:
a telematics controller configured to download, from an update server, software updates, to apply to a vehicle controller specified by instructions received by the telematics controller, responsive to detecting that a vehicle identifier included in the instructions matches a vehicle identifier assigned to the vehicle. 14. The system of claim 13, wherein the telematics controller is further configured to disregard the instructions and forego the downloading of the software updates in response to detecting that the received identifier differs from the assigned identifier. 15. The system of claim 13, wherein the instructions further include a decryption key for decrypting the downloaded software updates. 16. The system of claim 15, wherein the telematics controller is further configured to decrypt the downloaded software updates using the decryption key and send the decrypted software updates to a corresponding vehicle controller. 17. The system of claim 15, wherein the telematics controller is further configured to send the decryption key to a corresponding vehicle controller prior to the downloading of the software updates and, upon completion of the downloading, send the software updates to the corresponding vehicle controller. 18. The system of claim 17, wherein the vehicle controller is configured to decrypt the received software updates using the decryption key and install the decrypted software updates in response to detecting that a controller signature included with the received software updates matches a generated signature of the vehicle controller. | A system for a vehicle includes a controller configured to receive encrypted software updates including a first signature, decrypt the received software updates using a decryption key received with update instructions indicative of available software updates, and install the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key.1. A system for a vehicle comprising:
a controller configured to:
receive encrypted software updates including a first signature,
decrypt the received software updates using a decryption key received with update instructions indicative of available software updates, and
install the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key. 2. The system of claim 1, wherein the update instructions further include a vehicle identifier and the controller receives the encrypted signed software updates in response to detecting that the vehicle identifier matches stored identifier of the vehicle. 3. The system of claim 2, wherein the controller is further configured to disregard the update instructions and forego receiving the encrypted signed software updates in response to detecting that the vehicle identifier differs from the stored identifier of the vehicle. 4. The system of claim 1, wherein the controller is further configured to receive the signature verification key with the update instructions. 5. The system of claim 1, wherein the controller is further configured to receive the software updates from an update server configured to sign the software updates prior to sending the updates to the controller using a signature key corresponding to the signature verification key. 6. The system of claim 5, wherein the update server is further configured to encrypt the software updates using an encryption key prior to sending the updates to the controller. 7. A method for a vehicle comprising:
decrypting software updates, downloaded by a controller from an update server, using a decryption key received from the update server as a part of update instructions specifying the software updates and including a first signature; and installing the decrypted updates in response to detecting that the first signature matches a second signature generated by the controller using a signature verification key received from the update server. 8. The method of claim 7, wherein the update instructions further include a vehicle identifier and further comprising receiving the software updates in response to detecting that the vehicle identifier matches a vehicle identifier assigned to the vehicle. 9. The method of claim 8 further comprising disregarding the update instructions and foregoing the receiving of the encrypted signed software updates in response to detecting that the vehicle identifier differs from the identifier assigned to the vehicle. 10. The method of claim 7, wherein the signature verification key is generated by the update server. 11. The method of claim 7, wherein the encrypted signed software updates are received via a network connection with an update server configured to sign the software updates using a signature key prior to sending the updates. 12. The method of claim 11, wherein the update server is further configured to encrypt the software updates using an encryption key prior to sending the updates. 13. A system for a vehicle comprising:
a telematics controller configured to download, from an update server, software updates, to apply to a vehicle controller specified by instructions received by the telematics controller, responsive to detecting that a vehicle identifier included in the instructions matches a vehicle identifier assigned to the vehicle. 14. The system of claim 13, wherein the telematics controller is further configured to disregard the instructions and forego the downloading of the software updates in response to detecting that the received identifier differs from the assigned identifier. 15. The system of claim 13, wherein the instructions further include a decryption key for decrypting the downloaded software updates. 16. The system of claim 15, wherein the telematics controller is further configured to decrypt the downloaded software updates using the decryption key and send the decrypted software updates to a corresponding vehicle controller. 17. The system of claim 15, wherein the telematics controller is further configured to send the decryption key to a corresponding vehicle controller prior to the downloading of the software updates and, upon completion of the downloading, send the software updates to the corresponding vehicle controller. 18. The system of claim 17, wherein the vehicle controller is configured to decrypt the received software updates using the decryption key and install the decrypted software updates in response to detecting that a controller signature included with the received software updates matches a generated signature of the vehicle controller. | 2,100 |
5,435 | 5,435 | 13,360,594 | 2,124 | A system is provided for automatically notifying a user of predicted action. The system may be configured to monitor and observe a user's interactions with incoming data, identify patterns of actions the user may take in response to the incoming data and generate a notification associated with the action. A trainer component and a classifier component determine the probability a user may take a particular action and to make predictions of likely user actions based on the observations of the user. A notifier may communicate with the classifier to generate a particular user notification associated with a user action response generated by the classifier. The notifier component utilizes a logic device to compare the received user prediction from the classifier with a plurality of user notifications stored in a database. The notifier component sends the user notification to one or more user devices associated with a user. | 1. A method for generating an action-oriented user experience comprising:
receiving a predicted action response associated with incoming data, the predicted action response based on a pattern of actions associated with the received incoming data; assigning a user notification to the predicted action response; and sending the user notification to a user. 2. The method of claim 1 wherein sending the user notification comprises generating an auditory user experience to a device associated with a user. 3. The method of claim 1 wherein sending the user notification comprises generating a tactile user experience to a device associated with a user. 4. The method of claim 1 wherein sending the user notification comprises generating a visual user experience to a device associated with a user. 5. The method of claim 1 wherein the incoming data is received by a first user device and the sending the user notification is sent to a second user device different from the first user device. 6. The method of claim 1 assigning a temporal characteristic to the user notification and sending the user notification to a user based on the temporal characteristic. 7. The method of claim 1 further comprising:
automatically performing the predicted action response; and
sending the user notification after performing the predicted action response. 8. The method of claim 1 wherein the incoming data is in a first form and the user notification is in a second form different from the first form. 9. The method of claim 1 wherein assigning a user notification to the predicted action response further comprising:
comparing the predicted action response with a plurality of user notifications stored in a database; and
selecting at least one of the plurality of user notifications corresponding to the predicted response. 10. The method of claim 1 further comprising:
employing a notifier component for receiving the predicted action response associated with incoming data;
enabling the notifier component to determine the user notification based on the predicted action response; and
enabling the notifier component to send the user notification to the user to generate the user experience based on the user notification. 11. An apparatus comprising:
a logic device operative to receive a predicted action response associated with incoming data, to determine whether a user notification corresponds to the predicted action response and to send a user experience corresponding to the user notification to a user device, the predicted action response based on a pattern of user actions associated with the received incoming data. 12. The apparatus of claim 11 further comprising a memory communicating with the logic device, the memory configured to store a plurality of user notifications corresponding to the predicted action response, the logic device operative to access the memory to determine which of the plurality of user notifications correspond to the predicted action responses. 13. The apparatus of claim 12, wherein the user notification comprising a temporal indicator representing when the user experience corresponding to the user notification is sent by the logic device. 14. The apparatus of claim 11 wherein the user experience is an auditory response. 15. The apparatus of claim 11 wherein the user experience is a tactile response. 16. The apparatus of claim 11 wherein the user experience is a visual response. 17. An article comprising a computer readable storage medium containing instructions that when executed cause a system to:
receive a predicted action response associated with incoming data, the predicted action response based on a pattern of actions associated with the received incoming data; assign a user notification to the predicted action response; and send the user notification to a user. 18. The article of claim 17 further comprising instructions that when executed cause a system to compare the received predicted action response with a plurality of user notifications corresponding to the predicted action response. 19. The article of claim 18 further comprising instructions that when executed cause a system to select at least one of the plurality of user notifications corresponding to the received predicted action response. 20. The article of claim 17 further comprising instructions that when executed cause a system to receive the incoming data is a first form and send the user notification to a user in a second form different from the first form. | A system is provided for automatically notifying a user of predicted action. The system may be configured to monitor and observe a user's interactions with incoming data, identify patterns of actions the user may take in response to the incoming data and generate a notification associated with the action. A trainer component and a classifier component determine the probability a user may take a particular action and to make predictions of likely user actions based on the observations of the user. A notifier may communicate with the classifier to generate a particular user notification associated with a user action response generated by the classifier. The notifier component utilizes a logic device to compare the received user prediction from the classifier with a plurality of user notifications stored in a database. The notifier component sends the user notification to one or more user devices associated with a user.1. A method for generating an action-oriented user experience comprising:
receiving a predicted action response associated with incoming data, the predicted action response based on a pattern of actions associated with the received incoming data; assigning a user notification to the predicted action response; and sending the user notification to a user. 2. The method of claim 1 wherein sending the user notification comprises generating an auditory user experience to a device associated with a user. 3. The method of claim 1 wherein sending the user notification comprises generating a tactile user experience to a device associated with a user. 4. The method of claim 1 wherein sending the user notification comprises generating a visual user experience to a device associated with a user. 5. The method of claim 1 wherein the incoming data is received by a first user device and the sending the user notification is sent to a second user device different from the first user device. 6. The method of claim 1 assigning a temporal characteristic to the user notification and sending the user notification to a user based on the temporal characteristic. 7. The method of claim 1 further comprising:
automatically performing the predicted action response; and
sending the user notification after performing the predicted action response. 8. The method of claim 1 wherein the incoming data is in a first form and the user notification is in a second form different from the first form. 9. The method of claim 1 wherein assigning a user notification to the predicted action response further comprising:
comparing the predicted action response with a plurality of user notifications stored in a database; and
selecting at least one of the plurality of user notifications corresponding to the predicted response. 10. The method of claim 1 further comprising:
employing a notifier component for receiving the predicted action response associated with incoming data;
enabling the notifier component to determine the user notification based on the predicted action response; and
enabling the notifier component to send the user notification to the user to generate the user experience based on the user notification. 11. An apparatus comprising:
a logic device operative to receive a predicted action response associated with incoming data, to determine whether a user notification corresponds to the predicted action response and to send a user experience corresponding to the user notification to a user device, the predicted action response based on a pattern of user actions associated with the received incoming data. 12. The apparatus of claim 11 further comprising a memory communicating with the logic device, the memory configured to store a plurality of user notifications corresponding to the predicted action response, the logic device operative to access the memory to determine which of the plurality of user notifications correspond to the predicted action responses. 13. The apparatus of claim 12, wherein the user notification comprising a temporal indicator representing when the user experience corresponding to the user notification is sent by the logic device. 14. The apparatus of claim 11 wherein the user experience is an auditory response. 15. The apparatus of claim 11 wherein the user experience is a tactile response. 16. The apparatus of claim 11 wherein the user experience is a visual response. 17. An article comprising a computer readable storage medium containing instructions that when executed cause a system to:
receive a predicted action response associated with incoming data, the predicted action response based on a pattern of actions associated with the received incoming data; assign a user notification to the predicted action response; and send the user notification to a user. 18. The article of claim 17 further comprising instructions that when executed cause a system to compare the received predicted action response with a plurality of user notifications corresponding to the predicted action response. 19. The article of claim 18 further comprising instructions that when executed cause a system to select at least one of the plurality of user notifications corresponding to the received predicted action response. 20. The article of claim 17 further comprising instructions that when executed cause a system to receive the incoming data is a first form and send the user notification to a user in a second form different from the first form. | 2,100 |
5,436 | 5,436 | 11,876,953 | 2,158 | Roll back strategies for database deadlock resolution are customized by identifying a first transaction to a database, identifying a second transaction to the database and detecting a deadlock between the first and second transactions with respect to the database. The deadlock is resolved based upon a predetermined roll back strategy associated with at least one of the first or second transactions to identify a select one of the first and second transactions for roll back and a request is conveyed to roll back the selected one of the first and second transactions, wherein the preferred transaction is allowed to continue processing. | 1. A method of implementing database deadlock resolution using custom roll back strategies comprising:
identifying a first transaction with a database; identifying a second transaction with said database; detecting a deadlock between said first and second transactions with respect to said database; resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back; and conveying a request to roll back said selected remainder one of said first and second transactions, wherein said preferred one of said first and second transactions can continue processing. 2. The method according to claim 1, further comprising:
specifying said roll back strategy in transaction metadata. 3. The method according to claim 2, wherein said specifying said roll back strategy in transaction metadata comprises:
specifying one of at least two different metadata types where each metadata type is associated with a corresponding priority. 4. The method according to claim 1, further comprising:
specifying said roll back strategy in metadata using an applications programming interface. 5. The method according to claim 1, wherein said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back comprises:
identifying a first roll back strategy associated with said first transaction if it exists; identifying a second roll back strategy associated with said second transaction if it exists; and evaluating said first and second roll back strategies to determine a priority between said first and second transactions. 6. The method according to claim 5, wherein said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back further comprises:
considering the number of locks associated with each of said first and second transactions if said deadlock cannot be resolved based upon said first and second roll back strategies. 7. The method according to claim 5, wherein:
said identifying a first roll back strategy associated with said first transaction comprises identifying whether said first transaction should yield or not yield to other transactions; and said identifying a second roll back strategy associated with said second transaction comprises identifying whether said second transaction should yield or not yield to other transactions. 8. The method according to claim 1, wherein:
said detecting a deadlock between said first and second transactions with respect to said database further comprises identifying at least one additional transaction to said database that is deadlocked with said first and second transactions; said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back further comprises defining said predetermined roll back strategy to include multiple priorities so as to identify a preferred one transaction to maintain priority to access said database; and conveying a request to roll back said selected remainder one of said first and second transactions further comprises conveying a request to roll back each deadlocked transaction except for said preferred one transaction. 9. A method of implementing database deadlock resolution using custom roll back strategies comprising:
providing a database configured to allow multiple simultaneous transactions to access information therein, said database capable of assigning locks to transactions that restrict access to locked information to a single transaction; and providing a database deadlock resolution module coupled to said database, said database deadlock resolution module configured when executed, for:
identifying a first transaction with said database;
identifying a second transaction with said database;
detecting a deadlock between said first and second transactions with respect to said database;
resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back; and
conveying a request to roll back said selected remainder one of said first and second transactions, wherein said preferred one of said first and second transactions can continue processing. 10. The method according to claim 8, wherein said resolving said deadlock based upon a predetermined roll back strategy comprises deriving said roll back strategy from transaction metadata. 11. The method according to claim 10, wherein said deriving said roll back strategy from transaction metadata comprises:
specifying one of at least two different metadata types where each metadata type is associated with a corresponding priority. 12. The method according to claim 11, further comprising:
storing said different metadata types in a behavior matrix that specifies for various combinations of rollback strategy metadata, a corresponding deadlock outcome. 13. The method according to claim 10, further comprising providing an applications programming interface to specify said roll back strategy in transaction metadata using. 14. The method according to claim 9, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying a first roll back strategy associated with said first transaction if it exists;
identifying a second roll back strategy associated with said second transaction if it exists; and
evaluating said first and second roll back strategies to determine a priority between said first and second transactions. 15. The method according to claim 14, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
considering the number of locks associated with each of said first and second transactions if said deadlock cannot be resolved based upon said first and second roll back strategies. 16. The method according to claim 14, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying whether said first transaction should yield or not yield to other transactions; and
identifying whether said second transaction should yield or not yield to other transactions. 17. The method according to claim 9, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying at least one additional transaction to said database that is deadlocked with said first and second transactions;
defining said predetermined roll back strategy to include multiple priorities so as to identify a preferred one transaction to maintain priority to access said database; and
conveying a request to roll back each deadlocked transaction except for said preferred one transaction. | Roll back strategies for database deadlock resolution are customized by identifying a first transaction to a database, identifying a second transaction to the database and detecting a deadlock between the first and second transactions with respect to the database. The deadlock is resolved based upon a predetermined roll back strategy associated with at least one of the first or second transactions to identify a select one of the first and second transactions for roll back and a request is conveyed to roll back the selected one of the first and second transactions, wherein the preferred transaction is allowed to continue processing.1. A method of implementing database deadlock resolution using custom roll back strategies comprising:
identifying a first transaction with a database; identifying a second transaction with said database; detecting a deadlock between said first and second transactions with respect to said database; resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back; and conveying a request to roll back said selected remainder one of said first and second transactions, wherein said preferred one of said first and second transactions can continue processing. 2. The method according to claim 1, further comprising:
specifying said roll back strategy in transaction metadata. 3. The method according to claim 2, wherein said specifying said roll back strategy in transaction metadata comprises:
specifying one of at least two different metadata types where each metadata type is associated with a corresponding priority. 4. The method according to claim 1, further comprising:
specifying said roll back strategy in metadata using an applications programming interface. 5. The method according to claim 1, wherein said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back comprises:
identifying a first roll back strategy associated with said first transaction if it exists; identifying a second roll back strategy associated with said second transaction if it exists; and evaluating said first and second roll back strategies to determine a priority between said first and second transactions. 6. The method according to claim 5, wherein said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back further comprises:
considering the number of locks associated with each of said first and second transactions if said deadlock cannot be resolved based upon said first and second roll back strategies. 7. The method according to claim 5, wherein:
said identifying a first roll back strategy associated with said first transaction comprises identifying whether said first transaction should yield or not yield to other transactions; and said identifying a second roll back strategy associated with said second transaction comprises identifying whether said second transaction should yield or not yield to other transactions. 8. The method according to claim 1, wherein:
said detecting a deadlock between said first and second transactions with respect to said database further comprises identifying at least one additional transaction to said database that is deadlocked with said first and second transactions; said resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back further comprises defining said predetermined roll back strategy to include multiple priorities so as to identify a preferred one transaction to maintain priority to access said database; and conveying a request to roll back said selected remainder one of said first and second transactions further comprises conveying a request to roll back each deadlocked transaction except for said preferred one transaction. 9. A method of implementing database deadlock resolution using custom roll back strategies comprising:
providing a database configured to allow multiple simultaneous transactions to access information therein, said database capable of assigning locks to transactions that restrict access to locked information to a single transaction; and providing a database deadlock resolution module coupled to said database, said database deadlock resolution module configured when executed, for:
identifying a first transaction with said database;
identifying a second transaction with said database;
detecting a deadlock between said first and second transactions with respect to said database;
resolving said deadlock based upon a predetermined roll back strategy associated with at least one of said first or second transactions to identify a preferred one of said first and second transactions for continued database processing and to select a remainder one of said first and second transactions for roll back; and
conveying a request to roll back said selected remainder one of said first and second transactions, wherein said preferred one of said first and second transactions can continue processing. 10. The method according to claim 8, wherein said resolving said deadlock based upon a predetermined roll back strategy comprises deriving said roll back strategy from transaction metadata. 11. The method according to claim 10, wherein said deriving said roll back strategy from transaction metadata comprises:
specifying one of at least two different metadata types where each metadata type is associated with a corresponding priority. 12. The method according to claim 11, further comprising:
storing said different metadata types in a behavior matrix that specifies for various combinations of rollback strategy metadata, a corresponding deadlock outcome. 13. The method according to claim 10, further comprising providing an applications programming interface to specify said roll back strategy in transaction metadata using. 14. The method according to claim 9, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying a first roll back strategy associated with said first transaction if it exists;
identifying a second roll back strategy associated with said second transaction if it exists; and
evaluating said first and second roll back strategies to determine a priority between said first and second transactions. 15. The method according to claim 14, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
considering the number of locks associated with each of said first and second transactions if said deadlock cannot be resolved based upon said first and second roll back strategies. 16. The method according to claim 14, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying whether said first transaction should yield or not yield to other transactions; and
identifying whether said second transaction should yield or not yield to other transactions. 17. The method according to claim 9, wherein said providing a database deadlock resolution module further comprises:
configuring said database deadlock resolution module, when executed, for:
identifying at least one additional transaction to said database that is deadlocked with said first and second transactions;
defining said predetermined roll back strategy to include multiple priorities so as to identify a preferred one transaction to maintain priority to access said database; and
conveying a request to roll back each deadlocked transaction except for said preferred one transaction. | 2,100 |
5,437 | 5,437 | 14,856,393 | 2,182 | A method implements fixed-point polynomials in hardware logic. In an embodiment the method comprises distributing a defined error bound for the whole polynomial between operators in a data-flow graph for the polynomial and optimizing each operator to satisfy the part of the error bound allocated to that operator. The distribution of errors between operators is updated in an iterative process until a stop condition (such as a maximum number of iterations) is reached. | 1. A method of generating an implementation of a fixed-point polynomial with rational coefficients in hardware logic that satisfies a defined error bound, the method comprising:
receiving, in the hardware logic, the polynomial as a data-flow graph comprising one or more nodes, wherein each node is either a sum-of-products operator or a constant division operator; computing, in the hardware logic, an error bound for each node in the data-flow graph based on the defined error bound for the polynomial; optimizing, in the hardware logic, a single summation array for each node using a truncation scheme and the error bound for each node; calculating, in the hardware logic, an updated error bound for each node in the data-flow graph, wherein the calculating of updated error bounds redistributes error bounds between nodes to allow for synthesis of the fixed-point polynomial with a reduced physical size whilst satisfying the defined error bound; and further optimizing, in the hardware logic, the single summation array for each node using the truncation scheme and the updated error bound for the node. 2. The method according to claim 1, further comprising:
inputting RTL generated by the method of claim 1 to a logic synthesizer to produce, in the hardware logic, a gate level description of the implementation of the fixed-point polynomial. 3. The method according to claim 1, further comprising:
fabricating the implementation of the fixed-point polynomial in silicon. 4. The method according to claim 1, further comprising repeating:
calculating, in the hardware logic, an updated error bound for each node in the data-flow graph; and further optimizing, in the hardware logic, the single summation array for each node using the truncation scheme and the updated error bound for the node, until a stop condition is reached, the stop condition comprising one of: a maximum iteration count is reached; a maximum runtime is reached; and the updated error bound for each node calculated in an iteration is the same as the updated error bound for each node calculated in an immediately previous iteration, wherein the single summation array which is optimized in an iteration is the single summation array generated, in the hardware logic, by the optimization in the immediately previous iteration. 5. The method according to claim 1, wherein optimizing a single summation array for each node using a truncation scheme and the error bound for the node comprises:
calculating, in the hardware logic, a parameter k for each node, wherein: for a node which is a sum-of-products operator, the parameter k is a number of whole columns in the single summation array that can be removed whilst satisfying the error bound for the node; and for a node which is a constant division operator, the parameter k is a number of bits by which an output from the node is right shifted when the constant division operation is implemented as a sum-of-products operation followed by a right shift by k bits. 6. The method according to claim 5, wherein optimizing a single summation array for each node using a truncation scheme and the error bound for the node further comprises:
calculating, in the hardware logic, an updated input bit width for each node. 7. The method according to claim 5, wherein calculating an updated error bound for each node in the data-flow graph comprises:
calculating, in the hardware logic, for each node, a rate of change of a number of bits removed from the single summation array for node with respect to a change in error bound for the node. 8. The method according to claim 7, wherein the fixed-point polynomial is linear with respect to actual errors introduced by each node and wherein the rate of change of a number of bits removed from the single summation array for node j with respect to a change in error bound for the node,
∂
R
j
∂
e
i
,
comprises:
for a node j which is a sum-of-products operator:
∂
R
j
∂
e
i
=
{
1
2
k
j
-
1
,
j
=
i
0
,
otherwise
where kj is the parameter k for the node; and
for a node j which is a constant division operator:
∂
R
j
∂
e
i
=
{
n
q
,
i
2
e
i
j
=
i
and
codn
holds
0
j
=
i
and
cond
does
not
hold
n
i
,
j
2
e
i
otherwise
cond
=
(
2
k
i
-
1
(
∓
2
k
i
-
1
)
mod
d
i
>
⌊
2
n
q
,
i
-
r
i
-
1
d
i
⌋
)
where nq,i is an input bit width into the node, ei is the error bound for node i and ei=ui2r i and uiε[1,2). 9. The method according to claim 5, wherein the fixed-point polynomial is linear with respect to actual errors introduced by each node and wherein computing an error bound for each node in the data-flow graph based on the defined error bound for the polynomial comprises:
setting, in the hardware logic, an error for a node i to a value ei where ei=η/(λ i n), η is the defined error bound for the polynomial and λi is a maximum absolute value of a coefficient at node i. 10. The method according to claim 9, wherein calculating an updated error bound for each node in the data-flow graph comprises updating, in the hardware logic, a value ei at node i to a value given by:
η
e
j
∑
i
∂
R
i
∂
e
j
λ
j
∑
i
,
j
e
j
∂
R
i
∂
e
j
where Ri is a number of bits removed from the single summation array at node i when optimizing node i using a truncation scheme and the error bound ei for the node i, λj is a maximum absolute value of a coefficient at node j and ej is the error bound for the node j. 11. The method according to claim 5, wherein the fixed-point polynomial is non-linear with respect to actual errors introduced by each node and wherein computing an error bound for each node in the data-flow graph based on the defined error bound for the polynomial comprises solving, in the hardware logic, the following equations via Grobner bases:
∑
α
λ
α
e
j
∂
e
α
∂
e
j
=
T
for
all
j
∑
α
λ
α
e
α
=
η
wherein T is a constant, λα=maxx|cα(x)| and eα is an error bound term associated with cα(x). 12. The method according to claim 11, wherein calculating an updated error bound for each node in the data-flow graph comprises updating a value ej at node j to a value fj given by solving, in the hardware logic, the following equations using Grobner bases:
f
j
∑
α
λ
α
∂
f
α
∂
f
j
=
Te
j
∑
i
∂
R
i
∂
e
j
for
all
j
∑
α
λ
α
f
α
=
η
. 13. The method according to claim 1, further comprising:
generating, in the hardware logic, a second implementation of the fixed-point polynomial with rational coefficients in hardware logic that satisfies the defined error bounding using the method according to claim 1; and using, in the hardware logic, a heuristic hardware cost function to compare the implementations. 14. The method according to claim 13, further comprising:
in response to the comparison, selecting, in the hardware logic, one of the implementations in hardware logic; and inputting RTL for the selected implementation to a logic synthesizer to produce a gate level description of the implementation of the fixed-point polynomial. 15. The method according to claim 14, further comprising:
fabricating, in the hardware logic, the selected implementation of the fixed-point polynomial in silicon. 16. The method according to claim 13, wherein the heuristic hardware cost function for an arbitrary binary array, with width w, height h and a number pp of bits in the array is given by:
area
(
array
(
h
,
w
,
pp
)
)
≈
7
pp
(
1
-
(
2
3
)
f
)
+
w
2
(
3
⌈
log
2
w
⌉
+
11
)
where
f
=
⌈
log
2
h
-
1
log
2
3
-
1
⌉ 17. An apparatus configured to perform lossy synthesis of a fixed-point polynomial with rational coefficients and generate an implementation of the fixed-point polynomial in RTL, the apparatus comprising:
a processor; and a memory comprising computer executable instructions which, when executed, cause the processor to: receive the polynomial as a data-flow graph comprising one or more nodes, wherein each node is either a sum-of-products operator or a constant division operator; compute an error bound for each node in the data-flow graph based on the defined error bound for the polynomial; optimize a single summation array for each node using a truncation scheme and the error bound for each node; calculate an updated error bound for each node in the data-flow graph, wherein the calculating of updated error bounds redistributes error bounds between nodes to allow for synthesis of the fixed-point polynomial with a reduced physical size whilst satisfying the defined error bound; and further optimize the single summation array for each node using the truncation scheme and the updated error bound for the node. 18. An apparatus configured to compare two or more array summations when implemented in hardware logic, the apparatus comprising:
a processor; and a memory comprising computer executable instructions which, when executed, cause the processor to: receive RTL data describing the two or more array summations; and calculating, for each array summation, a cost function using:
area
(
array
(
h
,
w
,
pp
)
)
≈
7
pp
(
1
-
(
2
3
)
f
)
+
w
2
(
2
⌈
log
2
w
⌉
+
11
)
where
f
=
⌈
log
2
h
-
1
log
2
3
-
1
⌉
where w is a width of the array, h is a height of the array and pp is a number of bits in the array,
wherein the cost functions calculated for each array summation provide for several candidate RTL implementations to be compared and an RTL implementation with an optimal cost function to be selected for implementation in hardware. 19. The apparatus according to claim 18, wherein the memory further comprises computer executable instructions which, when executed, cause the processor to:
select one of the array summations with a lowest value of the cost function; and input RTL for the selected array summation to a logic synthesizer to produce a gate level description of the array summation. | A method implements fixed-point polynomials in hardware logic. In an embodiment the method comprises distributing a defined error bound for the whole polynomial between operators in a data-flow graph for the polynomial and optimizing each operator to satisfy the part of the error bound allocated to that operator. The distribution of errors between operators is updated in an iterative process until a stop condition (such as a maximum number of iterations) is reached.1. A method of generating an implementation of a fixed-point polynomial with rational coefficients in hardware logic that satisfies a defined error bound, the method comprising:
receiving, in the hardware logic, the polynomial as a data-flow graph comprising one or more nodes, wherein each node is either a sum-of-products operator or a constant division operator; computing, in the hardware logic, an error bound for each node in the data-flow graph based on the defined error bound for the polynomial; optimizing, in the hardware logic, a single summation array for each node using a truncation scheme and the error bound for each node; calculating, in the hardware logic, an updated error bound for each node in the data-flow graph, wherein the calculating of updated error bounds redistributes error bounds between nodes to allow for synthesis of the fixed-point polynomial with a reduced physical size whilst satisfying the defined error bound; and further optimizing, in the hardware logic, the single summation array for each node using the truncation scheme and the updated error bound for the node. 2. The method according to claim 1, further comprising:
inputting RTL generated by the method of claim 1 to a logic synthesizer to produce, in the hardware logic, a gate level description of the implementation of the fixed-point polynomial. 3. The method according to claim 1, further comprising:
fabricating the implementation of the fixed-point polynomial in silicon. 4. The method according to claim 1, further comprising repeating:
calculating, in the hardware logic, an updated error bound for each node in the data-flow graph; and further optimizing, in the hardware logic, the single summation array for each node using the truncation scheme and the updated error bound for the node, until a stop condition is reached, the stop condition comprising one of: a maximum iteration count is reached; a maximum runtime is reached; and the updated error bound for each node calculated in an iteration is the same as the updated error bound for each node calculated in an immediately previous iteration, wherein the single summation array which is optimized in an iteration is the single summation array generated, in the hardware logic, by the optimization in the immediately previous iteration. 5. The method according to claim 1, wherein optimizing a single summation array for each node using a truncation scheme and the error bound for the node comprises:
calculating, in the hardware logic, a parameter k for each node, wherein: for a node which is a sum-of-products operator, the parameter k is a number of whole columns in the single summation array that can be removed whilst satisfying the error bound for the node; and for a node which is a constant division operator, the parameter k is a number of bits by which an output from the node is right shifted when the constant division operation is implemented as a sum-of-products operation followed by a right shift by k bits. 6. The method according to claim 5, wherein optimizing a single summation array for each node using a truncation scheme and the error bound for the node further comprises:
calculating, in the hardware logic, an updated input bit width for each node. 7. The method according to claim 5, wherein calculating an updated error bound for each node in the data-flow graph comprises:
calculating, in the hardware logic, for each node, a rate of change of a number of bits removed from the single summation array for node with respect to a change in error bound for the node. 8. The method according to claim 7, wherein the fixed-point polynomial is linear with respect to actual errors introduced by each node and wherein the rate of change of a number of bits removed from the single summation array for node j with respect to a change in error bound for the node,
∂
R
j
∂
e
i
,
comprises:
for a node j which is a sum-of-products operator:
∂
R
j
∂
e
i
=
{
1
2
k
j
-
1
,
j
=
i
0
,
otherwise
where kj is the parameter k for the node; and
for a node j which is a constant division operator:
∂
R
j
∂
e
i
=
{
n
q
,
i
2
e
i
j
=
i
and
codn
holds
0
j
=
i
and
cond
does
not
hold
n
i
,
j
2
e
i
otherwise
cond
=
(
2
k
i
-
1
(
∓
2
k
i
-
1
)
mod
d
i
>
⌊
2
n
q
,
i
-
r
i
-
1
d
i
⌋
)
where nq,i is an input bit width into the node, ei is the error bound for node i and ei=ui2r i and uiε[1,2). 9. The method according to claim 5, wherein the fixed-point polynomial is linear with respect to actual errors introduced by each node and wherein computing an error bound for each node in the data-flow graph based on the defined error bound for the polynomial comprises:
setting, in the hardware logic, an error for a node i to a value ei where ei=η/(λ i n), η is the defined error bound for the polynomial and λi is a maximum absolute value of a coefficient at node i. 10. The method according to claim 9, wherein calculating an updated error bound for each node in the data-flow graph comprises updating, in the hardware logic, a value ei at node i to a value given by:
η
e
j
∑
i
∂
R
i
∂
e
j
λ
j
∑
i
,
j
e
j
∂
R
i
∂
e
j
where Ri is a number of bits removed from the single summation array at node i when optimizing node i using a truncation scheme and the error bound ei for the node i, λj is a maximum absolute value of a coefficient at node j and ej is the error bound for the node j. 11. The method according to claim 5, wherein the fixed-point polynomial is non-linear with respect to actual errors introduced by each node and wherein computing an error bound for each node in the data-flow graph based on the defined error bound for the polynomial comprises solving, in the hardware logic, the following equations via Grobner bases:
∑
α
λ
α
e
j
∂
e
α
∂
e
j
=
T
for
all
j
∑
α
λ
α
e
α
=
η
wherein T is a constant, λα=maxx|cα(x)| and eα is an error bound term associated with cα(x). 12. The method according to claim 11, wherein calculating an updated error bound for each node in the data-flow graph comprises updating a value ej at node j to a value fj given by solving, in the hardware logic, the following equations using Grobner bases:
f
j
∑
α
λ
α
∂
f
α
∂
f
j
=
Te
j
∑
i
∂
R
i
∂
e
j
for
all
j
∑
α
λ
α
f
α
=
η
. 13. The method according to claim 1, further comprising:
generating, in the hardware logic, a second implementation of the fixed-point polynomial with rational coefficients in hardware logic that satisfies the defined error bounding using the method according to claim 1; and using, in the hardware logic, a heuristic hardware cost function to compare the implementations. 14. The method according to claim 13, further comprising:
in response to the comparison, selecting, in the hardware logic, one of the implementations in hardware logic; and inputting RTL for the selected implementation to a logic synthesizer to produce a gate level description of the implementation of the fixed-point polynomial. 15. The method according to claim 14, further comprising:
fabricating, in the hardware logic, the selected implementation of the fixed-point polynomial in silicon. 16. The method according to claim 13, wherein the heuristic hardware cost function for an arbitrary binary array, with width w, height h and a number pp of bits in the array is given by:
area
(
array
(
h
,
w
,
pp
)
)
≈
7
pp
(
1
-
(
2
3
)
f
)
+
w
2
(
3
⌈
log
2
w
⌉
+
11
)
where
f
=
⌈
log
2
h
-
1
log
2
3
-
1
⌉ 17. An apparatus configured to perform lossy synthesis of a fixed-point polynomial with rational coefficients and generate an implementation of the fixed-point polynomial in RTL, the apparatus comprising:
a processor; and a memory comprising computer executable instructions which, when executed, cause the processor to: receive the polynomial as a data-flow graph comprising one or more nodes, wherein each node is either a sum-of-products operator or a constant division operator; compute an error bound for each node in the data-flow graph based on the defined error bound for the polynomial; optimize a single summation array for each node using a truncation scheme and the error bound for each node; calculate an updated error bound for each node in the data-flow graph, wherein the calculating of updated error bounds redistributes error bounds between nodes to allow for synthesis of the fixed-point polynomial with a reduced physical size whilst satisfying the defined error bound; and further optimize the single summation array for each node using the truncation scheme and the updated error bound for the node. 18. An apparatus configured to compare two or more array summations when implemented in hardware logic, the apparatus comprising:
a processor; and a memory comprising computer executable instructions which, when executed, cause the processor to: receive RTL data describing the two or more array summations; and calculating, for each array summation, a cost function using:
area
(
array
(
h
,
w
,
pp
)
)
≈
7
pp
(
1
-
(
2
3
)
f
)
+
w
2
(
2
⌈
log
2
w
⌉
+
11
)
where
f
=
⌈
log
2
h
-
1
log
2
3
-
1
⌉
where w is a width of the array, h is a height of the array and pp is a number of bits in the array,
wherein the cost functions calculated for each array summation provide for several candidate RTL implementations to be compared and an RTL implementation with an optimal cost function to be selected for implementation in hardware. 19. The apparatus according to claim 18, wherein the memory further comprises computer executable instructions which, when executed, cause the processor to:
select one of the array summations with a lowest value of the cost function; and input RTL for the selected array summation to a logic synthesizer to produce a gate level description of the array summation. | 2,100 |
5,438 | 5,438 | 14,855,687 | 2,139 | There is provided an apparatus comprising power state determination circuitry to determine a power state of a processing circuit; and control circuitry to issue a control signal relating to an item of data stored in a first storage circuitry. When the power state of the processing circuit is a predetermined state, the control circuitry issues a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry. | 1. An apparatus comprising:
power state determination circuitry to determine a power state of a processing circuit; and control circuitry to issue a control signal relating to an item of data stored in a first storage circuitry, wherein when the power state of the processing circuit is a predetermined state, the control circuitry issues a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry. 2. An apparatus according to claim 1, wherein
values of the power state include two or more of: normal, wait for interrupt, retention, powerdown, and cluster powerdown. 3. An apparatus according to claim 2, wherein
the control signal corresponds with an operation to remove the item of data from the first storage circuitry; and the first storage circuitry and the second storage circuitry are private to the processing circuit. 4. An apparatus according to claim 3, wherein
the further control signal indicates that the item of data is to be retained by the second storage circuitry; and the predetermined state is normal, wait for interrupt or retention. 5. An apparatus according to claim 3, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is powerdown or cluster powerdown. 6. An apparatus according to claim 2, wherein
the control signal corresponds with a response to a snoop operation issued from a further processing circuit, to access the item of data from the first storage circuitry; and the first storage circuitry is the second storage circuitry, which is private to the processing circuit. 7. An apparatus according to claim 6, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is powerdown or cluster powerdown. 8. An apparatus according to claim 7, wherein
when the power state of the processing circuit is the predetermined state, the control circuitry issues a still further control signal to shared storage circuitry; the shared storage circuitry is shared by the processing circuit and the further processing circuit; and the still further control signal indicates that the item of data is to be retained by the shared storage circuitry. 9. An apparatus according to claim 6, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is wait for interrupt or retention. 10. An apparatus according to claim 6, wherein
the predetermined state is wait for interrupt or retention; and the value of the further control signal indicates whether or not the item of data is to be retained by the second storage circuitry in further dependence on how recently the item of data has been accessed from the second storage circuitry. 11. An apparatus according to claim 6, wherein
the predetermined state is wait for interrupt or retention; and the value of the further control signal indicates whether or not the item of data is to be retained by the second storage circuitry in further dependence on how long the processing circuit has had the power state. 12. An apparatus according to claim 6, wherein
the predetermined state is normal; and the value of the further control signal indicates that the item of data is to be retained by the second storage circuitry. 13. An apparatus according to claim 2, wherein
the control signal corresponds with an operation to remove the item of data from the first storage circuitry; the first storage circuitry is private to the processing circuit; the power state determination circuitry is to determine a power state of a plurality of processing circuits, including the processing circuit; the value of the further control signal is based on the power state of the plurality of processing circuits; and the second storage circuitry is shared by the plurality of processing circuits. 14. An apparatus according to claim 13, wherein
the value of the further control signal indicates the item of data is not to be retained by the second storage circuitry when at least a predefined proportion of the plurality of processing circuits, including the processing circuit, have a power state of powerdown. 15. An apparatus according to claim 13, wherein
the predetermined power state is cluster powerdown; and the value of the further control signal indicates the item of data is not to be retained by the second storage circuitry. 16. An apparatus according to claim 13, wherein
the predetermined power state is normal, wait for interrupt or retention and the value of the further control signal indicates that the item of data is to be retained by the second storage circuitry. 17. An apparatus according to claim 1, wherein
in response to the second storage circuitry receiving the further control signal indicating that the data is to be retained and the data being absent from the second storage circuitry, the second storage circuitry stores the data. 18. An apparatus according to claim 1, wherein
in response to the second storage circuitry receiving the further control signal indicating that the data is not to be retained and the data being stored in the second storage circuitry, the data is removed from the second storage circuitry. 19. An apparatus according to claim 1, wherein
the first storage circuitry and the second storage circuitry form a cache hierarchy; and the second storage circuitry is at a higher level of the cache hierarchy than the first storage circuitry. 20. An apparatus according to claim 1, wherein
the power state is an intended power state. 21. A method of operating an apparatus, the method comprising the steps:
determining a power state of a processing circuit; and issuing a control signal relating to an item of data stored in a first storage circuitry, wherein when the power state of the processing circuit is a predetermined state, issuing a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry. | There is provided an apparatus comprising power state determination circuitry to determine a power state of a processing circuit; and control circuitry to issue a control signal relating to an item of data stored in a first storage circuitry. When the power state of the processing circuit is a predetermined state, the control circuitry issues a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry.1. An apparatus comprising:
power state determination circuitry to determine a power state of a processing circuit; and control circuitry to issue a control signal relating to an item of data stored in a first storage circuitry, wherein when the power state of the processing circuit is a predetermined state, the control circuitry issues a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry. 2. An apparatus according to claim 1, wherein
values of the power state include two or more of: normal, wait for interrupt, retention, powerdown, and cluster powerdown. 3. An apparatus according to claim 2, wherein
the control signal corresponds with an operation to remove the item of data from the first storage circuitry; and the first storage circuitry and the second storage circuitry are private to the processing circuit. 4. An apparatus according to claim 3, wherein
the further control signal indicates that the item of data is to be retained by the second storage circuitry; and the predetermined state is normal, wait for interrupt or retention. 5. An apparatus according to claim 3, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is powerdown or cluster powerdown. 6. An apparatus according to claim 2, wherein
the control signal corresponds with a response to a snoop operation issued from a further processing circuit, to access the item of data from the first storage circuitry; and the first storage circuitry is the second storage circuitry, which is private to the processing circuit. 7. An apparatus according to claim 6, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is powerdown or cluster powerdown. 8. An apparatus according to claim 7, wherein
when the power state of the processing circuit is the predetermined state, the control circuitry issues a still further control signal to shared storage circuitry; the shared storage circuitry is shared by the processing circuit and the further processing circuit; and the still further control signal indicates that the item of data is to be retained by the shared storage circuitry. 9. An apparatus according to claim 6, wherein
the further control signal indicates that the item of data is not to be retained by the second storage circuitry; and the predetermined state is wait for interrupt or retention. 10. An apparatus according to claim 6, wherein
the predetermined state is wait for interrupt or retention; and the value of the further control signal indicates whether or not the item of data is to be retained by the second storage circuitry in further dependence on how recently the item of data has been accessed from the second storage circuitry. 11. An apparatus according to claim 6, wherein
the predetermined state is wait for interrupt or retention; and the value of the further control signal indicates whether or not the item of data is to be retained by the second storage circuitry in further dependence on how long the processing circuit has had the power state. 12. An apparatus according to claim 6, wherein
the predetermined state is normal; and the value of the further control signal indicates that the item of data is to be retained by the second storage circuitry. 13. An apparatus according to claim 2, wherein
the control signal corresponds with an operation to remove the item of data from the first storage circuitry; the first storage circuitry is private to the processing circuit; the power state determination circuitry is to determine a power state of a plurality of processing circuits, including the processing circuit; the value of the further control signal is based on the power state of the plurality of processing circuits; and the second storage circuitry is shared by the plurality of processing circuits. 14. An apparatus according to claim 13, wherein
the value of the further control signal indicates the item of data is not to be retained by the second storage circuitry when at least a predefined proportion of the plurality of processing circuits, including the processing circuit, have a power state of powerdown. 15. An apparatus according to claim 13, wherein
the predetermined power state is cluster powerdown; and the value of the further control signal indicates the item of data is not to be retained by the second storage circuitry. 16. An apparatus according to claim 13, wherein
the predetermined power state is normal, wait for interrupt or retention and the value of the further control signal indicates that the item of data is to be retained by the second storage circuitry. 17. An apparatus according to claim 1, wherein
in response to the second storage circuitry receiving the further control signal indicating that the data is to be retained and the data being absent from the second storage circuitry, the second storage circuitry stores the data. 18. An apparatus according to claim 1, wherein
in response to the second storage circuitry receiving the further control signal indicating that the data is not to be retained and the data being stored in the second storage circuitry, the data is removed from the second storage circuitry. 19. An apparatus according to claim 1, wherein
the first storage circuitry and the second storage circuitry form a cache hierarchy; and the second storage circuitry is at a higher level of the cache hierarchy than the first storage circuitry. 20. An apparatus according to claim 1, wherein
the power state is an intended power state. 21. A method of operating an apparatus, the method comprising the steps:
determining a power state of a processing circuit; and issuing a control signal relating to an item of data stored in a first storage circuitry, wherein when the power state of the processing circuit is a predetermined state, issuing a further control signal to a second storage circuitry to indicate whether the item of data is to be retained by the second storage circuitry. | 2,100 |
5,439 | 5,439 | 14,750,764 | 2,184 | A port monitoring system includes a networking device that includes a device port and a monitoring device that includes a display. The networking device captures port indicator data that is associated with the operation of the device port, timestamps the port indicator data, and wirelessly transmits the port indicator data to the monitoring device. The monitoring device wirelessly receives the port indicator data from the networking device and determines whether the timestamp on the port indicator data satisfies a timing requirement for displaying a port indication. If the timestamp satisfies the timing requirement, the monitoring device provides a graphical user interface on the display that includes a graphical port indicator that operates according to the port indicator data. As such, real-time isochronous port indicator data may be wirelessly transmitted and displayed graphically on a monitoring device that allows a user to easily monitor port indicators on networking devices. | 1. A port monitoring system, comprising:
a networking device that includes a device port, wherein the networking device is configured to capture port indicator data that is associated with the operation of the device port, timestamp the port indicator data, and wirelessly transmit the port indicator data; and a monitoring device that includes a display, wherein the monitoring device is configured to wirelessly receive the port indicator data from the networking device, determine that the timestamp on the port indicator data satisfies a timing requirement for displaying a port indication and, in response, provide a graphical user interface on the display that includes a graphical port indicator that operates according to the port indicator data. 2. The port monitoring system of claim 1, wherein the networking device includes a communications port, and wherein a wireless communication adapter that has been coupled to the communications port provides for the wireless transmission of the port indicator data. 3. The port monitoring system of claim 1, wherein the graphical user interface includes a graphical port that corresponds to the device port. 4. The port monitoring system of claim 3, wherein the device port is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 5. The port monitoring system of claim 3, wherein the device port is aggregated with at least one other device port on the networking device; and
wherein the monitoring device is configured to provide the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 6. The port monitoring system of claim 1, wherein the device port is connected to a fan-out system that provides a plurality of device sub-ports that are coupled to the device port, the port indicator data includes respective sub-port indicator data that is associated with the operation of each of the plurality of device sub-ports, and the graphical user interface includes respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 7. The port monitoring system of claim 1, further comprising:
at least one device port indicator that is included on the networking device and that is associated with the device port, wherein the networking device is configured to use first port indicator data associated with a first operation of the device port to provide the at least one port indicator with a first color; and wherein monitoring device is configured to use the first port indicator data associated with the first operation of the device port to provide the graphical user interface including the graphical port indicator with a second color that is different than the first color. 8. An information handling system (IHS), comprising:
a display device; a wireless communication subsystem; a processing system that is coupled to the display device and the wireless communication device; and a memory system that is coupled to the processing system and that includes instructions that, when executed by processing system, cause the processing system to provide a port monitoring engine that is configured to:
receive, from a networking device using the wireless communication subsystem, port indicator data that is associated with the operation of a device port on the networking device;
determine that a timestamp on the port indicator data satisfies a timing requirement for displaying a port indication; and
provide, on the display device in response to the timestamp on the port indicator data satisfying the timing requirement, a graphical user interface that includes a graphical port indicator that operates according to the port indicator data. 9. The IHS of claim 8, wherein the graphical user interface includes a graphical port that corresponds to the device port. 10. The IHS of claim 9, wherein the device port on the networking device is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 11. The IHS of claim 9, wherein the port monitoring engine is configured to:
determine that the device port is aggregated with a at least one other device port on the networking device; and provide, on the display device, the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 12. The IHS of claim 8, wherein the port monitoring engine is configured to:
receive, using the wireless communication subsystem, the port indicator data that includes respective sub-port indicator data that is associated with the operation of each of a plurality of device sub-ports that are coupled to the device port; and provide, on the display device, the graphical user interface including respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 13. The IHS of claim 8, wherein the port monitoring engine is configured to:
receive, using the wireless communication subsystem, first port indicator data from the networking device that is associated with a first operation of the device port, wherein the first port indicator data is configured to provide a port indicator that is associated with the device port on the networking device with a first color; and use the first port indicator data associated with the first operation of the device port to provide, on the display device, the graphical user interface including the graphical port indicator with a second color that is different than the first color. 14. The IHS of claim 8, wherein the port monitoring engine is configured to:
determine that the device port is a part of a first virtual switch; and provide, on the display device, an indication of the first virtual switch. 15. A method for monitoring ports, comprising:
receiving, wirelessly by a monitoring device from a networking device, port indicator data that is associated with the operation of a device port on the networking device; determining, by the monitoring device, that a timestamp on the port indicator data satisfies a timing requirement for displaying a port indication; and providing, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, a graphical user interface that includes a graphical port indicator that operates according to the port indicator data. 16. The method of claim 15, wherein the graphical user interface includes a graphical port that corresponds to the device port. 17. The method of claim 16, wherein the device port on the networking device is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 18. The method of claim 15, further comprising:
determining, by the monitoring device, that the device port is aggregated with a at least one other device port on the networking device; and providing, by the monitoring device for display, the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 19. The method of claim 15, further comprising:
receiving, wirelessly by the monitoring device from the networking device, the port indicator data that includes respective sub-port indicator data that is associated with the operation of each of a plurality of device sub-ports that are coupled to the device port; and providing, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, the graphical user interface including respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 20. The method of claim 15, further comprising:
receiving, wirelessly by the monitoring device from the networking device, first port indicator data from the networking device that is associated with a first operation of the device port, wherein the first port indicator data is configured to provide a port indicator that is associated with the device port on the networking device with a first color; and using the first port indicator data associated with the first operation of the device port to provide, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, the graphical user interface including the graphical port indicator with a second color that is different than the first color. | A port monitoring system includes a networking device that includes a device port and a monitoring device that includes a display. The networking device captures port indicator data that is associated with the operation of the device port, timestamps the port indicator data, and wirelessly transmits the port indicator data to the monitoring device. The monitoring device wirelessly receives the port indicator data from the networking device and determines whether the timestamp on the port indicator data satisfies a timing requirement for displaying a port indication. If the timestamp satisfies the timing requirement, the monitoring device provides a graphical user interface on the display that includes a graphical port indicator that operates according to the port indicator data. As such, real-time isochronous port indicator data may be wirelessly transmitted and displayed graphically on a monitoring device that allows a user to easily monitor port indicators on networking devices.1. A port monitoring system, comprising:
a networking device that includes a device port, wherein the networking device is configured to capture port indicator data that is associated with the operation of the device port, timestamp the port indicator data, and wirelessly transmit the port indicator data; and a monitoring device that includes a display, wherein the monitoring device is configured to wirelessly receive the port indicator data from the networking device, determine that the timestamp on the port indicator data satisfies a timing requirement for displaying a port indication and, in response, provide a graphical user interface on the display that includes a graphical port indicator that operates according to the port indicator data. 2. The port monitoring system of claim 1, wherein the networking device includes a communications port, and wherein a wireless communication adapter that has been coupled to the communications port provides for the wireless transmission of the port indicator data. 3. The port monitoring system of claim 1, wherein the graphical user interface includes a graphical port that corresponds to the device port. 4. The port monitoring system of claim 3, wherein the device port is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 5. The port monitoring system of claim 3, wherein the device port is aggregated with at least one other device port on the networking device; and
wherein the monitoring device is configured to provide the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 6. The port monitoring system of claim 1, wherein the device port is connected to a fan-out system that provides a plurality of device sub-ports that are coupled to the device port, the port indicator data includes respective sub-port indicator data that is associated with the operation of each of the plurality of device sub-ports, and the graphical user interface includes respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 7. The port monitoring system of claim 1, further comprising:
at least one device port indicator that is included on the networking device and that is associated with the device port, wherein the networking device is configured to use first port indicator data associated with a first operation of the device port to provide the at least one port indicator with a first color; and wherein monitoring device is configured to use the first port indicator data associated with the first operation of the device port to provide the graphical user interface including the graphical port indicator with a second color that is different than the first color. 8. An information handling system (IHS), comprising:
a display device; a wireless communication subsystem; a processing system that is coupled to the display device and the wireless communication device; and a memory system that is coupled to the processing system and that includes instructions that, when executed by processing system, cause the processing system to provide a port monitoring engine that is configured to:
receive, from a networking device using the wireless communication subsystem, port indicator data that is associated with the operation of a device port on the networking device;
determine that a timestamp on the port indicator data satisfies a timing requirement for displaying a port indication; and
provide, on the display device in response to the timestamp on the port indicator data satisfying the timing requirement, a graphical user interface that includes a graphical port indicator that operates according to the port indicator data. 9. The IHS of claim 8, wherein the graphical user interface includes a graphical port that corresponds to the device port. 10. The IHS of claim 9, wherein the device port on the networking device is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 11. The IHS of claim 9, wherein the port monitoring engine is configured to:
determine that the device port is aggregated with a at least one other device port on the networking device; and provide, on the display device, the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 12. The IHS of claim 8, wherein the port monitoring engine is configured to:
receive, using the wireless communication subsystem, the port indicator data that includes respective sub-port indicator data that is associated with the operation of each of a plurality of device sub-ports that are coupled to the device port; and provide, on the display device, the graphical user interface including respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 13. The IHS of claim 8, wherein the port monitoring engine is configured to:
receive, using the wireless communication subsystem, first port indicator data from the networking device that is associated with a first operation of the device port, wherein the first port indicator data is configured to provide a port indicator that is associated with the device port on the networking device with a first color; and use the first port indicator data associated with the first operation of the device port to provide, on the display device, the graphical user interface including the graphical port indicator with a second color that is different than the first color. 14. The IHS of claim 8, wherein the port monitoring engine is configured to:
determine that the device port is a part of a first virtual switch; and provide, on the display device, an indication of the first virtual switch. 15. A method for monitoring ports, comprising:
receiving, wirelessly by a monitoring device from a networking device, port indicator data that is associated with the operation of a device port on the networking device; determining, by the monitoring device, that a timestamp on the port indicator data satisfies a timing requirement for displaying a port indication; and providing, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, a graphical user interface that includes a graphical port indicator that operates according to the port indicator data. 16. The method of claim 15, wherein the graphical user interface includes a graphical port that corresponds to the device port. 17. The method of claim 16, wherein the device port on the networking device is associated with a device port number, and wherein the graphical user interface includes the graphical port with a graphical port number that is different than the device port number. 18. The method of claim 15, further comprising:
determining, by the monitoring device, that the device port is aggregated with a at least one other device port on the networking device; and providing, by the monitoring device for display, the graphical user interface with an indication that the graphical port is aggregated with at least one other graphical port. 19. The method of claim 15, further comprising:
receiving, wirelessly by the monitoring device from the networking device, the port indicator data that includes respective sub-port indicator data that is associated with the operation of each of a plurality of device sub-ports that are coupled to the device port; and providing, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, the graphical user interface including respective graphical sub-port indicators that correspond to each of the plurality of device sub-ports and that operate according to the respective sub-port indicator data. 20. The method of claim 15, further comprising:
receiving, wirelessly by the monitoring device from the networking device, first port indicator data from the networking device that is associated with a first operation of the device port, wherein the first port indicator data is configured to provide a port indicator that is associated with the device port on the networking device with a first color; and using the first port indicator data associated with the first operation of the device port to provide, by the monitoring device for display in response to the timestamp on the port indicator data satisfying the timing requirement, the graphical user interface including the graphical port indicator with a second color that is different than the first color. | 2,100 |
5,440 | 5,440 | 15,062,034 | 2,181 | There is disclosed a toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit is arranged to establish Near Field Communication (NFC) with the peripheral unit, and wherein the central unit is further arranged to control one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. Furthermore, a corresponding method for controlling a toy and a corresponding computer program product are disclosed. | 1. A toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit is arranged to establish Near Field Communication, NFC, with the peripheral unit, and wherein the central unit is further arranged to control one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. 2. A toy as claimed in claim 1, wherein the central unit comprises an NFC device and at least one NFC antenna, and wherein the NFC device is arranged to establish said NFC via said NFC antenna. 3. A toy as claimed in claim 1, wherein the central unit comprises a microcontroller which is arranged to control said functions. 4. A toy as claimed in claim 2, wherein the NFC device and the microcontroller are integrated in the same package. 5. A toy as claimed in claim 1, wherein the peripheral unit comprises an NFC tag which contains said control data. 6. A toy as claimed in claim 1, wherein at least one function of the peripheral unit comprises a movement defined by the control data, and wherein the central unit is arranged to move the peripheral unit using said control data. 7. A toy as claimed in claim 6, wherein the central unit comprises a motor which is arranged to move said peripheral unit. 8. A toy as claimed in claim 6, wherein the central unit comprises an energy source which is arranged to provide energy for moving the peripheral unit. 9. A toy as claimed in claim 1, wherein the control data are programmable. 10. A toy as claimed in claim 1, wherein the peripheral unit comprises at least one functional component which is arranged to perform or support said function, and wherein the central unit is arranged to control, via said NFC, the functional component in dependence on said control data. 11. A toy as claimed in claim 10, wherein the functional component is at least one of a light output device, an audio output device and a motor. 12. A toy as claimed in claim 1, comprising at least one further peripheral unit, wherein the central unit is further arranged to control one or more functions of the further peripheral unit in dependence on said control data. 13. A method for controlling a toy, said toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit establishes Near Field Communication, NFC, with the peripheral unit, and wherein the central unit controls one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. 14. A computer program product comprising executable instructions which, when being executed by a processing unit, cause said processing unit to carry out or control the steps of the method of claim 13. | There is disclosed a toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit is arranged to establish Near Field Communication (NFC) with the peripheral unit, and wherein the central unit is further arranged to control one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. Furthermore, a corresponding method for controlling a toy and a corresponding computer program product are disclosed.1. A toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit is arranged to establish Near Field Communication, NFC, with the peripheral unit, and wherein the central unit is further arranged to control one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. 2. A toy as claimed in claim 1, wherein the central unit comprises an NFC device and at least one NFC antenna, and wherein the NFC device is arranged to establish said NFC via said NFC antenna. 3. A toy as claimed in claim 1, wherein the central unit comprises a microcontroller which is arranged to control said functions. 4. A toy as claimed in claim 2, wherein the NFC device and the microcontroller are integrated in the same package. 5. A toy as claimed in claim 1, wherein the peripheral unit comprises an NFC tag which contains said control data. 6. A toy as claimed in claim 1, wherein at least one function of the peripheral unit comprises a movement defined by the control data, and wherein the central unit is arranged to move the peripheral unit using said control data. 7. A toy as claimed in claim 6, wherein the central unit comprises a motor which is arranged to move said peripheral unit. 8. A toy as claimed in claim 6, wherein the central unit comprises an energy source which is arranged to provide energy for moving the peripheral unit. 9. A toy as claimed in claim 1, wherein the control data are programmable. 10. A toy as claimed in claim 1, wherein the peripheral unit comprises at least one functional component which is arranged to perform or support said function, and wherein the central unit is arranged to control, via said NFC, the functional component in dependence on said control data. 11. A toy as claimed in claim 10, wherein the functional component is at least one of a light output device, an audio output device and a motor. 12. A toy as claimed in claim 1, comprising at least one further peripheral unit, wherein the central unit is further arranged to control one or more functions of the further peripheral unit in dependence on said control data. 13. A method for controlling a toy, said toy comprising a central unit and at least one peripheral unit which is operatively coupled to said central unit, wherein the central unit establishes Near Field Communication, NFC, with the peripheral unit, and wherein the central unit controls one or more functions of the peripheral unit in dependence on control data received, via NFC, from said peripheral unit. 14. A computer program product comprising executable instructions which, when being executed by a processing unit, cause said processing unit to carry out or control the steps of the method of claim 13. | 2,100 |
5,441 | 5,441 | 14,611,227 | 2,166 | A search support system allows a customer to browse data contained in files stored on an external storage system. The search support system allows a customer to specify data processing tasks to be performed on raw data retrieved from a file stored on the external storage system. The customer specifies each data processing task and the search support system performs each task as it is selected by the customer on raw data retrieved from the file. The search support system concurrently displays the results of each data processing task in real time in a graphical user interface. The search support system saves the customer's settings as a late binding schema that can be applied to raw data retrieved from the external storage system in order to parse the raw data and to create, index, and search timestamped events derived from the raw data. | 1. A method, comprising:
retrieving raw data from a Hadoop file system; causing display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; in response to a selected event break option, parsing the raw data into a plurality of events using the selected event break option and concurrently displaying the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; storing the selected event break option as part of a late binding schema. 2. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 3. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data; receiving a search query; searching the indexed second set of data using the search query. 4. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data; organizing the indexed second set of data into a plurality of buckets; receiving a search query; searching indexed second set of data in a particular bucket among the plurality of buckets using the search query. 5. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system into a plurality of timestamped events by applying the late binding schema to the second set of data; organizing events in the plurality of events into a plurality of buckets based on a timestamp associated with each event in the plurality of events; receiving a search query; searching events in a particular bucket among the plurality of buckets using the search query. 6. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; in response to a selected source type, defining parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; storing the selected source type as part of the late binding schema. 7. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema. 8. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 9. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema. 10. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 11. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system provider; wherein the retrieving step retrieves the raw data from the Hadoop file system provided by a selected Hadoop file system provider. 12. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the retrieving step, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. 13. The method of claim 1, wherein the Hadoop file system is an S3 file system. 14. A non-transitory computer readable storage medium, storing software instructions, which when executed by one or more processors cause performance of:
retrieving raw data from a Hadoop file system; causing display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; in response to a selected event break option, parsing the raw data into a plurality of events using the selected event break option and concurrently displaying the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; storing the selected event break option as part of a late binding schema. 15. The non-transitory computer readable storage medium of claim 14, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 16. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; in response to a selected source type, defining parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; storing the selected source type as part of the late binding schema. 17. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema. 18. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 19. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema. 20. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 21. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system provider; wherein the retrieving step retrieves the raw data from the Hadoop file system provided by a selected Hadoop file system provider. 22. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the retrieving step, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. 23. An apparatus, comprising:
a raw data retrieving subsystem, implemented at least partially in hardware, that retrieves raw data from a Hadoop file system; a graphical user interface display subsystem, implemented at least partially in hardware, that causes display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; a subsystem, implemented at least partially in hardware, that, in response to a selected event break option, parses the raw data into a plurality of events using the selected event break option and concurrently displays the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; a storing subsystem, implemented at least partially in hardware, that stores the selected event break option as part of a late binding schema. 24. The apparatus of claim 23, further comprising:
an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 25. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that, in response to a selected source type, defines parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; wherein the storing subsystem stores the selected source type as part of the late binding schema. 26. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected timestamp option as part of the late binding schema. 27. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected timestamp option as part of the late binding schema; an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 28. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that receives a selected source type; wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that defines parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected source type and selected timestamp option as part of the late binding schema. 29. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that receives a selected source type; wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that defines parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected source type and selected timestamp option as part of the late binding schema; an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 30. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the raw data retrieving subsystem, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. | A search support system allows a customer to browse data contained in files stored on an external storage system. The search support system allows a customer to specify data processing tasks to be performed on raw data retrieved from a file stored on the external storage system. The customer specifies each data processing task and the search support system performs each task as it is selected by the customer on raw data retrieved from the file. The search support system concurrently displays the results of each data processing task in real time in a graphical user interface. The search support system saves the customer's settings as a late binding schema that can be applied to raw data retrieved from the external storage system in order to parse the raw data and to create, index, and search timestamped events derived from the raw data.1. A method, comprising:
retrieving raw data from a Hadoop file system; causing display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; in response to a selected event break option, parsing the raw data into a plurality of events using the selected event break option and concurrently displaying the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; storing the selected event break option as part of a late binding schema. 2. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 3. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data; receiving a search query; searching the indexed second set of data using the search query. 4. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data; organizing the indexed second set of data into a plurality of buckets; receiving a search query; searching indexed second set of data in a particular bucket among the plurality of buckets using the search query. 5. The method of claim 1, further comprising:
indexing a second set of data retrieved from the Hadoop file system into a plurality of timestamped events by applying the late binding schema to the second set of data; organizing events in the plurality of events into a plurality of buckets based on a timestamp associated with each event in the plurality of events; receiving a search query; searching events in a particular bucket among the plurality of buckets using the search query. 6. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; in response to a selected source type, defining parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; storing the selected source type as part of the late binding schema. 7. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema. 8. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 9. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema. 10. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 11. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system provider; wherein the retrieving step retrieves the raw data from the Hadoop file system provided by a selected Hadoop file system provider. 12. The method of claim 1, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the retrieving step, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. 13. The method of claim 1, wherein the Hadoop file system is an S3 file system. 14. A non-transitory computer readable storage medium, storing software instructions, which when executed by one or more processors cause performance of:
retrieving raw data from a Hadoop file system; causing display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; in response to a selected event break option, parsing the raw data into a plurality of events using the selected event break option and concurrently displaying the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; storing the selected event break option as part of a late binding schema. 15. The non-transitory computer readable storage medium of claim 14, further comprising:
indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 16. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; in response to a selected source type, defining parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; storing the selected source type as part of the late binding schema. 17. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema. 18. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 19. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema. 20. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a source type; receiving a selected source type; causing display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; defining parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; in response to a selected timestamp option, parsing data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; storing the selected source type and selected timestamp option as part of the late binding schema; indexing a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 21. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system provider; wherein the retrieving step retrieves the raw data from the Hadoop file system provided by a selected Hadoop file system provider. 22. The non-transitory computer readable storage medium of claim 14, further comprising:
causing display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the retrieving step, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. 23. An apparatus, comprising:
a raw data retrieving subsystem, implemented at least partially in hardware, that retrieves raw data from a Hadoop file system; a graphical user interface display subsystem, implemented at least partially in hardware, that causes display of a graphical user interface that displays a plurality of selectable event break options indicating where a break should occur in the raw data that designates an event within the raw data; a subsystem, implemented at least partially in hardware, that, in response to a selected event break option, parses the raw data into a plurality of events using the selected event break option and concurrently displays the plurality of events as the parsing occurs, each event in the plurality of events comprising at least a portion of the parsed raw data; a storing subsystem, implemented at least partially in hardware, that stores the selected event break option as part of a late binding schema. 24. The apparatus of claim 23, further comprising:
an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 25. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that, in response to a selected source type, defines parsing instructions relating to one of the selectable event break options of the plurality of selectable event break options based on the selected source type; wherein the storing subsystem stores the selected source type as part of the late binding schema. 26. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected timestamp option as part of the late binding schema. 27. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected timestamp option as part of the late binding schema; an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 28. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that receives a selected source type; wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that defines parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected source type and selected timestamp option as part of the late binding schema. 29. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a source type; a subsystem, implemented at least partially in hardware, that receives a selected source type; wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a plurality of selectable timestamp options indicating where a timestamp should occur in each event in the plurality of events; a subsystem, implemented at least partially in hardware, that defines parsing instructions relating to one of the selectable timestamp options of the plurality of selectable timestamp options based on the selected source type; a subsystem, implemented at least partially in hardware, that, in response to a selected timestamp option, parses data in each event in the plurality of events to determine timestamps associated with each event using the selected timestamp option and concurrently displaying timestamps associated with each event as the parsing occurs; wherein the storing subsystem stores the selected source type and selected timestamp option as part of the late binding schema; an indexing subsystem, implemented at least partially in hardware, that indexes a second set of data retrieved from the Hadoop file system by applying the late binding schema to the second set of data. 30. The apparatus of claim 23, further comprising:
wherein the graphical user interface display subsystem causes display of a graphical user interface that displays a pulldown menu for selecting a Hadoop file system; wherein the raw data retrieving subsystem, in response to a selected Hadoop file system, retrieves the raw data from the selected Hadoop file system. | 2,100 |
5,442 | 5,442 | 14,573,240 | 2,125 | Mechanisms for training a Question and Answer (QA) system are provided. The QA system receives a training question for processing by the QA system and processes the training question to generate an answer to the training question, from a portion of content. The QA system identifies a repeatable pattern of content present in the portion of content in association with the answer to the training question. The QA system applies the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure. The QA system is then trained using the expanded set of training questions and expanded ground truth data structure. | 1. A method, in a data processing system having a processor and a memory and implementing a Question and Answer (QA) system, the method comprising:
receiving, by the QA system, a training question for processing by the QA system; processing, by the QA system, the training question to generate an answer to the training question, from a portion of content in a corpus of information; identifying, by the QA system, a repeatable pattern of content present in the portion of content in association with the answer to the training question; applying, by the QA system, the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and storing the expanded set of training questions and expanded ground truth data structure. 2. The method of claim 1, further comprising:
training the QA system using the expanded set of training questions and expanded ground truth data structure. 3. The method of claim 1, further comprising:
generating a question and answer pair mapping the training question to the answer; and storing the question and answer pair in the ground truth data structure. 4. The method of claim 1, wherein identifying the repeatable pattern comprises applying one or more rules associated with a type of the portion of content, wherein the one or more rules specify a repeatable structure of the portion of content indicative of a repeatable pattern for identifying first elements of the at least one additional training question, and second elements of at least one additional answer to the at least one additional training question. 5. The method of claim 4, wherein the one or more rules specify metadata patterns indicative of a repeatable pattern associated with a group of elements of the portion of content. 6. The method of claim 1, wherein the portion of content comprises a document in a corpus of documents, and wherein the repeatable pattern comprises at least one of a table data structure, a list data structure, bulleted data, or outlined data with headings and subheadings. 7. The method of claim 4, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises:
selecting, based on the repeatable structure of the portion of content, each element in the repeatable structure that is in a parallel position in the repeatable structure to the answer generated for the training question; and verifying each of the selected elements in the repeatable structure. 8. The method of claim 7, wherein verifying each of the selected elements in the repeatable structure comprises:
for each selected element performing at least one of bayesian reasoning or ontology based reasoning to infer a semantic type of the selected element; evaluating whether a sufficient number of the selected elements are of a similar semantic type to a semantic type of the answer to the training question; and storing each of the selected elements as additional answers in the at least one additional answer in response to the evaluation indicating that a sufficient number of the selected elements are of a similar semantic type to the semantic type of the answer to the training question. 9. The method of claim 8, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises:
identifying relation terms in the training question; searching the portion of content for the relation terms; determining a structural relation of the repeatable structure based on an identification of the relation terms in the portion of content; verifying the structural relation of the repeatable structure returns semantically similar answers to the answer to the training question; and storing tuples of relation terms and the additional answers in response to the structural relation being verified. 10. The method of claim 9, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises, for each stored tuple:
converting the stored tuples to a natural language question; and storing an entry in the ground truth data structure correlating the natural language question with the additional answer associated with the tuple. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device implementing a Question and Answer (QA) system, causes the computing device to:
receive, by the QA system, a training question for processing by the QA system; process, by the QA system, the training question to generate an answer to the training question, from a portion of content in a corpus of information; identify, by the QA system, a repeatable pattern of content present in the portion of content in association with the answer to the training question; apply, by the QA system, the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and store the expanded set of training questions and expanded ground truth data structure. 12. The computer program product of claim 11, wherein the computer readable program further causes the computing device to:
train the QA system using the expanded set of training questions and expanded ground truth data structure. 13. The computer program product of claim 11, wherein the computer readable program further causes the computing device to:
generate a question and answer pair mapping the training question to the answer; and store the question and answer pair in the ground truth data structure. 14. The computer program product of claim 11, wherein the computer readable program further causes the computing device to identify the repeatable pattern at least by applying one or more rules associated with a type of the portion of content, wherein the one or more rules specify a repeatable structure of the portion of content indicative of a repeatable pattern for identifying first elements of the at least one additional training question, and second elements of at least one additional answer to the at least one additional training question. 15. The computer program product of claim 14, wherein the one or more rules specify metadata patterns indicative of a repeatable pattern associated with a group of elements of the portion of content. 16. The computer program product of claim 11, wherein the portion of content comprises a document in a corpus of documents, and wherein the repeatable pattern comprises at least one of a table data structure, a list data structure, bulleted data, or outlined data with headings and subheadings. 17. The computer program product of claim 14, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by:
selecting, based on the repeatable structure of the portion of content, each element in the repeatable structure that is in a parallel position in the repeatable structure to the answer generated for the training question; and verifying each of the selected elements in the repeatable structure. 18. The computer program product of claim 17, wherein verifying each of the selected elements in the repeatable structure comprises:
for each selected element performing at least one of bayesian reasoning or ontology based reasoning to infer a semantic type of the selected element; evaluating whether a sufficient number of the selected elements are of a similar semantic type to a semantic type of the answer to the training question; and storing each of the selected elements as additional answers in the at least one additional answer in response to the evaluation indicating that a sufficient number of the selected elements are of a similar semantic type to the semantic type of the answer to the training question. 19. The computer program product of claim 18, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by:
identifying relation terms in the training question; searching the portion of content for the relation terms; determining a structural relation of the repeatable structure based on an identification of the relation terms in the portion of content; verifying the structural relation of the repeatable structure returns semantically similar answers to the answer to the training question; and storing tuples of relation terms and the additional answers in response to the structural relation being verified. 20. The computer program product of claim 19, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by, for each stored tuple:
converting the stored tuples to a natural language question; and storing an entry in the ground truth data structure correlating the natural language question with the additional answer associated with the tuple. 21. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a training question for processing by a Question and Answer (QA) system associated with the apparatus; process the training question to generate an answer to the training question, from a portion of content in a corpus of information; identify a repeatable pattern of content present in the portion of content in association with the answer to the training question; apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and store the expanded set of training questions and expanded ground truth data structure. | Mechanisms for training a Question and Answer (QA) system are provided. The QA system receives a training question for processing by the QA system and processes the training question to generate an answer to the training question, from a portion of content. The QA system identifies a repeatable pattern of content present in the portion of content in association with the answer to the training question. The QA system applies the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure. The QA system is then trained using the expanded set of training questions and expanded ground truth data structure.1. A method, in a data processing system having a processor and a memory and implementing a Question and Answer (QA) system, the method comprising:
receiving, by the QA system, a training question for processing by the QA system; processing, by the QA system, the training question to generate an answer to the training question, from a portion of content in a corpus of information; identifying, by the QA system, a repeatable pattern of content present in the portion of content in association with the answer to the training question; applying, by the QA system, the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and storing the expanded set of training questions and expanded ground truth data structure. 2. The method of claim 1, further comprising:
training the QA system using the expanded set of training questions and expanded ground truth data structure. 3. The method of claim 1, further comprising:
generating a question and answer pair mapping the training question to the answer; and storing the question and answer pair in the ground truth data structure. 4. The method of claim 1, wherein identifying the repeatable pattern comprises applying one or more rules associated with a type of the portion of content, wherein the one or more rules specify a repeatable structure of the portion of content indicative of a repeatable pattern for identifying first elements of the at least one additional training question, and second elements of at least one additional answer to the at least one additional training question. 5. The method of claim 4, wherein the one or more rules specify metadata patterns indicative of a repeatable pattern associated with a group of elements of the portion of content. 6. The method of claim 1, wherein the portion of content comprises a document in a corpus of documents, and wherein the repeatable pattern comprises at least one of a table data structure, a list data structure, bulleted data, or outlined data with headings and subheadings. 7. The method of claim 4, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises:
selecting, based on the repeatable structure of the portion of content, each element in the repeatable structure that is in a parallel position in the repeatable structure to the answer generated for the training question; and verifying each of the selected elements in the repeatable structure. 8. The method of claim 7, wherein verifying each of the selected elements in the repeatable structure comprises:
for each selected element performing at least one of bayesian reasoning or ontology based reasoning to infer a semantic type of the selected element; evaluating whether a sufficient number of the selected elements are of a similar semantic type to a semantic type of the answer to the training question; and storing each of the selected elements as additional answers in the at least one additional answer in response to the evaluation indicating that a sufficient number of the selected elements are of a similar semantic type to the semantic type of the answer to the training question. 9. The method of claim 8, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises:
identifying relation terms in the training question; searching the portion of content for the relation terms; determining a structural relation of the repeatable structure based on an identification of the relation terms in the portion of content; verifying the structural relation of the repeatable structure returns semantically similar answers to the answer to the training question; and storing tuples of relation terms and the additional answers in response to the structural relation being verified. 10. The method of claim 9, wherein applying the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure further comprises, for each stored tuple:
converting the stored tuples to a natural language question; and storing an entry in the ground truth data structure correlating the natural language question with the additional answer associated with the tuple. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device implementing a Question and Answer (QA) system, causes the computing device to:
receive, by the QA system, a training question for processing by the QA system; process, by the QA system, the training question to generate an answer to the training question, from a portion of content in a corpus of information; identify, by the QA system, a repeatable pattern of content present in the portion of content in association with the answer to the training question; apply, by the QA system, the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and store the expanded set of training questions and expanded ground truth data structure. 12. The computer program product of claim 11, wherein the computer readable program further causes the computing device to:
train the QA system using the expanded set of training questions and expanded ground truth data structure. 13. The computer program product of claim 11, wherein the computer readable program further causes the computing device to:
generate a question and answer pair mapping the training question to the answer; and store the question and answer pair in the ground truth data structure. 14. The computer program product of claim 11, wherein the computer readable program further causes the computing device to identify the repeatable pattern at least by applying one or more rules associated with a type of the portion of content, wherein the one or more rules specify a repeatable structure of the portion of content indicative of a repeatable pattern for identifying first elements of the at least one additional training question, and second elements of at least one additional answer to the at least one additional training question. 15. The computer program product of claim 14, wherein the one or more rules specify metadata patterns indicative of a repeatable pattern associated with a group of elements of the portion of content. 16. The computer program product of claim 11, wherein the portion of content comprises a document in a corpus of documents, and wherein the repeatable pattern comprises at least one of a table data structure, a list data structure, bulleted data, or outlined data with headings and subheadings. 17. The computer program product of claim 14, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by:
selecting, based on the repeatable structure of the portion of content, each element in the repeatable structure that is in a parallel position in the repeatable structure to the answer generated for the training question; and verifying each of the selected elements in the repeatable structure. 18. The computer program product of claim 17, wherein verifying each of the selected elements in the repeatable structure comprises:
for each selected element performing at least one of bayesian reasoning or ontology based reasoning to infer a semantic type of the selected element; evaluating whether a sufficient number of the selected elements are of a similar semantic type to a semantic type of the answer to the training question; and storing each of the selected elements as additional answers in the at least one additional answer in response to the evaluation indicating that a sufficient number of the selected elements are of a similar semantic type to the semantic type of the answer to the training question. 19. The computer program product of claim 18, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by:
identifying relation terms in the training question; searching the portion of content for the relation terms; determining a structural relation of the repeatable structure based on an identification of the relation terms in the portion of content; verifying the structural relation of the repeatable structure returns semantically similar answers to the answer to the training question; and storing tuples of relation terms and the additional answers in response to the structural relation being verified. 20. The computer program product of claim 19, wherein the computer readable program further causes the computing device to apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure at least by, for each stored tuple:
converting the stored tuples to a natural language question; and storing an entry in the ground truth data structure correlating the natural language question with the additional answer associated with the tuple. 21. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a training question for processing by a Question and Answer (QA) system associated with the apparatus; process the training question to generate an answer to the training question, from a portion of content in a corpus of information; identify a repeatable pattern of content present in the portion of content in association with the answer to the training question; apply the repeatable pattern of content to other portions of content to generate at least one additional training question and at least one additional entry in a ground truth data structure to thereby expand a set of training questions and expand the ground truth data structure; and store the expanded set of training questions and expanded ground truth data structure. | 2,100 |
5,443 | 5,443 | 13,783,763 | 2,164 | Disclosed herein are system, method, and computer program product embodiments for data replication for cloud based in-memory databases. An embodiment operates by requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database, assessing, at the first computing device, database system components, and transmitting database system component information from the first computing device to a second computing device over a network. The first computing device receives from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set. The database system components at the first computing device are then configured to use the recommended replication strategy. | 1. A method comprising:
requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database; assessing, at the first computing device, database system components; transmitting database system component information from the first computing device to a second computing device over a network; receiving at the first computing device from the second computing device, an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and configuring the database system components at the first computing device to use the recommended replication strategy. 2. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 3. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 4. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 5. The method of claim 4, further comprising:
determining whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 6. The method of claim 1, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname, and a computer network address. 7. The method of claim 1, wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 8. A system, comprising:
a memory; and at least one processor coupled to the memory and configured to:
request, by a first computing device, configuration of an on-demand cloud-based in-memory database;
assess, at the first computing device, database system components;
transmit database system component information from the first computing device to a second computing device over a network;
receive at the first computing device from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and
configure the database system components at the first computing device to use the recommended replication strategy. 9. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 10. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 11. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 12. The system of claim 11, the at least one processor further configured to:
determine whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 13. The system of claim 8, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname, and a computer network address. 14. The system of claim 8, wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 15. A tangible 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:
requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database; assessing, at the first computing device, database system components; transmitting database system component information from the first computing device to a second computing device over a network; receiving at the first computing device from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and configuring the database system components at the first computing device to use the recommended replication strategy. 16. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 17. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 18. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 19. The computer-readable device of claim 18, the operations further comprising:
determining whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 20. The computer-readable device of claim 15, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname and a computer network address and wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 21. A method, comprising:
receiving, by a second computing device, a request for configuration of an on-demand cloud-based in-memory database; receiving, by the second computing device, database system component information regarding database system components at a first computing device; evaluating, by the second computing device, the database system component information; determining, by the second computing device, a recommended replication strategy responsive to a replication rule set; and configuring, by the second computing device, database system components at the first computing device and the on-demand cloud-based in-memory database based on the recommended replication strategy. | Disclosed herein are system, method, and computer program product embodiments for data replication for cloud based in-memory databases. An embodiment operates by requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database, assessing, at the first computing device, database system components, and transmitting database system component information from the first computing device to a second computing device over a network. The first computing device receives from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set. The database system components at the first computing device are then configured to use the recommended replication strategy.1. A method comprising:
requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database; assessing, at the first computing device, database system components; transmitting database system component information from the first computing device to a second computing device over a network; receiving at the first computing device from the second computing device, an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and configuring the database system components at the first computing device to use the recommended replication strategy. 2. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 3. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 4. The method of claim 1, the configuring further comprising:
configuring the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 5. The method of claim 4, further comprising:
determining whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 6. The method of claim 1, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname, and a computer network address. 7. The method of claim 1, wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 8. A system, comprising:
a memory; and at least one processor coupled to the memory and configured to:
request, by a first computing device, configuration of an on-demand cloud-based in-memory database;
assess, at the first computing device, database system components;
transmit database system component information from the first computing device to a second computing device over a network;
receive at the first computing device from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and
configure the database system components at the first computing device to use the recommended replication strategy. 9. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 10. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 11. The system of claim 8, the at least one processor further configured to:
configure the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 12. The system of claim 11, the at least one processor further configured to:
determine whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 13. The system of claim 8, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname, and a computer network address. 14. The system of claim 8, wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 15. A tangible 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:
requesting, by a first computing device, configuration of an on-demand cloud-based in-memory database; assessing, at the first computing device, database system components; transmitting database system component information from the first computing device to a second computing device over a network; receiving at the first computing device from the second computing device an evaluation of the database system components and a recommended replication strategy responsive to a replication rule set; and configuring the database system components at the first computing device to use the recommended replication strategy. 16. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended cloud based replication technology provided by the second computing device. 17. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use a recommended on premise replication technology provided by the first computing device. 18. The computer-readable device of claim 15, the configuring further comprising:
configuring the database system components at the first computing device to use an optimized replication strategy comprising one of a first recommended cloud based replication technology provided by the second computing device and a second recommended on premise replication technology provided by the first computing device. 19. The computer-readable device of claim 18, the operations further comprising:
determining whether the database system components are compatible with a plurality of replication technologies responsive to the replication rule set. 20. The computer-readable device of claim 15, wherein the database system component information comprises a database suite component, a component version, a component database vendor, a computer hostname and a computer network address and wherein the replication rule set comprises restrictions based on a number of database components, enterprise resource planning, customer relationship management, supplier relationship management, a source database type, a data compression type, and database protocols. 21. A method, comprising:
receiving, by a second computing device, a request for configuration of an on-demand cloud-based in-memory database; receiving, by the second computing device, database system component information regarding database system components at a first computing device; evaluating, by the second computing device, the database system component information; determining, by the second computing device, a recommended replication strategy responsive to a replication rule set; and configuring, by the second computing device, database system components at the first computing device and the on-demand cloud-based in-memory database based on the recommended replication strategy. | 2,100 |
5,444 | 5,444 | 13,919,323 | 2,128 | Cooperative modeling of discrete system elements and continuous system elements is described, in which a discrete system element and a relationship between the discrete system element and a continuous system element is modeled in a first modeling environment, where a description of the discrete system element and of the relationship between the discrete system element and the continuous system element is exported from the first modeling environment to a second modeling environment, causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, where the continuous system element is modeled in the second modeling environment. | 1. A method for cooperative modeling of discrete system elements and continuous system elements, the method comprising:
modeling, in a first modeling environment, a discrete system element and a relationship between the discrete system element and a continuous system element; and exporting, from the first modeling environment to a second modeling environment, a description of the discrete system element and of the relationship between the discrete system element and the continuous system element, thereby causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 2. The method of claim 1 and further comprising:
initiating a simulation of the discrete system element and the continuous system element in the second modeling environment; and
providing an output of one of the elements during the simulation as input to the other element during the simulation. 3. The method of claim 1 and further comprising:
initiating a simulation of the discrete system element in the first modeling environment;
initiating a simulation of the continuous system element in the second modeling environment; and
providing an output of one of the elements during one of the simulations as input to the other element during the other simulation. 4. The method according to claim 3 wherein the providing comprises providing the output via a communications channel that is accessible to the first modeling environment and the second modeling environment 5-12. (canceled) | Cooperative modeling of discrete system elements and continuous system elements is described, in which a discrete system element and a relationship between the discrete system element and a continuous system element is modeled in a first modeling environment, where a description of the discrete system element and of the relationship between the discrete system element and the continuous system element is exported from the first modeling environment to a second modeling environment, causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, where the continuous system element is modeled in the second modeling environment.1. A method for cooperative modeling of discrete system elements and continuous system elements, the method comprising:
modeling, in a first modeling environment, a discrete system element and a relationship between the discrete system element and a continuous system element; and exporting, from the first modeling environment to a second modeling environment, a description of the discrete system element and of the relationship between the discrete system element and the continuous system element, thereby causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 2. The method of claim 1 and further comprising:
initiating a simulation of the discrete system element and the continuous system element in the second modeling environment; and
providing an output of one of the elements during the simulation as input to the other element during the simulation. 3. The method of claim 1 and further comprising:
initiating a simulation of the discrete system element in the first modeling environment;
initiating a simulation of the continuous system element in the second modeling environment; and
providing an output of one of the elements during one of the simulations as input to the other element during the other simulation. 4. The method according to claim 3 wherein the providing comprises providing the output via a communications channel that is accessible to the first modeling environment and the second modeling environment 5-12. (canceled) | 2,100 |
5,445 | 5,445 | 13,531,995 | 2,128 | Cooperative modeling of discrete system elements and continuous system elements is described, in which a discrete system element and a relationship between the discrete system element and a continuous system element is modeled in a first modeling environment, where a description of the discrete system element and of the relationship between the discrete system element and the continuous system element is exported from the first modeling environment to a second modeling environment, causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, where the continuous system element is modeled in the second modeling environment. | 1-4. (canceled) 5. A system for cooperative modeling of discrete system elements and continuous system elements, the system comprising:
a first modeling environment configured to model a discrete system element and an association between the discrete system element and a continuous system element; and a model exporter configured to export from the first modeling environment to a second modeling environment, a description of the discrete system element and of the association between the discrete system element and the continuous system element, thereby causing the discrete system element and the association between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 6. The system of claim 5 and further comprising a simulation manager configured to initiate a simulation of the discrete system element and the continuous system element in the second modeling environment, wherein an output of one of the elements during the simulation is provided as input to the other element during the simulation. 7. The system of claim 5 and further comprising a simulation manager configured to
initiate a simulation of the discrete system element in the first modeling environment, and
initiate a simulation of the continuous system element in the second modeling environment,
wherein an output of one of the elements during one of the simulations is provided as input to the other element during the other simulation. 8. The system according to claim 7 wherein either of the modeling environments is configured to provide the output via a communications channel that is accessible to the modeling environments. 9. A computer program product for cooperative modeling of discrete system elements and continuous system elements, the computer program product comprising:
a computer-readable storage medium; and computer-readable program code embodied in the computer-readable storage medium, wherein the computer-readable program code is configured to
to model a discrete system element and an association between the discrete system element and a continuous system element, and
export from the first modeling environment to a second modeling environment, a description of the discrete system element and of the association between the discrete system element and the continuous system element, thereby causing the discrete system element and the association between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 10. The computer program product of claim 9 wherein the computer-readable program code is configured to initiate a simulation of the discrete system element and the continuous system element in the second modeling environment, wherein an output of one of the elements during the simulation is provided as input to the other element during the simulation. 11. The computer program product of claim 9 wherein the computer-readable program code is configured to initiate a simulation of the discrete system element in the first modeling environment, and initiate a simulation of the continuous system element in the second modeling environment, wherein an output of one of the elements during one of the simulations is provided as input to the other element during the other simulation. 12. The computer program product according to claim 11 wherein either of the modeling environments is configured to provide the output via a communications channel that is accessible to the modeling environments. | Cooperative modeling of discrete system elements and continuous system elements is described, in which a discrete system element and a relationship between the discrete system element and a continuous system element is modeled in a first modeling environment, where a description of the discrete system element and of the relationship between the discrete system element and the continuous system element is exported from the first modeling environment to a second modeling environment, causing the discrete system element and the relationship between the discrete system element and the continuous system element to be modeled in the second modeling environment, where the continuous system element is modeled in the second modeling environment.1-4. (canceled) 5. A system for cooperative modeling of discrete system elements and continuous system elements, the system comprising:
a first modeling environment configured to model a discrete system element and an association between the discrete system element and a continuous system element; and a model exporter configured to export from the first modeling environment to a second modeling environment, a description of the discrete system element and of the association between the discrete system element and the continuous system element, thereby causing the discrete system element and the association between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 6. The system of claim 5 and further comprising a simulation manager configured to initiate a simulation of the discrete system element and the continuous system element in the second modeling environment, wherein an output of one of the elements during the simulation is provided as input to the other element during the simulation. 7. The system of claim 5 and further comprising a simulation manager configured to
initiate a simulation of the discrete system element in the first modeling environment, and
initiate a simulation of the continuous system element in the second modeling environment,
wherein an output of one of the elements during one of the simulations is provided as input to the other element during the other simulation. 8. The system according to claim 7 wherein either of the modeling environments is configured to provide the output via a communications channel that is accessible to the modeling environments. 9. A computer program product for cooperative modeling of discrete system elements and continuous system elements, the computer program product comprising:
a computer-readable storage medium; and computer-readable program code embodied in the computer-readable storage medium, wherein the computer-readable program code is configured to
to model a discrete system element and an association between the discrete system element and a continuous system element, and
export from the first modeling environment to a second modeling environment, a description of the discrete system element and of the association between the discrete system element and the continuous system element, thereby causing the discrete system element and the association between the discrete system element and the continuous system element to be modeled in the second modeling environment, wherein the continuous system element is modeled in the second modeling environment. 10. The computer program product of claim 9 wherein the computer-readable program code is configured to initiate a simulation of the discrete system element and the continuous system element in the second modeling environment, wherein an output of one of the elements during the simulation is provided as input to the other element during the simulation. 11. The computer program product of claim 9 wherein the computer-readable program code is configured to initiate a simulation of the discrete system element in the first modeling environment, and initiate a simulation of the continuous system element in the second modeling environment, wherein an output of one of the elements during one of the simulations is provided as input to the other element during the other simulation. 12. The computer program product according to claim 11 wherein either of the modeling environments is configured to provide the output via a communications channel that is accessible to the modeling environments. | 2,100 |
5,446 | 5,446 | 14,449,065 | 2,159 | The present system provide for more efficient processing, storage and querying of metrics from a distributed system from which large volumes of metrics are collected. The present metrics processing system may store billions of performance metrics in a persistence storage system, such as an HBase storage system, for several days, with minimum space required and at the same time retaining a low level data granularity. The reporting queries may use a unique technique to find required metrics in the HBase persistence store using a portion of the key as a bit array. The present metrics processing system may user a very small number of keys to store minute level metrics data for a metric for several hours. The metric values may be pivoted to multiple time-bucketed keys at different times during their life time in the system. | 1. A method for processing metrics, comprising:
receiving a plurality of payloads which each include time series data; storing a first time series data associated with a first time range with a first key; and storing the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. 2. The method of claim 1, further comprising generating a bit map for the time series data stored with the second key. 3. The method of claim 1, further comprising storing the time series data in a byte array associated with the first key and a time the data was received. 4. The method of claim 3, further comprising storing a plurality of byte arrays associated with first key as a single byte array associated with the second key. 5. The method of claim 1, further comprising storing the time series data associated with the second key as a compressed byte array associated with a third key. 6. The method of claim 1, further comprising storing a plurality of bit maps associated with the second key as a single bit map associated with the third key. 7. The method of claim 1, wherein the first time series and at least one other time series data of the plurality of time series data is stored with the second key after a threshold period of time has been satisfied. 8. The method of claim 1, further comprising allowing the time series data associated with the first key to be overwritten once the time series data associated with the first key is associated with the second key. 9. A method for processing metrics, comprising:
receiving metric data for a metric type; updating one or more groups of data associated with a time period for the metric type, wherein the groups are associated with at least two different periods of time; and providing at least two groups associated with different periods of time in response to a query for metric data over a period of time. 10. The method according to claim 9, wherein the groups of data are provided to a cache for receiving queries. 11. A non-transitory computer readable storage medium having embodied thereon a program, the program being executable by a processor to perform a method for processing metrics, the method comprising:
receiving a plurality of payloads which each include time series data; storing a first time series data associated with a first time range with a first key; and storing the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. 12. A system for processing metrics, comprising:
a processor; a memory; and one or more modules stored in memory and executable by a processor to receive a plurality of payloads which each include time series data, store a first time series data associated with a first time range with a first key, and store the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. | The present system provide for more efficient processing, storage and querying of metrics from a distributed system from which large volumes of metrics are collected. The present metrics processing system may store billions of performance metrics in a persistence storage system, such as an HBase storage system, for several days, with minimum space required and at the same time retaining a low level data granularity. The reporting queries may use a unique technique to find required metrics in the HBase persistence store using a portion of the key as a bit array. The present metrics processing system may user a very small number of keys to store minute level metrics data for a metric for several hours. The metric values may be pivoted to multiple time-bucketed keys at different times during their life time in the system.1. A method for processing metrics, comprising:
receiving a plurality of payloads which each include time series data; storing a first time series data associated with a first time range with a first key; and storing the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. 2. The method of claim 1, further comprising generating a bit map for the time series data stored with the second key. 3. The method of claim 1, further comprising storing the time series data in a byte array associated with the first key and a time the data was received. 4. The method of claim 3, further comprising storing a plurality of byte arrays associated with first key as a single byte array associated with the second key. 5. The method of claim 1, further comprising storing the time series data associated with the second key as a compressed byte array associated with a third key. 6. The method of claim 1, further comprising storing a plurality of bit maps associated with the second key as a single bit map associated with the third key. 7. The method of claim 1, wherein the first time series and at least one other time series data of the plurality of time series data is stored with the second key after a threshold period of time has been satisfied. 8. The method of claim 1, further comprising allowing the time series data associated with the first key to be overwritten once the time series data associated with the first key is associated with the second key. 9. A method for processing metrics, comprising:
receiving metric data for a metric type; updating one or more groups of data associated with a time period for the metric type, wherein the groups are associated with at least two different periods of time; and providing at least two groups associated with different periods of time in response to a query for metric data over a period of time. 10. The method according to claim 9, wherein the groups of data are provided to a cache for receiving queries. 11. A non-transitory computer readable storage medium having embodied thereon a program, the program being executable by a processor to perform a method for processing metrics, the method comprising:
receiving a plurality of payloads which each include time series data; storing a first time series data associated with a first time range with a first key; and storing the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. 12. A system for processing metrics, comprising:
a processor; a memory; and one or more modules stored in memory and executable by a processor to receive a plurality of payloads which each include time series data, store a first time series data associated with a first time range with a first key, and store the first time series and at least one other time series data of the plurality of time series data associated with a second time range with a second key. | 2,100 |
5,447 | 5,447 | 14,210,259 | 2,129 | Techniques for automated Bayesian posterior sampling using Markov Chain Monte Carlo and related schemes are described. In an embodiment, one or more values in a stationarity phase for a system configured for Bayesian sampling may be initialized. Sampling may be performed in the stationarity phase based upon the one or more values to generate a plurality of samples. The plurality of samples may be evaluated based upon one or more stationarity criteria. The stationarity phase may be exited when the plurality of samples meets the one or more stationarity criteria. Other embodiments are described and claimed. | 1. An article of manufacture comprising a non-transitory computer-readable storage medium comprising instructions that, when executed, cause a system to:
initialize one or more values in a stationarity phase for a system configured for Bayesian sampling; perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; evaluate the plurality of samples based upon one or more stationarity criteria; and exit the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 2. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of one or more values in the stationarity phase, automatically initialize a number of tuning samples, a number of posterior samples, and a number of burn-in. 3. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the performing of sampling in the stationarity phase:
identify an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generate the plurality of samples from a posterior distribution using the MCMC algorithm. 4. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
evaluate the plurality of samples using one or more stationarity tests; and evaluate a burn-in proxy. 5. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of the one or more values in the stationarity phase:
automatically initialize a number of tuning samples based upon a percentage of successful stationary tests; automatically initialize a number of posterior samples based upon one or more proxies; and automatically initialize a number of burn-in based upon one or more proxies. 6. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of one or more values in the stationarity phase, initialize a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 7. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
perform one or more stationarity tests on a plurality of posterior samples; evaluate one or more proxies for the plurality of posterior samples; and evaluate one or more proxies for a burn-in. 8. The article of claim 7, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
evaluate whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, output the plurality of samples. 9. The article of claim 7, further comprising instructions that, when executed, cause a system to generate the plurality of samples from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 10. A computer-implemented method, comprising:
initializing, with a computing system configured for Bayesian sampling, one or more values in a stationarity phase; performing sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; evaluating the plurality of samples based upon one or more stationarity criteria; and exiting the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 11. The computer-implemented method of claim 10, wherein the initializing of one or more values in the stationarity phase includes automatically initializing a number of tuning samples, a number of posterior samples, and a number of burn-in. 12. The computer-implemented method of claim 10, wherein performing sampling in the stationarity phase includes:
identifying an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generating the plurality of samples from a posterior distribution using the MCMC algorithm. 13. The computer-implemented method of claim 10, wherein the evaluation of the plurality of samples includes:
evaluating the plurality of samples using one or more stationarity tests; and evaluating a burn-in proxy. 14. The computer-implemented method of claim 10, wherein the initializing of the one or more values in the stationarity phase includes:
automatically initializing a number of tuning samples based upon a percentage of successful stationary tests; automatically initializing a number of posterior samples based upon one or more proxies; and automatically initializing a number of burn-in based upon one or more proxies. 15. The computer-implemented method of claim 10, wherein the initializing of one or more values in the stationarity phase includes initializing a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 16. The computer-implemented method of claim 10, wherein the evaluation of the plurality of samples includes:
performing one or more stationarity tests on a plurality of posterior samples; evaluating one or more proxies for the plurality of posterior samples; and evaluating one or more proxies for a burn-in. 17. The computer-implemented method of claim 16, wherein the evaluation of the plurality of samples includes:
evaluating whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, outputting the plurality of samples. 18. The computer-implemented method of claim 16, wherein the plurality of samples are generated from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 19. An apparatus, comprising:
processor circuitry; and at least one memory unit communicatively coupled to the processor circuitry, the at least one memory unit configured to store: an initialization module configured to initialize one or more values in a stationarity phase for a system configured for Bayesian sampling; a sampling module configured to perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; and an evaluation module configured to evaluate the plurality of samples based upon one or more stationarity criteria, and exit the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 20. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of one or more values in the stationarity phase, automatically initialize a number of tuning samples, a number of posterior samples, and a number of burn-in. 21. The apparatus of claim 19, wherein the sampling module is further configured to, during performing the sampling in the stationarity phase:
identify an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generate the plurality of samples from a posterior distribution using the MCMC algorithm. 22. The apparatus of claim 19, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
evaluate the plurality of samples using one or more stationarity tests; and evaluate a burn-in proxy. 23. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of the one or more values in the stationarity phase:
automatically initialize a number of tuning samples based upon a percentage of successful stationary tests; automatically initialize a number of posterior samples based upon one or more proxies; and automatically initialize a number of burn-in based upon one or more proxies. 24. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of one or more values in the stationarity phase, initialize a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 25. The apparatus of claim 19, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
perform one or more stationarity tests on a plurality of posterior samples; evaluate one or more proxies for the plurality of posterior samples; and evaluate one or more proxies for a burn-in. 26. The apparatus of claim 25, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
evaluate whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, output the plurality of samples. 27. The apparatus of claim 25, wherein the sampling module is further configured to generate the plurality of samples from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 28. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, the computer-program product including instructions operable to cause a computing device to perform operations including:
executing a stationarity phase of a system configured for Bayesian sampling, the execution of the stationarity phase comprising operations including:
initialize one or more values;
perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples;
accessing one or more stationarity criteria;
evaluate the plurality of samples based upon the one or more stationarity criteria; and
ending the execution of the stationarity phase when the plurality of samples meets the one or more stationarity criteria. | Techniques for automated Bayesian posterior sampling using Markov Chain Monte Carlo and related schemes are described. In an embodiment, one or more values in a stationarity phase for a system configured for Bayesian sampling may be initialized. Sampling may be performed in the stationarity phase based upon the one or more values to generate a plurality of samples. The plurality of samples may be evaluated based upon one or more stationarity criteria. The stationarity phase may be exited when the plurality of samples meets the one or more stationarity criteria. Other embodiments are described and claimed.1. An article of manufacture comprising a non-transitory computer-readable storage medium comprising instructions that, when executed, cause a system to:
initialize one or more values in a stationarity phase for a system configured for Bayesian sampling; perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; evaluate the plurality of samples based upon one or more stationarity criteria; and exit the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 2. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of one or more values in the stationarity phase, automatically initialize a number of tuning samples, a number of posterior samples, and a number of burn-in. 3. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the performing of sampling in the stationarity phase:
identify an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generate the plurality of samples from a posterior distribution using the MCMC algorithm. 4. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
evaluate the plurality of samples using one or more stationarity tests; and evaluate a burn-in proxy. 5. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of the one or more values in the stationarity phase:
automatically initialize a number of tuning samples based upon a percentage of successful stationary tests; automatically initialize a number of posterior samples based upon one or more proxies; and automatically initialize a number of burn-in based upon one or more proxies. 6. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the initializing of one or more values in the stationarity phase, initialize a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 7. The article of claim 1, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
perform one or more stationarity tests on a plurality of posterior samples; evaluate one or more proxies for the plurality of posterior samples; and evaluate one or more proxies for a burn-in. 8. The article of claim 7, further comprising instructions that, when executed, cause a system to, during the evaluation of the plurality of samples:
evaluate whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, output the plurality of samples. 9. The article of claim 7, further comprising instructions that, when executed, cause a system to generate the plurality of samples from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 10. A computer-implemented method, comprising:
initializing, with a computing system configured for Bayesian sampling, one or more values in a stationarity phase; performing sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; evaluating the plurality of samples based upon one or more stationarity criteria; and exiting the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 11. The computer-implemented method of claim 10, wherein the initializing of one or more values in the stationarity phase includes automatically initializing a number of tuning samples, a number of posterior samples, and a number of burn-in. 12. The computer-implemented method of claim 10, wherein performing sampling in the stationarity phase includes:
identifying an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generating the plurality of samples from a posterior distribution using the MCMC algorithm. 13. The computer-implemented method of claim 10, wherein the evaluation of the plurality of samples includes:
evaluating the plurality of samples using one or more stationarity tests; and evaluating a burn-in proxy. 14. The computer-implemented method of claim 10, wherein the initializing of the one or more values in the stationarity phase includes:
automatically initializing a number of tuning samples based upon a percentage of successful stationary tests; automatically initializing a number of posterior samples based upon one or more proxies; and automatically initializing a number of burn-in based upon one or more proxies. 15. The computer-implemented method of claim 10, wherein the initializing of one or more values in the stationarity phase includes initializing a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 16. The computer-implemented method of claim 10, wherein the evaluation of the plurality of samples includes:
performing one or more stationarity tests on a plurality of posterior samples; evaluating one or more proxies for the plurality of posterior samples; and evaluating one or more proxies for a burn-in. 17. The computer-implemented method of claim 16, wherein the evaluation of the plurality of samples includes:
evaluating whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, outputting the plurality of samples. 18. The computer-implemented method of claim 16, wherein the plurality of samples are generated from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 19. An apparatus, comprising:
processor circuitry; and at least one memory unit communicatively coupled to the processor circuitry, the at least one memory unit configured to store: an initialization module configured to initialize one or more values in a stationarity phase for a system configured for Bayesian sampling; a sampling module configured to perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples; and an evaluation module configured to evaluate the plurality of samples based upon one or more stationarity criteria, and exit the stationarity phase when the plurality of samples meets the one or more stationarity criteria. 20. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of one or more values in the stationarity phase, automatically initialize a number of tuning samples, a number of posterior samples, and a number of burn-in. 21. The apparatus of claim 19, wherein the sampling module is further configured to, during performing the sampling in the stationarity phase:
identify an optimal proposal distribution for a Markov Chain Monte Carlo (MCMC) algorithm; and generate the plurality of samples from a posterior distribution using the MCMC algorithm. 22. The apparatus of claim 19, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
evaluate the plurality of samples using one or more stationarity tests; and evaluate a burn-in proxy. 23. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of the one or more values in the stationarity phase:
automatically initialize a number of tuning samples based upon a percentage of successful stationary tests; automatically initialize a number of posterior samples based upon one or more proxies; and automatically initialize a number of burn-in based upon one or more proxies. 24. The apparatus of claim 19, wherein the initialization module is further configured to, during the initializing of one or more values in the stationarity phase, initialize a number of tuning samples, a number of posterior samples, and a number of burn-in based upon user-provided values or default values. 25. The apparatus of claim 19, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
perform one or more stationarity tests on a plurality of posterior samples; evaluate one or more proxies for the plurality of posterior samples; and evaluate one or more proxies for a burn-in. 26. The apparatus of claim 25, wherein the evaluation module is further configured to, during the evaluation of the plurality of samples:
evaluate whether the one or more stationarity criteria have been met by the one or more stationarity tests, the evaluation of one or more proxies for the plurality of posterior samples, and the evaluation of one or more proxies for the burn-in; and when the one or more stationarity criteria have been met, output the plurality of samples. 27. The apparatus of claim 25, wherein the sampling module is further configured to generate the plurality of samples from a posterior distribution using a Markov Chain Monte Carlo (MCMC) algorithm. 28. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, the computer-program product including instructions operable to cause a computing device to perform operations including:
executing a stationarity phase of a system configured for Bayesian sampling, the execution of the stationarity phase comprising operations including:
initialize one or more values;
perform sampling in the stationarity phase based upon the one or more values to generate a plurality of samples;
accessing one or more stationarity criteria;
evaluate the plurality of samples based upon the one or more stationarity criteria; and
ending the execution of the stationarity phase when the plurality of samples meets the one or more stationarity criteria. | 2,100 |
5,448 | 5,448 | 15,080,533 | 2,144 | The present invention provides a method of embedding, transferring and communicating custom generated emojis/emoticons having unique physical features. | 1. A method of transmitting emojis/emoticons with diverse ethnic physical features in messages from a mobile device:
(a) storing a plurality of predefined emoji/emoticon images representing a plurality of diverse ethnic background in a physical database; (b) displaying a selected ethnic group of images from the physical database onto a display screen of the mobile device; (c) displaying a predetermined selection of skin tones onto a display screen of the mobile device; (d) displaying an actuator through a user interface for a user to capture a selected diverse ethnic emoji/emoticon; (e) collecting the selected diverse ethnic emoji/emoticon into a buffer memory storage area wherein a diverse emoji/emoticon sentence is created; (f) repeating steps b-e (g) incorporating the diverse emoji/emoticon sentence into a buffer message; and (h) transmitting the buffer message to one or many devices utilizing a transmission protocol. 2. The method of claim 1 wherein the displaying the selected ethnic group further comprises displaying an emoji/emoticon from the group consisting of African-American and Asian, Latino/Hispanic, Indian, Caucasian and Biracial. 3. The method of claim 1 wherein displaying the selected ethnic group further comprises displaying the selected ethnic group onto a simulated keyboard interface. 4. The method of claim 1 further comprising:
utilizing software interface, activating a multi-select option;
selecting at least one diverse emoji/emoticon storing the emoji/emoticon in a message buffer; and
transmitting the message buffer to an end user. 5. The method of claim 1 further comprising:
accepting input of an emoji/emoticon from an end user;
vertically displaying the emoji/emoticon onto the mobile device;
placing emoji/emoticon into a message buffer;
repeating step a-b until the end user selection an emoticon sentence is created;
sizing a horizontal container to accommodate the emoticon sentence;
displaying the horizontal container on the mobile device; 6. The method of claim 1 wherein displaying the predetermined skin tones further comprises displaying a skin tone from the group consisting of ivory, toffee, chocolate, olive, bronze. 7. A system of transmitting emojis/emoticons with diverse ethnic physical features in messages from a mobile device:
(a) means for storing a plurality of predefined emoji/emoticon images representing a plurality of diverse ethnic background in a physical database; (b) means for displaying a selected ethnic group of images from the physical database onto a display screen of the mobile device; (c) means for displaying a predetermined selection of skin tones onto a display screen of the mobile device; (d) means for displaying an actuator through a user interface for a user to capture a selected diverse ethnic emoji/emoticon; (e) means for collecting the selected diverse ethnic emoji/emoticon into a buffer memory storage area wherein a diverse emoji/emoticon sentence is created; (f) repeating steps b-e (g) means for incorporating the diverse emoji/emoticon sentence into a buffer message; and (h) means for transmitting the buffer message to one or many devices utilizing a transmission protocol. | The present invention provides a method of embedding, transferring and communicating custom generated emojis/emoticons having unique physical features.1. A method of transmitting emojis/emoticons with diverse ethnic physical features in messages from a mobile device:
(a) storing a plurality of predefined emoji/emoticon images representing a plurality of diverse ethnic background in a physical database; (b) displaying a selected ethnic group of images from the physical database onto a display screen of the mobile device; (c) displaying a predetermined selection of skin tones onto a display screen of the mobile device; (d) displaying an actuator through a user interface for a user to capture a selected diverse ethnic emoji/emoticon; (e) collecting the selected diverse ethnic emoji/emoticon into a buffer memory storage area wherein a diverse emoji/emoticon sentence is created; (f) repeating steps b-e (g) incorporating the diverse emoji/emoticon sentence into a buffer message; and (h) transmitting the buffer message to one or many devices utilizing a transmission protocol. 2. The method of claim 1 wherein the displaying the selected ethnic group further comprises displaying an emoji/emoticon from the group consisting of African-American and Asian, Latino/Hispanic, Indian, Caucasian and Biracial. 3. The method of claim 1 wherein displaying the selected ethnic group further comprises displaying the selected ethnic group onto a simulated keyboard interface. 4. The method of claim 1 further comprising:
utilizing software interface, activating a multi-select option;
selecting at least one diverse emoji/emoticon storing the emoji/emoticon in a message buffer; and
transmitting the message buffer to an end user. 5. The method of claim 1 further comprising:
accepting input of an emoji/emoticon from an end user;
vertically displaying the emoji/emoticon onto the mobile device;
placing emoji/emoticon into a message buffer;
repeating step a-b until the end user selection an emoticon sentence is created;
sizing a horizontal container to accommodate the emoticon sentence;
displaying the horizontal container on the mobile device; 6. The method of claim 1 wherein displaying the predetermined skin tones further comprises displaying a skin tone from the group consisting of ivory, toffee, chocolate, olive, bronze. 7. A system of transmitting emojis/emoticons with diverse ethnic physical features in messages from a mobile device:
(a) means for storing a plurality of predefined emoji/emoticon images representing a plurality of diverse ethnic background in a physical database; (b) means for displaying a selected ethnic group of images from the physical database onto a display screen of the mobile device; (c) means for displaying a predetermined selection of skin tones onto a display screen of the mobile device; (d) means for displaying an actuator through a user interface for a user to capture a selected diverse ethnic emoji/emoticon; (e) means for collecting the selected diverse ethnic emoji/emoticon into a buffer memory storage area wherein a diverse emoji/emoticon sentence is created; (f) repeating steps b-e (g) means for incorporating the diverse emoji/emoticon sentence into a buffer message; and (h) means for transmitting the buffer message to one or many devices utilizing a transmission protocol. | 2,100 |
5,449 | 5,449 | 14,593,709 | 2,127 | A computer-based system and method for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit is provided. A modeling tool has a symbol-based program with the signal that is to be assigned. The signal to be assigned of the symbol-based program and the at least one I/O functionality of the target hardware unit are specified in a configuration tool. Using the modeling tool, an I/O functionality of the target hardware unit is assigned in the symbol-based program to the signal that is to be assigned. A signal assignment information item is generated in the modeling tool from this assignment. The signal assignment information item is transmitted from the modeling tool to the configuration tool, and the configuration tool takes over the assignment to the I/O functionality of the target hardware unit of the signal to be assigned of the symbol-based program according to the signal assignment information item. | 1. A computer-implemented method for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the method comprising:
providing a modeling tool that has the symbol-based program with the signal that is to be assigned, the signal of the symbol-based program and the at least one I/O functionality of the target hardware unit being specified in a configuration tool; using the modeling tool, an I/O functionality of the target hardware unit is assigned in the symbol-based program to the signal that is to be assigned; generating a signal assignment information item in the modeling tool from this assignment; automatically transmitting the signal assignment information item from the modeling tool to the configuration tool; and taking over, via the configuration tool, the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit according to the signal assignment information item. 2. The method according to claim 1, wherein at least one input option is provided in the modeling tool for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit based on at least one I/O functionality information item from the configuration tool. 3. The method according to claim 2, wherein the signal to be assigned of the symbol-based program or the I/O functionality of the target hardware unit is selected in the modeling tool, a resultant selection information item is automatically transmitted from the modeling tool to the configuration tool, and the configuration tool provides the I/O functionality information item to the modeling tool based on the selection information item. 4. The method according to claim 2, wherein the at least one I/O functionality information item is provided by the configuration tool as a function of at least one setting in the configuration tool. 5. The method according to claim 2, wherein the at least one I/O functionality information item from the configuration tool is provided as a function of at least one previous input in the modeling tool. 6. The method according to claim 1, wherein the I/O functionality of the target hardware unit is represented by a graphical access point in the modeling tool or in the symbol-based program of the modeling tool. 7. The method according to claim 6, wherein the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit takes place through an assignment to the graphical access point of the signal to be assigned of the symbol-based program. 8. The method according to claim 6, wherein after a change in the I/O functionality of the target hardware unit in the configuration tool, a change takes place in the graphical access point representing the changed I/O functionality of the target hardware unit in the modeling tool or in the symbol-based program of the modeling tool. 9. The computer-based system for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the system comprising:
a modeling tool having the symbol-based program with the signal that is to be assigned, the signal of the symbol-based program and the at least one I/O functionality of the target hardware unit being specified in the configuration tool; and a signal assignment information item provided in the modeling tool, the signal assignment information item containing an assignment of the assigned signal of the symbol-based program to an I/O functionality of the target hardware unit, wherein the configuration tool contains an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit according to the signal assignment information item from the modeling tool. 10. The computer-based system according to claim 9, wherein the modeling tool has an input option for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the input option is based on at least one I/O functionality information item of the configuration tool. 11. The computer-based system according to claim 10, wherein the I/O functionality information item in the configuration tool is based on a selection information item relating to the selected signal to be assigned of the symbol-based program or the I/O functionality of the target hardware unit selected in the modeling tool. 12. The computer-based system according to claim 10, wherein the I/O functionality information item in the configuration tool is based on a setting in the configuration tool or a previous input in the modeling tool. 13. The computer-based system according to claim 9, wherein the modeling tool or the symbol-based program has at least one graphical access point, and wherein the graphical access point represents at least one I/O functionality of the target hardware unit. 14. The computer-based system according to claim 13, wherein the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit is defined by an assignment of the signal to be assigned of the symbol-based program to the graphical access point representing the I/O function. 15. The computer-based system according to claim 13, wherein, after a change in the I/O functionality of the target hardware unit in the configuration tool, the graphical access point in the modeling tool or in the symbol-based program of the modeling tool is adapted to the change in the I/O functionality of the target hardware unit in the configuration tool. 16. A modeling tool with functionality for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the modeling tool comprising the symbol-based program with the signal that is to be assigned, wherein a signal assignment information item is provided in the modeling tool, wherein the signal assignment information item contains an assignment of the signal to be assigned of the symbol-based program to an I/O functionality of the target hardware unit, and wherein the signal assignment information item of the modeling tool forms a basis for an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit in a configuration tool. 17. The modeling tool according to claim 16, wherein the modeling tool has an input option for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the input option is based on at least one I/O functionality information item of the configuration tool. 18. A configuration tool for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit,
wherein the signal to be assigned of the symbol-based program and the at least one I/O functionality of the target hardware unit are specified in the configuration tool, wherein a signal assignment information item from a modeling tool is present in the configuration tool, wherein the signal assignment information item contains an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the configuration tool contains an assignment of the assigned signal of the symbol-based program to an I/O functionality of the target hardware unit based on the signal assignment information item from the modeling tool of the configuration tool. 19. The configuration tool according to claim 18, wherein the configuration tool has an I/O functionality information item in the configuration tool based on a selection information item relating to the selected signal to be assigned of the symbol-based program or to the I/O functionality of the target hardware unit selected in the modeling tool, and wherein the I/O functionality information item from the configuration tool forms the basis for the signal assignment information item in the modeling tool. | A computer-based system and method for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit is provided. A modeling tool has a symbol-based program with the signal that is to be assigned. The signal to be assigned of the symbol-based program and the at least one I/O functionality of the target hardware unit are specified in a configuration tool. Using the modeling tool, an I/O functionality of the target hardware unit is assigned in the symbol-based program to the signal that is to be assigned. A signal assignment information item is generated in the modeling tool from this assignment. The signal assignment information item is transmitted from the modeling tool to the configuration tool, and the configuration tool takes over the assignment to the I/O functionality of the target hardware unit of the signal to be assigned of the symbol-based program according to the signal assignment information item.1. A computer-implemented method for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the method comprising:
providing a modeling tool that has the symbol-based program with the signal that is to be assigned, the signal of the symbol-based program and the at least one I/O functionality of the target hardware unit being specified in a configuration tool; using the modeling tool, an I/O functionality of the target hardware unit is assigned in the symbol-based program to the signal that is to be assigned; generating a signal assignment information item in the modeling tool from this assignment; automatically transmitting the signal assignment information item from the modeling tool to the configuration tool; and taking over, via the configuration tool, the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit according to the signal assignment information item. 2. The method according to claim 1, wherein at least one input option is provided in the modeling tool for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit based on at least one I/O functionality information item from the configuration tool. 3. The method according to claim 2, wherein the signal to be assigned of the symbol-based program or the I/O functionality of the target hardware unit is selected in the modeling tool, a resultant selection information item is automatically transmitted from the modeling tool to the configuration tool, and the configuration tool provides the I/O functionality information item to the modeling tool based on the selection information item. 4. The method according to claim 2, wherein the at least one I/O functionality information item is provided by the configuration tool as a function of at least one setting in the configuration tool. 5. The method according to claim 2, wherein the at least one I/O functionality information item from the configuration tool is provided as a function of at least one previous input in the modeling tool. 6. The method according to claim 1, wherein the I/O functionality of the target hardware unit is represented by a graphical access point in the modeling tool or in the symbol-based program of the modeling tool. 7. The method according to claim 6, wherein the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit takes place through an assignment to the graphical access point of the signal to be assigned of the symbol-based program. 8. The method according to claim 6, wherein after a change in the I/O functionality of the target hardware unit in the configuration tool, a change takes place in the graphical access point representing the changed I/O functionality of the target hardware unit in the modeling tool or in the symbol-based program of the modeling tool. 9. The computer-based system for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the system comprising:
a modeling tool having the symbol-based program with the signal that is to be assigned, the signal of the symbol-based program and the at least one I/O functionality of the target hardware unit being specified in the configuration tool; and a signal assignment information item provided in the modeling tool, the signal assignment information item containing an assignment of the assigned signal of the symbol-based program to an I/O functionality of the target hardware unit, wherein the configuration tool contains an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit according to the signal assignment information item from the modeling tool. 10. The computer-based system according to claim 9, wherein the modeling tool has an input option for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the input option is based on at least one I/O functionality information item of the configuration tool. 11. The computer-based system according to claim 10, wherein the I/O functionality information item in the configuration tool is based on a selection information item relating to the selected signal to be assigned of the symbol-based program or the I/O functionality of the target hardware unit selected in the modeling tool. 12. The computer-based system according to claim 10, wherein the I/O functionality information item in the configuration tool is based on a setting in the configuration tool or a previous input in the modeling tool. 13. The computer-based system according to claim 9, wherein the modeling tool or the symbol-based program has at least one graphical access point, and wherein the graphical access point represents at least one I/O functionality of the target hardware unit. 14. The computer-based system according to claim 13, wherein the assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit is defined by an assignment of the signal to be assigned of the symbol-based program to the graphical access point representing the I/O function. 15. The computer-based system according to claim 13, wherein, after a change in the I/O functionality of the target hardware unit in the configuration tool, the graphical access point in the modeling tool or in the symbol-based program of the modeling tool is adapted to the change in the I/O functionality of the target hardware unit in the configuration tool. 16. A modeling tool with functionality for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit, the modeling tool comprising the symbol-based program with the signal that is to be assigned, wherein a signal assignment information item is provided in the modeling tool, wherein the signal assignment information item contains an assignment of the signal to be assigned of the symbol-based program to an I/O functionality of the target hardware unit, and wherein the signal assignment information item of the modeling tool forms a basis for an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit in a configuration tool. 17. The modeling tool according to claim 16, wherein the modeling tool has an input option for assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the input option is based on at least one I/O functionality information item of the configuration tool. 18. A configuration tool for assigning at least one signal of a symbol-based program to at least one I/O functionality of a target hardware unit,
wherein the signal to be assigned of the symbol-based program and the at least one I/O functionality of the target hardware unit are specified in the configuration tool, wherein a signal assignment information item from a modeling tool is present in the configuration tool, wherein the signal assignment information item contains an assignment of the signal to be assigned of the symbol-based program to the I/O functionality of the target hardware unit, and wherein the configuration tool contains an assignment of the assigned signal of the symbol-based program to an I/O functionality of the target hardware unit based on the signal assignment information item from the modeling tool of the configuration tool. 19. The configuration tool according to claim 18, wherein the configuration tool has an I/O functionality information item in the configuration tool based on a selection information item relating to the selected signal to be assigned of the symbol-based program or to the I/O functionality of the target hardware unit selected in the modeling tool, and wherein the I/O functionality information item from the configuration tool forms the basis for the signal assignment information item in the modeling tool. | 2,100 |
5,450 | 5,450 | 14,542,728 | 2,143 | An information display device includes an input interface that accepts an input manipulation including setting a starting location and a destination, and a processor that displays in a display area, an object and a manipulator for use to enter an instruction to change the display state of the object. The processor changes the display state in accordance with a vector to be defined by the distance and direction from the starting location to the destination. The processor performs a first type of processing in response to the input manipulation done on a region other than a region of the manipulator, and a second type of processing of changing the display state in response to the input manipulation done on the region of the manipulator. In the second type of processing, the display state of the object can be changed more finely than in the first type of processing. | 1. An information display device comprising:
an input interface configured to accept an input manipulation, including setting a starting location and a destination, in a display area of a display screen, a processor configured to:
display, in the display area of the display screen, an object, of which a display state is changeable, and a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object;
change the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination;
perform a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown, and a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where the manipulator is shown; and
change, when performing the second type of processing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than when performing the first type of processing. 2. The information display device of claim 1, wherein the processor is configured to operate in a first mode in which the manipulator is hidden from the display area of the display screen and in a second mode in which the manipulator is shown in the display area of the display screen. 3. An information display device comprising:
an input interface configured to accept an input manipulation, including setting a starting location and a destination, in a display area of a display screen, a processor configured to:
display, in the display area of the display screen, an object, of which a display state is changeable, and a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object;
change the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination;
operate in a first mode in which the manipulator is hidden from the display area and in a second mode in which the manipulator is shown in the display area; and
wherein processing of changing the display state of the object in response to the input manipulation that has been done in the first mode is called a first type of processing, and processing of changing the display state of the object in response to the input manipulation that has been done on a region of the display area where the manipulator is shown in the second mode is called a second type of processing,
change, when performing the second type of processing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than when performing the first type of processing. 4. The information display device of claim 1, wherein while the manipulator is being shown in the display area of the display screen, the processor performs the first type of processing when the input manipulation has been done on a region of the display area where the object is being displayed, and performs the second type of processing when the input manipulation has been done on the manipulator. 5. The information display device of claim 1, wherein while performing the second type of processing, when the distance between the starting location and the destination that have been set by the input manipulation is as long as an interval between the plurality of markers, the processor makes a change in the display state of the object so that the change is going to be a natural number of times as large as a unit of change of the object. 6. The information display device of claim 1, wherein the processor is configured to: determine, by the distance between the starting location and the destination, how much the change to be made in the display state of the object is going to be greater than the unit of change; and determine the direction of change in the display state of the object by the direction from the starting location toward the destination. 7. The information display device of claim 1, wherein each of the plurality of markers in the manipulator is selected from the group consisting of dots, a ruler and grid points. 8. The information display device of claim 1, wherein the change to be made in the display state of the object includes at least one of rotating, zooming in on or zooming out of, moving, deforming, and changing a focus state of the object. 9. The information display device of claim 1, wherein the unit of change of the display state of the object is equal to a minimum unit of resolution that either the object or the display screen has. 10. The information display device of claim 1, wherein the input manipulation is swiping or dragging from the starting location to the destination, or tapping or clicking on two of the plurality of markers. 11. The information display device of claim 1, wherein the input manipulation includes a swipe or drag manipulation from the starting location to the destination, and
the processor is configured to operate in the first mode in which the manipulator is hidden from the display area when the velocity of the swipe or drag manipulation is equal to or greater than a preset threshold value, and otherwise operate in the second mode in which the manipulator is shown in the display area. 12. The information display device of claim 1, wherein the processor is configured to display, on the display screen, a mode switching indicator indicating that the modes of operation be changed from the first mode in which the manipulator is hidden from the display area into the second mode in which the manipulator is shown in the display area, or vice versa, and change the modes of operation from one of the first and second modes into the other one in response to an instruction that has been entered with the mode switching indicator. 13. The information display device of claim 1, wherein the object includes at least one image selected from the group consisting of a human body anatomy image, a machine or mechanism image, and an e-commerce product image. 14. The information display device of claim 1, further comprising the display screen,
wherein the input interface includes a touchscreen panel attached to the display screen. 15. An information display method comprising:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where at least the manipulator is shown, wherein the performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 16. A non-transitory computer-readable medium storing a computer program to be executed by a computer, the program causing the computer to execute:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where at least the manipulator is shown, wherein the performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 17. An information display method comprising:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; changing the modes of operation from a first mode in which the manipulator is hidden from the display area into a second mode in which the manipulator is shown in the display area, or vice versa; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done in the first mode; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region of the display area where at least the manipulator is shown in the second mode, wherein the step of performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 18. A non-transitory computer-readable medium storing a computer program to be executed by a computer, the program causing the computer to execute:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; changing the modes of operation from a first mode in which the manipulator is hidden from the display area into a second mode in which the manipulator is shown in the display area, or vice versa; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done in the first mode; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region of the display area where at least the manipulator is shown in the second mode, wherein the step of performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. | An information display device includes an input interface that accepts an input manipulation including setting a starting location and a destination, and a processor that displays in a display area, an object and a manipulator for use to enter an instruction to change the display state of the object. The processor changes the display state in accordance with a vector to be defined by the distance and direction from the starting location to the destination. The processor performs a first type of processing in response to the input manipulation done on a region other than a region of the manipulator, and a second type of processing of changing the display state in response to the input manipulation done on the region of the manipulator. In the second type of processing, the display state of the object can be changed more finely than in the first type of processing.1. An information display device comprising:
an input interface configured to accept an input manipulation, including setting a starting location and a destination, in a display area of a display screen, a processor configured to:
display, in the display area of the display screen, an object, of which a display state is changeable, and a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object;
change the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination;
perform a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown, and a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where the manipulator is shown; and
change, when performing the second type of processing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than when performing the first type of processing. 2. The information display device of claim 1, wherein the processor is configured to operate in a first mode in which the manipulator is hidden from the display area of the display screen and in a second mode in which the manipulator is shown in the display area of the display screen. 3. An information display device comprising:
an input interface configured to accept an input manipulation, including setting a starting location and a destination, in a display area of a display screen, a processor configured to:
display, in the display area of the display screen, an object, of which a display state is changeable, and a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object;
change the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination;
operate in a first mode in which the manipulator is hidden from the display area and in a second mode in which the manipulator is shown in the display area; and
wherein processing of changing the display state of the object in response to the input manipulation that has been done in the first mode is called a first type of processing, and processing of changing the display state of the object in response to the input manipulation that has been done on a region of the display area where the manipulator is shown in the second mode is called a second type of processing,
change, when performing the second type of processing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than when performing the first type of processing. 4. The information display device of claim 1, wherein while the manipulator is being shown in the display area of the display screen, the processor performs the first type of processing when the input manipulation has been done on a region of the display area where the object is being displayed, and performs the second type of processing when the input manipulation has been done on the manipulator. 5. The information display device of claim 1, wherein while performing the second type of processing, when the distance between the starting location and the destination that have been set by the input manipulation is as long as an interval between the plurality of markers, the processor makes a change in the display state of the object so that the change is going to be a natural number of times as large as a unit of change of the object. 6. The information display device of claim 1, wherein the processor is configured to: determine, by the distance between the starting location and the destination, how much the change to be made in the display state of the object is going to be greater than the unit of change; and determine the direction of change in the display state of the object by the direction from the starting location toward the destination. 7. The information display device of claim 1, wherein each of the plurality of markers in the manipulator is selected from the group consisting of dots, a ruler and grid points. 8. The information display device of claim 1, wherein the change to be made in the display state of the object includes at least one of rotating, zooming in on or zooming out of, moving, deforming, and changing a focus state of the object. 9. The information display device of claim 1, wherein the unit of change of the display state of the object is equal to a minimum unit of resolution that either the object or the display screen has. 10. The information display device of claim 1, wherein the input manipulation is swiping or dragging from the starting location to the destination, or tapping or clicking on two of the plurality of markers. 11. The information display device of claim 1, wherein the input manipulation includes a swipe or drag manipulation from the starting location to the destination, and
the processor is configured to operate in the first mode in which the manipulator is hidden from the display area when the velocity of the swipe or drag manipulation is equal to or greater than a preset threshold value, and otherwise operate in the second mode in which the manipulator is shown in the display area. 12. The information display device of claim 1, wherein the processor is configured to display, on the display screen, a mode switching indicator indicating that the modes of operation be changed from the first mode in which the manipulator is hidden from the display area into the second mode in which the manipulator is shown in the display area, or vice versa, and change the modes of operation from one of the first and second modes into the other one in response to an instruction that has been entered with the mode switching indicator. 13. The information display device of claim 1, wherein the object includes at least one image selected from the group consisting of a human body anatomy image, a machine or mechanism image, and an e-commerce product image. 14. The information display device of claim 1, further comprising the display screen,
wherein the input interface includes a touchscreen panel attached to the display screen. 15. An information display method comprising:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where at least the manipulator is shown, wherein the performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 16. A non-transitory computer-readable medium storing a computer program to be executed by a computer, the program causing the computer to execute:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done on at least a region of the display area of the display screen other than a region where the manipulator is shown; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region where at least the manipulator is shown, wherein the performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 17. An information display method comprising:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; changing the modes of operation from a first mode in which the manipulator is hidden from the display area into a second mode in which the manipulator is shown in the display area, or vice versa; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done in the first mode; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region of the display area where at least the manipulator is shown in the second mode, wherein the step of performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. 18. A non-transitory computer-readable medium storing a computer program to be executed by a computer, the program causing the computer to execute:
displaying an object, of which a display state is changeable, in a display area of a display screen; showing a manipulator including a plurality of markers for use to enter an instruction to change the display state of the object in the display area of the display screen; accepting an input manipulation, including setting a starting location and a destination, in the display area of the display screen; changing the display state of the object in accordance with a vector to be defined by the distance and direction from the starting location to the destination; changing the modes of operation from a first mode in which the manipulator is hidden from the display area into a second mode in which the manipulator is shown in the display area, or vice versa; performing a first type of processing of changing the display state of the object in response to the input manipulation that has been done in the first mode; and performing a second type of processing of changing the display state of the object in response to the input manipulation that has been done on the region of the display area where at least the manipulator is shown in the second mode, wherein the step of performing the second type of processing includes changing, in response to the input manipulation that has been done to define the same vector, the display state of the object more finely than in the step of performing the first type of processing. | 2,100 |
5,451 | 5,451 | 14,588,589 | 2,159 | A system, method, and computer-readable medium are disclosed for improved management of unattended user queries. An unattended user query management system is implemented to detect an unattended user query in a social media environment. Data associated with the unattended user query is then retrieved from the social media environment and processed to assign the unattended user query to a predetermined category. Once the unattended user query has been categorized, it is provided to a resource, such as a subject matter expert (SME), associated with the query. In response, an answer to the previously-unattended user query is received from the resource, which is then provided to the social media environment that was the source of the unattended user query. | 1. A computer-implementable method for improved management of unattended user queries, comprising:
detecting an unattended user query in a social media environment; retrieving data associated with the unattended user query from the social media environment; processing the retrieved data to assign the unattended user query to a category; providing the unattended user query to a resource associated with the category; receiving an answer to the unattended user query from the resource; and providing the answer to the social media environment that was the source of the unattended user query. 2. The method of claim 1, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 3. The method of claim 1, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 4. The method of claim 1, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 5. The method of claim 1, wherein the resource is a subject matter expert (SME). 6. The method of claim 1, wherein identity data associated with the resource is appended to the answer. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for improved management of unattended user queries and comprising instructions executable by the processor and configured for:
detecting an unattended user query in a social media environment;
retrieving data associated with the unattended user query from the social media environment;
processing the retrieved data to assign the unattended user query to a category;
providing the unattended user query to a resource associated with the category;
receiving an answer to the unattended user query from the resource; and
providing the answer to the social media environment that was the source of the unattended user query. 8. The system of claim 7, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 9. The system of claim 7, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 10. The system of claim 7, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 11. The system of claim 7, wherein the resource is a subject matter expert (SME). 12. The system of claim 7, wherein identity data associated with the resource is appended to the answer. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
detecting an unattended user query in a social media environment; retrieving data associated with the unattended user query from the social media environment; processing the retrieved data to assign the unattended user query to a category; providing the unattended user query to a resource associated with the category; receiving an answer to the unattended user query from the resource; and providing the answer to the social media environment that was the source of the unattended user query. 14. The non-transitory, computer-readable storage medium of claim 13, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 15. The non-transitory, computer-readable storage medium of claim 13, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 16. The non-transitory, computer-readable storage medium of claim 13, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 17. The non-transitory, computer-readable storage medium of claim 13, wherein the resource is a subject matter expert (SME). 18. The non-transitory, computer-readable storage medium of claim 13, wherein identity data associated with the resource is appended to the answer. | A system, method, and computer-readable medium are disclosed for improved management of unattended user queries. An unattended user query management system is implemented to detect an unattended user query in a social media environment. Data associated with the unattended user query is then retrieved from the social media environment and processed to assign the unattended user query to a predetermined category. Once the unattended user query has been categorized, it is provided to a resource, such as a subject matter expert (SME), associated with the query. In response, an answer to the previously-unattended user query is received from the resource, which is then provided to the social media environment that was the source of the unattended user query.1. A computer-implementable method for improved management of unattended user queries, comprising:
detecting an unattended user query in a social media environment; retrieving data associated with the unattended user query from the social media environment; processing the retrieved data to assign the unattended user query to a category; providing the unattended user query to a resource associated with the category; receiving an answer to the unattended user query from the resource; and providing the answer to the social media environment that was the source of the unattended user query. 2. The method of claim 1, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 3. The method of claim 1, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 4. The method of claim 1, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 5. The method of claim 1, wherein the resource is a subject matter expert (SME). 6. The method of claim 1, wherein identity data associated with the resource is appended to the answer. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for improved management of unattended user queries and comprising instructions executable by the processor and configured for:
detecting an unattended user query in a social media environment;
retrieving data associated with the unattended user query from the social media environment;
processing the retrieved data to assign the unattended user query to a category;
providing the unattended user query to a resource associated with the category;
receiving an answer to the unattended user query from the resource; and
providing the answer to the social media environment that was the source of the unattended user query. 8. The system of claim 7, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 9. The system of claim 7, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 10. The system of claim 7, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 11. The system of claim 7, wherein the resource is a subject matter expert (SME). 12. The system of claim 7, wherein identity data associated with the resource is appended to the answer. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
detecting an unattended user query in a social media environment; retrieving data associated with the unattended user query from the social media environment; processing the retrieved data to assign the unattended user query to a category; providing the unattended user query to a resource associated with the category; receiving an answer to the unattended user query from the resource; and providing the answer to the social media environment that was the source of the unattended user query. 14. The non-transitory, computer-readable storage medium of claim 13, wherein the data associated with the unattended user query comprises at least one member of the set of:
the Uniform Resource Locator (URL) of the unattended user query; a social media identifier of the social media environment associated with the unattended user query; a description of the unattended user query; and details associated with the unattended user query. 15. The non-transitory, computer-readable storage medium of claim 13, wherein the category is at least one member of the set of:
a social media environment; a market segment; a line of business (LOB); a product line; an individual product; a use of a product; a problem associated with a product; a provided service; a class of user; and a topic of user interest. 16. The non-transitory, computer-readable storage medium of claim 13, wherein the unattended user query is provided to the resource in a communication format comprising at least one member of the set of:
an email message; and Instant Messenger (IM) message; and a Short Message Service (SMS) message. 17. The non-transitory, computer-readable storage medium of claim 13, wherein the resource is a subject matter expert (SME). 18. The non-transitory, computer-readable storage medium of claim 13, wherein identity data associated with the resource is appended to the answer. | 2,100 |
5,452 | 5,452 | 14,841,620 | 2,168 | A method and system are provided. The method includes incrementally solving, by a processor-based journey plan incremental searcher, a current journey planning request from a user. The solving step includes performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests. The solving step further includes storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request. The solving step also includes providing the at least one journey plan to the user. | 1. A method, comprising:
incrementally solving, by a processor-based journey plan incremental searcher, a current journey planning request from a user, wherein said solving step includes:
performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests;
storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request; and
providing the at least one journey plan to the user. 2. The method of claim 1, wherein the database includes a cache, and wherein results stored for the current journey planning request or a previous journey planning request include a reusable portion, the reusable portion being stored in the cache. 3. The method of claim 1, wherein the database includes a cache, and wherein results stored for a previous journey planning request include a reusable portion stored in the cache, and wherein the at least one journey plan for the current journey planning request is computed while utilizing the reusable portion stored in the cache. 4. The method of claim 1, wherein transportation links corresponding to the at least one journey plan are time dependent, and multiple constraints are imposed on the at least one journey plan that include minimizing a travel time and minimizing transportation mode changes. 5. The method of claim 1, wherein the current search is performed over at least one search space having a plurality of states, each of the plurality of states having a respective temporal component. 6. The method of claim 5, wherein at least one of the plurality of states includes respective maximum thresholds for interchanges, a walking time, and a cycling time. 7. The method of claim 1, wherein results stored for the current journey planning request or a previous journey planning request include a reusable portion of a search graph, the reusable portion including at least one of a cost-to-goal estimation and an actual journey plan from a subset of states to a goal. 8. The method of claim 1, wherein results stored for a given state in a search space can be transferred to one or more other states in the search space or in another search space, based on dominance and commonality relations. 9. The method of claim 1, wherein the at least part of the information stored in the database comprises an information pair that includes a state of a search space and a lower bound on an arrival time. 10. The method of claim 1, wherein the at least part of the information stored in the database comprises an information pair that includes a state of a search space and an exact value of an arrival time. 11. The method of claim 1, wherein performing the current search for the at least one journey plan comprises guiding the search using a heuristic function. 12. The method of claim 11, wherein the heuristic function is used to estimate a travel time from a state of a search space to a given location. 13. The method of claim 12, wherein the given location is specified in the current journey planning request, and wherein the state of the search space includes a location that is unspecified in, but implicated by, the current journey planning request. 14. The method of claim 11, further comprising updating the heuristic function based on state dominance of states in one or more search spaces. 15. The method of claim 11, further comprising performing a back propagation technique that propagates heuristic values through a search graph space commencing at an end state of a graph search space or subgraph search space and traversing in a direction from end-to-beginning. 16. The method of claim 1, further comprising pruning a search space having a plurality of states using state dominance. 17. The method of claim 1, further comprising incrementally building the database at least from results of the plurality of previous journey planning requests. 18. A non-transitory article of manufacture tangibly embodying a computer readable program which when executed causes a computer to perform the steps of claim 1. 19. A system, comprising:
a processor-based journey planning incremental searcher for incrementally solving a current journey planning request from a user, wherein said journey planning incremental searcher incremental solves the journey planning request from the user by:
performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests;
storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request; and
providing the at least one journey plan to the user. 20. The system of claim 19, wherein the processor-based journey planning incremental searcher guides the current search using a heuristic function, and performs a back propagation technique that propagates heuristic values through a search graph space commencing at an end state of a graph search space or subgraph search space and traversing in a direction from end-to-beginning. | A method and system are provided. The method includes incrementally solving, by a processor-based journey plan incremental searcher, a current journey planning request from a user. The solving step includes performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests. The solving step further includes storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request. The solving step also includes providing the at least one journey plan to the user.1. A method, comprising:
incrementally solving, by a processor-based journey plan incremental searcher, a current journey planning request from a user, wherein said solving step includes:
performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests;
storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request; and
providing the at least one journey plan to the user. 2. The method of claim 1, wherein the database includes a cache, and wherein results stored for the current journey planning request or a previous journey planning request include a reusable portion, the reusable portion being stored in the cache. 3. The method of claim 1, wherein the database includes a cache, and wherein results stored for a previous journey planning request include a reusable portion stored in the cache, and wherein the at least one journey plan for the current journey planning request is computed while utilizing the reusable portion stored in the cache. 4. The method of claim 1, wherein transportation links corresponding to the at least one journey plan are time dependent, and multiple constraints are imposed on the at least one journey plan that include minimizing a travel time and minimizing transportation mode changes. 5. The method of claim 1, wherein the current search is performed over at least one search space having a plurality of states, each of the plurality of states having a respective temporal component. 6. The method of claim 5, wherein at least one of the plurality of states includes respective maximum thresholds for interchanges, a walking time, and a cycling time. 7. The method of claim 1, wherein results stored for the current journey planning request or a previous journey planning request include a reusable portion of a search graph, the reusable portion including at least one of a cost-to-goal estimation and an actual journey plan from a subset of states to a goal. 8. The method of claim 1, wherein results stored for a given state in a search space can be transferred to one or more other states in the search space or in another search space, based on dominance and commonality relations. 9. The method of claim 1, wherein the at least part of the information stored in the database comprises an information pair that includes a state of a search space and a lower bound on an arrival time. 10. The method of claim 1, wherein the at least part of the information stored in the database comprises an information pair that includes a state of a search space and an exact value of an arrival time. 11. The method of claim 1, wherein performing the current search for the at least one journey plan comprises guiding the search using a heuristic function. 12. The method of claim 11, wherein the heuristic function is used to estimate a travel time from a state of a search space to a given location. 13. The method of claim 12, wherein the given location is specified in the current journey planning request, and wherein the state of the search space includes a location that is unspecified in, but implicated by, the current journey planning request. 14. The method of claim 11, further comprising updating the heuristic function based on state dominance of states in one or more search spaces. 15. The method of claim 11, further comprising performing a back propagation technique that propagates heuristic values through a search graph space commencing at an end state of a graph search space or subgraph search space and traversing in a direction from end-to-beginning. 16. The method of claim 1, further comprising pruning a search space having a plurality of states using state dominance. 17. The method of claim 1, further comprising incrementally building the database at least from results of the plurality of previous journey planning requests. 18. A non-transitory article of manufacture tangibly embodying a computer readable program which when executed causes a computer to perform the steps of claim 1. 19. A system, comprising:
a processor-based journey planning incremental searcher for incrementally solving a current journey planning request from a user, wherein said journey planning incremental searcher incremental solves the journey planning request from the user by:
performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests;
storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request; and
providing the at least one journey plan to the user. 20. The system of claim 19, wherein the processor-based journey planning incremental searcher guides the current search using a heuristic function, and performs a back propagation technique that propagates heuristic values through a search graph space commencing at an end state of a graph search space or subgraph search space and traversing in a direction from end-to-beginning. | 2,100 |
5,453 | 5,453 | 14,796,264 | 2,119 | An Industrial Automation and Control System (IACS) for an industrial process including several neighbouring zones connected via a boundary element. The IACS includes a number of communicatively interconnected Intelligent Electronic Devices (IEDs), wherein low-level IEDs interact with primary devices, and wherein high-level IEDs implement high-level zone functions. The IACS includes a logical communication link between the two high-level IEDs for bypassing the connecting IED in case of communicative unavailability. The communication link enables exchange between the high-level IEDs of summarized information including data originating from low-level IEDs of a first of the zones and relevant for a high-level function on behalf of some other zones. This reduces the communication load at the higher level function while maintaining an availability level comparable to a completely central solution. | 1. An Industrial Automation and Control System SACS controlling an industrial process with a process structure including two zones connected via a connecting primary device, the IACS including a number of communicatively interconnected Intelligent Electronic Devices IEDs, with low level IEDs interacting with primary devices of the industrial process, and with two high level IEDs each implementing high level functions on behalf of one of the two zones, respectively,
characterized in that the IACS includes a logical communication link between the two high-level IEDs to transmit, in case of unavailability of a connecting IED interacting with the connecting primary device, process information originating from a first of the two zones and relevant for a high level function on behalf of a second of the two zones. 2. The IACS of claim 1, characterized in that it includes means for supervising the connecting IED and for activating the logical communication link. 3. The IACS of claim 1, wherein the IACS is a Substation Automation SA system operating a substation in a high or medium-voltage power network, and wherein the high level function is one of a bus bar protection or breaker failure protection function. 4. The IACS of claim 3, wherein the logical communication link includes an exchange of GOOSE or SV messages between the two high-level IEDs via a process bus or via a station bus of a substation communication network. 5. A method of operating an Industrial Automation and Control System IACS controlling an industrial process with a process structure including two zones connected via a connecting primary device, the IACS including a number of communicatively interconnected Intelligent Electronic Devices IEDs, with low level IEDs interacting with primary devices of the industrial process, and with two high level IEDs each implementing high level functions on behalf of one of the two zones, respectively, comprising
establishing a logical communication link between the two high-level IEDs to transmit, in case of unavailability of a connecting IED interacting with the connecting primary device, process information originating from a first of the two zones and relevant for a high level function on behalf of a second of the two zones. 6. The method of claim 5, comprising
activating the logical communication link upon detection of a failure of the connecting IED. 7. The method of claim 5, wherein the IACS is a Substation Automation SA system operating a substation in a high or medium-voltage power networks, and wherein the high level function is one of a bus bar protection or breaker failure protection function. | An Industrial Automation and Control System (IACS) for an industrial process including several neighbouring zones connected via a boundary element. The IACS includes a number of communicatively interconnected Intelligent Electronic Devices (IEDs), wherein low-level IEDs interact with primary devices, and wherein high-level IEDs implement high-level zone functions. The IACS includes a logical communication link between the two high-level IEDs for bypassing the connecting IED in case of communicative unavailability. The communication link enables exchange between the high-level IEDs of summarized information including data originating from low-level IEDs of a first of the zones and relevant for a high-level function on behalf of some other zones. This reduces the communication load at the higher level function while maintaining an availability level comparable to a completely central solution.1. An Industrial Automation and Control System SACS controlling an industrial process with a process structure including two zones connected via a connecting primary device, the IACS including a number of communicatively interconnected Intelligent Electronic Devices IEDs, with low level IEDs interacting with primary devices of the industrial process, and with two high level IEDs each implementing high level functions on behalf of one of the two zones, respectively,
characterized in that the IACS includes a logical communication link between the two high-level IEDs to transmit, in case of unavailability of a connecting IED interacting with the connecting primary device, process information originating from a first of the two zones and relevant for a high level function on behalf of a second of the two zones. 2. The IACS of claim 1, characterized in that it includes means for supervising the connecting IED and for activating the logical communication link. 3. The IACS of claim 1, wherein the IACS is a Substation Automation SA system operating a substation in a high or medium-voltage power network, and wherein the high level function is one of a bus bar protection or breaker failure protection function. 4. The IACS of claim 3, wherein the logical communication link includes an exchange of GOOSE or SV messages between the two high-level IEDs via a process bus or via a station bus of a substation communication network. 5. A method of operating an Industrial Automation and Control System IACS controlling an industrial process with a process structure including two zones connected via a connecting primary device, the IACS including a number of communicatively interconnected Intelligent Electronic Devices IEDs, with low level IEDs interacting with primary devices of the industrial process, and with two high level IEDs each implementing high level functions on behalf of one of the two zones, respectively, comprising
establishing a logical communication link between the two high-level IEDs to transmit, in case of unavailability of a connecting IED interacting with the connecting primary device, process information originating from a first of the two zones and relevant for a high level function on behalf of a second of the two zones. 6. The method of claim 5, comprising
activating the logical communication link upon detection of a failure of the connecting IED. 7. The method of claim 5, wherein the IACS is a Substation Automation SA system operating a substation in a high or medium-voltage power networks, and wherein the high level function is one of a bus bar protection or breaker failure protection function. | 2,100 |
5,454 | 5,454 | 14,574,025 | 2,142 | Methods and apparatus to provide a role-based user interface are disclosed herein. An example system disclosed includes a display device to depict a user interface. The example system also includes a processor. The example processor is to receive object information for an object in a process control system during a session, determine a user role based on the session, determine whether the object information is qualifying information based on the user role, and display the object information via the user interface when the object information is qualifying information. | 1. A system comprising:
a display device to depict a user interface for accessing information in a process control system; and one or more processors configured to:
establish a log-in session for a user;
determine an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system;
receive object information for an object in the process control system during the session;
determine whether the object information is qualifying information based on the organizational role of the user; and
display the object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. 2. The system of claim 1, wherein the one or more processors are configured to:
generate a plurality of role-specific layers, each including a different collection of information from a plurality of sources; and select one of the plurality of role-specific layers based on the organizational role of the user, wherein the selected layer includes the object information. 3. The system of claim 1, wherein the one or more processors are configured to:
generate a first screen to display the object information; identify, based on the organizational role, a navigation path interconnecting a plurality of screens including the first screen and a second screen, wherein each of the plurality of screens includes respective information related to the process control system; and transition to the second screen in response to a command received via the user interface. 4. The system of claim 1, wherein the organizational role is selected from a list that includes (i) a production manager, (ii) a maintenance manager, (iii) a control system engineer, (iv) an electrical and instrument engineer, and (v) a control room operator. 5. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role to a list that includes respective qualifying information for each of a plurality of organizational roles. 6. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role of the user to a geographical span of control. 7. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role of the user to a context-based span of control. 8. The system of claim 1, wherein the one or more processors are configured to filter out the object information when the object information is not qualifying information. 9. The system of claim 1, wherein the one or more processors are configured to arrange the qualifying information based on the organizational role of the user. 10. The system of claim 1, wherein the object information corresponds to a portion of a configuration capacity for the object. 11. The system of claim 10, wherein the processor is to display the portion of a configuration capacity via a color. 12. The system of claim 1, wherein the processor is to display the object information based on a custom visualization. 13. A method comprising:
providing a user interface for accessing information in a process control system; establishing, by the one or more processors, a log-in session for a user; determining, by the one or more processors, an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system; receiving, by one or more processors, object information associated with an object in a process control system during a session; determining, by the one or more processors, whether the object information is qualifying information based on the organizational role of the user; and displaying object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. 14. The method of claim 13, further comprising:
generating a plurality of role-specific layers, each including a different collection of information from a plurality of sources; and selecting one of the plurality of role-specific layers based on the organizational role of the user, wherein the selected layer includes the object information. 15. The method of claim 13, further comprising:
generating a first screen to display the object information; identifying, based on the organizational role, a navigation path interconnecting a plurality of screens including the first screen and a second screen, wherein each of the plurality of screens includes respective information related to the process control system; and transitioning to the second screen in response to a command received via the user interface. 16. The method of claim 13, wherein the organizational role is selected from a list that includes (i) a production manager, (ii) a maintenance manager, (iii) a control system engineer, (iv) an electrical and instrument engineer, and (v) a control room operator. 17. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a permission level for a task. 18. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a geographical span of control. 19. The method of claim 13, wherein determining whether the object information is qualifying information further comprising comparing the user role to a list of qualifying information. 20. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a context-based span of control. 21. The method of claim 13, further comprising filtering out the object information when the object information is not qualifying information. 22. The method of claim 13, further comprising arranging the qualifying information based on the user role. 23. A non-transitory computer-readable medium storing thereon instructions that, when executed by one or more processors in a machine, cause the machine to:
establish a log-in session for a user; determine an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system; receive object information for an object in the process control system during the session; determine whether the object information is qualifying information based on the organizational role of the user; and display the object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. | Methods and apparatus to provide a role-based user interface are disclosed herein. An example system disclosed includes a display device to depict a user interface. The example system also includes a processor. The example processor is to receive object information for an object in a process control system during a session, determine a user role based on the session, determine whether the object information is qualifying information based on the user role, and display the object information via the user interface when the object information is qualifying information.1. A system comprising:
a display device to depict a user interface for accessing information in a process control system; and one or more processors configured to:
establish a log-in session for a user;
determine an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system;
receive object information for an object in the process control system during the session;
determine whether the object information is qualifying information based on the organizational role of the user; and
display the object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. 2. The system of claim 1, wherein the one or more processors are configured to:
generate a plurality of role-specific layers, each including a different collection of information from a plurality of sources; and select one of the plurality of role-specific layers based on the organizational role of the user, wherein the selected layer includes the object information. 3. The system of claim 1, wherein the one or more processors are configured to:
generate a first screen to display the object information; identify, based on the organizational role, a navigation path interconnecting a plurality of screens including the first screen and a second screen, wherein each of the plurality of screens includes respective information related to the process control system; and transition to the second screen in response to a command received via the user interface. 4. The system of claim 1, wherein the organizational role is selected from a list that includes (i) a production manager, (ii) a maintenance manager, (iii) a control system engineer, (iv) an electrical and instrument engineer, and (v) a control room operator. 5. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role to a list that includes respective qualifying information for each of a plurality of organizational roles. 6. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role of the user to a geographical span of control. 7. The system of claim 1, wherein the one or more processors are configured to determine whether the object information is qualifying information by comparing the organizational role of the user to a context-based span of control. 8. The system of claim 1, wherein the one or more processors are configured to filter out the object information when the object information is not qualifying information. 9. The system of claim 1, wherein the one or more processors are configured to arrange the qualifying information based on the organizational role of the user. 10. The system of claim 1, wherein the object information corresponds to a portion of a configuration capacity for the object. 11. The system of claim 10, wherein the processor is to display the portion of a configuration capacity via a color. 12. The system of claim 1, wherein the processor is to display the object information based on a custom visualization. 13. A method comprising:
providing a user interface for accessing information in a process control system; establishing, by the one or more processors, a log-in session for a user; determining, by the one or more processors, an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system; receiving, by one or more processors, object information associated with an object in a process control system during a session; determining, by the one or more processors, whether the object information is qualifying information based on the organizational role of the user; and displaying object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. 14. The method of claim 13, further comprising:
generating a plurality of role-specific layers, each including a different collection of information from a plurality of sources; and selecting one of the plurality of role-specific layers based on the organizational role of the user, wherein the selected layer includes the object information. 15. The method of claim 13, further comprising:
generating a first screen to display the object information; identifying, based on the organizational role, a navigation path interconnecting a plurality of screens including the first screen and a second screen, wherein each of the plurality of screens includes respective information related to the process control system; and transitioning to the second screen in response to a command received via the user interface. 16. The method of claim 13, wherein the organizational role is selected from a list that includes (i) a production manager, (ii) a maintenance manager, (iii) a control system engineer, (iv) an electrical and instrument engineer, and (v) a control room operator. 17. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a permission level for a task. 18. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a geographical span of control. 19. The method of claim 13, wherein determining whether the object information is qualifying information further comprising comparing the user role to a list of qualifying information. 20. The method of claim 13, wherein determining whether the object information is qualifying information further comprises comparing a user role permission to a context-based span of control. 21. The method of claim 13, further comprising filtering out the object information when the object information is not qualifying information. 22. The method of claim 13, further comprising arranging the qualifying information based on the user role. 23. A non-transitory computer-readable medium storing thereon instructions that, when executed by one or more processors in a machine, cause the machine to:
establish a log-in session for a user; determine an organizational role of the user, wherein the organizational role includes a set of responsibilities and privileges within an organization associated with the process control system; receive object information for an object in the process control system during the session; determine whether the object information is qualifying information based on the organizational role of the user; and display the object information via the user interface when the object information is qualifying information, wherein the object information is not displayed via the user interface when the object information is not qualifying information. | 2,100 |
5,455 | 5,455 | 15,109,779 | 2,175 | Embodiments of the present invention provide an application display method and a terminal, where the method includes: acquiring a first flicking gesture, where a start position of the first flicking gesture is located in a first preset operating area; and when the terminal detects that the first flicking gesture is a first preset flicking gesture, displaying an application that is in a first state, where the first state includes at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. Therefore, a recently used application can be displayed to a user according to a gesture of the user, without a need to dispose a dedicated button, thereby improving operation and control efficiency. | 1-12. (canceled) 13. An application display method, comprising:
acquiring a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; and when a terminal detects that the first flicking gesture is a first preset flicking gesture, displaying an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 14. The method according to claim 13, wherein the displaying an application that is in a first state comprises:
displaying, in a preset area, an identifier of the application that is in the first state. 15. The method according to claim 13, wherein after the displaying an application that is in a first state, the method further comprises:
acquiring an instruction entered by a user; and displaying, on a current interface according to the instruction, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 16. The method according to claim 13, wherein after the displaying an application that is in a first state, the method further comprises:
acquiring a second flicking gesture, wherein a start position of the second flicking gesture is located in the first preset operating area; and when the terminal detects that the second flicking gesture is a second preset flicking gesture, hiding the identifier of the application that is in the first state. 17. The method according to claim 13, wherein displaying an application that is in a first state, comprises:
displaying, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 18. A terminal, comprising:
an acquiring unit, configured to acquire a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; a processing unit, configured to detect whether the first flicking gesture acquired by the acquiring unit is a first preset flicking gesture; and a display unit, configured to: when the processing unit detects that the first flicking gesture acquired by the acquiring unit is the first preset flicking gesture, display an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 19. The terminal according to claim 18, wherein the display unit is specifically configured to display, in a preset area, a identifier of the application that is in the first state. 20. The terminal according to claim 18, wherein:
the acquiring unit is further configured to: after the display unit displays the application that is in the first state, acquire an instruction entered by a user; and the display unit is further configured to display, on a current interface according to the instruction acquired by the acquiring unit, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 21. The terminal according to claim 18, wherein:
the acquiring unit is further configured to acquire a second flicking gesture after the display unit displays the application that is in the first state, wherein a start position of the second flicking gesture is located in the first preset operating area; the processing unit is further configured to detect whether the second flicking gesture acquired by the acquiring unit is a second preset flicking gesture; and the display unit is further configured to: when the processing unit detects that the second flicking gesture acquired by the acquiring unit is the second preset flicking gesture, hide the identifier of the application that is in the first state. 22. The method according to claim 18, wherein the display unit is specifically configured to display, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 23. A terminal, wherein the terminal comprises:
an input device, configured to acquire a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; an processor, configured to detect whether the first flicking gesture acquired by the input device is a first preset flicking gesture; and an output device, configured to: when the processor detects that the first flicking gesture acquired by the input device is the first preset flicking gesture, display an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 24. The terminal according to claim 23, wherein that the output device is specifically configured to display, in a preset area, a identifier of the application that is in the first state. 25. The terminal according to claim 23, wherein the input device is further configured to: after the output device displays the application that is in the first state, acquire an instruction entered by a user; and
the output device is further configured to display, on a current interface according to the instruction acquired by the input device, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 26. The terminal according to claim 23, wherein:
the input device is further configured to acquire a second flicking gesture after the output device displays the application that is in the first state, wherein a start position of the second flicking gesture is located in the first preset operating area; the processor is further configured to detect whether the second flicking gesture acquired by the input device is a second preset flicking gesture; and the output device is further configured to: when the processor detects that the second flicking gesture acquired by the input device is the second preset flicking gesture, hide the identifier of the application that is in the first state. 27. The method according to claim 23, wherein the output device is specifically configured to display, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 28. The method according to claim 24, wherein the preset area comprises at least one of the following: a bottom display area on the touchscreen of the terminal, a top display area on the touchscreen of the terminal, a left-side display area on the touchscreen of the terminal, a right-side display area on the touchscreen of the terminal, a virtual navigation bar area on the touchscreen of the terminal. | Embodiments of the present invention provide an application display method and a terminal, where the method includes: acquiring a first flicking gesture, where a start position of the first flicking gesture is located in a first preset operating area; and when the terminal detects that the first flicking gesture is a first preset flicking gesture, displaying an application that is in a first state, where the first state includes at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. Therefore, a recently used application can be displayed to a user according to a gesture of the user, without a need to dispose a dedicated button, thereby improving operation and control efficiency.1-12. (canceled) 13. An application display method, comprising:
acquiring a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; and when a terminal detects that the first flicking gesture is a first preset flicking gesture, displaying an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 14. The method according to claim 13, wherein the displaying an application that is in a first state comprises:
displaying, in a preset area, an identifier of the application that is in the first state. 15. The method according to claim 13, wherein after the displaying an application that is in a first state, the method further comprises:
acquiring an instruction entered by a user; and displaying, on a current interface according to the instruction, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 16. The method according to claim 13, wherein after the displaying an application that is in a first state, the method further comprises:
acquiring a second flicking gesture, wherein a start position of the second flicking gesture is located in the first preset operating area; and when the terminal detects that the second flicking gesture is a second preset flicking gesture, hiding the identifier of the application that is in the first state. 17. The method according to claim 13, wherein displaying an application that is in a first state, comprises:
displaying, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 18. A terminal, comprising:
an acquiring unit, configured to acquire a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; a processing unit, configured to detect whether the first flicking gesture acquired by the acquiring unit is a first preset flicking gesture; and a display unit, configured to: when the processing unit detects that the first flicking gesture acquired by the acquiring unit is the first preset flicking gesture, display an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 19. The terminal according to claim 18, wherein the display unit is specifically configured to display, in a preset area, a identifier of the application that is in the first state. 20. The terminal according to claim 18, wherein:
the acquiring unit is further configured to: after the display unit displays the application that is in the first state, acquire an instruction entered by a user; and the display unit is further configured to display, on a current interface according to the instruction acquired by the acquiring unit, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 21. The terminal according to claim 18, wherein:
the acquiring unit is further configured to acquire a second flicking gesture after the display unit displays the application that is in the first state, wherein a start position of the second flicking gesture is located in the first preset operating area; the processing unit is further configured to detect whether the second flicking gesture acquired by the acquiring unit is a second preset flicking gesture; and the display unit is further configured to: when the processing unit detects that the second flicking gesture acquired by the acquiring unit is the second preset flicking gesture, hide the identifier of the application that is in the first state. 22. The method according to claim 18, wherein the display unit is specifically configured to display, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 23. A terminal, wherein the terminal comprises:
an input device, configured to acquire a first flicking gesture, wherein a start position of the first flicking gesture is located in a first preset operating area; an processor, configured to detect whether the first flicking gesture acquired by the input device is a first preset flicking gesture; and an output device, configured to: when the processor detects that the first flicking gesture acquired by the input device is the first preset flicking gesture, display an application that is in a first state, wherein the first state comprises at least one of the following states: a state of running in the foreground, a state of running in the background, and a state of being buffered in the background. 24. The terminal according to claim 23, wherein that the output device is specifically configured to display, in a preset area, a identifier of the application that is in the first state. 25. The terminal according to claim 23, wherein the input device is further configured to: after the output device displays the application that is in the first state, acquire an instruction entered by a user; and
the output device is further configured to display, on a current interface according to the instruction acquired by the input device, an application interface of an application that is triggered by the instruction, wherein the application is any application of the application that is in the first state. 26. The terminal according to claim 23, wherein:
the input device is further configured to acquire a second flicking gesture after the output device displays the application that is in the first state, wherein a start position of the second flicking gesture is located in the first preset operating area; the processor is further configured to detect whether the second flicking gesture acquired by the input device is a second preset flicking gesture; and the output device is further configured to: when the processor detects that the second flicking gesture acquired by the input device is the second preset flicking gesture, hide the identifier of the application that is in the first state. 27. The method according to claim 23, wherein the output device is specifically configured to display, according to preset order, the application that is in the first state, wherein the preset order is a descending order of frequency of using an application by the user within a preset time, or, an ascending order of a difference between a time at which the user uses an application and a current time. 28. The method according to claim 24, wherein the preset area comprises at least one of the following: a bottom display area on the touchscreen of the terminal, a top display area on the touchscreen of the terminal, a left-side display area on the touchscreen of the terminal, a right-side display area on the touchscreen of the terminal, a virtual navigation bar area on the touchscreen of the terminal. | 2,100 |
5,456 | 5,456 | 13,840,723 | 2,139 | A spatial disturbance that occurs when an access is concentrated in a specific memory area in a volatile semiconductor memory like DRAM is properly solved by a memory controller. The memory controller includes a concentration access detection part generating a concentration access detection signal when an address for accessing a specific memory area among memory areas of volatile semiconductor memory is concentrically received. In the case that the concentration access detection signal is generated, the memory controller includes a controller for easing or preventing corruption of data which memory cells of the specific memory area and/or memory cells of memory areas adjacent to the specific memory area hold. | 1. A memory controller comprising:
a concentration access detector configured to generate a concentration detection signal when concentrically receiving an address for accessing a specific memory area among memory areas of volatile semiconductor memory; and a controller for preventing or mitigating corruption of data of memory cells of the specific memory area or memory cells of memory areas adjacent to the specific memory area when the concentration access detection signal is generated. 2. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller applies an interrupt signal to a processor connected to the memory controller and the processor changes an address allocation using a software method and thereby an access to the specific memory area is evaded. 3. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller stores an interrupt signal in an internal register and a processor which checked the internal register changes an address allocation and thereby the specific memory area is not accessed. 4. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls through a refresh counter so that an auto refresh period for auto-refreshing the specific memory area among memory areas of the volatile semiconductor memory is faster than the setting-up normal auto refresh period. 5. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls through a refresh counter so that an auto refresh period for auto-refreshing the memory areas adjacent to the specific memory area is faster than the setting-up normal auto refresh period. 6. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller generates a refresh command for refreshing the memory area adjacent to the specific memory area through a refresh controller. 7. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls so that a word line of the memory area adjacent to the specific memory area is activated, a bit line of the memory area adjacent to the specific memory area is precharged and a refresh operation is performed on the memory area adjacent to the specific memory area. 8. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller performs an address remapping so that data stored in a specific memory area among memory areas of the volatile semiconductor memory and data stored in a memory area where an address is not concentrated are swapped through a substitution buffer, and then an address of the specific memory area and an address of memory area where an address is not concentrated are switched through an address converter. 9. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller caching data stored in the specific memory area among memory areas of the volatile semiconductor memory to an internal cache, and then controls so that the specific memory area is not accessed if an address accessing the specific memory area is received, and provides data stored in the internal cache to a processor. 10. The memory controller of claim 1, wherein the volatile semiconductor memory is a DRAM. 11. The memory controller of claim 1, wherein the specific memory area is a memory page. 12. The memory controller of claim 1, wherein the address is a row address. 13. The memory controller of claim 1, wherein the address is a column address. 14. The memory controller of claim 1, wherein the address is a block or bank address. 15. A memory controller comprising:
a concentration access detector configured to generate a concentration access detection signal when a row address accessing a specific word line among word lines of a volatile semiconductor memory is concentrically received; a refresh counter for outputting a high speed auto refresh period faster than a setting-up normal auto refresh period when the concentration access detection signal is generated; and a controller for controlling in response to an output of the refresh counter so that memory cells connected to the specific word line are refreshed in the high speed auto refresh period to prevent or ease corruption of data of memory cells connected to the specific word line. 16. The memory controller of claim 15, wherein the concentration access detector accumulatively counts the row address and generates the concentration access detection signal if the number of accumulated row addresses are more than the number of setting-up accesses. 17. The memory controller of claim 16, wherein the concentration access detector accumulatively counts the row address within a previously set time. 18. A memory controller comprising:
a concentration access detector for generating a concentration access detection signal when a row address accessing a specific word line among word lines of a volatile semiconductor memory is concentrically received; a refresh counter for outputting a high speed auto refresh period faster than a setting-up normal auto refresh period when the concentration access detection signal is generated; and a controller for controlling in response to an output of the refresh counter so that memory cells connected to word line adjacent to the specific word line are refreshed in the high speed auto refresh period to prevent or ease corruption of data of memory cells connected to the word lines adjacent to the specific word line. 19. The memory controller of claim 18, wherein the concentration access detector accumulatively compares the row address and generates the concentration access detection signal if the number of the same row addresses is more than the frequency of setting-up accesses. 20. The memory controller of claim 19, wherein the concentration access detector accumulatively compares the row address within a previously set unit time. 21. The memory controller of claim 20, wherein the volatile semiconductor memory is a synchronous DRAM. 22. An access concentration decrease method comprising:
checking whether an address for accessing a specific memory area among memory areas of volatile semiconductor memory is concentrically received and generating a concentration access detection signal if the address is concentrically received; and preventing corruption of data of memory cells of the specific memory area and/or memory cells of memory areas adjacent to the specific memory area by solving an address concentration on the specific memory area. 23. The access concentration decrease method of claim 22, wherein an interrupt signal is applied to a process when the concentration access detection signal is generated and the processor changes an address allocation using a software method and thereby solution of address concentration on the specific memory area is performed. 24. The access concentration decrease method of claim 22, wherein an interrupt signal is stored in an internal register when the concentration access detection signal is generated and the processor which checked the internal register changes an address allocation and thereby solution of address concentration on the specific memory area is performed. 25. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, an auto refresh period for auto-refreshing a specific memory area among memory areas of the volatile semiconductor memory is faster than a setting-up normal refresh period through a refresh counter. 26. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, an auto refresh period for auto-refreshing the memory areas adjacent to the specific memory area is faster than a setting-up normal refresh period through a refresh counter. 27. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by generating a refresh command for refreshing the memory areas adjacent to the specific memory area through a refresh controller when the concentration access detection signal is generated. 28. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, a word line of the memory area adjacent to the specific memory area is activated, a bit line of the memory area adjacent to the specific memory area is precharged and a refresh operation with respect to the memory area adjacent to the specific memory area is executed. 29. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is accomplished by performing an address remapping for switching an address of the specific memory area to an address of memory area where an address is not concentrated through an address converter after swapping data stored in the specific memory area among memory areas of the volatile semiconductor memory and data stored memory area where an address is not concentrated among memory areas of the volatile semiconductor memory through a substitution buffer when the concentration access detection signal is generated. 30. The access concentration decrease method of claim 22, wherein when the concentration access detection signal is generated, solution of an address concentration with respect to the specific memory area is performed by caching data stored in the specific memory area among memory areas of the volatile semiconductor memory to an internal cache, and then controlling so that the specific memory area is not accessed if an address accessing the specific memory area is received, and providing data stored in the internal cache to a processor. 31. A method of evading an address concentration on a specific WL of DRAM by periodically invalidating or reassigning a buffer area of the DRAM in the case that a request of the same logical block address (LBA) continuously occurs from a host bus adaptor (HBA) in a SSD including the DRAM as a user data buffer. 32. A semiconductor memory device comprising:
a semiconductor memory cell array; and a concentration address processing part refreshing word lines adjacent to the specific word line in response to a concentration address detection signal being applied when an address concentrically occurs which accesses a specific word line of a semiconductor memory cell array. 33. The semiconductor memory device of claim 32, wherein a refresh operation with respect to the adjacent word lines is performed at least twice during 1 refresh cycle. 34. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied as a mode register set signal. 35. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied as a mode register set signal and an active command signal. 36. The semiconductor memory device of claim 35, wherein a concentration row address is received when the active command signal is applied. 37. The semiconductor memory device of claim 36, wherein before the mode register set signal is disabled, the active command signal is received at least twice. 38. The semiconductor memory device of claim 35, wherein when the active command signal is applied, row addresses adjacent to a concentration row address are received. 39. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied when an address concentration occurs at least N times (N is a natural number of 100,000 or more) during a set refresh period of the semiconductor memory device. 40. The semiconductor memory device of claim 36, wherein the concentration address processing part comprises:
a demultiplexer demultiplexing the concentration row address according to a control signal; an adjacent row address extractor extracting adjacent row addresses from the concentration row address output from the demultiplexer; and a multiplexer selecting the adjacent row addresses output from the adjacent row address extractor to output them according to a select control signal. 41. The semiconductor memory device of claim 39, wherein in the case that word lines corresponding to the adjacent row addresses are normal word lines, a normal row decoding path is activated for a refresh operation thereof. 42. The semiconductor memory device of claim 39, wherein in the case that word lines corresponding to the adjacent row addresses are redundancy word lines, a normal row decoding path is activated for a refresh operation thereof. 43. The semiconductor memory device of claim 40, further comprising a multipurpose register directly receiving the concentration row address or the adjacent row addresses to store them. 44. A memory controller comprising:
an address transform part receiving a logic address being applied to transform the logic address into a physical address for an access of a semiconductor memory device; a monitoring part receiving the physical address and a command signal to monitor whether a specific word line of the semiconductor memory device is concentrically accessed; and a control logic receiving the logic address and a memory request signal, and applying a concentration address detection signal to the semiconductor memory device when an output result of the monitoring part is expressed to be a concentration access to ease stress or disturbance from which memory cells connected to word lines adjacent to the specific word line will suffer. 45. The memory controller of claim 44, wherein the logic address is an address being provided from a processor or a host. 46. The memory controller of claim 44, wherein the monitoring part monitors whether an address concentration occurs at least N times (N is a natural number of 100,000 or more) during the set refresh period. 47. The memory controller of claim 44, wherein the control logic applies the concentration address detection signal as a mode register set signal. 48. The memory controller of claim 44, wherein the control logic applies the concentration address detection signal as a mode register set signal and an active command signal. 49. The memory controller of claim 48, wherein the control logic applies a concentration row address when the active command signal is applied. 50. The memory controller of claim 48, wherein before disabling the mode register set signal, the control logic applies the active command signal at least twice. 51. The memory controller of claim 48, wherein when the active command signal is applied, the control logic applies adjacent row addresses of concentration row address. 52. The memory controller of claim 44, wherein the monitoring part is installed outside a chip of the memory controller. 53. A concentration address caring method comprising:
monitoring whether an address repeatedly selecting any word line or any bit line of a semiconductor memory is generated more than the previously set number of times; and preventing or easing stress or disturbance from which memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line will suffer in the case that the address is generated more than the previously set number of times. 54. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises making a refresh period of memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line shorter than the set refresh period. 55. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises performing a refresh operation with respect to memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line whenever the any word line or the any bit line is selected. 56. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises an address remapping that data of memory cells connected to word lines adjacent to any word line or data of memory cells connected to word lines adjacent to any bit line is copied to memory cells connected to another word line or another bit line, and then the copied data is accessed after the address is generated more than the previously set number of times. 57. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises transmitting data of memory cells connected to word lines adjacent to any word line or data of memory cells connected to word lines adjacent to any bit line to different types of memory cells different from the memory cells constituting the semiconductor memory, and then accessing the data transmitted to the different types of memory cells after the address is generated more than the previously set number of times. 58. A concentration address caring method comprising:
receiving a concentration detection signal being applied when a row address accessing a specific word line of a semiconductor memory cell array concentrically occurs; activating word lines adjacent to the specific word line; and refreshing memory cells connected to the adjacent word line. 59. The concentration address caring method of claim 58, wherein the refresh operation is performed at least sixteen times during 1 refresh cycle. 60. The concentration address caring method of claim 59, wherein the concentration address detection signal is applied when an address concentration occurs at least N times (N is a natural number of 50,000 or more) during a set refresh period of the semiconductor memory device. 61. A semiconductor memory device comprising:
a spare line address encoding circuit generating a spare line address which encodes spare line enable signals being applied when a spare line replacing a normal line is activated to indicate a physical location of the spare line being activated; and an adjacent address generator generating spare line adjacent addresses which receive the spare line address to activate spare lines physically adjacent to the activated spare line. 62. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit is disposed in a row decoder applying the spare line enable signals to the spare line. 63. The semiconductor memory device of claim 62, further comprising a pre-decoder pre-decoding the spare line adjacent addresses to apply the pre-decoded spare line adjacent addresses to the row decoder. 64. The semiconductor memory device of claim 63, wherein the pre-decoder further comprises a switch for selectively receiving one of row addresses being applied from the outside through the spare line adjacent addresses and an address input buffer. 65. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit comprises an encoder correspondingly disposed at every spare line 66. The semiconductor memory device of claim 65, wherein the adjacent address generator is connected to an output stage of the encoder disposed at every spare line through a shared line. 67. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit operates when the spare line is concentrically accessed. 68. The semiconductor memory device of claim 61, wherein when the spare line adjacent addresses are generated, memory cells connected to the spare lines physically adjacent to the activated spare line are refreshed. 69. The semiconductor memory device of claim 68, wherein the spare line adjacent addresses comprises an address of a high rank adjacent spare line physically adjacent to the activated spare line. 70. The semiconductor memory device of claim 68, wherein the spare line adjacent addresses comprises an address of a low rank adjacent spare line physically adjacent to the activated spare line. 71. The semiconductor memory device of claim 61, wherein the spare line is a spare word line. 72. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array configured to replace a memory cell with a spare memory cell connected to a spare word line when the normal cell connected to a normal word line of the normal memory cell array is proved to be failed; a row decoder decoding a row pre-decoding signal to activate one of the normal word line and the spare word line; an address encoding circuit encoding spare word line enable signals which activate the spare word line when the spare word line is activated to generate a spare word line address indicating a physical location of the spare word line; and an adjacent address generator receiving the spare word line address to generate spare word line adjacent addresses activating spare word lines physically adjacent to the activated spare word line. 73. The semiconductor memory device of claim 72, wherein the address encoding circuit is connected to a spare word line driver in the row decoder. 74. The semiconductor memory device of claim 72, wherein the semiconductor memory device further comprises a pre-decoder pre-decoding the spare word line adjacent addresses to apply the pre-decoded spare word line adjacent addresses to the row decoder as the row pre-decoding signal. 75. The semiconductor memory device of claim 74, wherein the pre-decoder pre-decodes one of the spare word line adjacent addresses and an input row address being applied from the outside to enable the spare word line according to a concentration address detection operation mode. 76. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array that are comprised of volatile memory cells; and an adjacent row address generator generating row addresses of word lines physically adjacent to a specific word line using a concentration row address when the specific word line of the memory cell array is concentrically accessed by the concentration row address. 77. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a latch latching the concentration row address; and a counter increasingly or decreasingly counting a bit value of the concentration row address latched by the latch to output first and second adjacent row addresses. 78. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first latch latching an output address of the first counter; a second latch latching an output address of the second counter; and a multiplexer multiplexing outputs of the first and second latches. 79. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a scrambler scrambling the concentration row address according to a set scramble policy; a first counter increasingly counting a bit value of the scrambled concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the scrambled concentration row address to output a second adjacent row address; a first bank scrambler scrambling an output address of the first counter to apply it to a corresponding memory bank; a second bank scrambler scrambling an output address of the second counter to apply it to the memory bank; a first latch latching an output address of the first bank scrambler; a second latch latching an output address of the second bank scrambler; and a multiplexer multiplexing outputs of the first and second latches. 80. The semiconductor memory device of claim 76, wherein in the case that the concentration row address is word line scrambled through an address applying path, the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first scrambler scrambling an output address of the first counter; a second scrambler scrambling an output address of the second counter; a first latch latching an output address of the first scrambler; a second latch latching an output address of the second scrambler; and a multiplexer multiplexing outputs of the first and second latches. 81. The semiconductor memory device of claim 76, wherein in the case that an input of the adjacent row address generator is connected to a single global line to which the concentration row address is applied as a pre-decoder, an address input buffer outputting the concentration row address comprises a multiplexer selectively outputting one of the concentration row address and a row address of the adjacent word lines. 82. The semiconductor memory device of claim 76, wherein in the case that the concentration row address is applied through a first global line, row addresses of the adjacent word lines being applied from the adjacent row address generator are applied through a second global line. 83. The semiconductor memory device of claim 82, further comprising a pre-decoder selecting one of a first input being applied through the first global line and a second input being applied through the second global line to pre-decode the selected one. 84. The semiconductor memory device of claim 83, wherein the pre-decoder selects the second input being applied through the second global line in response to activation of a concentration access detection signal being applied when a specific word line of the memory cell array is concentrically accessed. 85. The semiconductor memory device of claim 84, wherein the concentration access detection signal is applied as a mode register set signal. 86. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array that are comprised of volatile memory cells; an address input buffer buffering a row address to output the buffered row address; an adjacent row address generator generating row addresses of word lines physically adjacent to a specific word line using a concentration row address when the concentration row address concentrically accessing the specific word line of the memory cell array is output from the address input buffer; a pre-decoder pre-decoding one of the row address being output from the address input buffer and a row address of the adjacent word lines being output from the adjacent row address generator to output the pre-decoded one as a row pre-decoding signal; and a row decoder configured to activate at least one of selected word lines of the memory cell array by decoding the row pre-decoding signal. 87. The semiconductor memory device of claim 86, wherein a refresh operation with respect to the adjacent word lines is performed at least twice during 1 refresh cycle. 88. The semiconductor memory device of claim 86, wherein the adjacent row address generator comprises:
a latch latching the concentration row address; and a counter increasingly or decreasingly counting a bit value of the concentration row address latched by the latch to output row addresses of the adjacent word lines as first and second adjacent row addresses. 89. The semiconductor memory device of claim 86, wherein in the case that the concentration row address is word line scrambled through an address applying path, the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first scrambler scrambling an output address of the first counter; a second scrambler scrambling an output address of the second counter; a first latch latching an output address of the first scrambler; a second latch latching an output address of the second scrambler; and a multiplexer multiplexing outputs of the first and second latches. 90. The semiconductor memory device of claim 86, wherein in the case that an input of the adjacent row address generator is connected to a single global line disposed between the address input buffer and the pre-decoder, the address input buffer comprises a multiplexer selectively outputting the row address or row addresses of the adjacent word line. | A spatial disturbance that occurs when an access is concentrated in a specific memory area in a volatile semiconductor memory like DRAM is properly solved by a memory controller. The memory controller includes a concentration access detection part generating a concentration access detection signal when an address for accessing a specific memory area among memory areas of volatile semiconductor memory is concentrically received. In the case that the concentration access detection signal is generated, the memory controller includes a controller for easing or preventing corruption of data which memory cells of the specific memory area and/or memory cells of memory areas adjacent to the specific memory area hold.1. A memory controller comprising:
a concentration access detector configured to generate a concentration detection signal when concentrically receiving an address for accessing a specific memory area among memory areas of volatile semiconductor memory; and a controller for preventing or mitigating corruption of data of memory cells of the specific memory area or memory cells of memory areas adjacent to the specific memory area when the concentration access detection signal is generated. 2. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller applies an interrupt signal to a processor connected to the memory controller and the processor changes an address allocation using a software method and thereby an access to the specific memory area is evaded. 3. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller stores an interrupt signal in an internal register and a processor which checked the internal register changes an address allocation and thereby the specific memory area is not accessed. 4. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls through a refresh counter so that an auto refresh period for auto-refreshing the specific memory area among memory areas of the volatile semiconductor memory is faster than the setting-up normal auto refresh period. 5. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls through a refresh counter so that an auto refresh period for auto-refreshing the memory areas adjacent to the specific memory area is faster than the setting-up normal auto refresh period. 6. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller generates a refresh command for refreshing the memory area adjacent to the specific memory area through a refresh controller. 7. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller controls so that a word line of the memory area adjacent to the specific memory area is activated, a bit line of the memory area adjacent to the specific memory area is precharged and a refresh operation is performed on the memory area adjacent to the specific memory area. 8. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller performs an address remapping so that data stored in a specific memory area among memory areas of the volatile semiconductor memory and data stored in a memory area where an address is not concentrated are swapped through a substitution buffer, and then an address of the specific memory area and an address of memory area where an address is not concentrated are switched through an address converter. 9. The memory controller of claim 1, wherein when the concentration access detection signal is generated, the controller caching data stored in the specific memory area among memory areas of the volatile semiconductor memory to an internal cache, and then controls so that the specific memory area is not accessed if an address accessing the specific memory area is received, and provides data stored in the internal cache to a processor. 10. The memory controller of claim 1, wherein the volatile semiconductor memory is a DRAM. 11. The memory controller of claim 1, wherein the specific memory area is a memory page. 12. The memory controller of claim 1, wherein the address is a row address. 13. The memory controller of claim 1, wherein the address is a column address. 14. The memory controller of claim 1, wherein the address is a block or bank address. 15. A memory controller comprising:
a concentration access detector configured to generate a concentration access detection signal when a row address accessing a specific word line among word lines of a volatile semiconductor memory is concentrically received; a refresh counter for outputting a high speed auto refresh period faster than a setting-up normal auto refresh period when the concentration access detection signal is generated; and a controller for controlling in response to an output of the refresh counter so that memory cells connected to the specific word line are refreshed in the high speed auto refresh period to prevent or ease corruption of data of memory cells connected to the specific word line. 16. The memory controller of claim 15, wherein the concentration access detector accumulatively counts the row address and generates the concentration access detection signal if the number of accumulated row addresses are more than the number of setting-up accesses. 17. The memory controller of claim 16, wherein the concentration access detector accumulatively counts the row address within a previously set time. 18. A memory controller comprising:
a concentration access detector for generating a concentration access detection signal when a row address accessing a specific word line among word lines of a volatile semiconductor memory is concentrically received; a refresh counter for outputting a high speed auto refresh period faster than a setting-up normal auto refresh period when the concentration access detection signal is generated; and a controller for controlling in response to an output of the refresh counter so that memory cells connected to word line adjacent to the specific word line are refreshed in the high speed auto refresh period to prevent or ease corruption of data of memory cells connected to the word lines adjacent to the specific word line. 19. The memory controller of claim 18, wherein the concentration access detector accumulatively compares the row address and generates the concentration access detection signal if the number of the same row addresses is more than the frequency of setting-up accesses. 20. The memory controller of claim 19, wherein the concentration access detector accumulatively compares the row address within a previously set unit time. 21. The memory controller of claim 20, wherein the volatile semiconductor memory is a synchronous DRAM. 22. An access concentration decrease method comprising:
checking whether an address for accessing a specific memory area among memory areas of volatile semiconductor memory is concentrically received and generating a concentration access detection signal if the address is concentrically received; and preventing corruption of data of memory cells of the specific memory area and/or memory cells of memory areas adjacent to the specific memory area by solving an address concentration on the specific memory area. 23. The access concentration decrease method of claim 22, wherein an interrupt signal is applied to a process when the concentration access detection signal is generated and the processor changes an address allocation using a software method and thereby solution of address concentration on the specific memory area is performed. 24. The access concentration decrease method of claim 22, wherein an interrupt signal is stored in an internal register when the concentration access detection signal is generated and the processor which checked the internal register changes an address allocation and thereby solution of address concentration on the specific memory area is performed. 25. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, an auto refresh period for auto-refreshing a specific memory area among memory areas of the volatile semiconductor memory is faster than a setting-up normal refresh period through a refresh counter. 26. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, an auto refresh period for auto-refreshing the memory areas adjacent to the specific memory area is faster than a setting-up normal refresh period through a refresh counter. 27. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by generating a refresh command for refreshing the memory areas adjacent to the specific memory area through a refresh controller when the concentration access detection signal is generated. 28. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is performed by controlling so that when the concentration access detection signal is generated, a word line of the memory area adjacent to the specific memory area is activated, a bit line of the memory area adjacent to the specific memory area is precharged and a refresh operation with respect to the memory area adjacent to the specific memory area is executed. 29. The access concentration decrease method of claim 22, wherein solution of an address concentration with respect to the specific memory area is accomplished by performing an address remapping for switching an address of the specific memory area to an address of memory area where an address is not concentrated through an address converter after swapping data stored in the specific memory area among memory areas of the volatile semiconductor memory and data stored memory area where an address is not concentrated among memory areas of the volatile semiconductor memory through a substitution buffer when the concentration access detection signal is generated. 30. The access concentration decrease method of claim 22, wherein when the concentration access detection signal is generated, solution of an address concentration with respect to the specific memory area is performed by caching data stored in the specific memory area among memory areas of the volatile semiconductor memory to an internal cache, and then controlling so that the specific memory area is not accessed if an address accessing the specific memory area is received, and providing data stored in the internal cache to a processor. 31. A method of evading an address concentration on a specific WL of DRAM by periodically invalidating or reassigning a buffer area of the DRAM in the case that a request of the same logical block address (LBA) continuously occurs from a host bus adaptor (HBA) in a SSD including the DRAM as a user data buffer. 32. A semiconductor memory device comprising:
a semiconductor memory cell array; and a concentration address processing part refreshing word lines adjacent to the specific word line in response to a concentration address detection signal being applied when an address concentrically occurs which accesses a specific word line of a semiconductor memory cell array. 33. The semiconductor memory device of claim 32, wherein a refresh operation with respect to the adjacent word lines is performed at least twice during 1 refresh cycle. 34. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied as a mode register set signal. 35. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied as a mode register set signal and an active command signal. 36. The semiconductor memory device of claim 35, wherein a concentration row address is received when the active command signal is applied. 37. The semiconductor memory device of claim 36, wherein before the mode register set signal is disabled, the active command signal is received at least twice. 38. The semiconductor memory device of claim 35, wherein when the active command signal is applied, row addresses adjacent to a concentration row address are received. 39. The semiconductor memory device of claim 32, wherein the concentration address detection signal is applied when an address concentration occurs at least N times (N is a natural number of 100,000 or more) during a set refresh period of the semiconductor memory device. 40. The semiconductor memory device of claim 36, wherein the concentration address processing part comprises:
a demultiplexer demultiplexing the concentration row address according to a control signal; an adjacent row address extractor extracting adjacent row addresses from the concentration row address output from the demultiplexer; and a multiplexer selecting the adjacent row addresses output from the adjacent row address extractor to output them according to a select control signal. 41. The semiconductor memory device of claim 39, wherein in the case that word lines corresponding to the adjacent row addresses are normal word lines, a normal row decoding path is activated for a refresh operation thereof. 42. The semiconductor memory device of claim 39, wherein in the case that word lines corresponding to the adjacent row addresses are redundancy word lines, a normal row decoding path is activated for a refresh operation thereof. 43. The semiconductor memory device of claim 40, further comprising a multipurpose register directly receiving the concentration row address or the adjacent row addresses to store them. 44. A memory controller comprising:
an address transform part receiving a logic address being applied to transform the logic address into a physical address for an access of a semiconductor memory device; a monitoring part receiving the physical address and a command signal to monitor whether a specific word line of the semiconductor memory device is concentrically accessed; and a control logic receiving the logic address and a memory request signal, and applying a concentration address detection signal to the semiconductor memory device when an output result of the monitoring part is expressed to be a concentration access to ease stress or disturbance from which memory cells connected to word lines adjacent to the specific word line will suffer. 45. The memory controller of claim 44, wherein the logic address is an address being provided from a processor or a host. 46. The memory controller of claim 44, wherein the monitoring part monitors whether an address concentration occurs at least N times (N is a natural number of 100,000 or more) during the set refresh period. 47. The memory controller of claim 44, wherein the control logic applies the concentration address detection signal as a mode register set signal. 48. The memory controller of claim 44, wherein the control logic applies the concentration address detection signal as a mode register set signal and an active command signal. 49. The memory controller of claim 48, wherein the control logic applies a concentration row address when the active command signal is applied. 50. The memory controller of claim 48, wherein before disabling the mode register set signal, the control logic applies the active command signal at least twice. 51. The memory controller of claim 48, wherein when the active command signal is applied, the control logic applies adjacent row addresses of concentration row address. 52. The memory controller of claim 44, wherein the monitoring part is installed outside a chip of the memory controller. 53. A concentration address caring method comprising:
monitoring whether an address repeatedly selecting any word line or any bit line of a semiconductor memory is generated more than the previously set number of times; and preventing or easing stress or disturbance from which memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line will suffer in the case that the address is generated more than the previously set number of times. 54. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises making a refresh period of memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line shorter than the set refresh period. 55. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises performing a refresh operation with respect to memory cells connected to word lines adjacent to any word line or memory cells connected to word lines adjacent to any bit line whenever the any word line or the any bit line is selected. 56. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises an address remapping that data of memory cells connected to word lines adjacent to any word line or data of memory cells connected to word lines adjacent to any bit line is copied to memory cells connected to another word line or another bit line, and then the copied data is accessed after the address is generated more than the previously set number of times. 57. The concentration address caring method of claim 53, wherein the step of preventing or ease the stress or disturbance comprises transmitting data of memory cells connected to word lines adjacent to any word line or data of memory cells connected to word lines adjacent to any bit line to different types of memory cells different from the memory cells constituting the semiconductor memory, and then accessing the data transmitted to the different types of memory cells after the address is generated more than the previously set number of times. 58. A concentration address caring method comprising:
receiving a concentration detection signal being applied when a row address accessing a specific word line of a semiconductor memory cell array concentrically occurs; activating word lines adjacent to the specific word line; and refreshing memory cells connected to the adjacent word line. 59. The concentration address caring method of claim 58, wherein the refresh operation is performed at least sixteen times during 1 refresh cycle. 60. The concentration address caring method of claim 59, wherein the concentration address detection signal is applied when an address concentration occurs at least N times (N is a natural number of 50,000 or more) during a set refresh period of the semiconductor memory device. 61. A semiconductor memory device comprising:
a spare line address encoding circuit generating a spare line address which encodes spare line enable signals being applied when a spare line replacing a normal line is activated to indicate a physical location of the spare line being activated; and an adjacent address generator generating spare line adjacent addresses which receive the spare line address to activate spare lines physically adjacent to the activated spare line. 62. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit is disposed in a row decoder applying the spare line enable signals to the spare line. 63. The semiconductor memory device of claim 62, further comprising a pre-decoder pre-decoding the spare line adjacent addresses to apply the pre-decoded spare line adjacent addresses to the row decoder. 64. The semiconductor memory device of claim 63, wherein the pre-decoder further comprises a switch for selectively receiving one of row addresses being applied from the outside through the spare line adjacent addresses and an address input buffer. 65. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit comprises an encoder correspondingly disposed at every spare line 66. The semiconductor memory device of claim 65, wherein the adjacent address generator is connected to an output stage of the encoder disposed at every spare line through a shared line. 67. The semiconductor memory device of claim 61, wherein the spare line address encoding circuit operates when the spare line is concentrically accessed. 68. The semiconductor memory device of claim 61, wherein when the spare line adjacent addresses are generated, memory cells connected to the spare lines physically adjacent to the activated spare line are refreshed. 69. The semiconductor memory device of claim 68, wherein the spare line adjacent addresses comprises an address of a high rank adjacent spare line physically adjacent to the activated spare line. 70. The semiconductor memory device of claim 68, wherein the spare line adjacent addresses comprises an address of a low rank adjacent spare line physically adjacent to the activated spare line. 71. The semiconductor memory device of claim 61, wherein the spare line is a spare word line. 72. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array configured to replace a memory cell with a spare memory cell connected to a spare word line when the normal cell connected to a normal word line of the normal memory cell array is proved to be failed; a row decoder decoding a row pre-decoding signal to activate one of the normal word line and the spare word line; an address encoding circuit encoding spare word line enable signals which activate the spare word line when the spare word line is activated to generate a spare word line address indicating a physical location of the spare word line; and an adjacent address generator receiving the spare word line address to generate spare word line adjacent addresses activating spare word lines physically adjacent to the activated spare word line. 73. The semiconductor memory device of claim 72, wherein the address encoding circuit is connected to a spare word line driver in the row decoder. 74. The semiconductor memory device of claim 72, wherein the semiconductor memory device further comprises a pre-decoder pre-decoding the spare word line adjacent addresses to apply the pre-decoded spare word line adjacent addresses to the row decoder as the row pre-decoding signal. 75. The semiconductor memory device of claim 74, wherein the pre-decoder pre-decodes one of the spare word line adjacent addresses and an input row address being applied from the outside to enable the spare word line according to a concentration address detection operation mode. 76. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array that are comprised of volatile memory cells; and an adjacent row address generator generating row addresses of word lines physically adjacent to a specific word line using a concentration row address when the specific word line of the memory cell array is concentrically accessed by the concentration row address. 77. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a latch latching the concentration row address; and a counter increasingly or decreasingly counting a bit value of the concentration row address latched by the latch to output first and second adjacent row addresses. 78. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first latch latching an output address of the first counter; a second latch latching an output address of the second counter; and a multiplexer multiplexing outputs of the first and second latches. 79. The semiconductor memory device of claim 76, wherein the adjacent row address generator comprises:
a scrambler scrambling the concentration row address according to a set scramble policy; a first counter increasingly counting a bit value of the scrambled concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the scrambled concentration row address to output a second adjacent row address; a first bank scrambler scrambling an output address of the first counter to apply it to a corresponding memory bank; a second bank scrambler scrambling an output address of the second counter to apply it to the memory bank; a first latch latching an output address of the first bank scrambler; a second latch latching an output address of the second bank scrambler; and a multiplexer multiplexing outputs of the first and second latches. 80. The semiconductor memory device of claim 76, wherein in the case that the concentration row address is word line scrambled through an address applying path, the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first scrambler scrambling an output address of the first counter; a second scrambler scrambling an output address of the second counter; a first latch latching an output address of the first scrambler; a second latch latching an output address of the second scrambler; and a multiplexer multiplexing outputs of the first and second latches. 81. The semiconductor memory device of claim 76, wherein in the case that an input of the adjacent row address generator is connected to a single global line to which the concentration row address is applied as a pre-decoder, an address input buffer outputting the concentration row address comprises a multiplexer selectively outputting one of the concentration row address and a row address of the adjacent word lines. 82. The semiconductor memory device of claim 76, wherein in the case that the concentration row address is applied through a first global line, row addresses of the adjacent word lines being applied from the adjacent row address generator are applied through a second global line. 83. The semiconductor memory device of claim 82, further comprising a pre-decoder selecting one of a first input being applied through the first global line and a second input being applied through the second global line to pre-decode the selected one. 84. The semiconductor memory device of claim 83, wherein the pre-decoder selects the second input being applied through the second global line in response to activation of a concentration access detection signal being applied when a specific word line of the memory cell array is concentrically accessed. 85. The semiconductor memory device of claim 84, wherein the concentration access detection signal is applied as a mode register set signal. 86. A semiconductor memory device comprising:
a memory cell array comprising a normal memory cell array and a spare memory cell array that are comprised of volatile memory cells; an address input buffer buffering a row address to output the buffered row address; an adjacent row address generator generating row addresses of word lines physically adjacent to a specific word line using a concentration row address when the concentration row address concentrically accessing the specific word line of the memory cell array is output from the address input buffer; a pre-decoder pre-decoding one of the row address being output from the address input buffer and a row address of the adjacent word lines being output from the adjacent row address generator to output the pre-decoded one as a row pre-decoding signal; and a row decoder configured to activate at least one of selected word lines of the memory cell array by decoding the row pre-decoding signal. 87. The semiconductor memory device of claim 86, wherein a refresh operation with respect to the adjacent word lines is performed at least twice during 1 refresh cycle. 88. The semiconductor memory device of claim 86, wherein the adjacent row address generator comprises:
a latch latching the concentration row address; and a counter increasingly or decreasingly counting a bit value of the concentration row address latched by the latch to output row addresses of the adjacent word lines as first and second adjacent row addresses. 89. The semiconductor memory device of claim 86, wherein in the case that the concentration row address is word line scrambled through an address applying path, the adjacent row address generator comprises:
a first counter increasingly counting a bit value of the concentration row address to output a first adjacent row address; a second counter decreasingly counting a bit value of the concentration row address to output a second adjacent row address; a first scrambler scrambling an output address of the first counter; a second scrambler scrambling an output address of the second counter; a first latch latching an output address of the first scrambler; a second latch latching an output address of the second scrambler; and a multiplexer multiplexing outputs of the first and second latches. 90. The semiconductor memory device of claim 86, wherein in the case that an input of the adjacent row address generator is connected to a single global line disposed between the address input buffer and the pre-decoder, the address input buffer comprises a multiplexer selectively outputting the row address or row addresses of the adjacent word line. | 2,100 |
5,457 | 5,457 | 14,951,052 | 2,112 | A data storage device includes a flash memory and a controller. The flash memory includes a plurality of dies, and each of the dies includes a first memory plane and a second memory plane, wherein each of the first memory plane and the second memory plane includes a plurality of physical pages. The controller retrieves data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to a read command which is arranged to read a target page. | 1. A data storage device, comprising:
a flash memory, comprising a plurality of dies, and each of the dies comprises a first memory plane and a second memory plane, wherein each of the first memory plane and the second memory plane comprises a plurality of physical pages; and a controller, retrieving data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to a read command which is arranged to read a target page. 2. The data storage device as claimed in claim 1, wherein the controller further comprises an error correction engine, and the controller further transmits the retrieved data of the first physical page and the retrieved data of the second physical page to the error correction engine to allow the error correction engine performs an error correction on the target page according to the retrieved data of the first physical page and the retrieved data of the second physical page. 3. The data storage device as claimed in claim 1, wherein the controller sequentially transmits a plurality of chunk read commands to the flash memory in response to the read command to retrieved a plurality of chunks of the target page which is constituted by the first physical page and the second physical page, wherein the controller retrieves a plurality of bytes of the first physical page and a plurality of bytes of the second physical page by two of the chunk read commands to obtain a first chunk of the chunks. 4. The data storage device as claimed in claim 3, wherein each of the chunks comprises a data sector and a parity code arranged to correct the data sector. 5. The data storage device as claimed in claim 3, wherein the controller further comprises an error correction engine, and the controller transmits the retrieved bytes of the first physical page and the second physical page retrieved by the two chunk read command to the error correction engine to allow the error correction engine perform the error correction on the first chunk according to the retrieved bytes of the first physical page and the second physical page. 6. The data storage device as claimed in claim 3, wherein each of the chunk read command comprises an address latch enable signal and a command latch enable signal. 7. A data retrieval method, applied to a flash memory, wherein the flash memory comprises a plurality of dies, each of the dies comprises a first memory plane and a second memory plane, each of the first memory plane and the second memory plane comprises a plurality of physical pages, and the data retrieval method comprises:
receiving a read command from a host, wherein the read command is arranged to read a target page; and retrieving data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to the read command. 8. The data retrieval method as claimed in claim 7, further comprising:
transmitting the retrieved data of the first physical page and the retrieved data of the second physical page to an error correction engine; and performing an error correction on the target page according to the retrieved data of the first physical page and the retrieved data of the second physical page. 9. The data retrieval method as claimed in claim 7, wherein the step of retrieving the data of the first physical page of the first memory plane and the data of the second physical page of the second memory plane in response to the read command further comprises:
sequentially transmitting a plurality of chunk read commands to the flash memory according to the read command to sequentially retrieve a plurality chunks of the target page which is constituted by the first physical page and the second physical page, wherein two of the chunk read commands are respectively arranged to retrieve a plurality bytes of the first physical page and a plurality bytes of the second physical page to obtain a first chunk of the chunks. 10. The data retrieval method as claimed in claim 9, wherein each of the chunks comprises a data sector and a parity code arranged to correct the data sector. 11. The data retrieval method as claimed in claim 9, further comprising:
transmitting the bytes of the first physical page and the second physical page retrieved by the two of the chunk read commands to an error correction engine; and performing the error correction on the first chunk by the error correction engine according to the retrieved bytes of the first physical page and the second physical page. 12. The data retrieval method as claimed in claim 9, wherein each of the chunk read commands comprises an address latch enable signal and a command latch enable signal. | A data storage device includes a flash memory and a controller. The flash memory includes a plurality of dies, and each of the dies includes a first memory plane and a second memory plane, wherein each of the first memory plane and the second memory plane includes a plurality of physical pages. The controller retrieves data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to a read command which is arranged to read a target page.1. A data storage device, comprising:
a flash memory, comprising a plurality of dies, and each of the dies comprises a first memory plane and a second memory plane, wherein each of the first memory plane and the second memory plane comprises a plurality of physical pages; and a controller, retrieving data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to a read command which is arranged to read a target page. 2. The data storage device as claimed in claim 1, wherein the controller further comprises an error correction engine, and the controller further transmits the retrieved data of the first physical page and the retrieved data of the second physical page to the error correction engine to allow the error correction engine performs an error correction on the target page according to the retrieved data of the first physical page and the retrieved data of the second physical page. 3. The data storage device as claimed in claim 1, wherein the controller sequentially transmits a plurality of chunk read commands to the flash memory in response to the read command to retrieved a plurality of chunks of the target page which is constituted by the first physical page and the second physical page, wherein the controller retrieves a plurality of bytes of the first physical page and a plurality of bytes of the second physical page by two of the chunk read commands to obtain a first chunk of the chunks. 4. The data storage device as claimed in claim 3, wherein each of the chunks comprises a data sector and a parity code arranged to correct the data sector. 5. The data storage device as claimed in claim 3, wherein the controller further comprises an error correction engine, and the controller transmits the retrieved bytes of the first physical page and the second physical page retrieved by the two chunk read command to the error correction engine to allow the error correction engine perform the error correction on the first chunk according to the retrieved bytes of the first physical page and the second physical page. 6. The data storage device as claimed in claim 3, wherein each of the chunk read command comprises an address latch enable signal and a command latch enable signal. 7. A data retrieval method, applied to a flash memory, wherein the flash memory comprises a plurality of dies, each of the dies comprises a first memory plane and a second memory plane, each of the first memory plane and the second memory plane comprises a plurality of physical pages, and the data retrieval method comprises:
receiving a read command from a host, wherein the read command is arranged to read a target page; and retrieving data of a first physical page of the first memory plane and data of a second physical page of the second memory plane in response to the read command. 8. The data retrieval method as claimed in claim 7, further comprising:
transmitting the retrieved data of the first physical page and the retrieved data of the second physical page to an error correction engine; and performing an error correction on the target page according to the retrieved data of the first physical page and the retrieved data of the second physical page. 9. The data retrieval method as claimed in claim 7, wherein the step of retrieving the data of the first physical page of the first memory plane and the data of the second physical page of the second memory plane in response to the read command further comprises:
sequentially transmitting a plurality of chunk read commands to the flash memory according to the read command to sequentially retrieve a plurality chunks of the target page which is constituted by the first physical page and the second physical page, wherein two of the chunk read commands are respectively arranged to retrieve a plurality bytes of the first physical page and a plurality bytes of the second physical page to obtain a first chunk of the chunks. 10. The data retrieval method as claimed in claim 9, wherein each of the chunks comprises a data sector and a parity code arranged to correct the data sector. 11. The data retrieval method as claimed in claim 9, further comprising:
transmitting the bytes of the first physical page and the second physical page retrieved by the two of the chunk read commands to an error correction engine; and performing the error correction on the first chunk by the error correction engine according to the retrieved bytes of the first physical page and the second physical page. 12. The data retrieval method as claimed in claim 9, wherein each of the chunk read commands comprises an address latch enable signal and a command latch enable signal. | 2,100 |
5,458 | 5,458 | 14,179,912 | 2,173 | A method includes detecting interaction with a user interface element corresponding to an app on a touch screen and displaying a different version of the user interface element responsive to the detected interaction. | 1. A method comprising:
detecting interaction with a user interface element corresponding to an app on a touch screen; displaying a different version of the user interface element responsive to the detected interaction. 2. The method of claim 1 wherein displaying a different version of the user interface element comprises displaying a larger version of the user interface element. 3. The method of claim 2 wherein displaying the larger version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app. 4. The method of claim 3 wherein the sub-elements comprise a list of contacts from a contact app. 5. The method of claim 4 and further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 6. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting hovering over the user interface element. 7. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting touching the user interface element. 8. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting that a user is looking at the user interface element via gaze tracking with a camera. 9. The method of claim 1 wherein displaying a different size version of the user interface element comprises displaying a smaller version of the user interface element when user interaction is no longer detected. 10. The method of claim 1 wherein the user interface element is a window, wherein the detected interaction comprises scrolling content within the window, and wherein the different version displayed comprises a larger window. 11. The method of claim 1 wherein displaying the different version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app, the method further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 12. A machine readable storage device having instructions for execution by a processor of the machine to perform:
detecting interaction with a user interface element corresponding to an app on a touch screen; displaying a different version of the user interface element responsive to the detected interaction. 13. The machine readable storage device claim 12 wherein displaying a different version of the user interface element comprises displaying a larger version of the user interface element that comprises multiple sub-elements facilitating selection of multiple functions of the app. 14. The machine readable storage device of claim 13 wherein the sub-elements comprise a list of contacts from a contact app. 15. The machine readable storage device of claim 14 and further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 16. The machine readable storage device of claim 12 wherein detecting interaction with the user interface element comprises detecting hovering over the user interface element, touching the user interface element, or detecting that a user is looking at the user interface element via gaze tracking with a camera. 17. The machine readable storage device of claim 12 wherein displaying the different version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app, the method further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 18. A device comprising:
a processor; a touch screen; and a memory device having a program stored thereon for execution by the processor to:
detect interaction with a user interface element corresponding to an app on the touch screen;
display a different version of the user interface element on the touch screen responsive to the detected interaction. 19. The device of claim 18 wherein display of a different version of the user interface element comprises display of a version of the user interface element that comprises multiple sub-elements facilitating selection of multiple functions of the app. 20. The device of claim 19 wherein the program further comprises code for execution by the processor to:
detect user interaction with a sub-element; and
display a further version of a user interface element that provides additional information corresponding to the sub-element. | A method includes detecting interaction with a user interface element corresponding to an app on a touch screen and displaying a different version of the user interface element responsive to the detected interaction.1. A method comprising:
detecting interaction with a user interface element corresponding to an app on a touch screen; displaying a different version of the user interface element responsive to the detected interaction. 2. The method of claim 1 wherein displaying a different version of the user interface element comprises displaying a larger version of the user interface element. 3. The method of claim 2 wherein displaying the larger version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app. 4. The method of claim 3 wherein the sub-elements comprise a list of contacts from a contact app. 5. The method of claim 4 and further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 6. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting hovering over the user interface element. 7. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting touching the user interface element. 8. The method of claim 1 wherein detecting interaction with the user interface element comprises detecting that a user is looking at the user interface element via gaze tracking with a camera. 9. The method of claim 1 wherein displaying a different size version of the user interface element comprises displaying a smaller version of the user interface element when user interaction is no longer detected. 10. The method of claim 1 wherein the user interface element is a window, wherein the detected interaction comprises scrolling content within the window, and wherein the different version displayed comprises a larger window. 11. The method of claim 1 wherein displaying the different version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app, the method further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 12. A machine readable storage device having instructions for execution by a processor of the machine to perform:
detecting interaction with a user interface element corresponding to an app on a touch screen; displaying a different version of the user interface element responsive to the detected interaction. 13. The machine readable storage device claim 12 wherein displaying a different version of the user interface element comprises displaying a larger version of the user interface element that comprises multiple sub-elements facilitating selection of multiple functions of the app. 14. The machine readable storage device of claim 13 wherein the sub-elements comprise a list of contacts from a contact app. 15. The machine readable storage device of claim 14 and further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 16. The machine readable storage device of claim 12 wherein detecting interaction with the user interface element comprises detecting hovering over the user interface element, touching the user interface element, or detecting that a user is looking at the user interface element via gaze tracking with a camera. 17. The machine readable storage device of claim 12 wherein displaying the different version of the user interface element comprises displaying multiple sub-elements facilitating selection of multiple functions of the app, the method further comprising:
detecting user interaction with a sub-element; and
displaying a further version of a user interface element that provides additional information corresponding to the sub-element. 18. A device comprising:
a processor; a touch screen; and a memory device having a program stored thereon for execution by the processor to:
detect interaction with a user interface element corresponding to an app on the touch screen;
display a different version of the user interface element on the touch screen responsive to the detected interaction. 19. The device of claim 18 wherein display of a different version of the user interface element comprises display of a version of the user interface element that comprises multiple sub-elements facilitating selection of multiple functions of the app. 20. The device of claim 19 wherein the program further comprises code for execution by the processor to:
detect user interaction with a sub-element; and
display a further version of a user interface element that provides additional information corresponding to the sub-element. | 2,100 |
5,459 | 5,459 | 13,725,263 | 2,158 | A computing apparatus and method of recalculating upon changes to data by saving changes to the data; receiving a request to recalculate a result according to the data; retrieving only active data from the data according to the saved changes to the data; and recalculating the result based upon the active data. | 1. A system for enabling the auditing of a position by creating a chain of active and non-active records, comprising:
processing an audit record that automatically detects changes to data and recalculates upon changes to data, comprising: a computer processor controlled to execute:
detecting changes to the audit record;
saving the changes to the audit record;
receiving a request to recalculate a result according to the data;
retrieving only active records from the data according to the saved changes to the data; and
recalculating the result based upon the active records. 2. The system according to claim 1, wherein the active records are stamped at the time of creation and any prior records are deactivated at the same time. 3. The system according to claim 2, wherein the prior records comprise records that existed before the active records are time-stamped. 4. The system according to claim 1, wherein all non-active records are retained for auditing. 5. The system according to claim 4, wherein all active and non-active records are combined to create an audit trail. 6. The system according to claim 5, wherein a report is generated from the audit trail. 7. The system according to claim 6, wherein the report comprises user data, such as who made the changes to the active records, and the time that such changes were made. 8. A method for enabling auditing of a position by creating a chain of active and non-active records, comprising:
configuring a computer to execute:
detecting changes to the audit record;
saving the changes to the audit record;
receiving a request to recalculate a result according to the data;
retrieving only active records from the data according to the saved changes to the data; and
recalculating the result based upon the active records. 9. The method of claim 8, wherein the active records are stamped at the time of creation and any prior records are deactivated at the same time. 10. The method of claim 9, wherein the prior records comprise records that existed before the active records are time-stamped. 11. The method of claim 8, further comprising retaining all non-active records for auditing. 12. The method of claim 11, further comprising combining all active and non-active records to create an audit trail. 13. The method of claim 12, further comprising generating a report from the audit trail. 14. The method of claim 13, wherein the report comprises user data, such as who made the changes to the active records, and the time that the changes were made. | A computing apparatus and method of recalculating upon changes to data by saving changes to the data; receiving a request to recalculate a result according to the data; retrieving only active data from the data according to the saved changes to the data; and recalculating the result based upon the active data.1. A system for enabling the auditing of a position by creating a chain of active and non-active records, comprising:
processing an audit record that automatically detects changes to data and recalculates upon changes to data, comprising: a computer processor controlled to execute:
detecting changes to the audit record;
saving the changes to the audit record;
receiving a request to recalculate a result according to the data;
retrieving only active records from the data according to the saved changes to the data; and
recalculating the result based upon the active records. 2. The system according to claim 1, wherein the active records are stamped at the time of creation and any prior records are deactivated at the same time. 3. The system according to claim 2, wherein the prior records comprise records that existed before the active records are time-stamped. 4. The system according to claim 1, wherein all non-active records are retained for auditing. 5. The system according to claim 4, wherein all active and non-active records are combined to create an audit trail. 6. The system according to claim 5, wherein a report is generated from the audit trail. 7. The system according to claim 6, wherein the report comprises user data, such as who made the changes to the active records, and the time that such changes were made. 8. A method for enabling auditing of a position by creating a chain of active and non-active records, comprising:
configuring a computer to execute:
detecting changes to the audit record;
saving the changes to the audit record;
receiving a request to recalculate a result according to the data;
retrieving only active records from the data according to the saved changes to the data; and
recalculating the result based upon the active records. 9. The method of claim 8, wherein the active records are stamped at the time of creation and any prior records are deactivated at the same time. 10. The method of claim 9, wherein the prior records comprise records that existed before the active records are time-stamped. 11. The method of claim 8, further comprising retaining all non-active records for auditing. 12. The method of claim 11, further comprising combining all active and non-active records to create an audit trail. 13. The method of claim 12, further comprising generating a report from the audit trail. 14. The method of claim 13, wherein the report comprises user data, such as who made the changes to the active records, and the time that the changes were made. | 2,100 |
5,460 | 5,460 | 14,946,065 | 2,173 | Disclosed are various examples for managing network resource permissions for applications through the use of an application catalog. A user interface presenting an application catalog is generated that includes a listing of applications that are available to managed client devices in an organization. A selection of a particular application from the application catalog is received from a managed client device. The selection indicates a particular security group of multiple security groups. A network of the organization is configured to provide the particular application on the managed client device with access to a set of resources corresponding to the particular security group. | 1. A non-transitory computer-readable medium embodying at least one program executable in at least one computing device, the at least one program, when executed by the at least one computing device, being configured to cause the at least one computing device to at least:
generate a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to managed client devices in an organization; receive, from a managed client device, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a particular security group of a plurality of security groups; and configure a network of the organization to provide the particular application on the managed client device with access to a set of resources corresponding to the particular security group. 2. The non-transitory computer-readable medium of claim 1, wherein the particular security group is associated with a role of a user within the organization, and the managed client device is used by the user. 3. The non-transitory computer-readable medium of claim 1, wherein configuring the network of the organization further comprises configuring a network device to permit routing of network traffic from the particular application executed in the managed client device to a virtual segment of the network through which the set of resources are accessible. 4. The non-transitory computer-readable medium of claim 1, wherein each of the plurality of security groups are associated with a different virtual segment of the network. 5. The non-transitory computer-readable medium of claim 1, wherein another security group of the plurality of security groups corresponds to a different set of resources, and the different set of resources includes at least one resource in common with the set of resources corresponding to the particular security group. 6. The non-transitory computer-readable medium of claim 1, wherein the listing of the plurality of applications included in the application catalog comprises a plurality of instances of the particular application, individual ones of the plurality of instances corresponding respective ones of the plurality of security groups. 7. The non-transitory computer-readable medium of claim 1, wherein the user interface includes a component corresponding to the particular application that facilitates a user selection of the particular security group of the plurality of security groups. 8. The non-transitory computer-readable medium of claim 1, wherein the at least one program, when executed by the at least one computing device, is further configured to cause the at least one computing device to at least:
verify that a user associated with the managed client device is authorized for the particular security group before configuring the network. 9. The non-transitory computer-readable medium of claim 1, wherein the at least one program, when executed by the at least one computing device, is further configured to cause the at least one computing device to at least:
send data encoding the user interface to the managed client device. 10. A system, comprising:
at least one computing device; and an application catalog service executable by the at least one computing device, the application catalog service configured to cause the at least one computing device to at least:
generate a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to managed client devices in an organization;
receive, from a managed client device associated with a user, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a role of the user in the organization; and
configure a network of the organization to provide the particular application on the managed client device with access to a set of resources corresponding to the role of the user in the organization. 11. The system of claim 10, wherein the role of the user in the organization is associated with a particular security group of a plurality of security groups, and the set of resources corresponds to the particular security group. 12. The system of claim 10, wherein the user interface includes, for the particular application, a plurality of selectable components that correspond to a plurality of roles in the organization. 13. The system of claim 10, wherein configuring the network further comprises configuring a network device to permit routing of network traffic from the particular application executed in the managed client device to a virtual segment of the network through which the set of resources are accessible. 14. The system of claim 13, wherein the network device is configured to verify that the managed client device has a credential associated with the virtual segment of the network before routing the network traffic from the particular application to the virtual segment of the network. 15. The system of claim 10, wherein the application catalog service is further configured to cause the at least one computing device to at least:
receive a specification of a plurality of sets of resources for the particular application from an administrative user; and generate a respective virtual segment on the network for each set of resources of the plurality of sets of resources. 16. A method, comprising:
generating a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to client devices; receiving, from a client device, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a particular security group of a plurality of security groups; and configuring a network to provide the particular application on the client device with access to a set of resources corresponding to the particular security group. 17. The method of claim 16, wherein each security group of the plurality of security groups is associated with a respective selectable component for the particular application in the user interface. 18. The method of claim 16, further comprising:
receiving a specification of a plurality of sets of resources for the particular application from another client device associated with an administrative user; and generating a respective virtual segment on the network for each set of resources of the plurality of sets of resources. 19. The method of claim 16, further comprising:
storing, in a data store, a record that the client device has requested access for the particular application to the set of resources corresponding to the particular security group. 20. The method of claim 16, further comprising:
sending the particular application to the client device in response to the selection; and causing the particular application to be installed upon the client device. | Disclosed are various examples for managing network resource permissions for applications through the use of an application catalog. A user interface presenting an application catalog is generated that includes a listing of applications that are available to managed client devices in an organization. A selection of a particular application from the application catalog is received from a managed client device. The selection indicates a particular security group of multiple security groups. A network of the organization is configured to provide the particular application on the managed client device with access to a set of resources corresponding to the particular security group.1. A non-transitory computer-readable medium embodying at least one program executable in at least one computing device, the at least one program, when executed by the at least one computing device, being configured to cause the at least one computing device to at least:
generate a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to managed client devices in an organization; receive, from a managed client device, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a particular security group of a plurality of security groups; and configure a network of the organization to provide the particular application on the managed client device with access to a set of resources corresponding to the particular security group. 2. The non-transitory computer-readable medium of claim 1, wherein the particular security group is associated with a role of a user within the organization, and the managed client device is used by the user. 3. The non-transitory computer-readable medium of claim 1, wherein configuring the network of the organization further comprises configuring a network device to permit routing of network traffic from the particular application executed in the managed client device to a virtual segment of the network through which the set of resources are accessible. 4. The non-transitory computer-readable medium of claim 1, wherein each of the plurality of security groups are associated with a different virtual segment of the network. 5. The non-transitory computer-readable medium of claim 1, wherein another security group of the plurality of security groups corresponds to a different set of resources, and the different set of resources includes at least one resource in common with the set of resources corresponding to the particular security group. 6. The non-transitory computer-readable medium of claim 1, wherein the listing of the plurality of applications included in the application catalog comprises a plurality of instances of the particular application, individual ones of the plurality of instances corresponding respective ones of the plurality of security groups. 7. The non-transitory computer-readable medium of claim 1, wherein the user interface includes a component corresponding to the particular application that facilitates a user selection of the particular security group of the plurality of security groups. 8. The non-transitory computer-readable medium of claim 1, wherein the at least one program, when executed by the at least one computing device, is further configured to cause the at least one computing device to at least:
verify that a user associated with the managed client device is authorized for the particular security group before configuring the network. 9. The non-transitory computer-readable medium of claim 1, wherein the at least one program, when executed by the at least one computing device, is further configured to cause the at least one computing device to at least:
send data encoding the user interface to the managed client device. 10. A system, comprising:
at least one computing device; and an application catalog service executable by the at least one computing device, the application catalog service configured to cause the at least one computing device to at least:
generate a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to managed client devices in an organization;
receive, from a managed client device associated with a user, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a role of the user in the organization; and
configure a network of the organization to provide the particular application on the managed client device with access to a set of resources corresponding to the role of the user in the organization. 11. The system of claim 10, wherein the role of the user in the organization is associated with a particular security group of a plurality of security groups, and the set of resources corresponds to the particular security group. 12. The system of claim 10, wherein the user interface includes, for the particular application, a plurality of selectable components that correspond to a plurality of roles in the organization. 13. The system of claim 10, wherein configuring the network further comprises configuring a network device to permit routing of network traffic from the particular application executed in the managed client device to a virtual segment of the network through which the set of resources are accessible. 14. The system of claim 13, wherein the network device is configured to verify that the managed client device has a credential associated with the virtual segment of the network before routing the network traffic from the particular application to the virtual segment of the network. 15. The system of claim 10, wherein the application catalog service is further configured to cause the at least one computing device to at least:
receive a specification of a plurality of sets of resources for the particular application from an administrative user; and generate a respective virtual segment on the network for each set of resources of the plurality of sets of resources. 16. A method, comprising:
generating a user interface presenting an application catalog that includes a listing of a plurality of applications that are available to client devices; receiving, from a client device, a selection of a particular application of the plurality of applications from the application catalog, the selection indicating a particular security group of a plurality of security groups; and configuring a network to provide the particular application on the client device with access to a set of resources corresponding to the particular security group. 17. The method of claim 16, wherein each security group of the plurality of security groups is associated with a respective selectable component for the particular application in the user interface. 18. The method of claim 16, further comprising:
receiving a specification of a plurality of sets of resources for the particular application from another client device associated with an administrative user; and generating a respective virtual segment on the network for each set of resources of the plurality of sets of resources. 19. The method of claim 16, further comprising:
storing, in a data store, a record that the client device has requested access for the particular application to the set of resources corresponding to the particular security group. 20. The method of claim 16, further comprising:
sending the particular application to the client device in response to the selection; and causing the particular application to be installed upon the client device. | 2,100 |
5,461 | 5,461 | 15,012,725 | 2,137 | The present application is directed to a memory-access-multiplexing memory controller that can multiplex memory accesses from multiple hardware threads, cores, and processors according to externally specified policies or parameters, including policies or parameters set by management layers within a virtualized computer system. A memory-access-multiplexing memory controller provides, at the physical-hardware level, a basis for ensuring rational and policy-driven sharing of the memory-access resource among multiple hardware threads, cores, and/or processors. | 1. A multiplexing memory controller comprising:
a first data-transfer connection that connects the multiplexing memory controller with a data-storage cache; a second data-transfer connection that connects the multiplexing memory controller with an electronic memory; a number of channels, one or more memory-access-request servicing characteristics of each of which are defined by one or more values stored in one or more multiplexing-memory-controller registers associated with the channel; a memory-request input through which the multiplexing memory controller receives memory-access requests from two or more processing entities, each memory-access request accompanied with a channel indication that identifies a channel in the context of which the memory-access request is to be serviced by the multiplexing memory controller; and memory-controller logic that processes each received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by the one or more values stored in the one or more multiplexing-memory-controller registers associated with the channel identified by the channel indication that accompanies the memory-access-request in order to transfer data through the first and second data-transfer connections. 2. The multiplexing memory controller of claim 1 wherein the one or more multiplexing-memory-controller registers include:
a shares register that stores a number of memory-access-resource shares. 3. The multiplexing memory controller of claim I wherein the one or more multiplexing-memory-controller registers include:
a tokens register that stores a current number of memory-access-request-processing tokens. 4. The multiplexing memory controller of claim 1 wherein the one or more multiplexing-memory-controller registers include:
a token-increment register that stores an indication of a number of memory-access-request-processing tokens to be allocated to the channel by the multiplexing memory controller during each token-refresh cycle. 5. The multiplexing memory controller of claim 1 wherein each memory-access request input to the multiplexing memory controller is time-stamped by the memory controller. 6. The multiplexing memory controller of claim 5 wherein the timestamp assigned to a next memory-access request received by the memory controller with respect to a particular channel is one of:
a value equal to a timestamp value assigned to a memory-access request currently being processed by the memory-controller logic; and
a finish value computed for the last memory-access request with respect to the particular channel that was time-stamped by the memory controller. 7. The multiplexing memory controller of claim 5 wherein the finish value for a memory-access request received through a particular channel is computed as the timestamp assigned to the memory-access request to which a value inversely proportional to the value stored in the shares register associated with the channel is added. 8. The multiplexing memory controller of claim 5 wherein time-stamped memory-access requests are processed by the multiplexing memory controller in timestamp order. 9. The multiplexing memory controller of claim 5 wherein a memory-access request is processed only when a number of tokens stored in a tokens register associated with the channel identified by the channel identifier accompanying the memory-access request is greater or equal than a number of tokens needed to process the memory-access request. 10. The multiplexing memory controller of claim 1 wherein processing entities include one or more of
hardware threads;
cores; and
processors. 11. One or more multiplexing memory controller of claim 1 incorporated in a virtualized-computer system comprising:
a number of computers, each containing two or more processing entities;
a number of networking subsystems, each providing transmission of data to, and reception of data from, one or more remote computers;
a number of data-storage devices; and
a virtualized-computer-system manager that
aggregates the number of computers, the number of networking subsystems, the number of memories, the number of data-storage devices, and the one or more multiplexing memory controllers into a root-node resource pool, and
allocates shares of each type of resource in the root-node resource pool or in ancestor-node resource pools hierarchically derived from the root-node resource pool to multiple virtual machines, execution of which is managed by the virtualized-computer-system manager. 12. The one or more multiplexing memory controller of claim 11 wherein the virtualized-computer-system manager assigns one or more channels provided by the one or more multiplexing memory controllers to each of the multiple virtual machines. 13. A virtualized-computer system comprising:
a number of computers, each containing two or more processing entities; a number of networking subsystems, each providing transmission of data to, and reception of data from, one or more remote computers; one or more multiplexing memory controllers; a number of data-storage devices; and a virtualized-computer-system manager that
aggregates the number of computers, the number of networking subsystems, the number of memories, the number of data-storage devices, and channels provided by the one or more multiplexing memory controllers into a root-node resource pool, and
allocates shares of each type of resource in the root-node resource pool or in ancestor-node resource pools hierarchically derived from the root-node resource pool to multiple computational entities, execution of which is managed by the virtualized-computer-system manager. 14. The virtualized-computer system of claim 13 wherein each of the one or more multiplexing memory controllers comprises:
multiple channels, one or more memory-access-request servicing characteristics of each of which are defined by one or more values stored in one or more multiplexing-memory-controller registers associated with the channel;
a memory-request input through which the multiplexing memory controller receives memory-access requests from two or more processing entities, each memory-access request accompanied with a channel indication that identifies a channel in the context of which the memory-access request is to be serviced by the multiplexing memory controller; and
memory-controller logic that processes each received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by the one or more values stored in the one or more multiplexing-memory-controller registers associated with the channel identified by the channel indication that accompanies the memory-access-request. 15. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a shares register that stores a number of memory-access-resource shares. 16. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a tokens register that stores a current number of memory-access-request-processing tokens. 17. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a token-increment register that stores an indication of a number of memory-access-request-processing tokens to be allocated to the channel by the multiplexing memory controller during each token-refresh cycle. 18. The virtualized-computer system of claim 14 wherein each memory-access request input to one of the one or more multiplexing memory controller is time-stamped by the memory controller. 19. The virtualized-computer system of claim 18 wherein the timestamp assigned to a next memory-access request received by the memory controller with respect to a particular channel is one of:
a value equal to a timestamp value assigned to a memory-access request currently being processed by the memory-controller logic; and
a finish value computed for the last memory-access request with respect to the particular channel that was time-stamped by the memory controller. 20. The virtualized-computer system of claim 18 wherein time-stamped memory-access requests are processed by the multiplexing memory controller in timestamp order. 21. A physical data-storage device that stores processor instructions that, when executed by a processor within a multiplexing memory controller, control the multiplexing memory controller to:
process a received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by one or more values stored in one or more multiplexing-memory-controller registers associated with a channel identified by a channel indication that accompanies the memory-access-request; and transfer data, specified by the received memory-access request, through a first data-transfer connection that connects the multiplexing memory controller with a data-storage cache and a second data-transfer connection that connects the multiplexing memory controller with an electronic memory. | The present application is directed to a memory-access-multiplexing memory controller that can multiplex memory accesses from multiple hardware threads, cores, and processors according to externally specified policies or parameters, including policies or parameters set by management layers within a virtualized computer system. A memory-access-multiplexing memory controller provides, at the physical-hardware level, a basis for ensuring rational and policy-driven sharing of the memory-access resource among multiple hardware threads, cores, and/or processors.1. A multiplexing memory controller comprising:
a first data-transfer connection that connects the multiplexing memory controller with a data-storage cache; a second data-transfer connection that connects the multiplexing memory controller with an electronic memory; a number of channels, one or more memory-access-request servicing characteristics of each of which are defined by one or more values stored in one or more multiplexing-memory-controller registers associated with the channel; a memory-request input through which the multiplexing memory controller receives memory-access requests from two or more processing entities, each memory-access request accompanied with a channel indication that identifies a channel in the context of which the memory-access request is to be serviced by the multiplexing memory controller; and memory-controller logic that processes each received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by the one or more values stored in the one or more multiplexing-memory-controller registers associated with the channel identified by the channel indication that accompanies the memory-access-request in order to transfer data through the first and second data-transfer connections. 2. The multiplexing memory controller of claim 1 wherein the one or more multiplexing-memory-controller registers include:
a shares register that stores a number of memory-access-resource shares. 3. The multiplexing memory controller of claim I wherein the one or more multiplexing-memory-controller registers include:
a tokens register that stores a current number of memory-access-request-processing tokens. 4. The multiplexing memory controller of claim 1 wherein the one or more multiplexing-memory-controller registers include:
a token-increment register that stores an indication of a number of memory-access-request-processing tokens to be allocated to the channel by the multiplexing memory controller during each token-refresh cycle. 5. The multiplexing memory controller of claim 1 wherein each memory-access request input to the multiplexing memory controller is time-stamped by the memory controller. 6. The multiplexing memory controller of claim 5 wherein the timestamp assigned to a next memory-access request received by the memory controller with respect to a particular channel is one of:
a value equal to a timestamp value assigned to a memory-access request currently being processed by the memory-controller logic; and
a finish value computed for the last memory-access request with respect to the particular channel that was time-stamped by the memory controller. 7. The multiplexing memory controller of claim 5 wherein the finish value for a memory-access request received through a particular channel is computed as the timestamp assigned to the memory-access request to which a value inversely proportional to the value stored in the shares register associated with the channel is added. 8. The multiplexing memory controller of claim 5 wherein time-stamped memory-access requests are processed by the multiplexing memory controller in timestamp order. 9. The multiplexing memory controller of claim 5 wherein a memory-access request is processed only when a number of tokens stored in a tokens register associated with the channel identified by the channel identifier accompanying the memory-access request is greater or equal than a number of tokens needed to process the memory-access request. 10. The multiplexing memory controller of claim 1 wherein processing entities include one or more of
hardware threads;
cores; and
processors. 11. One or more multiplexing memory controller of claim 1 incorporated in a virtualized-computer system comprising:
a number of computers, each containing two or more processing entities;
a number of networking subsystems, each providing transmission of data to, and reception of data from, one or more remote computers;
a number of data-storage devices; and
a virtualized-computer-system manager that
aggregates the number of computers, the number of networking subsystems, the number of memories, the number of data-storage devices, and the one or more multiplexing memory controllers into a root-node resource pool, and
allocates shares of each type of resource in the root-node resource pool or in ancestor-node resource pools hierarchically derived from the root-node resource pool to multiple virtual machines, execution of which is managed by the virtualized-computer-system manager. 12. The one or more multiplexing memory controller of claim 11 wherein the virtualized-computer-system manager assigns one or more channels provided by the one or more multiplexing memory controllers to each of the multiple virtual machines. 13. A virtualized-computer system comprising:
a number of computers, each containing two or more processing entities; a number of networking subsystems, each providing transmission of data to, and reception of data from, one or more remote computers; one or more multiplexing memory controllers; a number of data-storage devices; and a virtualized-computer-system manager that
aggregates the number of computers, the number of networking subsystems, the number of memories, the number of data-storage devices, and channels provided by the one or more multiplexing memory controllers into a root-node resource pool, and
allocates shares of each type of resource in the root-node resource pool or in ancestor-node resource pools hierarchically derived from the root-node resource pool to multiple computational entities, execution of which is managed by the virtualized-computer-system manager. 14. The virtualized-computer system of claim 13 wherein each of the one or more multiplexing memory controllers comprises:
multiple channels, one or more memory-access-request servicing characteristics of each of which are defined by one or more values stored in one or more multiplexing-memory-controller registers associated with the channel;
a memory-request input through which the multiplexing memory controller receives memory-access requests from two or more processing entities, each memory-access request accompanied with a channel indication that identifies a channel in the context of which the memory-access request is to be serviced by the multiplexing memory controller; and
memory-controller logic that processes each received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by the one or more values stored in the one or more multiplexing-memory-controller registers associated with the channel identified by the channel indication that accompanies the memory-access-request. 15. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a shares register that stores a number of memory-access-resource shares. 16. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a tokens register that stores a current number of memory-access-request-processing tokens. 17. The virtualized-computer system of claim 14 wherein the one or more multiplexing-memory-controller registers include:
a token-increment register that stores an indication of a number of memory-access-request-processing tokens to be allocated to the channel by the multiplexing memory controller during each token-refresh cycle. 18. The virtualized-computer system of claim 14 wherein each memory-access request input to one of the one or more multiplexing memory controller is time-stamped by the memory controller. 19. The virtualized-computer system of claim 18 wherein the timestamp assigned to a next memory-access request received by the memory controller with respect to a particular channel is one of:
a value equal to a timestamp value assigned to a memory-access request currently being processed by the memory-controller logic; and
a finish value computed for the last memory-access request with respect to the particular channel that was time-stamped by the memory controller. 20. The virtualized-computer system of claim 18 wherein time-stamped memory-access requests are processed by the multiplexing memory controller in timestamp order. 21. A physical data-storage device that stores processor instructions that, when executed by a processor within a multiplexing memory controller, control the multiplexing memory controller to:
process a received memory-access request in accordance with the one or more memory-access-request servicing characteristics defined by one or more values stored in one or more multiplexing-memory-controller registers associated with a channel identified by a channel indication that accompanies the memory-access-request; and transfer data, specified by the received memory-access request, through a first data-transfer connection that connects the multiplexing memory controller with a data-storage cache and a second data-transfer connection that connects the multiplexing memory controller with an electronic memory. | 2,100 |
5,462 | 5,462 | 13,742,406 | 2,142 | Provided are techniques for the identification and display of critical messages including displaying a default desktop on a computing system; detecting a first popup message; making a first determination that the first popup message conforms with user specified criteria; and in response to the first determination generating a first emergency desktop; populating the first emergency desktop with the first popup message; and displaying the first emergency desktop in place of the default desktop on the computing system. | 1. A method, comprising:
detecting a first popup message associated with a default desktop displayed on a computing system; making a first determination that the first popup message conforms with user specified criteria; and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 2. The method of claim 1, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 3. The method of claim 1, further comprising:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 4. The method of claim 1, the detecting comprising:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating; of the first signature, from a detected popup. 5. The method of claim 1, further comprising:
detecting a second popup message; making a second determination that the second popup message confirms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 6. The method of claim 5, further comprising making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 7. The method of claim 6, wherein the making of the first determination depends upon a second determination that the first popup message is not an excluded popup message. 8. An apparatus, comprising:
a processor associated with a computing system; a computer-readable storage medium coupled to the processor; and logic, stored on the computer-readable storage medium and executed on the processor, for:
detecting a first popup message associated with a default desktop displayed on the computing system;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination;
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 9. The apparatus of claim 8, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising;
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 10. The apparatus of claim 8, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 11. The apparatus of claim 8, the logic for detecting comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 12. The apparatus of claim 8, the logic further comprising logic for:
detecting a second popup message; making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 13. The apparatus of claim 12, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 14. A computer programming product, comprising;
a computer-readable storage medium; and logic, stored on the computer-readable storage medium and executed on a processor associated with a computing system, for:
detecting a first popup message associated with a default desktop displayed on the computing system;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 15. The computer programming product of claim 14, wherein the first popup message: is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process, 16. The computer programming product of claim 14, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 17. The computer programming product of claim 14, the logic for detecting g comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 18. The computer programming product of claim 14, the logic further comprising logic for:
detecting a second popup message; making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 19. The computer programming product of claim 18, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 20. A computer display associated with a computing system, comprising:
a processor; a computer-readable storage medium coupled to the processor; and logic, stored on the computer-readable storage medium and executed on the processor, for:
detecting a first popup message associated with a default desktop displayed on the computer display;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computer display in place of the default desktop. 21. The computer display of claim 20, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 22. The computer display of claim 20, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 23. The computer display of claim 20, the logic for detecting comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 24. The computer display of claim 20, the logic further comprising logic for:
detecting, a second popup message: making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computer display; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 25. The computer display of claim 24, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computer display rather than the first emergency desktop. | Provided are techniques for the identification and display of critical messages including displaying a default desktop on a computing system; detecting a first popup message; making a first determination that the first popup message conforms with user specified criteria; and in response to the first determination generating a first emergency desktop; populating the first emergency desktop with the first popup message; and displaying the first emergency desktop in place of the default desktop on the computing system.1. A method, comprising:
detecting a first popup message associated with a default desktop displayed on a computing system; making a first determination that the first popup message conforms with user specified criteria; and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 2. The method of claim 1, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 3. The method of claim 1, further comprising:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 4. The method of claim 1, the detecting comprising:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating; of the first signature, from a detected popup. 5. The method of claim 1, further comprising:
detecting a second popup message; making a second determination that the second popup message confirms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 6. The method of claim 5, further comprising making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 7. The method of claim 6, wherein the making of the first determination depends upon a second determination that the first popup message is not an excluded popup message. 8. An apparatus, comprising:
a processor associated with a computing system; a computer-readable storage medium coupled to the processor; and logic, stored on the computer-readable storage medium and executed on the processor, for:
detecting a first popup message associated with a default desktop displayed on the computing system;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination;
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 9. The apparatus of claim 8, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising;
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 10. The apparatus of claim 8, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 11. The apparatus of claim 8, the logic for detecting comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 12. The apparatus of claim 8, the logic further comprising logic for:
detecting a second popup message; making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 13. The apparatus of claim 12, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 14. A computer programming product, comprising;
a computer-readable storage medium; and logic, stored on the computer-readable storage medium and executed on a processor associated with a computing system, for:
detecting a first popup message associated with a default desktop displayed on the computing system;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computing system in place of the default desktop. 15. The computer programming product of claim 14, wherein the first popup message: is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and a fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process, 16. The computer programming product of claim 14, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 17. The computer programming product of claim 14, the logic for detecting g comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 18. The computer programming product of claim 14, the logic further comprising logic for:
detecting a second popup message; making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computing system; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 19. The computer programming product of claim 18, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computing system rather than the first emergency desktop. 20. A computer display associated with a computing system, comprising:
a processor; a computer-readable storage medium coupled to the processor; and logic, stored on the computer-readable storage medium and executed on the processor, for:
detecting a first popup message associated with a default desktop displayed on the computer display;
making a first determination that the first popup message conforms with user specified criteria;
and in response to the first determination:
generating a first emergency desktop;
populating the first emergency desktop with the first popup message; and
enabling a display of the first emergency desktop on the computer display in place of the default desktop. 21. The computer display of claim 20, wherein the first popup message is evaluated for conformity with the first user specified criteria by one or more procedures, the procedures comprising:
a first procedure comprising:
generating a first signature corresponding to the first popup message; and
matching the first signature to a second signature stored on a computer readable storage medium;
a second procedure comprising correlating the first popup message with a specified process; a third procedure comprising detecting a plurality of keywords in the first popup message; and fourth procedure comprising correlating, the first popup message with one or more GUI control properties, the one or more GUI control properties comprising:
window title;
window dialog ID;
window class ID;
parent/owning window; and
owning application/process. 22. The computer display of claim 20, the logic further comprising logic for:
making a second determination that a response has been received with respect to the emergency popup message; and, in response to the second determination; and enabling the display of the default desktop on the computing system rather than the first emergency desktop. 23. The computer display of claim 20, the logic for detecting comprising logic for:
setting an operating system hook to monitor popup windows; and extracting properties, for the generating of the first signature, from a detected popup. 24. The computer display of claim 20, the logic further comprising logic for:
detecting, a second popup message: making a second determination that the second popup message conforms with the user specified criteria; making a third determination that the first emergency desktop is displayed on the computer display; and, in response to the second and third determination:
generating a second emergency desktop;
populating the second emergency desktop with the second popup message; and
storing the second emergency desktop in a desktop queue. 25. The computer display of claim 24, the logic further comprising logic for making a forth determination that a response has been received with respect to the first popup message; and, in response to the forth determination:
selecting the second emergency desktop from the desktop queue; and enabling a display of the second emergency desktop on the computer display rather than the first emergency desktop. | 2,100 |
5,463 | 5,463 | 15,408,222 | 2,184 | A method for preventing non-temporal entries from entering small critical structures is disclosed. The method comprises transferring a first entry from a higher level memory structure to an intermediate buffer. It further comprises determining a second entry to be evicted from the intermediate buffer and a corresponding value associated with the second entry. Subsequently, responsive to a determination that the second entry is frequently accessed, the method comprises installing the second entry into a lower level memory structure. Finally, the method comprises installing the first entry into a slot previously occupied by the second entry in the intermediate buffer. | 1. A method for preventing non-temporal entries from entering small critical structures, said method comprising:
receiving data from a higher level memory structure at an intermediate buffer, the higher level memory structure having a higher latency relative to a processor than the intermediate buffer; determining an entry to be evicted from the intermediate buffer that has been frequently accessed; sending a value in the determined entry to a lower level memory structure, the lower level memory structure having a lower latency relative to the processor than the intermediate buffer; and storing the data in the determined entry of the intermediate buffer. 2. The method of claim 1, wherein the higher level memory structure is a Level 2 cache memory. 3. The method of claim 1, wherein the lower level memory structure is any one of a L1 data cache memory, a L1 instruction cache memory and a conversion lookaside buffer. 4. The method of claim 1, further comprising:
receiving an access request for the entry in the intermediate buffer; and increasing an access counter for the entry. 5. The method of claim 4, further comprising:
comparing the access counter to a threshold to move the entry to the lower level memory structure. 6. The method of claim 1, wherein the determining is based on a replacement policy, wherein the replacement policy is any one of an access counter based replacement policy, a least-recently used replacement policy and a random replacement policy. 7. The method of claim 1, further comprising:
discarding another entry in the intermediate buffer where an access count of the other entry is below a discard threshold. 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. (canceled) 13. (canceled) 14. (canceled) 15. An apparatus for preventing non-temporal entries from entering small critical structures, said apparatus comprising:
a memory; a processor communicatively coupled to the memory; a low level memory structure coupled to the processor, the low level memory structure with a lower latency to the processor than the memory; and an intermediate buffer coupled to the low level memory structure, the intermediate buffer having a latency that is lower than the memory, the intermediate buffer to receive a first block from the memory, the intermediate buffer having replacement logic to determine an entry to be evicted from the intermediate buffer that has been frequently accessed, to send a second block in the determined entry to the lower level memory structure, and to store the first block in the determined entry of the intermediate buffer. 16. The apparatus of claim 15, further comprising:
Level 2 cache memory having a latency that is higher than the intermediate buffer and lower than the memory. 17. The apparatus of claim 15, wherein the lower level memory structure is any one of a L1 data cache memory, a L1 instruction cache memory and a conversion lookaside buffer. 18. The apparatus of claim 15, wherein said the intermediate buffer includes confidence logic to discard the second block responsive to a determination that the second block is not frequently accessed. 19. The apparatus of claim 18, wherein the confidence logic compares an access counter of the second block to a threshold to move the second block to the lower level memory structure. 20. The apparatus of claim 15, wherein the replacement logic is configured to determine the second block to be evicted based on a replacement policy, wherein the replacement policy is any one of an access counter based replacement policy, a least-recently used replacement policy and a random replacement policy. 21. The method of claim 1, further comprising:
receiving a fetch at the intermediate buffer simultaneous to the fetch being processed at the lower level memory structure. 22. The method of claim 1, further comprising:
sending an entry to the lower level memory structure in response to an access causing an access count to exceed a move threshold. 23. The apparatus of claim 15, wherein the processor sends a fetch to the intermediate buffer simultaneous to the fetch being sent to the lower level memory structure. 24. The apparatus of claim 15, wherein the replacement logic and confidence logic are configured to send a third block to the lower level memory structure in response to an access of the third block causing an access count to exceed a move threshold. | A method for preventing non-temporal entries from entering small critical structures is disclosed. The method comprises transferring a first entry from a higher level memory structure to an intermediate buffer. It further comprises determining a second entry to be evicted from the intermediate buffer and a corresponding value associated with the second entry. Subsequently, responsive to a determination that the second entry is frequently accessed, the method comprises installing the second entry into a lower level memory structure. Finally, the method comprises installing the first entry into a slot previously occupied by the second entry in the intermediate buffer.1. A method for preventing non-temporal entries from entering small critical structures, said method comprising:
receiving data from a higher level memory structure at an intermediate buffer, the higher level memory structure having a higher latency relative to a processor than the intermediate buffer; determining an entry to be evicted from the intermediate buffer that has been frequently accessed; sending a value in the determined entry to a lower level memory structure, the lower level memory structure having a lower latency relative to the processor than the intermediate buffer; and storing the data in the determined entry of the intermediate buffer. 2. The method of claim 1, wherein the higher level memory structure is a Level 2 cache memory. 3. The method of claim 1, wherein the lower level memory structure is any one of a L1 data cache memory, a L1 instruction cache memory and a conversion lookaside buffer. 4. The method of claim 1, further comprising:
receiving an access request for the entry in the intermediate buffer; and increasing an access counter for the entry. 5. The method of claim 4, further comprising:
comparing the access counter to a threshold to move the entry to the lower level memory structure. 6. The method of claim 1, wherein the determining is based on a replacement policy, wherein the replacement policy is any one of an access counter based replacement policy, a least-recently used replacement policy and a random replacement policy. 7. The method of claim 1, further comprising:
discarding another entry in the intermediate buffer where an access count of the other entry is below a discard threshold. 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. (canceled) 13. (canceled) 14. (canceled) 15. An apparatus for preventing non-temporal entries from entering small critical structures, said apparatus comprising:
a memory; a processor communicatively coupled to the memory; a low level memory structure coupled to the processor, the low level memory structure with a lower latency to the processor than the memory; and an intermediate buffer coupled to the low level memory structure, the intermediate buffer having a latency that is lower than the memory, the intermediate buffer to receive a first block from the memory, the intermediate buffer having replacement logic to determine an entry to be evicted from the intermediate buffer that has been frequently accessed, to send a second block in the determined entry to the lower level memory structure, and to store the first block in the determined entry of the intermediate buffer. 16. The apparatus of claim 15, further comprising:
Level 2 cache memory having a latency that is higher than the intermediate buffer and lower than the memory. 17. The apparatus of claim 15, wherein the lower level memory structure is any one of a L1 data cache memory, a L1 instruction cache memory and a conversion lookaside buffer. 18. The apparatus of claim 15, wherein said the intermediate buffer includes confidence logic to discard the second block responsive to a determination that the second block is not frequently accessed. 19. The apparatus of claim 18, wherein the confidence logic compares an access counter of the second block to a threshold to move the second block to the lower level memory structure. 20. The apparatus of claim 15, wherein the replacement logic is configured to determine the second block to be evicted based on a replacement policy, wherein the replacement policy is any one of an access counter based replacement policy, a least-recently used replacement policy and a random replacement policy. 21. The method of claim 1, further comprising:
receiving a fetch at the intermediate buffer simultaneous to the fetch being processed at the lower level memory structure. 22. The method of claim 1, further comprising:
sending an entry to the lower level memory structure in response to an access causing an access count to exceed a move threshold. 23. The apparatus of claim 15, wherein the processor sends a fetch to the intermediate buffer simultaneous to the fetch being sent to the lower level memory structure. 24. The apparatus of claim 15, wherein the replacement logic and confidence logic are configured to send a third block to the lower level memory structure in response to an access of the third block causing an access count to exceed a move threshold. | 2,100 |
5,464 | 5,464 | 14,031,256 | 2,122 | This document describes techniques for predicting spread of content across social networks. In various embodiments, user interactions with content posted to a social network are accessed during a first stage. The accessed user interactions are applied to a prediction model to predict future user interactions with the content during one or more subsequent stages. | 1. A computer-implemented method comprising:
receiving one or more parameters related to a page on a social network; accessing user interactions with content posted to the page on the social network during a first stage; and predicting future user interactions with the content during one or more subsequent stages by applying the one or more parameters and the accessed user interactions to a prediction model. 2. The computer-implemented method of claim 1, wherein the one or more received parameters include at least a population parameter that is related to a number of users subscribed to the page on the social network. 3. The computer-implemented method of claim 2, wherein the predicting further comprises:
determining, using the prediction model, a probability of a user interacting with the content during each of the one or more subsequent stages based at least in part on the accessed user interactions with the content during the first stage; and predicting, using the prediction model, a number of future user interactions with the content at each of the one or more subsequent stages as a function of the population parameter and the probability of the user getting infected at each respective subsequent stage. 4. The computer-implemented method of claim 1, wherein the prediction model includes a recursive algorithm. 5. The computer-implemented method of claim 1, wherein the one or more parameters include at least an average connections parameter that corresponds to an average number of connections of each user subscribed to the page on the social network. 6. The computer-implemented method of claim 1, wherein the first stage corresponds to a duration of time, and wherein the one or more subsequent stages each correspond to the same duration of time. 7. The computer-implemented method of claim 1, wherein the predicting further comprises predicting future user interactions with the content during at least nine subsequent stages. 8. The computer-implemented method of claim 1, wherein the content comprises a post, a picture, video content, or audio content. 9. The computer-implemented method of claim 1, wherein the user interactions comprise one or more of views of the content, clicks on the content, replies to the content, likes of the content, shares of the content, or retweets of the content. 10. One or more computer-readable storage media comprising instructions stored thereon that, responsive to execution by a computing device, cause the computing device to perform operations comprising:
receiving, via a user interface, parameters corresponding to a page on a social network, the parameters including at least a population parameter related to a number of users subscribed to the page on the social network, and an average connections parameter corresponding to an average number of connections of the users subscribed to the page; accessing user interactions with content posted to the page on the social network during a first stage; and predicting future user interactions with the content during one or more subsequent stages by applying the one or more parameters and the accessed user interactions to a prediction model. 11. The one or more computer-readable storage media of claim 10, wherein the predicting future user interactions with the content further comprises:
determining, using the prediction model, a probability of a user interacting with the content during each of the one or more subsequent stages based at least in part on the accessed user interactions with the content during the first stage; and predicting, using the prediction model, a number of future user interactions with the content at each of the one or more subsequent stages as a function of the population parameter and the probability of the user getting infected at each respective subsequent stage. 12. The one or more computer-readable storage media of claim 10, wherein the prediction model comprises a recursive algorithm. 13. The one or more computer-readable storage media of claim 10, wherein the first stage corresponds to a duration of time, and wherein the one or more subsequent stages each correspond to the same duration of time. 14. The one or more computer-readable storage media of claim 10, wherein the predicting further comprises predicting future user interactions with the content during at least nine subsequent stages. 15. The one or more computer-readable storage media of claim 10, wherein the content comprises a post, a picture, or a video. 16. The one or more computer-readable storage media of claim 10, wherein the user interactions comprise one or more of views of the content, clicks on the content, replies to the content, likes of the content, shares of the content, or retweets of the content. 17. A computing device, comprising:
at least a memory and a processor to implement a prediction model, the prediction model configured to:
receive a population parameter that is related to a number of users that subscribe to a page on a social network;
receive user interactions with content posted to the page during a first stage;
determine a first probability of a user interacting with the content during the first stage based on the received user interactions;
generate a trend of probabilities of a user interacting with the content in subsequent stages;
determine, from the trend, a probability of a user interacting with the content during each of the subsequent stages; and
predict the number of user interactions with the content at each of the subsequent stages as a function of the population parameter and the probability of the user interacting with the content at each respective subsequent stage. 18. The computing device of claim 17, wherein the trend of probabilities is generated using linear extrapolation. 19. The computing device of claim 17, wherein the first stage corresponds to a duration of time, and wherein each of the subsequent stages correspond to the same duration of time. 20. The computing device of claim 17, wherein the prediction model is further configured to determine, from the trend, the probability of a user interacting with the content during at least nine subsequent stages. | This document describes techniques for predicting spread of content across social networks. In various embodiments, user interactions with content posted to a social network are accessed during a first stage. The accessed user interactions are applied to a prediction model to predict future user interactions with the content during one or more subsequent stages.1. A computer-implemented method comprising:
receiving one or more parameters related to a page on a social network; accessing user interactions with content posted to the page on the social network during a first stage; and predicting future user interactions with the content during one or more subsequent stages by applying the one or more parameters and the accessed user interactions to a prediction model. 2. The computer-implemented method of claim 1, wherein the one or more received parameters include at least a population parameter that is related to a number of users subscribed to the page on the social network. 3. The computer-implemented method of claim 2, wherein the predicting further comprises:
determining, using the prediction model, a probability of a user interacting with the content during each of the one or more subsequent stages based at least in part on the accessed user interactions with the content during the first stage; and predicting, using the prediction model, a number of future user interactions with the content at each of the one or more subsequent stages as a function of the population parameter and the probability of the user getting infected at each respective subsequent stage. 4. The computer-implemented method of claim 1, wherein the prediction model includes a recursive algorithm. 5. The computer-implemented method of claim 1, wherein the one or more parameters include at least an average connections parameter that corresponds to an average number of connections of each user subscribed to the page on the social network. 6. The computer-implemented method of claim 1, wherein the first stage corresponds to a duration of time, and wherein the one or more subsequent stages each correspond to the same duration of time. 7. The computer-implemented method of claim 1, wherein the predicting further comprises predicting future user interactions with the content during at least nine subsequent stages. 8. The computer-implemented method of claim 1, wherein the content comprises a post, a picture, video content, or audio content. 9. The computer-implemented method of claim 1, wherein the user interactions comprise one or more of views of the content, clicks on the content, replies to the content, likes of the content, shares of the content, or retweets of the content. 10. One or more computer-readable storage media comprising instructions stored thereon that, responsive to execution by a computing device, cause the computing device to perform operations comprising:
receiving, via a user interface, parameters corresponding to a page on a social network, the parameters including at least a population parameter related to a number of users subscribed to the page on the social network, and an average connections parameter corresponding to an average number of connections of the users subscribed to the page; accessing user interactions with content posted to the page on the social network during a first stage; and predicting future user interactions with the content during one or more subsequent stages by applying the one or more parameters and the accessed user interactions to a prediction model. 11. The one or more computer-readable storage media of claim 10, wherein the predicting future user interactions with the content further comprises:
determining, using the prediction model, a probability of a user interacting with the content during each of the one or more subsequent stages based at least in part on the accessed user interactions with the content during the first stage; and predicting, using the prediction model, a number of future user interactions with the content at each of the one or more subsequent stages as a function of the population parameter and the probability of the user getting infected at each respective subsequent stage. 12. The one or more computer-readable storage media of claim 10, wherein the prediction model comprises a recursive algorithm. 13. The one or more computer-readable storage media of claim 10, wherein the first stage corresponds to a duration of time, and wherein the one or more subsequent stages each correspond to the same duration of time. 14. The one or more computer-readable storage media of claim 10, wherein the predicting further comprises predicting future user interactions with the content during at least nine subsequent stages. 15. The one or more computer-readable storage media of claim 10, wherein the content comprises a post, a picture, or a video. 16. The one or more computer-readable storage media of claim 10, wherein the user interactions comprise one or more of views of the content, clicks on the content, replies to the content, likes of the content, shares of the content, or retweets of the content. 17. A computing device, comprising:
at least a memory and a processor to implement a prediction model, the prediction model configured to:
receive a population parameter that is related to a number of users that subscribe to a page on a social network;
receive user interactions with content posted to the page during a first stage;
determine a first probability of a user interacting with the content during the first stage based on the received user interactions;
generate a trend of probabilities of a user interacting with the content in subsequent stages;
determine, from the trend, a probability of a user interacting with the content during each of the subsequent stages; and
predict the number of user interactions with the content at each of the subsequent stages as a function of the population parameter and the probability of the user interacting with the content at each respective subsequent stage. 18. The computing device of claim 17, wherein the trend of probabilities is generated using linear extrapolation. 19. The computing device of claim 17, wherein the first stage corresponds to a duration of time, and wherein each of the subsequent stages correspond to the same duration of time. 20. The computing device of claim 17, wherein the prediction model is further configured to determine, from the trend, the probability of a user interacting with the content during at least nine subsequent stages. | 2,100 |
5,465 | 5,465 | 14,541,785 | 2,178 | In various implementations, an embedded document receives untrusted content from a containing document, where the embedded document is in the containing document. In some cases, the untrusted content is received by the containing document from a server and is forwarded to the embedded document without rendering the untrusted content in the containing document. Instead, the untrusted content is rendered in the embedded document. A sandbox policy is enforced on the embedded document such that the rendered untrusted content is restricted from accessing data associated with the containing document. The untrusted content may comprise malicious code that when rendered executes an XXS attack that attempts to access the data associated with the containing document. However, because the untrusted content is rendered in the embedded document, the malicious code may be denied access to the data, thereby preventing the XSS attack from succeeding. | 1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:
receiving, by an embedded document, untrusted content from a containing document, wherein the embedded document is in the containing document; rendering the received untrusted content in the embedded document, wherein a sandbox policy is enforced on the embedded document such that the rendered untrusted content is restricted from accessing at least some data associated with the containing document. 2. The one or more computer storage media of claim 1, further comprising:
receiving, by the embedded document, additional untrusted content from one or more users; and sending the received additional untrusted content to the containing document. 3. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from a server and forwarding the received untrusted content to the embedded document. 4. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from user input to the containing document and forwarding the received untrusted content to the embedded document. 5. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content and forwarding the received untrusted content to the embedded document, wherein the untrusted content is not rendered on the containing document. 6. The one or more computer storage media of claim 1, further comprising displaying the embedded document without a visual indication that the embedded document is a separate document from the containing document. 7. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from a server in a user authenticated communication and forwarding the received untrusted content to the embedded document. 8. The one or more computer storage media of claim 1, wherein the at least some data comprises an authentication cookie of a user logged into the containing document. 9. The one or more computer storage media of claim 1, wherein the sandbox policy is a same-origin policy. 10. The one or more computer storage media of claim 1, wherein the containing document is a markup language document. 11. The one or more computer storage media of claim 1, wherein the embedded document is in a different domain than the containing document. 12. The one or more computer storage media of claim 1, wherein the embedded document is in a same domain as the containing document. 13. The one or more computer storage media of claim 1, wherein at least some of the data is in the document object model (DOM) of the containing document. 14. A computer implemented method comprising:
receiving, by an embedded document, untrusted content from a containing document, wherein the embedded document is in the containing document, and the containing document and the embedded document are loaded in a document viewer; rendering the received untrusted content in the embedded document, wherein the document viewer prevents the rendered untrusted content from accessing at least some data associated with the containing document by enforcing a sandbox policy on the embedded document. 15. The computer implemented method of claim 14, wherein the containing document is a HyperText Markup Language (HTML) document and the embedded document is in an inline frame (iframe) of the HTML document. 16. The computer implemented method of claim 14, wherein the document viewer is a web browser. 17. A computerized system comprising:
a content handler of an embedded document receiving untrusted content from a containing document, wherein the embedded document is in the containing document; a content processor of the embedded document rendering the received untrusted content in the embedded document; a document viewer enforcing a sandbox policy on the embedded document such that the rendered untrusted content is restricted from accessing at least some data associated with the containing document. 18. The computerized system of claim 17, further comprising a content handler of the containing document receiving additional untrusted content from the content handler of the embedded document and forwarding the received additional untrusted content to a server. 19. The computerized system of claim 17, further comprising the content processor extracting the untrusted content from a message comprising a string, the string corresponding to the untrusted content. 20. The computerized system of claim 17, further comprising a content handler of the containing document receiving the untrusted content from a server and forwarding the received additional untrusted content to the embedded document, wherein the untrusted content is not rendered on the containing document. | In various implementations, an embedded document receives untrusted content from a containing document, where the embedded document is in the containing document. In some cases, the untrusted content is received by the containing document from a server and is forwarded to the embedded document without rendering the untrusted content in the containing document. Instead, the untrusted content is rendered in the embedded document. A sandbox policy is enforced on the embedded document such that the rendered untrusted content is restricted from accessing data associated with the containing document. The untrusted content may comprise malicious code that when rendered executes an XXS attack that attempts to access the data associated with the containing document. However, because the untrusted content is rendered in the embedded document, the malicious code may be denied access to the data, thereby preventing the XSS attack from succeeding.1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:
receiving, by an embedded document, untrusted content from a containing document, wherein the embedded document is in the containing document; rendering the received untrusted content in the embedded document, wherein a sandbox policy is enforced on the embedded document such that the rendered untrusted content is restricted from accessing at least some data associated with the containing document. 2. The one or more computer storage media of claim 1, further comprising:
receiving, by the embedded document, additional untrusted content from one or more users; and sending the received additional untrusted content to the containing document. 3. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from a server and forwarding the received untrusted content to the embedded document. 4. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from user input to the containing document and forwarding the received untrusted content to the embedded document. 5. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content and forwarding the received untrusted content to the embedded document, wherein the untrusted content is not rendered on the containing document. 6. The one or more computer storage media of claim 1, further comprising displaying the embedded document without a visual indication that the embedded document is a separate document from the containing document. 7. The one or more computer storage media of claim 1, further comprising the containing document receiving the untrusted content from a server in a user authenticated communication and forwarding the received untrusted content to the embedded document. 8. The one or more computer storage media of claim 1, wherein the at least some data comprises an authentication cookie of a user logged into the containing document. 9. The one or more computer storage media of claim 1, wherein the sandbox policy is a same-origin policy. 10. The one or more computer storage media of claim 1, wherein the containing document is a markup language document. 11. The one or more computer storage media of claim 1, wherein the embedded document is in a different domain than the containing document. 12. The one or more computer storage media of claim 1, wherein the embedded document is in a same domain as the containing document. 13. The one or more computer storage media of claim 1, wherein at least some of the data is in the document object model (DOM) of the containing document. 14. A computer implemented method comprising:
receiving, by an embedded document, untrusted content from a containing document, wherein the embedded document is in the containing document, and the containing document and the embedded document are loaded in a document viewer; rendering the received untrusted content in the embedded document, wherein the document viewer prevents the rendered untrusted content from accessing at least some data associated with the containing document by enforcing a sandbox policy on the embedded document. 15. The computer implemented method of claim 14, wherein the containing document is a HyperText Markup Language (HTML) document and the embedded document is in an inline frame (iframe) of the HTML document. 16. The computer implemented method of claim 14, wherein the document viewer is a web browser. 17. A computerized system comprising:
a content handler of an embedded document receiving untrusted content from a containing document, wherein the embedded document is in the containing document; a content processor of the embedded document rendering the received untrusted content in the embedded document; a document viewer enforcing a sandbox policy on the embedded document such that the rendered untrusted content is restricted from accessing at least some data associated with the containing document. 18. The computerized system of claim 17, further comprising a content handler of the containing document receiving additional untrusted content from the content handler of the embedded document and forwarding the received additional untrusted content to a server. 19. The computerized system of claim 17, further comprising the content processor extracting the untrusted content from a message comprising a string, the string corresponding to the untrusted content. 20. The computerized system of claim 17, further comprising a content handler of the containing document receiving the untrusted content from a server and forwarding the received additional untrusted content to the embedded document, wherein the untrusted content is not rendered on the containing document. | 2,100 |
5,466 | 5,466 | 14,881,600 | 2,113 | Aircraft communications networks, network devices, and methods of determining compatibility on an aircraft communications network are disclosed herein. The aircraft communications network includes, but is not limited to, a communications bus, a first network device, and a second network device. The first network device is communicatively coupled with the communications bus and is configured to publish on the communications bus a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network. The second network device is communicatively coupled with the communications bus and is configured to receive the configuration manifest from the first network device over the communications bus, compare the configuration manifest to a second hardware and software profile that describes the second network device, and disable outputs of the second network device in response to detecting that the configuration manifest differs from the second hardware and software profile. | 1. An aircraft communications network comprising:
a communications bus; a first network device communicatively coupled with the communications bus, the first network device configured to publish on the communications bus a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network; and a second network device communicatively coupled with the communications bus, the second network device configured to: receive the configuration manifest from the first network device over the communications bus; compare the configuration manifest to a second hardware and software profile that describes the second network device; and disable outputs of the second network device in response to detecting a difference between the configuration manifest and the second hardware and software profile. 2. The aircraft communications network of claim 1, wherein the second network device is further configured to determine that the second network device is incompatible with the aircraft communications network in response to detecting the difference between the configuration manifest and the second hardware and software profile. 3. The aircraft communications network of claim 2, wherein the second network device is further configured to generate a configuration failure alert on the communications bus in response to determining that the second network device is incompatible with the aircraft communications network. 4. The aircraft communications network of claim 1, further comprising a sensor communicatively coupled with the second network device, and wherein the second hardware and software profile describes both the second network device and the sensor. 5. The aircraft communications network of claim 1, wherein the first network device is further configured to store the configuration manifest. 6. The aircraft communications network of claim 5, wherein the second network device is further configured to store the configuration manifest. 7. The aircraft communications network of claim 6, wherein the first network device is further configured to:
receive the configuration manifest from the second network device across the communications bus; compare the configuration manifest to a first hardware and software profile that describes the first network device; and disable outputs of the first network device in response to the configuration manifest differing from the first hardware and software profile. 8. The aircraft communications network of claim 7, wherein the first network device is further configured to compare the configuration manifest stored on the first network device with the first hardware and software profile. 9. The aircraft communications network of claim 8, wherein the second network device is further configured to compare the configuration manifest stored on the second network device with the second hardware and software profile. 10. The aircraft communications network of claim 6, wherein the configuration manifest is stored solely on at least one of the first network device and the second network device. 11. A network device for an aircraft communications network, the network device comprising:
a computer hardware component including an input/output (I/O) portion configured for connecting to an aircraft communications bus; and a software component loaded into the computer hardware component, wherein the computer hardware component and the software component cooperate to configure the network device to:
receive a configuration manifest through the I/O portion;
compare the configuration manifest to a hardware and software profile that describes the computer hardware component and the software component; and disable outputs from the network device through the I/O portion in response to detecting that the configuration manifest differs from the hardware and software profile. 12. The network device of claim 11, wherein the network device is further configured to determine that the network device is incompatible with the aircraft communications network in response to detecting that the configuration manifest differs from the hardware and software profile. 13. The network device of claim 12, wherein the network device is further configured to generate a configuration failure alert at the I/O portion in response to determining that the network device is incompatible with the aircraft communications network. 14. The network device of claim 11, wherein the computer hardware component further includes a sensor input portion, and wherein hardware and software profile describes a sensor coupled with the sensor input portion, the computer hardware component, and the software component. 15. The network device of claim 11, wherein the network device is further configured to store the configuration manifest and to publish the configuration manifest at the I/O portion. 16. A method of determining compatibility of a network device with an aircraft communications network, the method comprising:
publishing on a communications network, by a first network device, a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network; receiving, at a second network device, the configuration manifest; and comparing, at the second network device, the configuration manifest to a second hardware and software profile that describes the second network device. 17. The method of claim 16, further comprising disabling outputs of the second network device in response to determining that the configuration manifest differs from the second hardware and software profile. 18. The method of claim 16, further comprising generating a configuration failure alert on the aircraft communications network in response to determining that the configuration manifest differs from the second hardware and software profile. 19. The method of claim 16, further comprising retrieving the configuration manifest from an electronic storage device on the first network device. 20. The method of claim 16, further comprising:
retrieving the configuration manifest from an electronic storage device on the second network device; publishing on the communications network, by the second network device, the configuration manifest; receiving, at the first network device, the configuration manifest; and comparing, at the first network device, the configuration manifest with a first hardware and software profile that describes the first network device. | Aircraft communications networks, network devices, and methods of determining compatibility on an aircraft communications network are disclosed herein. The aircraft communications network includes, but is not limited to, a communications bus, a first network device, and a second network device. The first network device is communicatively coupled with the communications bus and is configured to publish on the communications bus a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network. The second network device is communicatively coupled with the communications bus and is configured to receive the configuration manifest from the first network device over the communications bus, compare the configuration manifest to a second hardware and software profile that describes the second network device, and disable outputs of the second network device in response to detecting that the configuration manifest differs from the second hardware and software profile.1. An aircraft communications network comprising:
a communications bus; a first network device communicatively coupled with the communications bus, the first network device configured to publish on the communications bus a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network; and a second network device communicatively coupled with the communications bus, the second network device configured to: receive the configuration manifest from the first network device over the communications bus; compare the configuration manifest to a second hardware and software profile that describes the second network device; and disable outputs of the second network device in response to detecting a difference between the configuration manifest and the second hardware and software profile. 2. The aircraft communications network of claim 1, wherein the second network device is further configured to determine that the second network device is incompatible with the aircraft communications network in response to detecting the difference between the configuration manifest and the second hardware and software profile. 3. The aircraft communications network of claim 2, wherein the second network device is further configured to generate a configuration failure alert on the communications bus in response to determining that the second network device is incompatible with the aircraft communications network. 4. The aircraft communications network of claim 1, further comprising a sensor communicatively coupled with the second network device, and wherein the second hardware and software profile describes both the second network device and the sensor. 5. The aircraft communications network of claim 1, wherein the first network device is further configured to store the configuration manifest. 6. The aircraft communications network of claim 5, wherein the second network device is further configured to store the configuration manifest. 7. The aircraft communications network of claim 6, wherein the first network device is further configured to:
receive the configuration manifest from the second network device across the communications bus; compare the configuration manifest to a first hardware and software profile that describes the first network device; and disable outputs of the first network device in response to the configuration manifest differing from the first hardware and software profile. 8. The aircraft communications network of claim 7, wherein the first network device is further configured to compare the configuration manifest stored on the first network device with the first hardware and software profile. 9. The aircraft communications network of claim 8, wherein the second network device is further configured to compare the configuration manifest stored on the second network device with the second hardware and software profile. 10. The aircraft communications network of claim 6, wherein the configuration manifest is stored solely on at least one of the first network device and the second network device. 11. A network device for an aircraft communications network, the network device comprising:
a computer hardware component including an input/output (I/O) portion configured for connecting to an aircraft communications bus; and a software component loaded into the computer hardware component, wherein the computer hardware component and the software component cooperate to configure the network device to:
receive a configuration manifest through the I/O portion;
compare the configuration manifest to a hardware and software profile that describes the computer hardware component and the software component; and disable outputs from the network device through the I/O portion in response to detecting that the configuration manifest differs from the hardware and software profile. 12. The network device of claim 11, wherein the network device is further configured to determine that the network device is incompatible with the aircraft communications network in response to detecting that the configuration manifest differs from the hardware and software profile. 13. The network device of claim 12, wherein the network device is further configured to generate a configuration failure alert at the I/O portion in response to determining that the network device is incompatible with the aircraft communications network. 14. The network device of claim 11, wherein the computer hardware component further includes a sensor input portion, and wherein hardware and software profile describes a sensor coupled with the sensor input portion, the computer hardware component, and the software component. 15. The network device of claim 11, wherein the network device is further configured to store the configuration manifest and to publish the configuration manifest at the I/O portion. 16. A method of determining compatibility of a network device with an aircraft communications network, the method comprising:
publishing on a communications network, by a first network device, a configuration manifest that describes a compatible configuration of hardware and software for the aircraft communications network; receiving, at a second network device, the configuration manifest; and comparing, at the second network device, the configuration manifest to a second hardware and software profile that describes the second network device. 17. The method of claim 16, further comprising disabling outputs of the second network device in response to determining that the configuration manifest differs from the second hardware and software profile. 18. The method of claim 16, further comprising generating a configuration failure alert on the aircraft communications network in response to determining that the configuration manifest differs from the second hardware and software profile. 19. The method of claim 16, further comprising retrieving the configuration manifest from an electronic storage device on the first network device. 20. The method of claim 16, further comprising:
retrieving the configuration manifest from an electronic storage device on the second network device; publishing on the communications network, by the second network device, the configuration manifest; receiving, at the first network device, the configuration manifest; and comparing, at the first network device, the configuration manifest with a first hardware and software profile that describes the first network device. | 2,100 |
5,467 | 5,467 | 12,763,003 | 2,136 | A data storage apparatus and associated method involving a memory with a plurality of storage elements defining an associated set of stored data, and memory control logic that, responsive to a request to store first data in a first storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data. | 1. A data storage apparatus, comprising:
a memory having a plurality of storage elements defining an associated set of stored data; and memory control logic that, responsive to a request to store first data in a first storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data. 2. The data storage apparatus of claim 1 wherein the memory control logic by computing the first redundancy data does not alter other redundancy data stored in one of the plurality of storage elements and for the associated set of stored data non-inclusive of the first data. 3. The data storage apparatus of claim 1 wherein the memory control logic, responsive to a request to store second data in a second storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the first data and the second data, and subsequently concurrently stores the first data and the second data and the second redundancy data to the memory. 4. The data storage apparatus of claim 1 wherein the memory control logic, responsive to a request to store a data stripe across the plurality of storage elements, computes without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the data stripe, and subsequently concurrently stores the data stripe and the second redundancy data to the memory. 5. The data storage apparatus of claim 1 comprising a buffer to which the first data and the first redundancy data are stored before concurrently being flushed from the buffer to the memory. 6. The data storage apparatus of claim 3 comprising a buffer to which the first data and the second data and the second redundancy data are stored before concurrently being flushed from the buffer to the memory. 7. The data storage apparatus of claim 6 wherein the buffer comprises a nonvolatile memory. 8. The data storage apparatus of claim 1 wherein the first data comprises writeback data. 9. The data storage apparatus of claim 4 wherein the memory is characterized as a multiple channel solid state storage device. 10. The data storage apparatus of claim 9 wherein the memory stores data via one of at least fifteen channels. 11. The data storage apparatus of claim 1 wherein the request to store first data is received as a host command via a communication link between the host and the data storage apparatus, the memory control logic computing the first redundancy data entirely under a top level control of the data storage apparatus with no input from the host or any other device via the communication link. 12. The data storage apparatus of claim 11 wherein the communication link comprises a network. 13. A method comprising:
receiving a host command by a data storage device corresponding to storing data in a first storage element of a memory having a plurality of storage elements defining an associated set of stored data; in response to the receiving step, computing without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data. 14. The method of claim 13 wherein the computing step is characterized by not altering other redundancy data stored in one of the plurality of storage elements and for the associated set of stored data non-inclusive of the first data. 15. The method of claim 13 wherein the receiving step is characterized by receiving a host command corresponding to storing data in a second storage element of the plurality of storage elements, the method further comprising
in response to the receiving step, computing without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the first data and the second data; and
after the computing steps, concurrently storing the first data and the second data and the second redundancy data to the memory. 16. The method of claim 13 wherein the receiving step is characterized by receiving a host command corresponding to storing a data stripe across the plurality of storage elements, the method further comprising:
in response to the receiving step, computing without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the data stripe; and
after the computing steps, concurrently storing the data stripe and the second redundancy data to the memory. 17. The method of claim 16 wherein the second redundancy data is characterized as parity data. 18. The method of claim 16 wherein before the storing step, the computing steps are characterized by buffering the data stripe and the second redundancy data in a nonvolatile memory. 19. The method of claim 16 wherein the receiving step is characterized by the host command being received via a host communication link, and the computing steps being entirely self executed by the data storage device in response to the host command with no other input from the host or any other device via the host communication link. 20. A data storage apparatus, comprising:
a solid state memory (SSM) that stores a first data via a first channel to be part of an associated set of stored data; and writeback logic appending to the first channel, without storing to the SSM, first updated data corresponding to an update of the first data, and appending to a different channel, without storing to the SSM, first redundancy data for the associated set of stored data inclusive of the first updated data. | A data storage apparatus and associated method involving a memory with a plurality of storage elements defining an associated set of stored data, and memory control logic that, responsive to a request to store first data in a first storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data.1. A data storage apparatus, comprising:
a memory having a plurality of storage elements defining an associated set of stored data; and memory control logic that, responsive to a request to store first data in a first storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data. 2. The data storage apparatus of claim 1 wherein the memory control logic by computing the first redundancy data does not alter other redundancy data stored in one of the plurality of storage elements and for the associated set of stored data non-inclusive of the first data. 3. The data storage apparatus of claim 1 wherein the memory control logic, responsive to a request to store second data in a second storage element of the plurality of storage elements, computes without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the first data and the second data, and subsequently concurrently stores the first data and the second data and the second redundancy data to the memory. 4. The data storage apparatus of claim 1 wherein the memory control logic, responsive to a request to store a data stripe across the plurality of storage elements, computes without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the data stripe, and subsequently concurrently stores the data stripe and the second redundancy data to the memory. 5. The data storage apparatus of claim 1 comprising a buffer to which the first data and the first redundancy data are stored before concurrently being flushed from the buffer to the memory. 6. The data storage apparatus of claim 3 comprising a buffer to which the first data and the second data and the second redundancy data are stored before concurrently being flushed from the buffer to the memory. 7. The data storage apparatus of claim 6 wherein the buffer comprises a nonvolatile memory. 8. The data storage apparatus of claim 1 wherein the first data comprises writeback data. 9. The data storage apparatus of claim 4 wherein the memory is characterized as a multiple channel solid state storage device. 10. The data storage apparatus of claim 9 wherein the memory stores data via one of at least fifteen channels. 11. The data storage apparatus of claim 1 wherein the request to store first data is received as a host command via a communication link between the host and the data storage apparatus, the memory control logic computing the first redundancy data entirely under a top level control of the data storage apparatus with no input from the host or any other device via the communication link. 12. The data storage apparatus of claim 11 wherein the communication link comprises a network. 13. A method comprising:
receiving a host command by a data storage device corresponding to storing data in a first storage element of a memory having a plurality of storage elements defining an associated set of stored data; in response to the receiving step, computing without storing to any of the plurality of storage elements first redundancy data for the associated set of stored data inclusive of the first data. 14. The method of claim 13 wherein the computing step is characterized by not altering other redundancy data stored in one of the plurality of storage elements and for the associated set of stored data non-inclusive of the first data. 15. The method of claim 13 wherein the receiving step is characterized by receiving a host command corresponding to storing data in a second storage element of the plurality of storage elements, the method further comprising
in response to the receiving step, computing without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the first data and the second data; and
after the computing steps, concurrently storing the first data and the second data and the second redundancy data to the memory. 16. The method of claim 13 wherein the receiving step is characterized by receiving a host command corresponding to storing a data stripe across the plurality of storage elements, the method further comprising:
in response to the receiving step, computing without storing to any of the plurality of storage elements second redundancy data for the associated set of stored data inclusive of the data stripe; and
after the computing steps, concurrently storing the data stripe and the second redundancy data to the memory. 17. The method of claim 16 wherein the second redundancy data is characterized as parity data. 18. The method of claim 16 wherein before the storing step, the computing steps are characterized by buffering the data stripe and the second redundancy data in a nonvolatile memory. 19. The method of claim 16 wherein the receiving step is characterized by the host command being received via a host communication link, and the computing steps being entirely self executed by the data storage device in response to the host command with no other input from the host or any other device via the host communication link. 20. A data storage apparatus, comprising:
a solid state memory (SSM) that stores a first data via a first channel to be part of an associated set of stored data; and writeback logic appending to the first channel, without storing to the SSM, first updated data corresponding to an update of the first data, and appending to a different channel, without storing to the SSM, first redundancy data for the associated set of stored data inclusive of the first updated data. | 2,100 |
5,468 | 5,468 | 15,345,777 | 2,191 | Novel tools and techniques are provided for implementing green software applications and/or certifying software applications with a green applications efficiency (“GAE”) rating. Implementing green software applications might include performing performance tests of a software application, measuring power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests, generating a power consumption profile for the software application based on the measure power consumption, and tuning the software application such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. Certifying software applications might include calculating an efficiency rating based on measured or calculated hardware power consumption, calculating the GAE rating for the software application, and certifying the software application with the GAE rating. | 1. A method for implementing green software applications, the method comprising:
performing, with a computer, one or more performance tests of a software application; evaluating, with the computer, a performance of the software application during the one or more performance tests; measuring, with the computer, power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests; generating, with the computer, a power consumption profile for the software application, based on the measured power consumption; and tuning the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 2. The method of claim 1, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 3. The method of claim 1, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 4. The method of claim 1, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 5. The method of claim 1, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 6. The method of claim 1, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 7. The method of claim 1, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. 8. A system for implementing green software applications, the system comprising:
a processor; and a non-transitory computer readable medium having encoded thereon instructions executable by the processor to:
perform one or more performance tests of a software application;
evaluate a performance of the software application during the one or more performance tests;
measure power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests;
generate a power consumption profile for the software application, based on the measured power consumption; and
tune the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 9. The system of claim 8, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 10. The system of claim 8, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 11. The system of claim 8, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 12. The system of claim 8, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 13. The system of claim 8, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 14. The system of claim 8, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. 15. An apparatus, comprising:
a non-transitory computer readable medium having encoded thereon a set of instructions executable by a computer to:
perform one or more performance tests of a software application;
evaluate a performance of the software application during the one or more performance tests;
measure power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests;
generate a power consumption profile for the software application, based on the measured power consumption; and
tune the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 16. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 17. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 18. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 19. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 20. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 21. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. | Novel tools and techniques are provided for implementing green software applications and/or certifying software applications with a green applications efficiency (“GAE”) rating. Implementing green software applications might include performing performance tests of a software application, measuring power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests, generating a power consumption profile for the software application based on the measure power consumption, and tuning the software application such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. Certifying software applications might include calculating an efficiency rating based on measured or calculated hardware power consumption, calculating the GAE rating for the software application, and certifying the software application with the GAE rating.1. A method for implementing green software applications, the method comprising:
performing, with a computer, one or more performance tests of a software application; evaluating, with the computer, a performance of the software application during the one or more performance tests; measuring, with the computer, power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests; generating, with the computer, a power consumption profile for the software application, based on the measured power consumption; and tuning the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 2. The method of claim 1, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 3. The method of claim 1, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 4. The method of claim 1, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 5. The method of claim 1, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 6. The method of claim 1, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 7. The method of claim 1, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. 8. A system for implementing green software applications, the system comprising:
a processor; and a non-transitory computer readable medium having encoded thereon instructions executable by the processor to:
perform one or more performance tests of a software application;
evaluate a performance of the software application during the one or more performance tests;
measure power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests;
generate a power consumption profile for the software application, based on the measured power consumption; and
tune the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 9. The system of claim 8, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 10. The system of claim 8, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 11. The system of claim 8, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 12. The system of claim 8, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 13. The system of claim 8, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 14. The system of claim 8, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. 15. An apparatus, comprising:
a non-transitory computer readable medium having encoded thereon a set of instructions executable by a computer to:
perform one or more performance tests of a software application;
evaluate a performance of the software application during the one or more performance tests;
measure power consumption of one or more hardware components, in response to execution of the software application during the one or more performance tests;
generate a power consumption profile for the software application, based on the measured power consumption; and
tune the software application, such that power consumption of the one or more hardware components matches a power load caused by execution of the software application, based at least in part on the power consumption profile for the software application. 16. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to quickly release resources when the resources are no longer determined to be required. 17. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to contain efficient computational logic. 18. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to minimize or eliminate at least one of large or long-lived objects in memory. 19. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to minimize storage of large amounts of data. 20. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to reduce heavy data transfer over a network. 21. The apparatus of claim 15, wherein tuning the software application comprises tuning the software application to closely match hardware and software characteristics. | 2,100 |
5,469 | 5,469 | 15,518,218 | 2,185 | A method for restricting write access to a non-volatile memory. The method includes receiving a request to write to a protected location in the non-volatile memory and determining whether the protected location is in a write-protected state. If the protected location is not in a write-protected state, the method includes writing data indicated by the request to the protected location. If the protected location is in a write-protected state, the method includes rejecting the request. The protected location stores a validation key to validate the contents of another portion of the non-volatile memory. | 1. A method for restricting write access to a non-volatile memory, the method comprising:
receiving, by a media controller associated with the non-volatile memory, a request to write to a protected location in the non-volatile memory; determining whether the protected location is in a write-protected state; if the protected location is not in a write-protected state, writing data indicated by the request to the protected location; if the protected location is in a write-protected state, rejecting the request; wherein the protected location stores a validation key to validate the contents of another portion of the non-volatile memory. 2. The method of claim 1 wherein the validation key comprises a checksum to validate the contents of the other portion. 3. The method of claim 2 further comprising:
computing a checksum for the other portion of the non-volatile memory;
comparing the computed checksum to the validation key; and
validating the portion of the non-volatile memory if the computed checksum matches the validation key. 4. The method of claim 1 further comprising:
redirecting read and write requests for an address or address range corresponding to the protected location to the media controller; and
passing read and write requests to addresses other than the address or address range corresponding to the protected location directly to the non-volatile memory. 5. The method of claim 1 wherein determining whether the protected location is in a write-protected state comprises analyzing, in a register of the media controller, whether a metadata field of the data stored at the protected location indicates that the protected location is in a write-protected state. 6. A system for restricting write access to a non-volatile memory, the system comprising:
a processing unit; a memory module coupled to the processing unit, the memory module comprising;
a non-volatile memory; and
a media controller coupled to the non-volatile memory and the processing unit, the media controller comprising write logic to:
receive a request to write to a protected location in the non-volatile memory;
if the protected location is not in a write-protected state, write data indicated by the request to the protected location; and
if the protected location is in a write-protected state, reject the request;
wherein the protected location stores a validation key to validate the contents of another portion of the non-volatile memory. 7. The system of claim 6 wherein the validation key comprises a checksum to validate the contents of the other portion. 8. The system of claim 7 wherein the processing unit is to:
compute a checksum for the other portion of the non-volatile memory;
compare the computed checksum to the validation key; and
validate the portion of the non-volatile memory if the computed checksum matches the validation key. 9. The system of claim 6 wherein the media controller is further to:
redirect read and write requests for an address or address range corresponding to the protected location to the write logic; and
pass read and write requests to addresses other than the address or address range corresponding to the protected location directly to the non-volatile memory. 10. The system of claim 6 wherein the media controller comprises a register, the media controller further to analyze, in the register, whether a metadata field of the data stored at the protected location indicates that the protected location is in a write-protected state. 11. The system of claim 6 wherein a portion of the non-volatile memory is not write restricted and is to be accessed by the processing unit as normal non-volatile memory. 12. A method for restricting write access to a non-volatile memory and maintaining a log buffer, the method comprising:
receiving, by a media controller associated with the non-volatile memory, a request to write to a protected location in the non-volatile memory, the protected location comprising a base address and a next address; if the request is to write to the protected location and the protected location is in a write-protected state, rejecting the request; if the request is to write to the next address, writing data indicated by the request to an address indicated by a write next pointer and incrementing the write next pointer. 13. The method of claim 12 further comprising:
receiving, by the media controller, a request to read from the protected location;
if the request is to read from the base address and the base address is in a write-protected state, returning data from the base address and setting a read next pointer to a second address in the log buffer;
if the request is to read from the next address and the address pointed to by the read next pointer is in a write-protected state, returning data from the address pointed to by the read next pointer and incrementing the read next pointer. 14. The method of claim 13 wherein if the request is to read from the base address and the base address is not in a write-protected state or if the request is to read from the next address and the address pointed to by the read next pointer is not in a write-protected state, the method further comprises returning null data. 15. The method of claim 13 wherein if the request is to read from the next address and the read next pointer points to the same address as the write next pointer, returning null data. | A method for restricting write access to a non-volatile memory. The method includes receiving a request to write to a protected location in the non-volatile memory and determining whether the protected location is in a write-protected state. If the protected location is not in a write-protected state, the method includes writing data indicated by the request to the protected location. If the protected location is in a write-protected state, the method includes rejecting the request. The protected location stores a validation key to validate the contents of another portion of the non-volatile memory.1. A method for restricting write access to a non-volatile memory, the method comprising:
receiving, by a media controller associated with the non-volatile memory, a request to write to a protected location in the non-volatile memory; determining whether the protected location is in a write-protected state; if the protected location is not in a write-protected state, writing data indicated by the request to the protected location; if the protected location is in a write-protected state, rejecting the request; wherein the protected location stores a validation key to validate the contents of another portion of the non-volatile memory. 2. The method of claim 1 wherein the validation key comprises a checksum to validate the contents of the other portion. 3. The method of claim 2 further comprising:
computing a checksum for the other portion of the non-volatile memory;
comparing the computed checksum to the validation key; and
validating the portion of the non-volatile memory if the computed checksum matches the validation key. 4. The method of claim 1 further comprising:
redirecting read and write requests for an address or address range corresponding to the protected location to the media controller; and
passing read and write requests to addresses other than the address or address range corresponding to the protected location directly to the non-volatile memory. 5. The method of claim 1 wherein determining whether the protected location is in a write-protected state comprises analyzing, in a register of the media controller, whether a metadata field of the data stored at the protected location indicates that the protected location is in a write-protected state. 6. A system for restricting write access to a non-volatile memory, the system comprising:
a processing unit; a memory module coupled to the processing unit, the memory module comprising;
a non-volatile memory; and
a media controller coupled to the non-volatile memory and the processing unit, the media controller comprising write logic to:
receive a request to write to a protected location in the non-volatile memory;
if the protected location is not in a write-protected state, write data indicated by the request to the protected location; and
if the protected location is in a write-protected state, reject the request;
wherein the protected location stores a validation key to validate the contents of another portion of the non-volatile memory. 7. The system of claim 6 wherein the validation key comprises a checksum to validate the contents of the other portion. 8. The system of claim 7 wherein the processing unit is to:
compute a checksum for the other portion of the non-volatile memory;
compare the computed checksum to the validation key; and
validate the portion of the non-volatile memory if the computed checksum matches the validation key. 9. The system of claim 6 wherein the media controller is further to:
redirect read and write requests for an address or address range corresponding to the protected location to the write logic; and
pass read and write requests to addresses other than the address or address range corresponding to the protected location directly to the non-volatile memory. 10. The system of claim 6 wherein the media controller comprises a register, the media controller further to analyze, in the register, whether a metadata field of the data stored at the protected location indicates that the protected location is in a write-protected state. 11. The system of claim 6 wherein a portion of the non-volatile memory is not write restricted and is to be accessed by the processing unit as normal non-volatile memory. 12. A method for restricting write access to a non-volatile memory and maintaining a log buffer, the method comprising:
receiving, by a media controller associated with the non-volatile memory, a request to write to a protected location in the non-volatile memory, the protected location comprising a base address and a next address; if the request is to write to the protected location and the protected location is in a write-protected state, rejecting the request; if the request is to write to the next address, writing data indicated by the request to an address indicated by a write next pointer and incrementing the write next pointer. 13. The method of claim 12 further comprising:
receiving, by the media controller, a request to read from the protected location;
if the request is to read from the base address and the base address is in a write-protected state, returning data from the base address and setting a read next pointer to a second address in the log buffer;
if the request is to read from the next address and the address pointed to by the read next pointer is in a write-protected state, returning data from the address pointed to by the read next pointer and incrementing the read next pointer. 14. The method of claim 13 wherein if the request is to read from the base address and the base address is not in a write-protected state or if the request is to read from the next address and the address pointed to by the read next pointer is not in a write-protected state, the method further comprises returning null data. 15. The method of claim 13 wherein if the request is to read from the next address and the read next pointer points to the same address as the write next pointer, returning null data. | 2,100 |
5,470 | 5,470 | 14,099,820 | 2,135 | A storage controller controlling a plurality of storage media devices receives one or more commands from a queue representing a load, identifies a minimum performance level required for the load, identifies a first set of weighted storage regions having a slow access rate across the plurality of storage media devices and a second set of weighted storage regions having a fast access rate in the plurality of storage media devices, identifies a subset of storage regions within the first set of weighted storage regions having a slow access rate that satisfies the identified minimum performance level, and distributes the load based on the identified minimum performance level by utilizing only the subset of storage regions within the first set of weighted storage regions having the slow access rate and holding the second storage region having the fast access rate in reserve. | 1. A storage system comprising:
a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate; a storage controller controlling said plurality of storage media devices, said storage controller: receives one or more commands from a queue representing a load; identifies a minimum performance level required for said load; identifies a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identifies a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distributes said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. 2. The storage system of claim 1, wherein said storage controller:
receives one or more additional commands from said queue representing an additional load; identifies an additional minimum performance level required for said additional load; identifies a third set of weighted storage regions having said slow access rate across said plurality of storage media devices and a fourth set of weighted storage regions having said fast access rate in said plurality of storage media devices; and distributes said load based on targeting said identified minimum performance level by utilizing a mixture of subsets of storage regions within said third set of weighted storage regions having said slow access rate and said fourth storage region having said fast access rate. 3. The storage system of claim 1, wherein said storage media devices are any of, or a combination of, the following: solid-state drive, rotational hard disk drive, hybrid disk drive, or PCI-Express slot disk drive. 4. The storage system of claim 1, wherein said storage media devices are part of a storage area network (SAN). 5. The storage system of claim 1, wherein said storage media devices are part of a network attached storage (NAS) device. 6. The storage system of claim 1, wherein at least one command corresponds to a read request. 7. The storage system of claim 1, wherein at least one command corresponds to a write request. 8. A method as implemented in a storage system comprising a storage system comprising a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate, a storage controller controlling said plurality of storage media devices, said method comprising:
receiving one or more commands from a queue representing a load; identifying a minimum performance level required for said load; identifying a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identifying a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distributing said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. 9. The method of claim 8, wherein said method further comprising:
receiving one or more additional commands from said queue representing an additional load; identifying an additional minimum performance level required for said additional load; identifying a third set of weighted storage regions having said slow access rate across said plurality of storage media devices and a fourth set of weighted storage regions having said fast access rate in said plurality of storage media devices; and distributing said load based on targeting said identified minimum performance level by utilizing a mixture of subsets of storage regions within said third set of weighted storage regions having said slow access rate and said fourth storage region having said fast access rate. 10. The method of claim 8, wherein said storage media devices are any of, or a combination of, the following: solid-state drive, rotational hard disk drive, hybrid disk drive, or PCI-Express slot disk drive. 11. The method of claim 8, wherein said storage media devices are part of a storage area network (SAN). 12. The method of claim 8, wherein said storage media devices are part of a network attached storage (NAS) device. 13. The method of claim 8, wherein at least one command corresponds to a read request. 14. The method of claim 8, wherein at least one command corresponds to a write request. 15. A non-transitory, computer accessible memory medium storing program instructions for performing a method as implemented in a storage system comprising a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate, a storage controller controlling said plurality of storage media devices, wherein the program instructions are executable by a processor to:
receive one or more commands from a queue representing a load; identify a minimum performance level required for said load; identify a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identify a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distribute said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. | A storage controller controlling a plurality of storage media devices receives one or more commands from a queue representing a load, identifies a minimum performance level required for the load, identifies a first set of weighted storage regions having a slow access rate across the plurality of storage media devices and a second set of weighted storage regions having a fast access rate in the plurality of storage media devices, identifies a subset of storage regions within the first set of weighted storage regions having a slow access rate that satisfies the identified minimum performance level, and distributes the load based on the identified minimum performance level by utilizing only the subset of storage regions within the first set of weighted storage regions having the slow access rate and holding the second storage region having the fast access rate in reserve.1. A storage system comprising:
a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate; a storage controller controlling said plurality of storage media devices, said storage controller: receives one or more commands from a queue representing a load; identifies a minimum performance level required for said load; identifies a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identifies a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distributes said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. 2. The storage system of claim 1, wherein said storage controller:
receives one or more additional commands from said queue representing an additional load; identifies an additional minimum performance level required for said additional load; identifies a third set of weighted storage regions having said slow access rate across said plurality of storage media devices and a fourth set of weighted storage regions having said fast access rate in said plurality of storage media devices; and distributes said load based on targeting said identified minimum performance level by utilizing a mixture of subsets of storage regions within said third set of weighted storage regions having said slow access rate and said fourth storage region having said fast access rate. 3. The storage system of claim 1, wherein said storage media devices are any of, or a combination of, the following: solid-state drive, rotational hard disk drive, hybrid disk drive, or PCI-Express slot disk drive. 4. The storage system of claim 1, wherein said storage media devices are part of a storage area network (SAN). 5. The storage system of claim 1, wherein said storage media devices are part of a network attached storage (NAS) device. 6. The storage system of claim 1, wherein at least one command corresponds to a read request. 7. The storage system of claim 1, wherein at least one command corresponds to a write request. 8. A method as implemented in a storage system comprising a storage system comprising a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate, a storage controller controlling said plurality of storage media devices, said method comprising:
receiving one or more commands from a queue representing a load; identifying a minimum performance level required for said load; identifying a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identifying a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distributing said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. 9. The method of claim 8, wherein said method further comprising:
receiving one or more additional commands from said queue representing an additional load; identifying an additional minimum performance level required for said additional load; identifying a third set of weighted storage regions having said slow access rate across said plurality of storage media devices and a fourth set of weighted storage regions having said fast access rate in said plurality of storage media devices; and distributing said load based on targeting said identified minimum performance level by utilizing a mixture of subsets of storage regions within said third set of weighted storage regions having said slow access rate and said fourth storage region having said fast access rate. 10. The method of claim 8, wherein said storage media devices are any of, or a combination of, the following: solid-state drive, rotational hard disk drive, hybrid disk drive, or PCI-Express slot disk drive. 11. The method of claim 8, wherein said storage media devices are part of a storage area network (SAN). 12. The method of claim 8, wherein said storage media devices are part of a network attached storage (NAS) device. 13. The method of claim 8, wherein at least one command corresponds to a read request. 14. The method of claim 8, wherein at least one command corresponds to a write request. 15. A non-transitory, computer accessible memory medium storing program instructions for performing a method as implemented in a storage system comprising a plurality of storage media devices, each storage media device comprising one or more addressable storage regions, each region assigned a weight based on at least a fast or slow access rate, where regions having fast access rate are weighted differently than regions having slow access rate, a storage controller controlling said plurality of storage media devices, wherein the program instructions are executable by a processor to:
receive one or more commands from a queue representing a load; identify a minimum performance level required for said load; identify a first set of weighted storage regions having a slow access rate across said plurality of storage media devices and a second set of weighted storage regions having a fast access rate in said plurality of storage media devices; identify a subset of storage regions within said first set of weighted storage regions having a slow access rate that satisfies said identified minimum performance level; and distribute said load based on said identified minimum performance level by utilizing only said subset of storage regions within said first set of weighted storage regions having said slow access rate and holding said second storage region having said fast access rate in reserve. | 2,100 |
5,471 | 5,471 | 15,336,661 | 2,175 | On a computing device, an overview mode is provided to present overview windows of all applications currently running on the computing device. When one or more applications are running in a windowed mode, a first overview window is generated for each of the one or more applications running in the windowed mode; when one or more applications are running in a full-screen mode, a second overview window is generated for each of the one or more applications running in the full-screen mode. The one or more first overview windows in the first space can be arranged in one or more rows in a first overview space, and the one or more second overview windows in the second space in a stack in a second overview space. The arranged overview windows may then be displayed in the overview mode of the computing device. | 1. A computer-implemented method comprising:
receiving a first user selection of a user interface element corresponding to an overview mode of a computing device; determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode; when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
providing the one or more first overview windows in a flat arrangement; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in a full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stacked arrangement; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space. 2. The method of claim 1, wherein the user interface element corresponding to an overview mode is an overview button. 3. The method of claim 1, wherein the one or more first overview windows in the first overview space are arranged in a most recently used order in one or more rows, each of the one or more first overview windows having a normalized height and a same aspect ratio as its corresponding application running in the windowed mode. 4. The method of claim 1, wherein the one or more second overview windows in the second overview space are arranged in a most recently used order in a stack. 5. The method of claim 1, further comprising:
receiving a second user selection of an overview window for moving from the second overview space to the first overview space in the overview mode; and in response to the second user selection, moving the selected overview window from the second overview space to the first overview space. 6. The method of claim 5, wherein an application running in the full-screen mode corresponding to the selected overview window transitions to the windowed mode after the moving of the selected overview window from the second overview space to the first overview space. 7. The method of claim 1, further comprising:
receiving a third user selection of an overview window from the first or the second overview space for activating an application corresponding to the selected overview window; and in response to the third user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 8. The method of claim 1, further comprising:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of the one or more applications running in the windowed mode to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; and arranging the one or more first overview windows with a normalized height in the number of rows. 9. The method of claim 8, wherein arranging the one or more first overview windows in the number of rows comprises determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row. 10. A non-transitory machine-readable medium including instructions stored thereon that, when executed by a computing device, cause the computing device to perform a method comprising:
receiving a first user selection of an overview button corresponding to an overview mode of a computing device; determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode; when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
providing the one or more first overview windows in a grid; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in the full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stack; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space. 11. The non-transitory machine-readable medium of claim 10, wherein the overview windows in the first and the second overview spaces are arranged in a most recently used order. 12. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
receiving a second user selection of an overview window from the first or the second overview space for activating an application the selected overview window; and in response to the second user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 13. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
receiving a third user selection of an overview window for moving from the first overview space to the second overview space in the overview mode; and in response to the third user selection, moving the selected overview window from the first overview space to the second overview space, wherein an application running in the windowed mode corresponding to the selected overview window transitions to the full-screen mode after the moving of the selected overview window. 14. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of one or more applications running in the windowed mode to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; and arranging the one or more first overview windows with a normalized height in the number of rows. 15. The non-transitory machine-readable medium of claim 14, wherein arranging the one or more first overview windows in the number of rows comprises determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row. 16. A system, comprising:
one or more processors; and a memory, the memory having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform a method comprising:
receiving a first user selection of an overview button corresponding to an overview mode of a computing device;
determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode;
when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
arranging the one or more first overview windows in a grid, each of the one or more first overview windows having has a normalized height and a same aspect ratio as a corresponding application running in the windowed mode; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in the full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stack; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space, the first and second overview windows respectively in the first and the second overview spaces provided in a most recently used order. 17. The system of claim 16, wherein the method further comprises:
receiving a second user selection of an overview window from the first or the second overview space for activating an application the selected overview window; and in response to the second user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 18. The system of claim 16, wherein the method further comprises:
receiving a third user selection of an overview window for moving from the first overview space to the second overview space in the overview mode; and in response to the third user selection, moving the selected overview window from the first overview space to the second overview space, wherein an application running in the windowed mode corresponding to the selected overview window transitions to the full-screen mode after the moving of the selected overview window. 19. The system of claim 16, wherein the method further comprises:
receiving a fourth user selection of an overview window for moving from the second overview space to the first overview space in the overview mode; and in response to the fourth user selection, moving the selected overview window from the second overview space to the overview first space, wherein an application running in the full-screen mode corresponding to the selected overview window transitions to the windowed mode after the moving of the selected overview window. 20. The system of claim 16, wherein the method further comprises:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of one or more windowed applications to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row; and arranging the one or more first overview windows with a normalized height in the number of rows. | On a computing device, an overview mode is provided to present overview windows of all applications currently running on the computing device. When one or more applications are running in a windowed mode, a first overview window is generated for each of the one or more applications running in the windowed mode; when one or more applications are running in a full-screen mode, a second overview window is generated for each of the one or more applications running in the full-screen mode. The one or more first overview windows in the first space can be arranged in one or more rows in a first overview space, and the one or more second overview windows in the second space in a stack in a second overview space. The arranged overview windows may then be displayed in the overview mode of the computing device.1. A computer-implemented method comprising:
receiving a first user selection of a user interface element corresponding to an overview mode of a computing device; determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode; when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
providing the one or more first overview windows in a flat arrangement; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in a full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stacked arrangement; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space. 2. The method of claim 1, wherein the user interface element corresponding to an overview mode is an overview button. 3. The method of claim 1, wherein the one or more first overview windows in the first overview space are arranged in a most recently used order in one or more rows, each of the one or more first overview windows having a normalized height and a same aspect ratio as its corresponding application running in the windowed mode. 4. The method of claim 1, wherein the one or more second overview windows in the second overview space are arranged in a most recently used order in a stack. 5. The method of claim 1, further comprising:
receiving a second user selection of an overview window for moving from the second overview space to the first overview space in the overview mode; and in response to the second user selection, moving the selected overview window from the second overview space to the first overview space. 6. The method of claim 5, wherein an application running in the full-screen mode corresponding to the selected overview window transitions to the windowed mode after the moving of the selected overview window from the second overview space to the first overview space. 7. The method of claim 1, further comprising:
receiving a third user selection of an overview window from the first or the second overview space for activating an application corresponding to the selected overview window; and in response to the third user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 8. The method of claim 1, further comprising:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of the one or more applications running in the windowed mode to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; and arranging the one or more first overview windows with a normalized height in the number of rows. 9. The method of claim 8, wherein arranging the one or more first overview windows in the number of rows comprises determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row. 10. A non-transitory machine-readable medium including instructions stored thereon that, when executed by a computing device, cause the computing device to perform a method comprising:
receiving a first user selection of an overview button corresponding to an overview mode of a computing device; determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode; when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
providing the one or more first overview windows in a grid; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in the full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stack; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space. 11. The non-transitory machine-readable medium of claim 10, wherein the overview windows in the first and the second overview spaces are arranged in a most recently used order. 12. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
receiving a second user selection of an overview window from the first or the second overview space for activating an application the selected overview window; and in response to the second user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 13. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
receiving a third user selection of an overview window for moving from the first overview space to the second overview space in the overview mode; and in response to the third user selection, moving the selected overview window from the first overview space to the second overview space, wherein an application running in the windowed mode corresponding to the selected overview window transitions to the full-screen mode after the moving of the selected overview window. 14. The non-transitory machine-readable medium of claim 10, wherein the method further comprises:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of one or more applications running in the windowed mode to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; and arranging the one or more first overview windows with a normalized height in the number of rows. 15. The non-transitory machine-readable medium of claim 14, wherein arranging the one or more first overview windows in the number of rows comprises determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row. 16. A system, comprising:
one or more processors; and a memory, the memory having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform a method comprising:
receiving a first user selection of an overview button corresponding to an overview mode of a computing device;
determining, in response to the first user selection, whether one or more applications are running in a windowed mode or a full-screen mode;
when it is determined that the one or more applications are running in the windowed mode:
generating a first overview window for each of the one or more applications;
arranging the one or more first overview windows in a grid, each of the one or more first overview windows having has a normalized height and a same aspect ratio as a corresponding application running in the windowed mode; and
providing, for display on the computing device in the overview mode, the one or more first overview windows in a first overview space; and
when it is determined that the one or more applications are running in the full-screen mode:
generating a second overview window for each of the one or more applications;
providing the one or more second overview windows in a stack; and
providing, for display on the computing device in the overview mode, the one or more second overview windows in a second overview space, the first and second overview windows respectively in the first and the second overview spaces provided in a most recently used order. 17. The system of claim 16, wherein the method further comprises:
receiving a second user selection of an overview window from the first or the second overview space for activating an application the selected overview window; and in response to the second user selection, exiting the overview mode and activating the application corresponding to the selected overview window to its original size. 18. The system of claim 16, wherein the method further comprises:
receiving a third user selection of an overview window for moving from the first overview space to the second overview space in the overview mode; and in response to the third user selection, moving the selected overview window from the first overview space to the second overview space, wherein an application running in the windowed mode corresponding to the selected overview window transitions to the full-screen mode after the moving of the selected overview window. 19. The system of claim 16, wherein the method further comprises:
receiving a fourth user selection of an overview window for moving from the second overview space to the first overview space in the overview mode; and in response to the fourth user selection, moving the selected overview window from the second overview space to the overview first space, wherein an application running in the full-screen mode corresponding to the selected overview window transitions to the windowed mode after the moving of the selected overview window. 20. The system of claim 16, wherein the method further comprises:
determining a height and a width of an overview area on a display of the computing device; determining a total available relative width as a function of a given number of rows based on the height and the width of the overview area; calculating a sum of relative widths of the one or more applications running in the windowed mode by normalizing each of one or more windowed applications to a unit height while maintaining its original aspect ratio; determining a number of rows based on the calculated sum of relative widths and the total available relative width; determining one or more split points in between rows of the one or more first overview windows such that the one or more first overview windows are evenly distributed among each row; and arranging the one or more first overview windows with a normalized height in the number of rows. | 2,100 |
5,472 | 5,472 | 14,481,392 | 2,165 | Mechanisms for operating a business rule management system are provided. The mechanisms access a text file describing one or more business processes, and bindings of a plurality of text chunks within the text file to a respective plurality of elements within the business rule management system. The mechanisms detect a change in a bound text chunk in the text file and modify the respective bound element within the business rule management system according to the detected change in the bound text chunk in the text file. | 1. A method, in a computing device implementing a binding engine, for updating elements of a business rule management system, the method comprising:
accessing, by the binding engine, a text file describing one or more business processes, generating, by the binding engine, bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detecting, by the binding engine, a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modifying, by the binding, an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 2. A method according to claim 1, further comprising, after detecting the change in the text chunk in the text file, validating the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 3. A method according to claim 1, wherein the elements within the business rule management system comprise a plurality of rules and, wherein modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file, comprises modifying a rule bound to the changed text chunk. 4. A method according to claim 1, further comprising triggering a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 5. A method according to claim 1, further comprising receiving a defined user input and providing access to the plurality of text chunks within the text file in response to the defined user input. 6. A business rule management system comprising a binding engine configured to:
access a text the describing one or more business processes, generate bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detect a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modify an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 7. A system according to claim 6, wherein the binding engine is further configured to, after detecting the change in the text chunk in the text file, validate the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 8. A system according to claim 6, wherein the elements within the business rule management system comprise a plurality of rules and the binding engine is configured to, when modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file, modify a rule bound to the changed text chunk. 9. A system according to claim 6, wherein the binding engine is further configured to trigger a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 10. A system according to claim 6, wherein the binding engine is further configured to receive a defined user input and provide access to the plurality of text chunks within the text file in response to the defined user input. 11. A computer program product on a non-transitory computer readable medium for operating a business rule management system, the product comprising instructions, which when executed by a computing device, cause the computing device to:
access a text file describing one or more business processes, generate bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detect a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modify an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 12. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to, after detecting the change in the text chunk in the text file, validate the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 13. A computer program product according to claim 11, wherein the elements within the business rule management system comprise a plurality of rules and modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file comprises modifying a rule bound to the changed text chunk. 14. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to trigger a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 15. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to receive a defined user input and provide access to the plurality of text chunks within the text file in response to the defined user input. 16. A method according to claim 1, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. 17. The method according to claim 1, wherein modifying the element bound to the changed text chunk is performed automatically without a human user, that submitted the change in the text chunk, being made aware of the modification to the element bound to the changed text chunk. 18. A system according to claim 6, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. 19. A system according to claim 6, wherein modifying the element bound to the changed text chunk is performed automatically without a human user, that submitted the change in the text chunk, being made aware of the modification to the element bound to the changed text chunk. 20. A computer program product according to claim 11, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. | Mechanisms for operating a business rule management system are provided. The mechanisms access a text file describing one or more business processes, and bindings of a plurality of text chunks within the text file to a respective plurality of elements within the business rule management system. The mechanisms detect a change in a bound text chunk in the text file and modify the respective bound element within the business rule management system according to the detected change in the bound text chunk in the text file.1. A method, in a computing device implementing a binding engine, for updating elements of a business rule management system, the method comprising:
accessing, by the binding engine, a text file describing one or more business processes, generating, by the binding engine, bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detecting, by the binding engine, a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modifying, by the binding, an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 2. A method according to claim 1, further comprising, after detecting the change in the text chunk in the text file, validating the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 3. A method according to claim 1, wherein the elements within the business rule management system comprise a plurality of rules and, wherein modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file, comprises modifying a rule bound to the changed text chunk. 4. A method according to claim 1, further comprising triggering a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 5. A method according to claim 1, further comprising receiving a defined user input and providing access to the plurality of text chunks within the text file in response to the defined user input. 6. A business rule management system comprising a binding engine configured to:
access a text the describing one or more business processes, generate bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detect a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modify an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 7. A system according to claim 6, wherein the binding engine is further configured to, after detecting the change in the text chunk in the text file, validate the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 8. A system according to claim 6, wherein the elements within the business rule management system comprise a plurality of rules and the binding engine is configured to, when modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file, modify a rule bound to the changed text chunk. 9. A system according to claim 6, wherein the binding engine is further configured to trigger a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 10. A system according to claim 6, wherein the binding engine is further configured to receive a defined user input and provide access to the plurality of text chunks within the text file in response to the defined user input. 11. A computer program product on a non-transitory computer readable medium for operating a business rule management system, the product comprising instructions, which when executed by a computing device, cause the computing device to:
access a text file describing one or more business processes, generate bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system, detect a change in a text chunk, in the text file, bound to an element of the plurality of elements, and modify an element bound to the changed text chunk within the business rule management system, according to the detected change in the changed text chunk, wherein an operation of the business rule management system is changed according to the modification to the element bound to the changed text chunk. 12. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to, after detecting the change in the text chunk in the text file, validate the change, prior to modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the text chunk. 13. A computer program product according to claim 11, wherein the elements within the business rule management system comprise a plurality of rules and modifying the element bound to the changed text chunk, within the business rule management system according to the detected change in the bound text chunk in the text file comprises modifying a rule bound to the changed text chunk. 14. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to trigger a specific action defined by the element bound to the changed text chunk, in response to modifying the element bound to the changed text chunk within the business rule management system according to the detected change in the text chunk. 15. A computer program product according to claim 11, wherein the computer program product further comprises instructions that cause the computing device to receive a defined user input and provide access to the plurality of text chunks within the text file in response to the defined user input. 16. A method according to claim 1, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. 17. The method according to claim 1, wherein modifying the element bound to the changed text chunk is performed automatically without a human user, that submitted the change in the text chunk, being made aware of the modification to the element bound to the changed text chunk. 18. A system according to claim 6, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. 19. A system according to claim 6, wherein modifying the element bound to the changed text chunk is performed automatically without a human user, that submitted the change in the text chunk, being made aware of the modification to the element bound to the changed text chunk. 20. A computer program product according to claim 11, wherein:
the plurality of elements within the business rule management system are business rules managed by the business rule management system, generating bindings of a plurality of text chunks within the text file to respective elements of a plurality of elements within the business rule management system comprises binding a numerical value specified in a text chunk of the text file to a numerical parameter of a business rule bound to the text chunk, detecting a change in a text chunk in the text file bound to an element of the plurality of elements comprises detecting a change in a numerical value of the changed text chunk, and modifying the element bound to the changed text chunk comprises updating a numerical parameter of the business rule bound to the changed text chunk based on the change to the numerical value in the changed text chunk. | 2,100 |
5,473 | 5,473 | 14,501,596 | 2,143 | A display manager initiates display of an on-screen keyboard to include a first zone of display regions and a second zone of display regions on a display screen. The display manager additionally initiates display of a visual prompt that is navigable about the first zone. A location of the visual prompt indicates a current navigation position in the on-screen keyboard. In response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, the display manager performs a function corresponding to selection of the display region in the second zone. In one example implementation of an on-screen keyboard, a display region represents a letter of the alphabet. Selection of the display region (and corresponding letter) outside of the first zone using an arrow key indicates selection of the letter in the second zone. | 1. A method comprising:
initiating display of multiple display regions on a display screen, the multiple display regions including a first display region and a second display region, the second display region displaying a symbol; initiating display of a visual prompt in the first display region, the visual prompt indicating a current navigation position in the display screen; and in response to receiving directional input with respect to the visual prompt from the first display region to the second display region, storing a copy of the symbol in a buffer to indicate selection of the symbol. 2. The method as in claim 1 further comprising:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region: after temporarily moving the visual prompt to the second display region, moving the visual prompt back to the first display region. 3. The method as in claim 2, further comprising:
displaying the multiple display regions on the display screen as part of an on-screen keyboard; and wherein the directional input is received from a user viewing the display screen and performing a search for content. 4. The method as in claim 3, wherein the directional input is a selection of an arrow key by the user; and
wherein storing the copy of the symbol includes appending the copy of the symbol to a text string stored in the buffer. 5. The method as in claim 4 further comprising:
matching the text string stored in the buffer to multiple candidate text strings to which the text string stored in the buffer potentially pertains; and
initiating display of the multiple candidate text strings on the display screen for selection by the user. 6. The method as in claim 1 further comprising:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region as indicated by a selected arrow control key, appending a copy of the symbol associated with the second display region to a text string stored in the buffer. 7. The method as in claim 1, wherein the second display region is disposed adjacent to the first display region on the display screen, the directional input being selection of a respective arrow key to at least temporarily navigate the visual prompt from the first display region to the second display region. 8. The method as in claim 1, wherein the symbol displayed in the first display region is a first symbol of the alphabet, the method further comprising:
in the second display region, initiating display of a second symbol of the alphabet; and initiating display of a third display region, the third display region displaying a third symbol of the alphabet. 9. The method as in claim 8 further comprising:
appending a copy of the symbol associated with the second display region to a text string stored in the buffer in response to receiving the directional input as indicated by selection of a first arrow key; and
in response to receiving additional input selecting the first display region, appending a copy of the symbol associated with the first display region to the text string stored in the buffer. 10. The method as in claim 1 further comprising:
in response to receiving selection of a first key selection inputted by a user viewing the display screen: i) temporarily moving the visual prompt from the first display region to the second display region, ii) moving the visual prompt back to the first display region, and iii) appending the symbol to a text string stored in the buffer; and
in response to receiving selection of a second key selection inputted by the user viewing the display screen: i) maintaining the visual prompt in the first display region, and ii) appending a symbol assigned to the first display region to the text string. 11. The method as in claim 1, wherein the directional input is a single selection of an arrow key on a keypad, the method further comprising:
in response to receiving the single selection of the arrow key navigating the visual prompt from the first display region to the second display region, performing a back-and-forth transition of the visual prompt from the first display region to the second display region and back to the first display region. 12. The method as in claim 1, wherein the directional input is first input indicating to navigate the visual prompt in a first direction along a first axis, the method further comprising:
in response to receiving second input to navigate the visual prompt in a second direction along a second axis that is substantially orthogonal to the first axis, moving the visual prompt in a direction from the first display region to a third display region without modifying the buffer. 13. The method as in claim 12, wherein the second axis is substantially orthogonal to the first axis. 14. A method comprising:
initiating display of a first zone of display regions and a second zone of display regions in an on-screen keyboard displayed on a display screen; initiating display of a visual prompt, the visual prompt navigable about the first zone of display regions and the second zone of display regions, a location of the visual prompt indicating a current navigation position; and in response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, performing a function corresponding to selection of the display region in the second zone. 15. The method as in claim 14, wherein initiating display of the first zone of the display regions and the second zone of display regions further comprises:
displaying the first zone of display regions as a first sequence; and displaying the second zone of display regions as a second sequence, the second zone of display regions displayed substantially side-by-side and parallel with respect to the first sequence. 16. The method as in claim 15, wherein the input is selection of a first arrow key on a respective keypad, the first arrow key indicating to move the visual prompt in a direction substantially orthogonal with respect to an axis of the first sequence. 17. The method as in claim 16, wherein the first zone of display regions includes a first display region and a second display region, the first display region disposed in the first sequence adjacent to the second display region, the method further comprising:
in response to receiving additional input navigating the visual prompt from the first display region in the first zone to the second display region in the first zone, moving the visual prompt from the first display region to the second display region. 18. The method as in claim 17, wherein the additional input is selection of a second arrow key on the respective keypad, the second arrow key indicating to move the visual prompt in a direction substantially parallel with respect to the axis of the first sequence. 19. The method as in claim 14 further comprising:
providing an indication that each of the display regions in the first zone corresponds to a respective letter of the alphabet; and
providing an indication that each of the display regions in the second zone corresponds to a respective letter of the alphabet. 20. The method as in claim 14 further comprising:
providing an indication that each of the display regions in the first zone corresponds to a respective letter of the alphabet; and
providing an indication that each of the display regions in the second zone does not correspond to a respective letter of the alphabet. 21. The method as in claim 15 further comprising:
displaying the visual prompt indicating the current navigation position to include an arrow, the arrow pointing in a direction substantially orthogonal to an axial length of the first sequence, the arrow pointing from the display region in the first zone to the display region in the second zone. 22. The method as in claim 14 further comprising:
in response to receiving the directional input, performing a back-and-forth navigation transition of the visual prompt from the display region in the first zone to the display region in the second zone back to the display region in the first zone. 23. A computer system comprising:
computer processor hardware; and a hardware storage resource coupled to the computer processor hardware, the hardware storage resource storing instructions that, when executed by the computer processor hardware, causes the computer processor hardware to perform operations of:
initiating display of multiple display regions on a display screen, the multiple display regions including a first display region and a second display region, the second display region displaying a symbol;
initiating display of a visual prompt in the first display region, the visual prompt indicating a current navigation position in the display screen; and
in response to receiving directional input with respect to the visual prompt from the first display region to the second display region, and performing an operation as specified by the symbol. 24. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region: after temporarily moving the visual prompt to the second display region, moving the visual prompt back to the first display region. 25. The computer system as in claim 24, wherein the computer processor hardware further performs operations of:
displaying the multiple display regions on the display screen as part of an on-screen keyboard; and wherein the directional input is received from a user viewing the display screen and performing a search for content. 26. The computer system as in claim 25, wherein the directional input is a selection of an arrow key by the user; and
wherein performing an operation as specified by the symbol includes appending a copy of the symbol to a text string stored in a buffer. 27. The computer system as in claim 26, wherein the computer processor hardware further performs operations of:
matching the text string stored in the buffer to multiple candidate text strings to which the text string in the buffer potentially pertains; and initiating display of the multiple candidate text strings on the display screen for selection by the user. 28. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region as indicated by a selected arrow control key, appending a copy of the symbol associated with the second display region to a text string stored in the buffer. 29. The computer system as in claim 23, wherein the second display region is disposed adjacent to the first display region on the display screen, the directional input being selection of a respective arrow key to at least temporarily navigate the visual prompt from the first display region to the second display region. 30. The computer system as in claim 23, wherein the symbol displayed in the first display region is a first symbol of the alphabet, the computer processor hardware further performing operations of:
in the second display region, initiating display of a second symbol of the alphabet; and initiating display of a third display region, the third display region displaying a third symbol of the alphabet. 31. The computer system as in claim 30, wherein the computer processor hardware further performs operations of:
appending a copy of the symbol associated with the second display region to a text string stored in a buffer in response to receiving the directional input as indicated by selection of a first arrow key; and in response to receiving additional input selecting the first display region, appending a copy of the symbol associated with the first display region to the text string stored in the buffer. 32. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving selection of a first key selection inputted by a user viewing the display screen: i) temporarily moving the visual prompt from the first display region to the second display region, ii) moving the visual prompt back to the first display region, and iii) appending the symbol to a text string stored in a buffer; and in response to receiving selection of a second key selection inputted by the user viewing the display screen: i) maintaining the visual prompt in the first display region, and ii) appending a symbol assigned to the first display region to the text string. 33. The computer system as in claim 23, wherein the directional input is a single selection of an arrow key on a keypad, the computer processor hardware further performing operations of:
in response to receiving the single selection of the arrow key navigating the visual prompt in a direction from the first display region to the second display region, performing a back-and-forth transition of the visual prompt from the first display region to the second display region and back to the first display region. 34. The computer system as in claim 23, wherein the directional input is first input indicating to navigate the visual prompt in a first direction along a first axis, the computer processor hardware further performing operations of:
in response to receiving second input to navigate the visual prompt in a second direction along a second axis that is substantially orthogonal to the first axis, moving the visual prompt in a direction from the first display region to a third display region without modifying a text string. 35. The computer system as in claim 23, wherein the second axis is substantially orthogonal to the first axis. 36. Computer-readable storage hardware having instructions stored thereon, the instructions, when carried out by computer processor hardware, causes the computer processor hardware to perform operations of:
initiating display of a first zone of display regions and a second zone of display regions in an on-screen keyboard displayed on a display screen; initiating display of a visual prompt, the visual prompt navigable about the first zone of display regions and the second zone of display regions, a location of the visual prompt indicating a current navigation position; and in response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, performing a function corresponding to selection of the display region in the second zone. | A display manager initiates display of an on-screen keyboard to include a first zone of display regions and a second zone of display regions on a display screen. The display manager additionally initiates display of a visual prompt that is navigable about the first zone. A location of the visual prompt indicates a current navigation position in the on-screen keyboard. In response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, the display manager performs a function corresponding to selection of the display region in the second zone. In one example implementation of an on-screen keyboard, a display region represents a letter of the alphabet. Selection of the display region (and corresponding letter) outside of the first zone using an arrow key indicates selection of the letter in the second zone.1. A method comprising:
initiating display of multiple display regions on a display screen, the multiple display regions including a first display region and a second display region, the second display region displaying a symbol; initiating display of a visual prompt in the first display region, the visual prompt indicating a current navigation position in the display screen; and in response to receiving directional input with respect to the visual prompt from the first display region to the second display region, storing a copy of the symbol in a buffer to indicate selection of the symbol. 2. The method as in claim 1 further comprising:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region: after temporarily moving the visual prompt to the second display region, moving the visual prompt back to the first display region. 3. The method as in claim 2, further comprising:
displaying the multiple display regions on the display screen as part of an on-screen keyboard; and wherein the directional input is received from a user viewing the display screen and performing a search for content. 4. The method as in claim 3, wherein the directional input is a selection of an arrow key by the user; and
wherein storing the copy of the symbol includes appending the copy of the symbol to a text string stored in the buffer. 5. The method as in claim 4 further comprising:
matching the text string stored in the buffer to multiple candidate text strings to which the text string stored in the buffer potentially pertains; and
initiating display of the multiple candidate text strings on the display screen for selection by the user. 6. The method as in claim 1 further comprising:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region as indicated by a selected arrow control key, appending a copy of the symbol associated with the second display region to a text string stored in the buffer. 7. The method as in claim 1, wherein the second display region is disposed adjacent to the first display region on the display screen, the directional input being selection of a respective arrow key to at least temporarily navigate the visual prompt from the first display region to the second display region. 8. The method as in claim 1, wherein the symbol displayed in the first display region is a first symbol of the alphabet, the method further comprising:
in the second display region, initiating display of a second symbol of the alphabet; and initiating display of a third display region, the third display region displaying a third symbol of the alphabet. 9. The method as in claim 8 further comprising:
appending a copy of the symbol associated with the second display region to a text string stored in the buffer in response to receiving the directional input as indicated by selection of a first arrow key; and
in response to receiving additional input selecting the first display region, appending a copy of the symbol associated with the first display region to the text string stored in the buffer. 10. The method as in claim 1 further comprising:
in response to receiving selection of a first key selection inputted by a user viewing the display screen: i) temporarily moving the visual prompt from the first display region to the second display region, ii) moving the visual prompt back to the first display region, and iii) appending the symbol to a text string stored in the buffer; and
in response to receiving selection of a second key selection inputted by the user viewing the display screen: i) maintaining the visual prompt in the first display region, and ii) appending a symbol assigned to the first display region to the text string. 11. The method as in claim 1, wherein the directional input is a single selection of an arrow key on a keypad, the method further comprising:
in response to receiving the single selection of the arrow key navigating the visual prompt from the first display region to the second display region, performing a back-and-forth transition of the visual prompt from the first display region to the second display region and back to the first display region. 12. The method as in claim 1, wherein the directional input is first input indicating to navigate the visual prompt in a first direction along a first axis, the method further comprising:
in response to receiving second input to navigate the visual prompt in a second direction along a second axis that is substantially orthogonal to the first axis, moving the visual prompt in a direction from the first display region to a third display region without modifying the buffer. 13. The method as in claim 12, wherein the second axis is substantially orthogonal to the first axis. 14. A method comprising:
initiating display of a first zone of display regions and a second zone of display regions in an on-screen keyboard displayed on a display screen; initiating display of a visual prompt, the visual prompt navigable about the first zone of display regions and the second zone of display regions, a location of the visual prompt indicating a current navigation position; and in response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, performing a function corresponding to selection of the display region in the second zone. 15. The method as in claim 14, wherein initiating display of the first zone of the display regions and the second zone of display regions further comprises:
displaying the first zone of display regions as a first sequence; and displaying the second zone of display regions as a second sequence, the second zone of display regions displayed substantially side-by-side and parallel with respect to the first sequence. 16. The method as in claim 15, wherein the input is selection of a first arrow key on a respective keypad, the first arrow key indicating to move the visual prompt in a direction substantially orthogonal with respect to an axis of the first sequence. 17. The method as in claim 16, wherein the first zone of display regions includes a first display region and a second display region, the first display region disposed in the first sequence adjacent to the second display region, the method further comprising:
in response to receiving additional input navigating the visual prompt from the first display region in the first zone to the second display region in the first zone, moving the visual prompt from the first display region to the second display region. 18. The method as in claim 17, wherein the additional input is selection of a second arrow key on the respective keypad, the second arrow key indicating to move the visual prompt in a direction substantially parallel with respect to the axis of the first sequence. 19. The method as in claim 14 further comprising:
providing an indication that each of the display regions in the first zone corresponds to a respective letter of the alphabet; and
providing an indication that each of the display regions in the second zone corresponds to a respective letter of the alphabet. 20. The method as in claim 14 further comprising:
providing an indication that each of the display regions in the first zone corresponds to a respective letter of the alphabet; and
providing an indication that each of the display regions in the second zone does not correspond to a respective letter of the alphabet. 21. The method as in claim 15 further comprising:
displaying the visual prompt indicating the current navigation position to include an arrow, the arrow pointing in a direction substantially orthogonal to an axial length of the first sequence, the arrow pointing from the display region in the first zone to the display region in the second zone. 22. The method as in claim 14 further comprising:
in response to receiving the directional input, performing a back-and-forth navigation transition of the visual prompt from the display region in the first zone to the display region in the second zone back to the display region in the first zone. 23. A computer system comprising:
computer processor hardware; and a hardware storage resource coupled to the computer processor hardware, the hardware storage resource storing instructions that, when executed by the computer processor hardware, causes the computer processor hardware to perform operations of:
initiating display of multiple display regions on a display screen, the multiple display regions including a first display region and a second display region, the second display region displaying a symbol;
initiating display of a visual prompt in the first display region, the visual prompt indicating a current navigation position in the display screen; and
in response to receiving directional input with respect to the visual prompt from the first display region to the second display region, and performing an operation as specified by the symbol. 24. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region: after temporarily moving the visual prompt to the second display region, moving the visual prompt back to the first display region. 25. The computer system as in claim 24, wherein the computer processor hardware further performs operations of:
displaying the multiple display regions on the display screen as part of an on-screen keyboard; and wherein the directional input is received from a user viewing the display screen and performing a search for content. 26. The computer system as in claim 25, wherein the directional input is a selection of an arrow key by the user; and
wherein performing an operation as specified by the symbol includes appending a copy of the symbol to a text string stored in a buffer. 27. The computer system as in claim 26, wherein the computer processor hardware further performs operations of:
matching the text string stored in the buffer to multiple candidate text strings to which the text string in the buffer potentially pertains; and initiating display of the multiple candidate text strings on the display screen for selection by the user. 28. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving the directional input with respect to the visual prompt from the first display region to the second display region as indicated by a selected arrow control key, appending a copy of the symbol associated with the second display region to a text string stored in the buffer. 29. The computer system as in claim 23, wherein the second display region is disposed adjacent to the first display region on the display screen, the directional input being selection of a respective arrow key to at least temporarily navigate the visual prompt from the first display region to the second display region. 30. The computer system as in claim 23, wherein the symbol displayed in the first display region is a first symbol of the alphabet, the computer processor hardware further performing operations of:
in the second display region, initiating display of a second symbol of the alphabet; and initiating display of a third display region, the third display region displaying a third symbol of the alphabet. 31. The computer system as in claim 30, wherein the computer processor hardware further performs operations of:
appending a copy of the symbol associated with the second display region to a text string stored in a buffer in response to receiving the directional input as indicated by selection of a first arrow key; and in response to receiving additional input selecting the first display region, appending a copy of the symbol associated with the first display region to the text string stored in the buffer. 32. The computer system as in claim 23, wherein the computer processor hardware further performs operations of:
in response to receiving selection of a first key selection inputted by a user viewing the display screen: i) temporarily moving the visual prompt from the first display region to the second display region, ii) moving the visual prompt back to the first display region, and iii) appending the symbol to a text string stored in a buffer; and in response to receiving selection of a second key selection inputted by the user viewing the display screen: i) maintaining the visual prompt in the first display region, and ii) appending a symbol assigned to the first display region to the text string. 33. The computer system as in claim 23, wherein the directional input is a single selection of an arrow key on a keypad, the computer processor hardware further performing operations of:
in response to receiving the single selection of the arrow key navigating the visual prompt in a direction from the first display region to the second display region, performing a back-and-forth transition of the visual prompt from the first display region to the second display region and back to the first display region. 34. The computer system as in claim 23, wherein the directional input is first input indicating to navigate the visual prompt in a first direction along a first axis, the computer processor hardware further performing operations of:
in response to receiving second input to navigate the visual prompt in a second direction along a second axis that is substantially orthogonal to the first axis, moving the visual prompt in a direction from the first display region to a third display region without modifying a text string. 35. The computer system as in claim 23, wherein the second axis is substantially orthogonal to the first axis. 36. Computer-readable storage hardware having instructions stored thereon, the instructions, when carried out by computer processor hardware, causes the computer processor hardware to perform operations of:
initiating display of a first zone of display regions and a second zone of display regions in an on-screen keyboard displayed on a display screen; initiating display of a visual prompt, the visual prompt navigable about the first zone of display regions and the second zone of display regions, a location of the visual prompt indicating a current navigation position; and in response to receiving directional input with respect to the visual prompt from a display region in the first zone to a display region in the second zone, performing a function corresponding to selection of the display region in the second zone. | 2,100 |
5,474 | 5,474 | 14,628,137 | 2,143 | Image cache collaboration is described to enable multiple clients to share image data in a remote desktop environment. A centralized cache manager maintains information about all image caches on all client devices which have established connections to the server. When an update to a portion of the GUI of a virtual desktop for a first client device is detected, the central cache manager can determine whether any other client devices contain the requested image data in their respective image caches. If such a device is identified, the server transmits a message to the first client device, identifying the second client device that contains the requested image data in its respective image cache. The first client device may then request and receive the image data from the second client device over the LAN on which both devices reside, thereby obtaining the data with less latency. | 1. A method for providing image cache collaboration between multiple client devices in a remote desktop environment, the method comprising:
detecting an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device; determining that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and transmitting a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 2. The method of claim 1, further comprising:
maintaining a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 3. The method of claim 1, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the server resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the server over a wide area network (WAN) connections. 4. The method of claim 1, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 5. The method of claim 4, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 6. The method of claim 1, wherein the server is a connection server that includes a central cache manager that receives image hash keys associated with image cache data from each of a plurality of client devices having a virtual desktop provided by the server. 7. The method of claim 1, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the server, the virtual machine associated with a user of the first client device. 8. A non-transitory computer readable storage medium comprising one or more sequences of instructions, the instructions when executed by one or more processors causing the one or more processors to execute the operations of:
detecting an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device; determining that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and transmitting a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 9. The non-transitory computer readable storage medium of claim 8, further comprising instructions to cause the one or more processors to:
maintain a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 10. The non-transitory computer readable storage medium of claim 8, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the server resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the server over a wide area network (WAN) connections. 11. The non-transitory computer readable storage medium of claim 8, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 12. The non-transitory computer readable storage medium of claim 11, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 13. The non-transitory computer readable storage medium of claim 8, wherein the server is a connection server that includes a central cache manager that receives image cache keys associated with image cache data from each of a plurality of client devices having a virtual desktop provided by the server. 14. The non-transitory computer readable storage medium of claim 8, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the server, the virtual machine associated with a user of the first client device. 15. A computing device, comprising:
one or more processors; and memory including instructions that when executed by the one or more processors, cause the computing device to:
detect an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device;
determine that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and
transmit a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 16. The computing device of claim 15, wherein the memory further includes instructions that cause the computing device to:
maintain a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 17. The computing device of claim 15, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the computing device resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the computing device over wide area network (WAN) connections. 18. The computing device of claim 15, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 19. The computing device of claim 18, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 20. The method of claim 1, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the computing device, the virtual machine associated with a user of the first client device. | Image cache collaboration is described to enable multiple clients to share image data in a remote desktop environment. A centralized cache manager maintains information about all image caches on all client devices which have established connections to the server. When an update to a portion of the GUI of a virtual desktop for a first client device is detected, the central cache manager can determine whether any other client devices contain the requested image data in their respective image caches. If such a device is identified, the server transmits a message to the first client device, identifying the second client device that contains the requested image data in its respective image cache. The first client device may then request and receive the image data from the second client device over the LAN on which both devices reside, thereby obtaining the data with less latency.1. A method for providing image cache collaboration between multiple client devices in a remote desktop environment, the method comprising:
detecting an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device; determining that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and transmitting a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 2. The method of claim 1, further comprising:
maintaining a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 3. The method of claim 1, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the server resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the server over a wide area network (WAN) connections. 4. The method of claim 1, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 5. The method of claim 4, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 6. The method of claim 1, wherein the server is a connection server that includes a central cache manager that receives image hash keys associated with image cache data from each of a plurality of client devices having a virtual desktop provided by the server. 7. The method of claim 1, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the server, the virtual machine associated with a user of the first client device. 8. A non-transitory computer readable storage medium comprising one or more sequences of instructions, the instructions when executed by one or more processors causing the one or more processors to execute the operations of:
detecting an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device; determining that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and transmitting a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 9. The non-transitory computer readable storage medium of claim 8, further comprising instructions to cause the one or more processors to:
maintain a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 10. The non-transitory computer readable storage medium of claim 8, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the server resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the server over a wide area network (WAN) connections. 11. The non-transitory computer readable storage medium of claim 8, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 12. The non-transitory computer readable storage medium of claim 11, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 13. The non-transitory computer readable storage medium of claim 8, wherein the server is a connection server that includes a central cache manager that receives image cache keys associated with image cache data from each of a plurality of client devices having a virtual desktop provided by the server. 14. The non-transitory computer readable storage medium of claim 8, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the server, the virtual machine associated with a user of the first client device. 15. A computing device, comprising:
one or more processors; and memory including instructions that when executed by the one or more processors, cause the computing device to:
detect an update to at least a portion of a graphical user interface (GUI) of a virtual desktop executed on a server for a first client device;
determine that an image cache on a second client device currently contains image data needed to update the GUI of the virtual desktop for the first client device; and
transmit a message to the first client device identifying the second client device that contains the image data, wherein the first client device requests the image data from the second client device in response to receiving said message. 16. The computing device of claim 15, wherein the memory further includes instructions that cause the computing device to:
maintain a table storing entries associating image hash keys with client devices, wherein each image hash key corresponds to a set of image data for a portion of the GUI, the set of image data stored on a client device identified by the corresponding entry in the table. 17. The computing device of claim 15, wherein the first client device and the second client device reside within a first local area network (LAN) and wherein the computing device resides in a second LAN that is separate and distinct from the first LAN, and wherein the first client device and the second client device connect to the computing device over wide area network (WAN) connections. 18. The computing device of claim 15, wherein the second client device is configured to listen on a specified port designated for sending image cache data, and wherein:
in response to receiving the message, the first client obtains the internet protocol (IP) address of the second client and establishes a transfer control protocol (TCP) connection with the second client at the specified port. 19. The computing device of claim 18, wherein the first client requests the image data from the second client using the connection and the second client transmits the image data from the image cache of the second client to the first client. 20. The method of claim 1, wherein the virtual desktop is executed on a virtual machine managed by a hypervisor executed on the computing device, the virtual machine associated with a user of the first client device. | 2,100 |
5,475 | 5,475 | 15,417,696 | 2,114 | Dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, including: setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for the component should be changed; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component. | 1. A method of dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the method comprising:
setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for the component should be changed; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component. 2. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 3. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 4. The method of claim 3 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 5. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 6. The method of claim 1 wherein determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. 7. A method of dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the method comprising:
receiving log data from the storage system; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for a component should be changed, the logging level specifying the extent to which log data should be generated for a particular component; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component. 8. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 9. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 10. The method of claim 9 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 11. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 12. The method of claim 7 wherein determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. 13. An apparatus for dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining, in dependence upon one or more measured operating characteristics of the storage system, whether a logging level for a component should be changed, the logging level specifying the extent to which log data should be generated for a particular component; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component 14. The apparatus of claim 13 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the step of receiving log data from the storage system. 15. The apparatus of claim 13 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component. 16. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 17. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 18. The apparatus of claim 17 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 19. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 20. The apparatus of claim 13 determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. | Dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, including: setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for the component should be changed; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component.1. A method of dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the method comprising:
setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for the component should be changed; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component. 2. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 3. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 4. The method of claim 3 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 5. The method of claim 1 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 6. The method of claim 1 wherein determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. 7. A method of dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the method comprising:
receiving log data from the storage system; determining, in dependence upon one or more measured operating characteristics of the storage system, whether the logging level for a component should be changed, the logging level specifying the extent to which log data should be generated for a particular component; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component. 8. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 9. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 10. The method of claim 9 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 11. The method of claim 7 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 12. The method of claim 7 wherein determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. 13. An apparatus for dynamically adjusting an amount of log data generated for a storage system that includes a plurality of storage devices, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining, in dependence upon one or more measured operating characteristics of the storage system, whether a logging level for a component should be changed, the logging level specifying the extent to which log data should be generated for a particular component; and responsive to determining that the logging level for the component should be changed, changing the logging level associated with the component 14. The apparatus of claim 13 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the step of receiving log data from the storage system. 15. The apparatus of claim 13 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of setting, for a component within the storage system, a logging level for the component, the logging level specifying the extent to which log data should be generated for a particular component. 16. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises detecting that an error has been encountered by one or more components in the storage system. 17. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint. 18. The apparatus of claim 17 wherein detecting that one or more operating characteristics of the storage system matches a predetermined operating characteristic fingerprint further comprises comparing log data generated by the storage system to one or more operating characteristic fingerprints. 19. The apparatus of claim 13 wherein determining that the logging level for the component should be changed further comprises evaluating results from a health check of the storage system. 20. The apparatus of claim 13 determining, in dependence upon one or more measured operating characteristics of the storage system, that the logging level for the component should be changed further comprises detecting that a predetermined amount of time has lapsed since an error has been encountered by one or more components in the storage system. | 2,100 |
5,476 | 5,476 | 15,204,931 | 2,165 | A method and system for populating a software catalogue in software applications which monitor the presence of software products on a plurality of computers. The proposed method aims at populating a software catalogue with a limited manual intervention of an administrator. The present invention reduces the cost of producing and maintaining a comprehensive knowledge base (the catalogue) which contains definitions of software products and the related signature. Information about software products and their related signature is obtained through a process using some special files (e.g. XML files) which contains information and/or pointers to other products. | 1. A method of populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application, the method including the steps of:
scanning, by the system management application, the file systems of the plurality of data processing systems to detect the occurrence of a set of files indicative of a software product being installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software product using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 2. The method of claim 1, wherein the at least one manifest file includes an XML document. 3. The method of claim 1 wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 4. (canceled) 5. The method of claim 3, wherein the at least one manifest file includes a link to another manifest file. 6. The method of claim 1, wherein the product signature includes a file identifier identifying one of the files of the set of files. 7. The method of claim 1, wherein the association of the signature with a software product identifier is based on information extracted by the files included in the corresponding set of files. 8. The method of claim 1, wherein the software products are inventoried across a plurality of data processing systems. 9. A computer program product comprising a non-transitory computer readable medium having stored thereon a computer program for populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application when the computer program is executed on a data processing system, to perform steps of:
scanning, by the system management application, the file systems of the plurality of data processing systems to detect the occurrence of a set of files indicative of a software product installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 10. A system for populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application, comprising a data processor coupled to a memory having program code stored then that is configured to perform, when executed by the data processor, steps of:
scanning, by the system management application, the file systems of the plurality of data processing system systems to detect the occurrence of a set of files indicative of a software product installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software product using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 11. (canceled) 12. The method of claim 1, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. 13. The computer program product of claim 9, wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 14. The computer program product of claim 13, wherein the at least one manifest file includes a link to another manifest file. 15. The computer program product of claim 9, wherein the product signature includes a file identifier identifying one of the files of the set of files. 16. The computer program product of claim 9, wherein the association of the product signature with the software product identifier is based on information extracted by the files included in the corresponding set of files. 17. The computer program product of claim 9, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. 18. The system of claim 10, wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 19. The system of claim 18, wherein the at least one manifest file includes a link to another manifest file. 20. The system of claim 10, wherein the product signature includes a file identifier identifying one of the files of the set of files. 21. The system of claim 10, wherein the association of the product signature with the software product identifier is based on information extracted by the files included in the corresponding set of files. 22. The system of claim 10, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. | A method and system for populating a software catalogue in software applications which monitor the presence of software products on a plurality of computers. The proposed method aims at populating a software catalogue with a limited manual intervention of an administrator. The present invention reduces the cost of producing and maintaining a comprehensive knowledge base (the catalogue) which contains definitions of software products and the related signature. Information about software products and their related signature is obtained through a process using some special files (e.g. XML files) which contains information and/or pointers to other products.1. A method of populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application, the method including the steps of:
scanning, by the system management application, the file systems of the plurality of data processing systems to detect the occurrence of a set of files indicative of a software product being installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software product using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 2. The method of claim 1, wherein the at least one manifest file includes an XML document. 3. The method of claim 1 wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 4. (canceled) 5. The method of claim 3, wherein the at least one manifest file includes a link to another manifest file. 6. The method of claim 1, wherein the product signature includes a file identifier identifying one of the files of the set of files. 7. The method of claim 1, wherein the association of the signature with a software product identifier is based on information extracted by the files included in the corresponding set of files. 8. The method of claim 1, wherein the software products are inventoried across a plurality of data processing systems. 9. A computer program product comprising a non-transitory computer readable medium having stored thereon a computer program for populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application when the computer program is executed on a data processing system, to perform steps of:
scanning, by the system management application, the file systems of the plurality of data processing systems to detect the occurrence of a set of files indicative of a software product installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 10. A system for populating a software catalogue with software product identifiers corresponding to software products being discovered on a plurality of data processing systems by a system management application, comprising a data processor coupled to a memory having program code stored then that is configured to perform, when executed by the data processor, steps of:
scanning, by the system management application, the file systems of the plurality of data processing system systems to detect the occurrence of a set of files indicative of a software product installed on a data processing system, the set of files including at least one manifest file containing management interface information on at least one referenced software product usable by the system management application to control operation of the at least one referenced software product; determining, by the system management application, a product signature associated to the at least one referenced software product using the information of the manifest file; storing, by the system management application, the product signature and an associated software product identifier of the referenced product on the software catalogue; and controlling, by the system management application, the at least one reference software product using the management interface information. 11. (canceled) 12. The method of claim 1, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. 13. The computer program product of claim 9, wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 14. The computer program product of claim 13, wherein the at least one manifest file includes a link to another manifest file. 15. The computer program product of claim 9, wherein the product signature includes a file identifier identifying one of the files of the set of files. 16. The computer program product of claim 9, wherein the association of the product signature with the software product identifier is based on information extracted by the files included in the corresponding set of files. 17. The computer program product of claim 9, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. 18. The system of claim 10, wherein the at least one referenced software product includes the software product related to the detected set of files and a different software product that is different from the software product related to the detected set of files. 19. The system of claim 18, wherein the at least one manifest file includes a link to another manifest file. 20. The system of claim 10, wherein the product signature includes a file identifier identifying one of the files of the set of files. 21. The system of claim 10, wherein the association of the product signature with the software product identifier is based on information extracted by the files included in the corresponding set of files. 22. The system of claim 10, wherein the manifest file contains information indicating which file must be in execution to consider that the at least one referenced software product is running. | 2,100 |
5,477 | 5,477 | 14,501,346 | 2,121 | A load balance controller in communication with at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid is provided. The load balance controller is configured to: receive a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid, identify a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer, determine a deviation of the value of the at least one operational parameter from the threshold value, and selectively control the power consumption of at least one load balancing device such that the deviation is minimized. | 1. A load balance controller in communication with at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid, the load balance controller configured to:
receive a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid; identify a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer; determine a deviation of the value of the at least one operational parameter from the threshold value; and selectively control the power consumption of at least one load balancing device such that the deviation is minimized. 2. The load balance controller of claim 1, wherein the load balance controller is further configured to:
receive at least one operating constraint associated with each load balancing device of a plurality of load balancing devices; and identify at least one load balancing device of the plurality of load balancing devices having at least one operating constraint that correlates with the deviation. 3. The load balance controller of claim 2, wherein the operating constraint is at least one of current status, power consumption capacity, time period of availability, and one or more conditions related to availability. 4. The load balance controller of claim 2, wherein the load balance controller is further configured to use one or more statistical modeling techniques to determine at least one operating constraint associated with at least one load balancing device. 5. The load balance controller of claim 2, further configured to receive a signal based on at least one operating constraint of at least one load balancing device, and further configured to reduce at least a portion of a computational load of the load balance controller based on the signal. 6. The load balance controller of claim 2, wherein identifying at least one load balancing device further includes aggregating one or more identified load balancing devices such that a sum total of values corresponding to at least one operating constraint of each respective load balancing device included in the aggregation is substantially equal to the deviation. 7. The load balance controller of claim 6, wherein the load balance controller is further configured to:
determine that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source exceeds an amount of electrical power consumed by the at least one energy consumer; generate a control signal for each respective load balancing device of the aggregated load balancing devices that causes each load balancing device to increase power consumption; and transmit the control signal to each respective load balancing device. 8. The load balance controller of claim 6, wherein the load balance controller is further configured to:
determine that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source is below an amount of electrical power consumed by the at least one energy consumer; generate a control signal for each respective load balancing device of the aggregated load balancing devices that causes each load balancing device to reduce power consumption; and transmit the control signal to each respective load balancing device. 9. The load balance controller of claim 8, wherein the load balance controller generates the control signal for at least one load balancing device of the aggregated load balancing devices to cause the at least one load balancing device to reduce power consumption without shutting off. 10. The load balance controller of claim 1, wherein the at least one operational parameter is a frequency of the electrical power grid. 11. The load balance controller of claim 1, wherein the at least one energy generation source comprises at least one renewable energy source and an amount of electrical power generated by the at least one renewable energy source corresponds with the value of the at least one operational parameter. 12. The load balance controller of claim 1, further comprising a monitoring system configured to determine the value of the at least one operational parameter, and wherein the value of the at least one operational parameter is time-varying and the monitoring system and the load balance controller are configured to operate in real time. 13. A method for load balancing an electrical power distribution system, the electrical power distribution system including at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid, the method comprising:
receiving a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid; identifying a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer; determining a deviation of the value of the at least one operational parameter from the threshold value; and selectively controlling the power consumption of at least one load balancing device such that the deviation is minimized. 14. The method of claim 13, further comprising:
receiving at least one operating constraint associated with each load balancing device of a plurality of load balancing devices; and identifying at least one load balancing device of the plurality of load balancing devices having at least one operating constraint that correlates with the deviation. 15. The method of claim 14, further comprising using one or more statistical modeling techniques to determine at least one operating constraint associated with at least one load balancing device. 16. The method of claim 14, further comprising transferring at least a portion of a computational load associated with receiving the at least one operating constraint to at least one load balancing device. 17. The method of claim 14, wherein identifying at least one load balancing device includes aggregating one or more identified load balancing devices such that a sum total of values corresponding to at least one operating constraint of each respective load balancing device included in the aggregation is substantially equal to the deviation. 18. The method of claim 17, further comprising:
determining that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source exceeds an amount of electrical power consumed by the at least one energy consumer; generating a control signal for each respective load balancing device of the aggregated load balancing devices such that the control signal causes each load balancing device to increase power consumption; and transmitting the control signal to each respective load balancing device. 19. The method of claim 17, further comprising:
determining that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source is below an amount of electrical power consumed by the at least one energy consumer; generating a control signal for each respective load balancing device of the aggregated load balancing devices such that the control signal causes each load balancing device to reduce power consumption; and transmitting the control signal to each respective load balancing device. 20. The method of claim 13, wherein the value of the at least one operational parameter is time-varying and selectively controlling the power consumption of the at least one load balancing device occurs in real time. | A load balance controller in communication with at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid is provided. The load balance controller is configured to: receive a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid, identify a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer, determine a deviation of the value of the at least one operational parameter from the threshold value, and selectively control the power consumption of at least one load balancing device such that the deviation is minimized.1. A load balance controller in communication with at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid, the load balance controller configured to:
receive a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid; identify a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer; determine a deviation of the value of the at least one operational parameter from the threshold value; and selectively control the power consumption of at least one load balancing device such that the deviation is minimized. 2. The load balance controller of claim 1, wherein the load balance controller is further configured to:
receive at least one operating constraint associated with each load balancing device of a plurality of load balancing devices; and identify at least one load balancing device of the plurality of load balancing devices having at least one operating constraint that correlates with the deviation. 3. The load balance controller of claim 2, wherein the operating constraint is at least one of current status, power consumption capacity, time period of availability, and one or more conditions related to availability. 4. The load balance controller of claim 2, wherein the load balance controller is further configured to use one or more statistical modeling techniques to determine at least one operating constraint associated with at least one load balancing device. 5. The load balance controller of claim 2, further configured to receive a signal based on at least one operating constraint of at least one load balancing device, and further configured to reduce at least a portion of a computational load of the load balance controller based on the signal. 6. The load balance controller of claim 2, wherein identifying at least one load balancing device further includes aggregating one or more identified load balancing devices such that a sum total of values corresponding to at least one operating constraint of each respective load balancing device included in the aggregation is substantially equal to the deviation. 7. The load balance controller of claim 6, wherein the load balance controller is further configured to:
determine that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source exceeds an amount of electrical power consumed by the at least one energy consumer; generate a control signal for each respective load balancing device of the aggregated load balancing devices that causes each load balancing device to increase power consumption; and transmit the control signal to each respective load balancing device. 8. The load balance controller of claim 6, wherein the load balance controller is further configured to:
determine that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source is below an amount of electrical power consumed by the at least one energy consumer; generate a control signal for each respective load balancing device of the aggregated load balancing devices that causes each load balancing device to reduce power consumption; and transmit the control signal to each respective load balancing device. 9. The load balance controller of claim 8, wherein the load balance controller generates the control signal for at least one load balancing device of the aggregated load balancing devices to cause the at least one load balancing device to reduce power consumption without shutting off. 10. The load balance controller of claim 1, wherein the at least one operational parameter is a frequency of the electrical power grid. 11. The load balance controller of claim 1, wherein the at least one energy generation source comprises at least one renewable energy source and an amount of electrical power generated by the at least one renewable energy source corresponds with the value of the at least one operational parameter. 12. The load balance controller of claim 1, further comprising a monitoring system configured to determine the value of the at least one operational parameter, and wherein the value of the at least one operational parameter is time-varying and the monitoring system and the load balance controller are configured to operate in real time. 13. A method for load balancing an electrical power distribution system, the electrical power distribution system including at least one energy generation source, at least one energy consumer, at least one load balancing device, and an electrical power grid, the method comprising:
receiving a value of at least one operational parameter of the electrical power grid corresponding to a load balance state of the electrical power grid; identifying a threshold value for the at least one operational parameter, the threshold value corresponding to a load balance state where an amount of electrical power generated by the at least one energy generation source is substantially equivalent to an amount of electrical power consumed by the at least one energy consumer; determining a deviation of the value of the at least one operational parameter from the threshold value; and selectively controlling the power consumption of at least one load balancing device such that the deviation is minimized. 14. The method of claim 13, further comprising:
receiving at least one operating constraint associated with each load balancing device of a plurality of load balancing devices; and identifying at least one load balancing device of the plurality of load balancing devices having at least one operating constraint that correlates with the deviation. 15. The method of claim 14, further comprising using one or more statistical modeling techniques to determine at least one operating constraint associated with at least one load balancing device. 16. The method of claim 14, further comprising transferring at least a portion of a computational load associated with receiving the at least one operating constraint to at least one load balancing device. 17. The method of claim 14, wherein identifying at least one load balancing device includes aggregating one or more identified load balancing devices such that a sum total of values corresponding to at least one operating constraint of each respective load balancing device included in the aggregation is substantially equal to the deviation. 18. The method of claim 17, further comprising:
determining that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source exceeds an amount of electrical power consumed by the at least one energy consumer; generating a control signal for each respective load balancing device of the aggregated load balancing devices such that the control signal causes each load balancing device to increase power consumption; and transmitting the control signal to each respective load balancing device. 19. The method of claim 17, further comprising:
determining that the value of the at least one operational parameter corresponds to a load balance state where an amount of electrical power generated by the at least one energy generation source is below an amount of electrical power consumed by the at least one energy consumer; generating a control signal for each respective load balancing device of the aggregated load balancing devices such that the control signal causes each load balancing device to reduce power consumption; and transmitting the control signal to each respective load balancing device. 20. The method of claim 13, wherein the value of the at least one operational parameter is time-varying and selectively controlling the power consumption of the at least one load balancing device occurs in real time. | 2,100 |
5,478 | 5,478 | 15,118,215 | 2,119 | A field device and method for starting up an industrial automation network, wherein to allow virtual start-up of at least one field device, an field device integration package is provided, whose user interface plug-in has an extension that allows a software tool to access a simulation model for the behavior of the at least one field device, and upon virtual start-up, the simulation model is used to reproduce the response of the field device, where a process model or interfacing of an external process model via a co-simulation coupling can also be used to stimulate the reproduced field device behavior, and where because the models with the FDI package are provided by the field device manufacturer, correct simulation and hence minimization of the risks upon start-up of industrial installations can be expected. | 1.-5. (canceled) 6. A method for starting an industrial automation network with a plurality of field devices which are interconnected to one another by a network for data communication, wherein a configuration and parameterization of the plurality of field devices located in the automation network is performed by a software tool, the method comprising:
providing a field device integration package including a user interface plug-in having an extension via though which access to a simulation model for behavior of at least one field device occurs for the software tool; and starting the at least one field device virtually via the software tool, the behavior of the at least one field device being simulated via the simulation model. 7. The method as claimed in claim 6, wherein access to a simulation model for a process is additionally made possible for the software tool by the extension of the user interface plug-in. 8. The method as claimed in claim 7, wherein the simulation model for a process contains prefabricated stimulation patterns and is stored in the user interface plug-in. 9. The method as claimed in claim 7, wherein access to the simulation model for the process occurs via a co-simulation coupling, through which a process model that is unstored in the user interface plug-in, is linked to the model for the field device behavior. 10. The method as claimed in claim 8, wherein access to the simulation model for the process occurs via a co-simulation coupling, through which a process model that is unstored in the user interface plug-in, is linked to the model for the field device behavior. 11. A field device, comprising:
a processor; and a field device integration package including a user interface plug-in having an extension through which access by a software tool to a simulation model for behavior of the field device occurs. | A field device and method for starting up an industrial automation network, wherein to allow virtual start-up of at least one field device, an field device integration package is provided, whose user interface plug-in has an extension that allows a software tool to access a simulation model for the behavior of the at least one field device, and upon virtual start-up, the simulation model is used to reproduce the response of the field device, where a process model or interfacing of an external process model via a co-simulation coupling can also be used to stimulate the reproduced field device behavior, and where because the models with the FDI package are provided by the field device manufacturer, correct simulation and hence minimization of the risks upon start-up of industrial installations can be expected.1.-5. (canceled) 6. A method for starting an industrial automation network with a plurality of field devices which are interconnected to one another by a network for data communication, wherein a configuration and parameterization of the plurality of field devices located in the automation network is performed by a software tool, the method comprising:
providing a field device integration package including a user interface plug-in having an extension via though which access to a simulation model for behavior of at least one field device occurs for the software tool; and starting the at least one field device virtually via the software tool, the behavior of the at least one field device being simulated via the simulation model. 7. The method as claimed in claim 6, wherein access to a simulation model for a process is additionally made possible for the software tool by the extension of the user interface plug-in. 8. The method as claimed in claim 7, wherein the simulation model for a process contains prefabricated stimulation patterns and is stored in the user interface plug-in. 9. The method as claimed in claim 7, wherein access to the simulation model for the process occurs via a co-simulation coupling, through which a process model that is unstored in the user interface plug-in, is linked to the model for the field device behavior. 10. The method as claimed in claim 8, wherein access to the simulation model for the process occurs via a co-simulation coupling, through which a process model that is unstored in the user interface plug-in, is linked to the model for the field device behavior. 11. A field device, comprising:
a processor; and a field device integration package including a user interface plug-in having an extension through which access by a software tool to a simulation model for behavior of the field device occurs. | 2,100 |
5,479 | 5,479 | 14,680,013 | 2,173 | One embodiment provides a system of exchanging information between at least two parties over a network. The system includes a chat room generator module, executed by one or more processors, to receive a comparison result between an first key word search from a first party and a second key word used in a search query from a second party via a network, and to generate a chat room embedded into a search result web page associated with the search query, when the comparison result indicates no substantial similarity between the first key word and the second key word. A chat room admission module may then admit a third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and a third key word used in a search query by the third party via the network. | 1. A system comprising:
one or more processors; and a chat room generator module, executed by the one or more processors, configured to receive a comparison result between a first key word from a first party and a second key word used in a search query from a second party via a network, and to generate a chat room embedded into a search result web page associated with the search query, when the comparison result indicates no substantial similarity between the first key word and the second key word. 2. The system of claim 1, further comprising:
a chat room admission module configured to automatically admit a third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and a third key word used in a search query by the third party via the network. 3. The system of claim 2, further comprising:
a passing through window control module configured to display a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 4. The system of claim 2, further comprising:
a key word comparator module configured to:
compare the first key word and the second key word and generate the comparison result; and
compare the second key word and the third key word and generate the comparison result. 5. The system of claim 2, further comprising:
a messenger module configured to enable the second party and the third party to exchange information within the chat room. 6. The system of claim 1, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 7. The system of claim 2, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 8. The system of claim 2, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. 9. A method comprising:
prompting a first party to enter a first key word; prompting a second party to enter a second key word in a search query; comparing the first keyword and the second keyword; and based on the comparison result that indicates no substantial similarity between the first key word and the second key word, creating a chat room embedded into a search result web page associated with the search query. 10. The method of claim 9, further comprising:
prompting a third party to enter a third key word in a search query; comparing the second keyword and the third keyword; and admitting the third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and the third key word. 11. The method of claim 10, further comprising displaying a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 12. The method of claim 9, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 13. The method of claim 10, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 14. The method of claim 10, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. 15. A non-transitory machine-readable medium comprising instructions, which when implemented by one or more processors, cause the machine to perform the following operations:
prompting a first party to enter a first key word; prompting a second party to enter a second key word in a search query; comparing the first keyword and the second keyword; and based on the comparison result that indicates no substantial similarity between the first key word and the second key word, creating a chat room embedded into a search result web page associated with the search query. 16. The method of claim 15, further comprising:
prompting a third party to enter a third key word in a search query; comparing the second keyword and the third keyword; and admitting the third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and the third key word. 17. The method of claim 16, further comprising displaying a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 18. The method of claim 15, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 19. The method of claim 16, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 20. The method of claim 16, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. | One embodiment provides a system of exchanging information between at least two parties over a network. The system includes a chat room generator module, executed by one or more processors, to receive a comparison result between an first key word search from a first party and a second key word used in a search query from a second party via a network, and to generate a chat room embedded into a search result web page associated with the search query, when the comparison result indicates no substantial similarity between the first key word and the second key word. A chat room admission module may then admit a third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and a third key word used in a search query by the third party via the network.1. A system comprising:
one or more processors; and a chat room generator module, executed by the one or more processors, configured to receive a comparison result between a first key word from a first party and a second key word used in a search query from a second party via a network, and to generate a chat room embedded into a search result web page associated with the search query, when the comparison result indicates no substantial similarity between the first key word and the second key word. 2. The system of claim 1, further comprising:
a chat room admission module configured to automatically admit a third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and a third key word used in a search query by the third party via the network. 3. The system of claim 2, further comprising:
a passing through window control module configured to display a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 4. The system of claim 2, further comprising:
a key word comparator module configured to:
compare the first key word and the second key word and generate the comparison result; and
compare the second key word and the third key word and generate the comparison result. 5. The system of claim 2, further comprising:
a messenger module configured to enable the second party and the third party to exchange information within the chat room. 6. The system of claim 1, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 7. The system of claim 2, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 8. The system of claim 2, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. 9. A method comprising:
prompting a first party to enter a first key word; prompting a second party to enter a second key word in a search query; comparing the first keyword and the second keyword; and based on the comparison result that indicates no substantial similarity between the first key word and the second key word, creating a chat room embedded into a search result web page associated with the search query. 10. The method of claim 9, further comprising:
prompting a third party to enter a third key word in a search query; comparing the second keyword and the third keyword; and admitting the third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and the third key word. 11. The method of claim 10, further comprising displaying a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 12. The method of claim 9, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 13. The method of claim 10, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 14. The method of claim 10, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. 15. A non-transitory machine-readable medium comprising instructions, which when implemented by one or more processors, cause the machine to perform the following operations:
prompting a first party to enter a first key word; prompting a second party to enter a second key word in a search query; comparing the first keyword and the second keyword; and based on the comparison result that indicates no substantial similarity between the first key word and the second key word, creating a chat room embedded into a search result web page associated with the search query. 16. The method of claim 15, further comprising:
prompting a third party to enter a third key word in a search query; comparing the second keyword and the third keyword; and admitting the third party into the chat room based on a comparison result that indicates substantial similarity between the second key word and the third key word. 17. The method of claim 16, further comprising displaying a passing through window in the chat room, the passing through window including a name of the third party being temporarily displayed and the name of the third party being selectable by the second party to invite the third party into the chat room before the name of the third party disappears. 18. The method of claim 15, wherein the comparison result indicates no substantial similarity based on a number of characters that the first key word and second key word have in common being less than a specified threshold. 19. The method of claim 16, wherein the comparison result indicates substantial similarity based on a number of characters that are not common to both the first key word and second key word being less than a specified threshold. 20. The method of claim 16, wherein the comparison result indicates substantial similarity based on the first key word and second key word being alternate spellings or the first key word and second key word being synonyms. | 2,100 |
5,480 | 5,480 | 14,024,273 | 2,176 | Transforming a website for dynamic web content management includes identifying aspects of a static website that are to be under dynamic web content management, organizing the aspects of the static website in preparation for storing the aspects, and storing the aspects of the static website with a specific identifier. | 1. A method for transforming a website for dynamic web content management, said method comprising:
identifying aspects of a static website that are to be under dynamic web content management; organizing said aspects of said static website in preparation for storing said aspects; and storing said aspects of said static website with a specific identifier. 2. The method of claim 1, further comprising loading a static website in a browser, in a graphical user interface (GUI) tool, or combinations thereof on a user device. 3. The method of claim 1, further comprising producing at least one presentation template based on a webpage for said static website using a conversion tool. 4. The method of claim 3, further comprising producing a specific presentation template for an additional webpage within said static website. 5. The method of claim 1, further comprising populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 6. The method of claim 5, further comprising associating said navigation node with said presentation template in said web content library using an authoring template. 7. The method of claim 5, further comprising associating said navigation node with said content item in said web content library using said authoring template. 8. The method of claim 7, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. 9. A method for transforming a website for dynamic web content management, said method comprising:
producing at least one presentation template based on a webpage for a static website using a conversion tool; identifying aspects of said static website that are to be under dynamic web content management; organizing said aspects of said static website in preparation for storing said aspects; storing said aspects of said static website with a specific identifier; and populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 10. The method of claim 9, further comprising loading a static website in a browser, in a GUI tool, or combinations thereof on a user device. 11. The method of claim 9, further comprising producing a specific presentation template for an additional webpage within said static website. 12. The method of claim 9, further comprising associating said navigation node with said presentation template in said web content library using an authoring template. 13. The method of claim 12, further comprising associating said navigation node with said content item in said web content library using said authoring template. 14. The method of claim 9, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. 15. The method of claim 14, further comprising mapping an additional content item to a specific presentation template at a specific navigation node wherein said authoring template is associated with said additional content item. 16. A method for transforming a website for dynamic web content management, said method comprising:
identifying aspects of a static website that are to be under dynamic web content management; and populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 17. The method of claim 16, further comprising:
organizing said aspects of said static website in preparation for storing said aspects; and storing said aspects of said static website with a specific identifier. 18. The method of claim 16, further comprising producing at least one presentation template based on a webpage for said static website using a conversion tool. 19. The method of claim 16, further comprising:
associating said navigation node with said presentation template in said web content library using an authoring template; and associating said navigation node with said content item in said web content library using said authoring template. 20. The method of claim 16, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. | Transforming a website for dynamic web content management includes identifying aspects of a static website that are to be under dynamic web content management, organizing the aspects of the static website in preparation for storing the aspects, and storing the aspects of the static website with a specific identifier.1. A method for transforming a website for dynamic web content management, said method comprising:
identifying aspects of a static website that are to be under dynamic web content management; organizing said aspects of said static website in preparation for storing said aspects; and storing said aspects of said static website with a specific identifier. 2. The method of claim 1, further comprising loading a static website in a browser, in a graphical user interface (GUI) tool, or combinations thereof on a user device. 3. The method of claim 1, further comprising producing at least one presentation template based on a webpage for said static website using a conversion tool. 4. The method of claim 3, further comprising producing a specific presentation template for an additional webpage within said static website. 5. The method of claim 1, further comprising populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 6. The method of claim 5, further comprising associating said navigation node with said presentation template in said web content library using an authoring template. 7. The method of claim 5, further comprising associating said navigation node with said content item in said web content library using said authoring template. 8. The method of claim 7, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. 9. A method for transforming a website for dynamic web content management, said method comprising:
producing at least one presentation template based on a webpage for a static website using a conversion tool; identifying aspects of said static website that are to be under dynamic web content management; organizing said aspects of said static website in preparation for storing said aspects; storing said aspects of said static website with a specific identifier; and populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 10. The method of claim 9, further comprising loading a static website in a browser, in a GUI tool, or combinations thereof on a user device. 11. The method of claim 9, further comprising producing a specific presentation template for an additional webpage within said static website. 12. The method of claim 9, further comprising associating said navigation node with said presentation template in said web content library using an authoring template. 13. The method of claim 12, further comprising associating said navigation node with said content item in said web content library using said authoring template. 14. The method of claim 9, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. 15. The method of claim 14, further comprising mapping an additional content item to a specific presentation template at a specific navigation node wherein said authoring template is associated with said additional content item. 16. A method for transforming a website for dynamic web content management, said method comprising:
identifying aspects of a static website that are to be under dynamic web content management; and populating a web content library with web content components, hyperlinks, presentation templates, navigation nodes, content items, or combinations thereof. 17. The method of claim 16, further comprising:
organizing said aspects of said static website in preparation for storing said aspects; and storing said aspects of said static website with a specific identifier. 18. The method of claim 16, further comprising producing at least one presentation template based on a webpage for said static website using a conversion tool. 19. The method of claim 16, further comprising:
associating said navigation node with said presentation template in said web content library using an authoring template; and associating said navigation node with said content item in said web content library using said authoring template. 20. The method of claim 16, further comprising mapping said content item to said presentation template at said navigation node wherein said authoring template is associated with said content item. | 2,100 |
5,481 | 5,481 | 15,088,502 | 2,176 | A plurality of annotations can be received for a presentation presented in a web conference. For each of the plurality of annotations, a respective portion of the presentation to which the annotation pertains can be determined, and a respective relevance parameter can be assigned to the annotation. The relevance parameter can indicate a relevance of the annotation to the respective portion of the presentation to which the annotation pertains. For each of the plurality of annotations, the annotation can be assigned to a respective location of a view based on the relevance parameter assigned to the annotation and the annotation can be presented in the respective location of the view to which the annotation is assigned. | 1-7. (canceled) 8. A system, comprising:
a processor programmed to initiate executable operations comprising: receiving a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining a respective portion of the presentation to which the annotation pertains;
assigning to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting the annotation in the respective location of the view to which the annotation is assigned. 9. The system of claim 8, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 10. The system of claim 8, the executable operations further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 11. The system of claim 8, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 12. The system of claim 8, the executable operations further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 13. The system of claim 8, the executable operations further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 14. The system of claim 8, the executable operations further comprising”
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining, by the processor, a respective portion of the presentation to which the annotation pertains;
assigning, by the processor, to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning, by the processor, the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting, by the processor, the annotation in the respective location of the view to which the annotation is assigned. 16. The computer program product of claim 15, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 17. The computer program product of claim 15, the method further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 18. The computer program product of claim 15, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 19. The computer program product of claim 15, the method further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 20. The computer program product of claim 15, the method further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 21. The computer program product of claim 15, the method further comprising:
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. | A plurality of annotations can be received for a presentation presented in a web conference. For each of the plurality of annotations, a respective portion of the presentation to which the annotation pertains can be determined, and a respective relevance parameter can be assigned to the annotation. The relevance parameter can indicate a relevance of the annotation to the respective portion of the presentation to which the annotation pertains. For each of the plurality of annotations, the annotation can be assigned to a respective location of a view based on the relevance parameter assigned to the annotation and the annotation can be presented in the respective location of the view to which the annotation is assigned.1-7. (canceled) 8. A system, comprising:
a processor programmed to initiate executable operations comprising: receiving a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining a respective portion of the presentation to which the annotation pertains;
assigning to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting the annotation in the respective location of the view to which the annotation is assigned. 9. The system of claim 8, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 10. The system of claim 8, the executable operations further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 11. The system of claim 8, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 12. The system of claim 8, the executable operations further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 13. The system of claim 8, the executable operations further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 14. The system of claim 8, the executable operations further comprising”
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining, by the processor, a respective portion of the presentation to which the annotation pertains;
assigning, by the processor, to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning, by the processor, the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting, by the processor, the annotation in the respective location of the view to which the annotation is assigned. 16. The computer program product of claim 15, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 17. The computer program product of claim 15, the method further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 18. The computer program product of claim 15, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 19. The computer program product of claim 15, the method further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 20. The computer program product of claim 15, the method further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 21. The computer program product of claim 15, the method further comprising:
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. | 2,100 |
5,482 | 5,482 | 15,596,477 | 2,176 | A plurality of annotations can be received for a presentation presented in a web conference. For each of the plurality of annotations, a respective portion of the presentation to which the annotation pertains can be determined, and a respective relevance parameter can be assigned to the annotation. The relevance parameter can indicate a relevance of the annotation to the respective portion of the presentation to which the annotation pertains. For each of the plurality of annotations, the annotation can be assigned to a respective location of a view based on the relevance parameter assigned to the annotation and the annotation can be presented in the respective location of the view to which the annotation is assigned. | 1. A method comprising:
receiving a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining a respective portion of the presentation to which the annotation pertains;
assigning to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning, using a processor, the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting the annotation in the respective location of the view to which the annotation is assigned. 2. The method of claim 1, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 3. The method of claim 1, further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 4. The method of claim 1, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 5. The method of claim 1, further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 6. The method of claim 1, further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 7. The method of claim 1, further comprising:
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. 8-20. (canceled) | A plurality of annotations can be received for a presentation presented in a web conference. For each of the plurality of annotations, a respective portion of the presentation to which the annotation pertains can be determined, and a respective relevance parameter can be assigned to the annotation. The relevance parameter can indicate a relevance of the annotation to the respective portion of the presentation to which the annotation pertains. For each of the plurality of annotations, the annotation can be assigned to a respective location of a view based on the relevance parameter assigned to the annotation and the annotation can be presented in the respective location of the view to which the annotation is assigned.1. A method comprising:
receiving a plurality of annotations for a presentation presented in a web conference; and for each of the plurality of annotations:
determining a respective portion of the presentation to which the annotation pertains;
assigning to the annotation a respective relevance parameter, wherein the relevance parameter indicates a relevance of the annotation to the respective portion of the presentation to which the annotation pertains;
assigning, using a processor, the annotation to a respective location of a view based on the relevance parameter assigned to the annotation; and
presenting the annotation in the respective location of the view to which the annotation is assigned. 2. The method of claim 1, wherein determining the respective portion of the presentation to which the annotation pertains comprises:
performing natural language processing on the annotation and content of the presentation. 3. The method of claim 1, further comprising:
determining the relevance parameter by determining a level of correlation between the annotation and the respective portion of the presentation to which the annotation pertains, determining the level of correlation comprising applying regression analysis at least on results of natural language processing performed on the annotation and content of the presentation. 4. The method of claim 1, wherein the respective location of the view to which the annotation is assigned is different than a location of the view where the annotation originally was provided. 5. The method of claim 1, further comprising:
determining whether the relevance parameter exceeds a threshold value; wherein assigning the annotation to the respective location of the view based on the relevance parameter assigned to the annotation is based, at least in part, on the relevance parameter exceeding the threshold value. 6. The method of claim 1, further comprising:
wherein the respective location of the view to which the annotation is assigned is where clear space in the presentation is identified. 7. The method of claim 1, further comprising:
responsive to assigning the annotation to a respective location of a view, reserving that location exclusively for the annotation. 8-20. (canceled) | 2,100 |
5,483 | 5,483 | 14,702,057 | 2,196 | Disclosed herein are methods, systems, and software to enhance the testing of race conditions in programs. In one example, a method of testing race conditions in a target program with one or more concurrent processes includes generating a scheduling program based on race conditions identified in the target program, wherein the scheduling program includes order of operation rules for the one or more concurrent processes. The method further provides initiating execution of the scheduling program, and executing the target program based on the order of operation rules for the one or more concurrent processes. | 1. A method of operating a computing system to test race conditions in a target program, the method comprising:
executing a scheduler program, the scheduler program comprising order of operation rules for testing race conditions in the target program based on the race conditions in the target program; initiating execution of the target program, wherein the target program comprises one or more concurrent processes; and executing each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program, wherein the order of operation rules control operation of the one or more concurrent processes to test the race conditions in the target program. 2. The method of claim 1 wherein the order of operation rules for the target program comprises state rules for the one or more concurrent processes. 3. The method of claim 2, wherein the target program further comprises state identifiers for the one or more concurrent processes, and wherein executing each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program comprises executing each concurrent process in the one or more concurrent processes based on the state rules and the state identifiers. 4. The method of claim 2 wherein the state rules for the one or more concurrent processes comprise rules to hold, continue, or delay concurrent processes. 5. The method of claim 1 further comprising receiving user input to generate the scheduler program. 6. The method of claim 1 wherein executing the scheduler program comprises initiating a thread for the scheduler program. 7. The method of claim 1 wherein executing the scheduler program comprises executing the scheduler program in response to initiating the execution of the target program. 8. The method of claim 7 wherein executing the scheduler program in response to initiating the execution of the target program comprises:
identifying a call from the target program to execute the scheduler program; and
in response to the call, executing the scheduler program. 9. The method of claim 8 further comprising:
in response to identifying the call, holding execution of the target program; and
in response to executing the scheduler program, continuing execution of the scheduler program. 10. An apparatus to perform testing of race conditions in a target program, the apparatus comprising:
one or more computer readable media; and processing instructions stored on the one or more computer readable media that, when executed by a processing system, direct the processing system to:
execute a scheduler program, the scheduler program comprising order of operation rules for testing race conditions in the target program based on the race conditions in the target program;
initiate execution of the target program, wherein the target program comprises one or more concurrent processes; and
execute each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program, wherein the order of operation rules control operation of the one or more concurrent processes. 11. The apparatus of claim 10, wherein the order of operation rules for the target program comprises state rules for the one or more concurrent processes. 12. The apparatus of claim 11, wherein the target program further comprises state identifiers for the one or more concurrent processes, and wherein the processing instructions to execute each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program direct the computing system to execute each concurrent process in the one or more concurrent processes based on the state rules and the state identifiers. 13. The apparatus of claim 11, wherein the state rules for the one or more concurrent processes comprise rules to hold, continue, or delay concurrent processes. 14. The apparatus of claim 10, wherein the processing instructions further direct the computing system to receive user input to generate the scheduler program. 15. The apparatus of claim 10, wherein the processing instructions to execute the scheduler program direct the processing system to initiate a thread for the scheduler program. 16. The apparatus of claim 10, wherein the processing instructions to execute the scheduler program direct the processing system to execute the scheduler program in response to initiating the execution of the target program. 17. The apparatus of claim 16, wherein the processing instructions to execute the scheduler program in response to initiating the execution of the target program direct the processing system to:
identify a call from the target program to execute the scheduler program; in response to the call, execute the scheduler program. 18. The apparatus of claim 10, wherein the scheduler program and the target program comprise programs written in different programming languages. 19. A method of testing race conditions in a target program with one or more concurrent processes, the method comprising:
generating a scheduling program based on the race conditions identified in the target program, wherein the scheduling program includes order of operation rules for testing race conditions in the one or more concurrent processes; initiating execution of the scheduling program; and executing the target program based on the order of operation rules for the one or more concurrent processes wherein the order of operation rules control operation of the one or more concurrent processes. 20. The method of claim 19 wherein the order of operation rules comprises state rules corresponding to states for each concurrent process in the one or more concurrent processes. | Disclosed herein are methods, systems, and software to enhance the testing of race conditions in programs. In one example, a method of testing race conditions in a target program with one or more concurrent processes includes generating a scheduling program based on race conditions identified in the target program, wherein the scheduling program includes order of operation rules for the one or more concurrent processes. The method further provides initiating execution of the scheduling program, and executing the target program based on the order of operation rules for the one or more concurrent processes.1. A method of operating a computing system to test race conditions in a target program, the method comprising:
executing a scheduler program, the scheduler program comprising order of operation rules for testing race conditions in the target program based on the race conditions in the target program; initiating execution of the target program, wherein the target program comprises one or more concurrent processes; and executing each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program, wherein the order of operation rules control operation of the one or more concurrent processes to test the race conditions in the target program. 2. The method of claim 1 wherein the order of operation rules for the target program comprises state rules for the one or more concurrent processes. 3. The method of claim 2, wherein the target program further comprises state identifiers for the one or more concurrent processes, and wherein executing each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program comprises executing each concurrent process in the one or more concurrent processes based on the state rules and the state identifiers. 4. The method of claim 2 wherein the state rules for the one or more concurrent processes comprise rules to hold, continue, or delay concurrent processes. 5. The method of claim 1 further comprising receiving user input to generate the scheduler program. 6. The method of claim 1 wherein executing the scheduler program comprises initiating a thread for the scheduler program. 7. The method of claim 1 wherein executing the scheduler program comprises executing the scheduler program in response to initiating the execution of the target program. 8. The method of claim 7 wherein executing the scheduler program in response to initiating the execution of the target program comprises:
identifying a call from the target program to execute the scheduler program; and
in response to the call, executing the scheduler program. 9. The method of claim 8 further comprising:
in response to identifying the call, holding execution of the target program; and
in response to executing the scheduler program, continuing execution of the scheduler program. 10. An apparatus to perform testing of race conditions in a target program, the apparatus comprising:
one or more computer readable media; and processing instructions stored on the one or more computer readable media that, when executed by a processing system, direct the processing system to:
execute a scheduler program, the scheduler program comprising order of operation rules for testing race conditions in the target program based on the race conditions in the target program;
initiate execution of the target program, wherein the target program comprises one or more concurrent processes; and
execute each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program, wherein the order of operation rules control operation of the one or more concurrent processes. 11. The apparatus of claim 10, wherein the order of operation rules for the target program comprises state rules for the one or more concurrent processes. 12. The apparatus of claim 11, wherein the target program further comprises state identifiers for the one or more concurrent processes, and wherein the processing instructions to execute each concurrent process in the one or more concurrent processes based on the order of operation rules for the target program direct the computing system to execute each concurrent process in the one or more concurrent processes based on the state rules and the state identifiers. 13. The apparatus of claim 11, wherein the state rules for the one or more concurrent processes comprise rules to hold, continue, or delay concurrent processes. 14. The apparatus of claim 10, wherein the processing instructions further direct the computing system to receive user input to generate the scheduler program. 15. The apparatus of claim 10, wherein the processing instructions to execute the scheduler program direct the processing system to initiate a thread for the scheduler program. 16. The apparatus of claim 10, wherein the processing instructions to execute the scheduler program direct the processing system to execute the scheduler program in response to initiating the execution of the target program. 17. The apparatus of claim 16, wherein the processing instructions to execute the scheduler program in response to initiating the execution of the target program direct the processing system to:
identify a call from the target program to execute the scheduler program; in response to the call, execute the scheduler program. 18. The apparatus of claim 10, wherein the scheduler program and the target program comprise programs written in different programming languages. 19. A method of testing race conditions in a target program with one or more concurrent processes, the method comprising:
generating a scheduling program based on the race conditions identified in the target program, wherein the scheduling program includes order of operation rules for testing race conditions in the one or more concurrent processes; initiating execution of the scheduling program; and executing the target program based on the order of operation rules for the one or more concurrent processes wherein the order of operation rules control operation of the one or more concurrent processes. 20. The method of claim 19 wherein the order of operation rules comprises state rules corresponding to states for each concurrent process in the one or more concurrent processes. | 2,100 |
5,484 | 5,484 | 14,172,677 | 2,167 | A literary recommendation engine is used to receive an object of interest to a user and make a recommendation based on the received object. For example, a user may provide a name of a book or author and receive a list of recommendations that a services determines to be responsive to the user's interests based on a profile for the “seed” book (or author) and/or the user profile. | 1. A method of developing a database of literary content, the method comprising:
receiving, from a first data source, a first description of a first literary object; receiving, from a second data source, a second description of a second literary object; relating the first description of the first literary object to the second description of the second literary object; determining, based on relating the first description of the first literary object to the second description of the second literary object, a degree of correlation; accessing a threshold used to determine whether two objects are related; comparing the threshold with the degree of correlation; and determining, based on comparing the degree of correlation with the threshold, whether the first literary object and the second literary object are related. 2. The method of claim 1 further comprising:
consolidating the first literary object and the second literary object into a merged record that includes a first aspect of the first literary object and a second aspect of the second literary object. 3. A method of recommending a literary object to a user, the method comprising:
identifying a first literary object in a database of literary objects; developing a first model for the first literary object; accessing a first stream of content with a sequence of records that includes a first record; identifying a relationship between the first record and the first literary object; identifying a first aspect from the first record; modifying the first literary object to reflect the first aspect; accessing a user profile; identifying, from within the user profile, interests across one or more dimensions; identifying a subset of the interests with a stronger magnitude; determining that the first literary object is responsive to the subset of interests with the stronger magnitude; and presenting a description of the first literary object to the user with the user profile. 4. A method of recommending a literary object to a user, the method comprising:
identifying a first literary object in a database of literary objects; developing a first model for the first literary object; accessing a first stream of content with a sequence of records that includes a first record; identifying a relationship between the first record and the first literary object; identifying a first aspect from the first record; modifying the first literary object to reflect the first aspect; receiving a user request for content that reflects a seed item; identifying, a seed profile for a seed item with one or more dimensions; identifying a subset of the interests with a stronger magnitude for the seed profile; accessing a user request for the user; determining that the first literary object is responsive to the subset of interests with the stronger magnitude; and presenting a description of the first literary object to the user with the user profile in a list of literary objects. | A literary recommendation engine is used to receive an object of interest to a user and make a recommendation based on the received object. For example, a user may provide a name of a book or author and receive a list of recommendations that a services determines to be responsive to the user's interests based on a profile for the “seed” book (or author) and/or the user profile.1. A method of developing a database of literary content, the method comprising:
receiving, from a first data source, a first description of a first literary object; receiving, from a second data source, a second description of a second literary object; relating the first description of the first literary object to the second description of the second literary object; determining, based on relating the first description of the first literary object to the second description of the second literary object, a degree of correlation; accessing a threshold used to determine whether two objects are related; comparing the threshold with the degree of correlation; and determining, based on comparing the degree of correlation with the threshold, whether the first literary object and the second literary object are related. 2. The method of claim 1 further comprising:
consolidating the first literary object and the second literary object into a merged record that includes a first aspect of the first literary object and a second aspect of the second literary object. 3. A method of recommending a literary object to a user, the method comprising:
identifying a first literary object in a database of literary objects; developing a first model for the first literary object; accessing a first stream of content with a sequence of records that includes a first record; identifying a relationship between the first record and the first literary object; identifying a first aspect from the first record; modifying the first literary object to reflect the first aspect; accessing a user profile; identifying, from within the user profile, interests across one or more dimensions; identifying a subset of the interests with a stronger magnitude; determining that the first literary object is responsive to the subset of interests with the stronger magnitude; and presenting a description of the first literary object to the user with the user profile. 4. A method of recommending a literary object to a user, the method comprising:
identifying a first literary object in a database of literary objects; developing a first model for the first literary object; accessing a first stream of content with a sequence of records that includes a first record; identifying a relationship between the first record and the first literary object; identifying a first aspect from the first record; modifying the first literary object to reflect the first aspect; receiving a user request for content that reflects a seed item; identifying, a seed profile for a seed item with one or more dimensions; identifying a subset of the interests with a stronger magnitude for the seed profile; accessing a user request for the user; determining that the first literary object is responsive to the subset of interests with the stronger magnitude; and presenting a description of the first literary object to the user with the user profile in a list of literary objects. | 2,100 |
5,485 | 5,485 | 15,332,125 | 2,179 | An apparatus for performing split display is disclosed. The apparatus includes various interfaces through which a group of information processing devices can be connected to the apparatus, a user interface (UI) module that accepts a user operation, and a screen split module that splits a display area of a display into a set of display areas. The screen split module also allocates the display areas to the group of information processing devices accordingly, and displays pieces of display information that are input from the group of information processing devices via the interfaces in the respective display areas. The screen split module may set a display attribute of each of the display areas in response to the user operation that has been accepted via the UI module. | 1. An apparatus for performing split screen display, said apparatus comprising:
a plurality of interfaces through which a plurality of information processing devices are connected to said apparatus; a user interface (UI) module for receiving a user operation; and a screen split module for splitting a display screen into a plurality of display areas, for allocating said display areas to said plurality of information processing devices accordingly, and for displaying various display information from said plurality of information processing devices via said interfaces on said display areas accordingly, wherein said screen split module also sets a display attribute of each of said display areas in response to said user operation that has been accepted by said UI module. 2. The apparatus of claim 1, wherein said display attribute includes a display position and a display size of each of said display areas. 3. The apparatus of claim 1, wherein said display attribute includes a display direction of said display information. 4. The apparatus of claim 1, wherein said display attribute includes a display shape. 5. The apparatus of claim 1, wherein said display attribute includes mirroring of said display information to be displayed on one of said display areas. 6. The apparatus of claim 1, wherein two of said display areas are displayed in an overlapping state. 7. The apparatus of claim 1, wherein said UI module accepts said user operation via a remote control device, an operation button disposed on a chassis of the device, a touch sensor disposed in said display screen of said display, a sensor adapted to detect a gesture of a user. 8. A method comprising:
receiving a user operation via an receiver; splitting a display screen into a plurality of display areas; allocating said plurality of display areas to a plurality of information processing devices that are connected to said receiver accordingly; setting a display attribute of each of said allocated display areas to each of said information processing device in response to a user operation; and displaying various display information coming from each of said plurality of information processing devices in each of said allocated display areas for which said display attribute has been set accordingly. 9. The method of claim 8, wherein said display attribute includes a display position and a display size of each of said allocated display areas. 10. The method of claim 8, wherein said display attribute includes a display direction of said display information. 11. The method of claim 8, wherein said display attribute includes a display shape. 12. The method of claim 8, wherein said display attribute includes mirroring of said display information to be displayed on one of said display areas. 13. The method of claim 8, wherein two of said display areas are displayed in an overlapping state. 14. A computer readable storage medium having a program product for performing split screen display, said computer readable storage medium comprising:
computer code for receiving a user operation via an receiver; computer code for splitting a display screen into a plurality of display areas; computer code for allocating said plurality of display areas to a plurality of information processing devices that are connected to said receiver accordingly; computer code for setting a display attribute of each of said allocated display areas to each of said information processing device in response to a user operation, wherein said display attribute includes a display position and a display size of each of said allocated display areas; and computer code for displaying various display information coming from each of said plurality of information processing devices in each of said allocated display areas for which said display attribute has been set accordingly. | An apparatus for performing split display is disclosed. The apparatus includes various interfaces through which a group of information processing devices can be connected to the apparatus, a user interface (UI) module that accepts a user operation, and a screen split module that splits a display area of a display into a set of display areas. The screen split module also allocates the display areas to the group of information processing devices accordingly, and displays pieces of display information that are input from the group of information processing devices via the interfaces in the respective display areas. The screen split module may set a display attribute of each of the display areas in response to the user operation that has been accepted via the UI module.1. An apparatus for performing split screen display, said apparatus comprising:
a plurality of interfaces through which a plurality of information processing devices are connected to said apparatus; a user interface (UI) module for receiving a user operation; and a screen split module for splitting a display screen into a plurality of display areas, for allocating said display areas to said plurality of information processing devices accordingly, and for displaying various display information from said plurality of information processing devices via said interfaces on said display areas accordingly, wherein said screen split module also sets a display attribute of each of said display areas in response to said user operation that has been accepted by said UI module. 2. The apparatus of claim 1, wherein said display attribute includes a display position and a display size of each of said display areas. 3. The apparatus of claim 1, wherein said display attribute includes a display direction of said display information. 4. The apparatus of claim 1, wherein said display attribute includes a display shape. 5. The apparatus of claim 1, wherein said display attribute includes mirroring of said display information to be displayed on one of said display areas. 6. The apparatus of claim 1, wherein two of said display areas are displayed in an overlapping state. 7. The apparatus of claim 1, wherein said UI module accepts said user operation via a remote control device, an operation button disposed on a chassis of the device, a touch sensor disposed in said display screen of said display, a sensor adapted to detect a gesture of a user. 8. A method comprising:
receiving a user operation via an receiver; splitting a display screen into a plurality of display areas; allocating said plurality of display areas to a plurality of information processing devices that are connected to said receiver accordingly; setting a display attribute of each of said allocated display areas to each of said information processing device in response to a user operation; and displaying various display information coming from each of said plurality of information processing devices in each of said allocated display areas for which said display attribute has been set accordingly. 9. The method of claim 8, wherein said display attribute includes a display position and a display size of each of said allocated display areas. 10. The method of claim 8, wherein said display attribute includes a display direction of said display information. 11. The method of claim 8, wherein said display attribute includes a display shape. 12. The method of claim 8, wherein said display attribute includes mirroring of said display information to be displayed on one of said display areas. 13. The method of claim 8, wherein two of said display areas are displayed in an overlapping state. 14. A computer readable storage medium having a program product for performing split screen display, said computer readable storage medium comprising:
computer code for receiving a user operation via an receiver; computer code for splitting a display screen into a plurality of display areas; computer code for allocating said plurality of display areas to a plurality of information processing devices that are connected to said receiver accordingly; computer code for setting a display attribute of each of said allocated display areas to each of said information processing device in response to a user operation, wherein said display attribute includes a display position and a display size of each of said allocated display areas; and computer code for displaying various display information coming from each of said plurality of information processing devices in each of said allocated display areas for which said display attribute has been set accordingly. | 2,100 |
5,486 | 5,486 | 14,726,567 | 2,199 | The present disclosure provides a method, computer program product, and system for compensating for event counts for a thread occurring during targeted states on the thread. In example embodiments, the state is a spin loop state and instructions completed during the spin loop are eliminated from a performance report and are presented in the absence of the spin loop. In another embodiment, the event counts are interrupt counts eliminated during the spin loop. | 1. A method for factoring out event counts for a routine in a thread state targeted for elimination of event counts comprising:
accumulating events counts as a per thread base time; and attributing the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 2. The method of claim 1, wherein the thread state is a software spin loop. 3. The method of claim 1, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 4. The method of claim 1, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 5. The method of claim 1, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 6. The method of claim 1, wherein the thread state is spinning and the event counts are interrupt counts for the thread. 7. The method of claim 1, further comprising:
responsive to detecting an entering of the thread state, preventing accumulation of the event counts on the thread; and responsive to detecting an exit from the thread state, permitting accumulation of the event counts on the thread. 8. The method of claim 1, further comprising:
producing a report excluding the event counts during the state on the thread and including the event counts in the report for a different thread. 9. A computer program product stored in a non-transitory computer readable medium, comprising computer instructions that when executed by an information handling system, causes the information handling system to factoring out event counts for a routine in a thread state targeted for elimination of event counts to perform actions comprising:
accumulating events counts as a per thread base time; and attributing the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 10. The computer program product of claim 9, wherein the thread state is a software spin loop. 11. The computer program product of claim 9, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 12. The computer program product of claim 9, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 13. The computer program product of claim 9, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 14. A system for factoring out event counts occurring on a thread during a state targeted for compensation comprising:
a processor; a memory connected to the processor; an application executing on the processor; and wherein the system: accumulates event counts a per thread base time; and attributes the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 15. The system according to claim 14, wherein the thread state is a software spin loop. 16. The system according to claim 14, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 17. The system according to claim 14, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 18. The system according to claim 14, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 19. The system according to claims 14, wherein the thread state is spinning and the event counts are interrupt counts for the thread. 20. The system according to claims 14,
responsive to detecting an entering of the thread state, preventing accumulation of the event counts on the thread; and responsive to detecting an exit from the thread state, permitting accumulation of the event counts on the thread. | The present disclosure provides a method, computer program product, and system for compensating for event counts for a thread occurring during targeted states on the thread. In example embodiments, the state is a spin loop state and instructions completed during the spin loop are eliminated from a performance report and are presented in the absence of the spin loop. In another embodiment, the event counts are interrupt counts eliminated during the spin loop.1. A method for factoring out event counts for a routine in a thread state targeted for elimination of event counts comprising:
accumulating events counts as a per thread base time; and attributing the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 2. The method of claim 1, wherein the thread state is a software spin loop. 3. The method of claim 1, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 4. The method of claim 1, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 5. The method of claim 1, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 6. The method of claim 1, wherein the thread state is spinning and the event counts are interrupt counts for the thread. 7. The method of claim 1, further comprising:
responsive to detecting an entering of the thread state, preventing accumulation of the event counts on the thread; and responsive to detecting an exit from the thread state, permitting accumulation of the event counts on the thread. 8. The method of claim 1, further comprising:
producing a report excluding the event counts during the state on the thread and including the event counts in the report for a different thread. 9. A computer program product stored in a non-transitory computer readable medium, comprising computer instructions that when executed by an information handling system, causes the information handling system to factoring out event counts for a routine in a thread state targeted for elimination of event counts to perform actions comprising:
accumulating events counts as a per thread base time; and attributing the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 10. The computer program product of claim 9, wherein the thread state is a software spin loop. 11. The computer program product of claim 9, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 12. The computer program product of claim 9, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 13. The computer program product of claim 9, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 14. A system for factoring out event counts occurring on a thread during a state targeted for compensation comprising:
a processor; a memory connected to the processor; an application executing on the processor; and wherein the system: accumulates event counts a per thread base time; and attributes the per thread base time to a routine executing instructions on a thread to form an accumulated per thread base time for the routine wherein the accumulated per thread base time is only for executing instructions by the routine outside of a thread state targeted for elimination of event counts. 15. The system according to claim 14, wherein the thread state is a software spin loop. 16. The system according to claim 14, wherein the routine is selected from a group consisting of a method, a subroutine, a procedure, a function, and an instrumented segment. 17. The system according to claim 14, wherein the thread state is a failure to acquire a resource state for the thread and the event counts are instructions completed. 18. The system according to claim 14, wherein the event counts are counted by a performance monitoring unit on a processor executing instructions on the thread. 19. The system according to claims 14, wherein the thread state is spinning and the event counts are interrupt counts for the thread. 20. The system according to claims 14,
responsive to detecting an entering of the thread state, preventing accumulation of the event counts on the thread; and responsive to detecting an exit from the thread state, permitting accumulation of the event counts on the thread. | 2,100 |
5,487 | 5,487 | 12,645,836 | 2,128 | According to one aspect of the present disclosure a method and technique for processor verification using an abstract test case is disclosed. The method comprises identifying a format for an abstract instruction of an abstract test case, selecting an instruction from an instruction pool corresponding to the identified format, and generating a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. | 1. A method comprising:
identifying a format for an abstract instruction of an abstract test case; selecting an instruction from an instruction pool corresponding to the identified format; and generating a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 2. The method of claim 1, further comprising selecting an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identifying the format of the abstract instruction. 3. The method of claim 1, further comprising modifying the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 4. The method of claim 1, further comprising modifying the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 5. The method of claim 1, further comprising generating the abstract instruction by:
selecting an instruction format based on a processor to be verified; selecting at least one register to be defined by the abstract instruction; and building the abstract instruction including an opcode identifier and the at least one register. 6. The method of claim 5, further comprising building the abstract instruction to include an extended opcode identifier. 7. The method of claim 1, wherein selecting the instruction from the instruction pool comprises randomly selecting the instruction from the instruction pool. 8. A system comprising:
a data processing system configured to execute an execution manager, the execution manager configured to execute a real test case for processor verification, the execution manager configured to:
identify a format for an abstract instruction of an abstract test case;
select an instruction from an instruction pool corresponding to the identified format; and
generate the real test case for the processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 9. The system of claim 8, wherein the execution manager is configured to select an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identify the format of the abstract instruction. 10. The system of claim 8, wherein the execution manager is configured to modify the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 11. The system of claim 8, wherein the execution manager is configured to modify the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 12. The system of claim 8, wherein the data processing system is configured to execute an abstract instruction builder, the abstract instruction builder configured to:
select an instruction format based on a processor to be verified; select at least one register to be defined by the abstract instruction; and build the abstract instruction including an opcode identifier and the at least one register. 13. The system of claim 12, wherein the abstract instruction builder is configured to build the abstract instruction to include an extended opcode identifier. 14. The system of claim 8, wherein the execution manager is configured to randomly select the instruction from the instruction pool. 15. A computer program product for memory management, the computer program product 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:
identify a format for an abstract instruction of an abstract test case;
select an instruction from an instruction pool corresponding to the identified format; and
generate a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 16. The computer program product of claim 15, wherein the computer readable program code is configured to select an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identify the format of the abstract instruction. 17. The computer program product of claim 15, wherein the computer readable program code is configured to modify the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 18. The computer program product of claim 15, wherein the computer readable program code is configured to modify the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 19. The computer program product of claim 15, further comprising computer readable program code stored on the computer readable storage medium and configured to:
select an instruction format based on a processor to be verified; select at least one register to be defined by the abstract instruction; and build the abstract instruction including an opcode identifier and the at least one register. 20. The computer program product of claim 15, wherein the computer readable program code is configured to randomly select the instruction from the instruction pool. 21. A method comprising:
receiving a test case for processor verification; determining whether the test case includes an abstract instruction; and in response to determining that the test case includes an abstract instruction:
determining a format of the abstract instruction;
selecting an instruction from an instruction pool based on the format; and
substituting the instruction from the instruction pool for the abstract instruction in the test case. 22. The method of claim 21, further comprising randomly selecting the instruction from the instruction pool. 23. The method of claim 21, further comprising modifying the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 24. The method of claim 21, further comprising modifying the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. | According to one aspect of the present disclosure a method and technique for processor verification using an abstract test case is disclosed. The method comprises identifying a format for an abstract instruction of an abstract test case, selecting an instruction from an instruction pool corresponding to the identified format, and generating a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool.1. A method comprising:
identifying a format for an abstract instruction of an abstract test case; selecting an instruction from an instruction pool corresponding to the identified format; and generating a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 2. The method of claim 1, further comprising selecting an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identifying the format of the abstract instruction. 3. The method of claim 1, further comprising modifying the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 4. The method of claim 1, further comprising modifying the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 5. The method of claim 1, further comprising generating the abstract instruction by:
selecting an instruction format based on a processor to be verified; selecting at least one register to be defined by the abstract instruction; and building the abstract instruction including an opcode identifier and the at least one register. 6. The method of claim 5, further comprising building the abstract instruction to include an extended opcode identifier. 7. The method of claim 1, wherein selecting the instruction from the instruction pool comprises randomly selecting the instruction from the instruction pool. 8. A system comprising:
a data processing system configured to execute an execution manager, the execution manager configured to execute a real test case for processor verification, the execution manager configured to:
identify a format for an abstract instruction of an abstract test case;
select an instruction from an instruction pool corresponding to the identified format; and
generate the real test case for the processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 9. The system of claim 8, wherein the execution manager is configured to select an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identify the format of the abstract instruction. 10. The system of claim 8, wherein the execution manager is configured to modify the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 11. The system of claim 8, wherein the execution manager is configured to modify the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 12. The system of claim 8, wherein the data processing system is configured to execute an abstract instruction builder, the abstract instruction builder configured to:
select an instruction format based on a processor to be verified; select at least one register to be defined by the abstract instruction; and build the abstract instruction including an opcode identifier and the at least one register. 13. The system of claim 12, wherein the abstract instruction builder is configured to build the abstract instruction to include an extended opcode identifier. 14. The system of claim 8, wherein the execution manager is configured to randomly select the instruction from the instruction pool. 15. A computer program product for memory management, the computer program product 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:
identify a format for an abstract instruction of an abstract test case;
select an instruction from an instruction pool corresponding to the identified format; and
generate a real test case for processor verification by modifying the abstract instruction based on the instruction selected from the instruction pool. 16. The computer program product of claim 15, wherein the computer readable program code is configured to select an instruction from the abstract test case and, in response to identifying that the instruction is an abstract instruction, identify the format of the abstract instruction. 17. The computer program product of claim 15, wherein the computer readable program code is configured to modify the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 18. The computer program product of claim 15, wherein the computer readable program code is configured to modify the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. 19. The computer program product of claim 15, further comprising computer readable program code stored on the computer readable storage medium and configured to:
select an instruction format based on a processor to be verified; select at least one register to be defined by the abstract instruction; and build the abstract instruction including an opcode identifier and the at least one register. 20. The computer program product of claim 15, wherein the computer readable program code is configured to randomly select the instruction from the instruction pool. 21. A method comprising:
receiving a test case for processor verification; determining whether the test case includes an abstract instruction; and in response to determining that the test case includes an abstract instruction:
determining a format of the abstract instruction;
selecting an instruction from an instruction pool based on the format; and
substituting the instruction from the instruction pool for the abstract instruction in the test case. 22. The method of claim 21, further comprising randomly selecting the instruction from the instruction pool. 23. The method of claim 21, further comprising modifying the abstract instruction by including an opcode as defined by the instruction in the instruction pool. 24. The method of claim 21, further comprising modifying the abstract instruction by including an extended opcode as defined by the instruction in the instruction pool. | 2,100 |
5,488 | 5,488 | 14,022,776 | 2,173 | An aspect provides a method, including: determining a location of a cursor within a display area provided by multiple monitors; defining in the display area a boundary associated with one or more monitors of the multiple monitors; determining that the location of the cursor is proximate to a predetermined location associated with the boundary; and responsive to the determining, providing a notification to a user. Other aspects are described and claimed. | 1. A method, comprising:
determining a location of a cursor within a display area provided by multiple monitors; defining in the display area a boundary associated with one or more monitors of the multiple monitors; determining that the location of the cursor is proximate to a predetermined location associated with the boundary; and responsive to the determining, providing a notification to a user. 2. The method of claim 1, wherein the boundary is associated with a transition between two of the multiple monitors. 3. The method of claim 2, wherein the boundary comprises multiple boundaries, each of the multiple boundaries being associated with a transition between two of the multiple monitors. 4. The method of claim 3, wherein the notification comprises two or more notifications;
each of the two or more notifications being associated with a different boundary. 5. The method of claim 1, wherein the notification is selected from the group of notifications consisting of: an audible notification, a visual notification, a haptic notification and a requirement for additional input to permit cursor movement. 6. The method of claim 1, wherein the notification is a haptic notification. 7. The method of claim 1, further comprising disabling the notification responsive to user input. 8. The method of claim 5, wherein the requirement for additional input to permit cursor movement comprises requiring additional input to permit the cursor to be transitioned between monitors. 9. The method of claim 8, wherein the requirement for additional input to permit cursor movement comprises requiring speed of cursor movement above a predetermined threshold to transition the cursor between monitors. 10. The method of claim 8, wherein the requirement for additional input to permit cursor movement comprises requiring repeated motion input to transition the cursor between monitors. 11. An information handling device, comprising:
one or more processors; a memory device accessible to the one or more processors and storing code executable by the one or more processors to: determine a location of a cursor within a display area provided by multiple monitors; define in the display area a boundary associated with one or more monitors of the multiple monitors; determine that the location of the cursor is proximate to a predetermined location associated with the boundary; and thereafter provide a notification to a user. 12. The information handling device of claim 11, wherein the boundary is associated with a transition between two of the multiple monitors. 13. The information handling device of claim 12, wherein the boundary comprises multiple boundaries, each of the multiple boundaries being associated with a transition between two of the multiple monitors. 14. The information handling device of claim 13, wherein the notification comprises two or more notifications;
each of the two or more notifications being associated with a different boundary. 15. The information handling device of claim 11, wherein the notification is selected from the group of notifications consisting of: an audible notification, a visual notification, a haptic notification and a requirement for additional input to permit cursor movement. 16. The information handling device of claim 11, wherein the notification is a haptic notification. 17. The information handling device of claim 11, wherein the code is further executable by the one or more processors to disable the notification responsive to user input. 18. The information handling device of claim 15, wherein the requirement for additional input to permit cursor movement comprises requiring additional input to permit the cursor to be transitioned between monitors. 19. The information handling device of claim 18, wherein the requirement for additional input to permit cursor movement comprises requiring additional input in a form selected from the group of:
requiring speed of cursor movement above a predetermined threshold to transition the cursor between monitors; and requiring repeated motion input to transition the cursor between monitors. 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 determine a location of a cursor within a display area provided by multiple monitors; computer readable program code configured to define in the display area a boundary associated with one or more monitors of the multiple monitors; computer readable program code configured to determine that the location of the cursor is proximate to a predetermined location associated with the boundary; and computer readable program code configured to thereafter provide a notification to a user. | An aspect provides a method, including: determining a location of a cursor within a display area provided by multiple monitors; defining in the display area a boundary associated with one or more monitors of the multiple monitors; determining that the location of the cursor is proximate to a predetermined location associated with the boundary; and responsive to the determining, providing a notification to a user. Other aspects are described and claimed.1. A method, comprising:
determining a location of a cursor within a display area provided by multiple monitors; defining in the display area a boundary associated with one or more monitors of the multiple monitors; determining that the location of the cursor is proximate to a predetermined location associated with the boundary; and responsive to the determining, providing a notification to a user. 2. The method of claim 1, wherein the boundary is associated with a transition between two of the multiple monitors. 3. The method of claim 2, wherein the boundary comprises multiple boundaries, each of the multiple boundaries being associated with a transition between two of the multiple monitors. 4. The method of claim 3, wherein the notification comprises two or more notifications;
each of the two or more notifications being associated with a different boundary. 5. The method of claim 1, wherein the notification is selected from the group of notifications consisting of: an audible notification, a visual notification, a haptic notification and a requirement for additional input to permit cursor movement. 6. The method of claim 1, wherein the notification is a haptic notification. 7. The method of claim 1, further comprising disabling the notification responsive to user input. 8. The method of claim 5, wherein the requirement for additional input to permit cursor movement comprises requiring additional input to permit the cursor to be transitioned between monitors. 9. The method of claim 8, wherein the requirement for additional input to permit cursor movement comprises requiring speed of cursor movement above a predetermined threshold to transition the cursor between monitors. 10. The method of claim 8, wherein the requirement for additional input to permit cursor movement comprises requiring repeated motion input to transition the cursor between monitors. 11. An information handling device, comprising:
one or more processors; a memory device accessible to the one or more processors and storing code executable by the one or more processors to: determine a location of a cursor within a display area provided by multiple monitors; define in the display area a boundary associated with one or more monitors of the multiple monitors; determine that the location of the cursor is proximate to a predetermined location associated with the boundary; and thereafter provide a notification to a user. 12. The information handling device of claim 11, wherein the boundary is associated with a transition between two of the multiple monitors. 13. The information handling device of claim 12, wherein the boundary comprises multiple boundaries, each of the multiple boundaries being associated with a transition between two of the multiple monitors. 14. The information handling device of claim 13, wherein the notification comprises two or more notifications;
each of the two or more notifications being associated with a different boundary. 15. The information handling device of claim 11, wherein the notification is selected from the group of notifications consisting of: an audible notification, a visual notification, a haptic notification and a requirement for additional input to permit cursor movement. 16. The information handling device of claim 11, wherein the notification is a haptic notification. 17. The information handling device of claim 11, wherein the code is further executable by the one or more processors to disable the notification responsive to user input. 18. The information handling device of claim 15, wherein the requirement for additional input to permit cursor movement comprises requiring additional input to permit the cursor to be transitioned between monitors. 19. The information handling device of claim 18, wherein the requirement for additional input to permit cursor movement comprises requiring additional input in a form selected from the group of:
requiring speed of cursor movement above a predetermined threshold to transition the cursor between monitors; and requiring repeated motion input to transition the cursor between monitors. 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 determine a location of a cursor within a display area provided by multiple monitors; computer readable program code configured to define in the display area a boundary associated with one or more monitors of the multiple monitors; computer readable program code configured to determine that the location of the cursor is proximate to a predetermined location associated with the boundary; and computer readable program code configured to thereafter provide a notification to a user. | 2,100 |
5,489 | 5,489 | 14,699,858 | 2,129 | The present invention provides a simulation device which is able to obtain a preferred simulation result. The simulation device calculating a solution of an equation including an advective term, includes: a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation, and calculates a solution of the discretization equation, wherein the two operations includes deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. | 1. A simulation device calculating a solution of an equation including an advective term, comprising:
a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation, and calculates a solution of the discretization equation, wherein the two operations includes deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 2. The simulation device according to claim 1,
wherein the term of correcting the error in the conservation form of the advective term is a term of correcting an error which occurs due to the fact that the velocity field does not satisfy a continuity equation. 3. The simulation device according to claim 2,
wherein the term of correcting the error is a term obtained by performing at least an integration which is identical to an integration with respect to the equation with respect to the continuity equation. 4. The simulation device according to claim 2,
wherein the solution calculation unit calculates a velocity field in a next time step by using at least the continuity equation, and the velocity field acquired by the velocity field acquisition unit is a velocity field calculated by the solution calculation unit. 5. The simulation device according to claim 2,
wherein the velocity field acquisition unit acquires a velocity field which is stored in advance. 6. A simulation method calculating a solution of an equation including an advective term, comprising:
a first step of acquiring a velocity field; and a second step of applying the velocity field acquired in the first step to a discretization equation obtained by adding at least two operations to the equation including the advective term, and of calculating a solution of the discretization equation, wherein the two operations include deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 7. A program for functioning a computer as:
a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation including the advective term, and calculates a solution of the discretization equation, wherein the two operations include deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 8. A simulation device estimating a generation source of a diffusion substance which estimates generation source information of fluid on the basis of information from a plurality of observers, comprising:
an observation information obtaining section which obtains position information of the observer and measured concentration information; a virtual ejection spot setting section which sets a plurality of virtual ejection spots in a region which predetermines estimation of a concentration of the diffusion substance; and the device according to claim 1 estimating the concentration of the diffusion substance in the virtual ejection spot on the basis of the position information of the observer, the measured concentration information, and information of the virtual ejection spot. 9. A simulation method estimating a generation source of a diffusion substance which estimates generation source information of fluid on the basis of information from a plurality of observers, the method comprising:
obtaining position information of the observer and measured concentration information; setting a plurality of virtual ejection spots in a region which predetermines estimation of a concentration of the diffusion substance; and estimating the concentration of the diffusion substance in the virtual ejection spot by the method according to claim 6 on the basis of the position information of the observer, the measured concentration information, and information of the virtual ejection spot. | The present invention provides a simulation device which is able to obtain a preferred simulation result. The simulation device calculating a solution of an equation including an advective term, includes: a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation, and calculates a solution of the discretization equation, wherein the two operations includes deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term.1. A simulation device calculating a solution of an equation including an advective term, comprising:
a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation, and calculates a solution of the discretization equation, wherein the two operations includes deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 2. The simulation device according to claim 1,
wherein the term of correcting the error in the conservation form of the advective term is a term of correcting an error which occurs due to the fact that the velocity field does not satisfy a continuity equation. 3. The simulation device according to claim 2,
wherein the term of correcting the error is a term obtained by performing at least an integration which is identical to an integration with respect to the equation with respect to the continuity equation. 4. The simulation device according to claim 2,
wherein the solution calculation unit calculates a velocity field in a next time step by using at least the continuity equation, and the velocity field acquired by the velocity field acquisition unit is a velocity field calculated by the solution calculation unit. 5. The simulation device according to claim 2,
wherein the velocity field acquisition unit acquires a velocity field which is stored in advance. 6. A simulation method calculating a solution of an equation including an advective term, comprising:
a first step of acquiring a velocity field; and a second step of applying the velocity field acquired in the first step to a discretization equation obtained by adding at least two operations to the equation including the advective term, and of calculating a solution of the discretization equation, wherein the two operations include deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 7. A program for functioning a computer as:
a velocity field acquisition unit which acquires a velocity field; and a solution calculation unit which applies the velocity field acquired by the velocity field acquisition unit to a discretization equation obtained by adding at least two operations to the equation including the advective term, and calculates a solution of the discretization equation, wherein the two operations include deformation of the advective term into a conservation form, and a term of correcting an error in the conservation form of the advective term. 8. A simulation device estimating a generation source of a diffusion substance which estimates generation source information of fluid on the basis of information from a plurality of observers, comprising:
an observation information obtaining section which obtains position information of the observer and measured concentration information; a virtual ejection spot setting section which sets a plurality of virtual ejection spots in a region which predetermines estimation of a concentration of the diffusion substance; and the device according to claim 1 estimating the concentration of the diffusion substance in the virtual ejection spot on the basis of the position information of the observer, the measured concentration information, and information of the virtual ejection spot. 9. A simulation method estimating a generation source of a diffusion substance which estimates generation source information of fluid on the basis of information from a plurality of observers, the method comprising:
obtaining position information of the observer and measured concentration information; setting a plurality of virtual ejection spots in a region which predetermines estimation of a concentration of the diffusion substance; and estimating the concentration of the diffusion substance in the virtual ejection spot by the method according to claim 6 on the basis of the position information of the observer, the measured concentration information, and information of the virtual ejection spot. | 2,100 |
5,490 | 5,490 | 13,769,521 | 2,158 | Methods and systems may provide for identifying a first set of recipients associated with an away status. Additionally, the first set of recipients may be removed from a second set of recipients associated with a bulk communications campaign to obtain a third set of recipients, wherein a first message may be sent to the third set of recipients. In one example, it may be determined that the away status has ceased for one or more of the first set of recipients, wherein a second message may be sent to the one or more of the first set of recipients for which the away status has ceased. The second message may reference the away status. Methods and systems may also provide for a brokering system to enable the transfer of away status information between different collectors of away status information and senders of messages. | 1. A computer program product comprising:
a computer readable storage medium; and computer usable code stored on the computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: receive a first communication from a first collector of away status information, wherein the first communication is to include first cryptographic information and first away status information; populate a database with the first cryptographic information and the first away status information; receive a second communication from a sender of messages, wherein the second communication is to include a request for away status information and second cryptographic information; conduct a search of the database in response to the request; and transmit a response to the sender of messages based on the search. 2. The computer program product of claim 1, wherein the request for away status information is to be associated with a plurality of recipients. 3. The computer program product of claim 1, wherein the computer usable code, if executed, causes a computer to use the second cryptographic information as a key to conduct the search. 4. The computer program product of claim 3, wherein the first away status information is to include return date information associated with one or more of an out-of-office status and an on-vacation status. 5. The computer program product of claim 1, wherein the computer usable code, if executed, causes a computer to:
receive a third communication from a second collector of away status information, wherein the third communication is to include third cryptographic information and third away status information; and populate the database with the third cryptographic information and the third away status information. 6-15. (canceled) 16. A computer program product comprising:
a computer readable storage medium; and computer usable code stored on the computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: identify a first set of recipients associated with an away status; remove the first set of recipients from a second set of recipients associated with a bulk communications campaign to obtain a third set of recipients; and send a first message to the third set of recipients. 17. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to:
determine that the away status has ceased for one or more of the first set of recipients; and send a second message to the one or more of the first set of recipients for which the away status has ceased. 18. The computer program product of claim 17, wherein the second message is to reference the away status. 19. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to access a brokering system to identify the first set of recipients. 20. The computer program product of claim 19, wherein the computer usable code, if executed, causes a computer to:
apply a cryptographic hash function to contact information corresponding to the second set of recipients to obtain first cryptographic information; submit the first cryptographic information to the brokering system; receive a response from the brokering system, wherein the response is to include away status information, and wherein the first set of recipients are to be identified based on the away status information. 21. The computer program product of claim 20, wherein the contact information is to include one or more of email addresses, phone numbers, fax numbers social media names and login names. 22. The computer program product of claim 19, wherein the computer usable code, if executed, causes a computer to:
receive a database from the brokering system; and obtain the first set of recipients from the database. 23. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to process one or more user communications to identify the first set of recipients. 24. The computer program product of claim 23, wherein the computer usable code, if executed, causes a computer to:
apply a cryptographic hash function to contact information corresponding to the first set of recipients to obtain third cryptographic information; and send the third cryptographic information and corresponding away status information to a brokering system. 25. The computer program product of claim 16, wherein the away status is to be one or more of an out-of-office status and an on-vacation status. | Methods and systems may provide for identifying a first set of recipients associated with an away status. Additionally, the first set of recipients may be removed from a second set of recipients associated with a bulk communications campaign to obtain a third set of recipients, wherein a first message may be sent to the third set of recipients. In one example, it may be determined that the away status has ceased for one or more of the first set of recipients, wherein a second message may be sent to the one or more of the first set of recipients for which the away status has ceased. The second message may reference the away status. Methods and systems may also provide for a brokering system to enable the transfer of away status information between different collectors of away status information and senders of messages.1. A computer program product comprising:
a computer readable storage medium; and computer usable code stored on the computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: receive a first communication from a first collector of away status information, wherein the first communication is to include first cryptographic information and first away status information; populate a database with the first cryptographic information and the first away status information; receive a second communication from a sender of messages, wherein the second communication is to include a request for away status information and second cryptographic information; conduct a search of the database in response to the request; and transmit a response to the sender of messages based on the search. 2. The computer program product of claim 1, wherein the request for away status information is to be associated with a plurality of recipients. 3. The computer program product of claim 1, wherein the computer usable code, if executed, causes a computer to use the second cryptographic information as a key to conduct the search. 4. The computer program product of claim 3, wherein the first away status information is to include return date information associated with one or more of an out-of-office status and an on-vacation status. 5. The computer program product of claim 1, wherein the computer usable code, if executed, causes a computer to:
receive a third communication from a second collector of away status information, wherein the third communication is to include third cryptographic information and third away status information; and populate the database with the third cryptographic information and the third away status information. 6-15. (canceled) 16. A computer program product comprising:
a computer readable storage medium; and computer usable code stored on the computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: identify a first set of recipients associated with an away status; remove the first set of recipients from a second set of recipients associated with a bulk communications campaign to obtain a third set of recipients; and send a first message to the third set of recipients. 17. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to:
determine that the away status has ceased for one or more of the first set of recipients; and send a second message to the one or more of the first set of recipients for which the away status has ceased. 18. The computer program product of claim 17, wherein the second message is to reference the away status. 19. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to access a brokering system to identify the first set of recipients. 20. The computer program product of claim 19, wherein the computer usable code, if executed, causes a computer to:
apply a cryptographic hash function to contact information corresponding to the second set of recipients to obtain first cryptographic information; submit the first cryptographic information to the brokering system; receive a response from the brokering system, wherein the response is to include away status information, and wherein the first set of recipients are to be identified based on the away status information. 21. The computer program product of claim 20, wherein the contact information is to include one or more of email addresses, phone numbers, fax numbers social media names and login names. 22. The computer program product of claim 19, wherein the computer usable code, if executed, causes a computer to:
receive a database from the brokering system; and obtain the first set of recipients from the database. 23. The computer program product of claim 16, wherein the computer usable code, if executed, causes a computer to process one or more user communications to identify the first set of recipients. 24. The computer program product of claim 23, wherein the computer usable code, if executed, causes a computer to:
apply a cryptographic hash function to contact information corresponding to the first set of recipients to obtain third cryptographic information; and send the third cryptographic information and corresponding away status information to a brokering system. 25. The computer program product of claim 16, wherein the away status is to be one or more of an out-of-office status and an on-vacation status. | 2,100 |
5,491 | 5,491 | 15,414,124 | 2,182 | A linear system solving method, system, and computer program product, include calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition, solving a first expression for a first value using a substitution module to create a first result, dividing the first result by values stored in the diagonal of the matrix to obtain a second result, and solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. | 1. A computer-implemented linear system solving method, the method comprising:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition; first solving a first expression for a first value using a substitution module to create a first result; dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and second solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 2. The computer-implemented method of claim 1, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 3. The computer-implemented method of claim 1, wherein the first solving and the second solving are performed using a same substitution engine. 4. The computer-implemented method of claim 1, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 5. The computer-implemented method of claim 1, wherein, in the first solving, the first expression is Ly=b and is solved for the first value of b using a substitution engine to create the first result, and
wherein the substitution engine performs a forward substitution using the same engine as used in the LDU decomposition to calculate a third expression of bi−Σk=0 i=1Likxk. 6. The computer-implemented method of claim 5, wherein the second solving solves the second expression of
Ux
=
y
D
for the second value of y, and
wherein, in a forward transformation (FTRAN) in the second solving, “y1=b1” is set as “L11=1”, then “y2=b2−y1L21” and continuing for each element of y using yi=bi−Σk=0 i=1Likyk until a last element is reached. 7. The computer-implemented method of claim 1, wherein the first solving solves the first expression of Ly=b for the first value y, and
wherein the second solving solves the second expression of Ux=(y/D) for the second value of x. 8. The computer-implemented method of claim 1, embodied in a cloud-computing environment. 9. A computer program product for linear system solving, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition; first solving a first expression for a first value using a substitution module to create a first result; dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and second solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 10. The computer program product of claim 9, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 11. The computer program product of claim 9, wherein the first solving and the second solving are performed using a same substitution engine. 12. The computer program product claim of 9, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 13. The computer program product claim of 9, wherein, in the first solving, the first expression is Ly=b and is solved for the first value of b using a substitution engine to create the result, and
wherein the substitution engine performs a forward substitution using a same engine as used in the LDU decomposition to calculate a third expression of bi−Σk=0 i=1Likxk. 14. The computer program product claim of 13, wherein the second solving solves the second expression of
Ux
=
y
D
for the second value of y, and
wherein, in a forward transformation (FTRAN) in the second solving, “y1=b1” is set as “L11=1”, then “y2=b2−y1L21” and continuing for each element of y using yi=bi−Σk=0 i=1Likyk until a last element is reached. 15. The computer program product claim of 9, wherein the first solving solves the first expression of Ly=b for the first value y, and
wherein the second solving solves the second expression of Ux=(y/D) for the second value of x. 16. A linear system solving system, said system comprising:
a processor; and a memory, the memory storing instructions to cause the processor to perform:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition;
solving a first expression for a first value using a substitution module to create a first result;
dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and
solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 17. The system of claim 16, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 18. The system of claim 16, wherein the first solving and the second solving are performed using a same substitution engine. 19. The system of claim 16, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 20. The system of claim 16, embodied in a cloud-computing environment. | A linear system solving method, system, and computer program product, include calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition, solving a first expression for a first value using a substitution module to create a first result, dividing the first result by values stored in the diagonal of the matrix to obtain a second result, and solving a second expression for a second value where a processing of the diagonal is skipped by using the second result.1. A computer-implemented linear system solving method, the method comprising:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition; first solving a first expression for a first value using a substitution module to create a first result; dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and second solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 2. The computer-implemented method of claim 1, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 3. The computer-implemented method of claim 1, wherein the first solving and the second solving are performed using a same substitution engine. 4. The computer-implemented method of claim 1, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 5. The computer-implemented method of claim 1, wherein, in the first solving, the first expression is Ly=b and is solved for the first value of b using a substitution engine to create the first result, and
wherein the substitution engine performs a forward substitution using the same engine as used in the LDU decomposition to calculate a third expression of bi−Σk=0 i=1Likxk. 6. The computer-implemented method of claim 5, wherein the second solving solves the second expression of
Ux
=
y
D
for the second value of y, and
wherein, in a forward transformation (FTRAN) in the second solving, “y1=b1” is set as “L11=1”, then “y2=b2−y1L21” and continuing for each element of y using yi=bi−Σk=0 i=1Likyk until a last element is reached. 7. The computer-implemented method of claim 1, wherein the first solving solves the first expression of Ly=b for the first value y, and
wherein the second solving solves the second expression of Ux=(y/D) for the second value of x. 8. The computer-implemented method of claim 1, embodied in a cloud-computing environment. 9. A computer program product for linear system solving, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition; first solving a first expression for a first value using a substitution module to create a first result; dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and second solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 10. The computer program product of claim 9, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 11. The computer program product of claim 9, wherein the first solving and the second solving are performed using a same substitution engine. 12. The computer program product claim of 9, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 13. The computer program product claim of 9, wherein, in the first solving, the first expression is Ly=b and is solved for the first value of b using a substitution engine to create the result, and
wherein the substitution engine performs a forward substitution using a same engine as used in the LDU decomposition to calculate a third expression of bi−Σk=0 i=1Likxk. 14. The computer program product claim of 13, wherein the second solving solves the second expression of
Ux
=
y
D
for the second value of y, and
wherein, in a forward transformation (FTRAN) in the second solving, “y1=b1” is set as “L11=1”, then “y2=b2−y1L21” and continuing for each element of y using yi=bi−Σk=0 i=1Likyk until a last element is reached. 15. The computer program product claim of 9, wherein the first solving solves the first expression of Ly=b for the first value y, and
wherein the second solving solves the second expression of Ux=(y/D) for the second value of x. 16. A linear system solving system, said system comprising:
a processor; and a memory, the memory storing instructions to cause the processor to perform:
calculating a matrix factorization for a matrix in a pair of matrices, in a form of a lower, a diagonal, an upper (LDU) decomposition;
solving a first expression for a first value using a substitution module to create a first result;
dividing the first result by values stored in the diagonal of the matrix to obtain a second result; and
solving a second expression for a second value where a processing of the diagonal is skipped by using the second result. 17. The system of claim 16, wherein the first solving comprises a forward substitution, and
wherein the second solving comprises a backwards substitution. 18. The system of claim 16, wherein the first solving and the second solving are performed using a same substitution engine. 19. The system of claim 16, wherein, in the calculating a matrix factorization, all elements of the matrix are divided by their corresponding diagonal element to make diagonal entries equal to a value of one, and
wherein the diagonal entries are then stored as the first and second values. 20. The system of claim 16, embodied in a cloud-computing environment. | 2,100 |
5,492 | 5,492 | 14,747,944 | 2,135 | A processor uses the same virtual address space for heterogeneous processing units of the processor. The processor employs different sets of page tables for different types of processing units, such as a CPU and a GPU, wherein a memory management unit uses each set of page tables to translate virtual addresses of the virtual address space to corresponding physical addresses of memory modules associated with the processor. As data is migrated between memory modules, the physical addresses in the page tables can be updated to reflect the physical location of the data for each processing unit. | 1. A method comprising:
translating, at a processor, virtual addresses for a virtual address space to a first set of physical addresses for a first processing unit of the processor; and translating, at the processor, virtual addresses for the virtual address space to a second set of physical addresses for a second processing unit of the processor, the second processing unit of a different processing unit type than the first processing unit. 2. The method of claim 1, wherein the second set of physical addresses includes addresses in the first set of physical addresses. 3. The method of claim 1, wherein a first physical address in the first set of physical addresses corresponding to a virtual address in the virtual address space is different from a second physical address in the second set of physical addresses corresponding to the virtual address. 4. The method of claim 1, wherein:
translating virtual addresses to the first set of physical addresses comprises translating the virtual addresses based on a first set of page tables; and translating virtual addresses to the second set of physical addresses comprises translating the virtual addresses based on a second set of page tables different from the first. 5. The method of claim 4, further comprising:
transferring data from a first memory module associated with the processor to a second memory module associated with the processor; and updating the second set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 6. The method of claim 5, further comprising:
maintaining the first set of page tables so that the first of physical addresses for the data reflects physical addresses of the first memory module. 7. The method of claim 5, further comprising:
updating the first set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 8. The method of claim 5, further comprising:
in response to a memory access request from the first processing unit, identifying if the data has been modified by the second processing unit at the second memory module; and in response to identifying that the data has been modified at the second memory module, transferring the data from the second memory module to the first memory module. 9. The method of claim 5, further comprising:
stalling execution of write requests to the data during the transfer of the data from the first memory module to the second memory module. 10. A method, comprising:
maintaining a first set of page tables for a first processing unit of a processor, the first set of page tables reflecting a mapping between a virtual address space and a first physical address space; and maintaining a second set of page tables for a second processing unit of the processor, the second set of page tables reflecting a mapping between the virtual address space and a second physical address space. 11. The method of claim 10, wherein the first physical address space is different than the second physical address space. 12. The method of claim 10, further comprising:
updating the second set of page tables in response to migration of data from a first memory module associated with the processor to a second memory module associated with the processor. 13. The method of claim 12, wherein updating the second set of page tables comprises updating physical addresses of the second set of page tables and maintaining corresponding virtual addresses of the second set of page tables. 14. A processor, comprising:
a first processing unit of a first type; a second processing unit a second type different than the first type; and a memory management unit (MMU) to:
translate virtual addresses for a virtual address space to a first set of physical addresses for the first processing unit; and
translate virtual addresses for the virtual address space to a second set of physical addresses for the second processing unit. 15. The processor of claim 14, wherein the second set of physical addresses includes addresses in the first set of physical addresses. 16. The processor of claim 14, wherein a first physical address in the first set of physical addresses corresponding to a virtual address in the virtual address space is different from a second physical address in the second set of physical addresses corresponding to the virtual address. 17. The processor of claim 14, wherein the MMU is to:
translate virtual addresses to the first set of physical addresses comprises translating the virtual addresses based on a first set of page tables; and translate virtual addresses to the second set of physical addresses comprises translating the virtual addresses based on a second set of page tables different from the first. 18. The processor of claim 17, further comprising:
a controller to migrate data from a first memory module associated with the processor to a second memory module associated with the processor, and to update the second set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 19. The processor of claim 18, wherein the controller is to:
maintain the first set of page tables so that the first of physical addresses for the data reflects physical addresses of the first memory module. 20. The processor of claim 14, wherein the first processing unit is a central processing unit and the second processing unit is a graphics processing unit. | A processor uses the same virtual address space for heterogeneous processing units of the processor. The processor employs different sets of page tables for different types of processing units, such as a CPU and a GPU, wherein a memory management unit uses each set of page tables to translate virtual addresses of the virtual address space to corresponding physical addresses of memory modules associated with the processor. As data is migrated between memory modules, the physical addresses in the page tables can be updated to reflect the physical location of the data for each processing unit.1. A method comprising:
translating, at a processor, virtual addresses for a virtual address space to a first set of physical addresses for a first processing unit of the processor; and translating, at the processor, virtual addresses for the virtual address space to a second set of physical addresses for a second processing unit of the processor, the second processing unit of a different processing unit type than the first processing unit. 2. The method of claim 1, wherein the second set of physical addresses includes addresses in the first set of physical addresses. 3. The method of claim 1, wherein a first physical address in the first set of physical addresses corresponding to a virtual address in the virtual address space is different from a second physical address in the second set of physical addresses corresponding to the virtual address. 4. The method of claim 1, wherein:
translating virtual addresses to the first set of physical addresses comprises translating the virtual addresses based on a first set of page tables; and translating virtual addresses to the second set of physical addresses comprises translating the virtual addresses based on a second set of page tables different from the first. 5. The method of claim 4, further comprising:
transferring data from a first memory module associated with the processor to a second memory module associated with the processor; and updating the second set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 6. The method of claim 5, further comprising:
maintaining the first set of page tables so that the first of physical addresses for the data reflects physical addresses of the first memory module. 7. The method of claim 5, further comprising:
updating the first set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 8. The method of claim 5, further comprising:
in response to a memory access request from the first processing unit, identifying if the data has been modified by the second processing unit at the second memory module; and in response to identifying that the data has been modified at the second memory module, transferring the data from the second memory module to the first memory module. 9. The method of claim 5, further comprising:
stalling execution of write requests to the data during the transfer of the data from the first memory module to the second memory module. 10. A method, comprising:
maintaining a first set of page tables for a first processing unit of a processor, the first set of page tables reflecting a mapping between a virtual address space and a first physical address space; and maintaining a second set of page tables for a second processing unit of the processor, the second set of page tables reflecting a mapping between the virtual address space and a second physical address space. 11. The method of claim 10, wherein the first physical address space is different than the second physical address space. 12. The method of claim 10, further comprising:
updating the second set of page tables in response to migration of data from a first memory module associated with the processor to a second memory module associated with the processor. 13. The method of claim 12, wherein updating the second set of page tables comprises updating physical addresses of the second set of page tables and maintaining corresponding virtual addresses of the second set of page tables. 14. A processor, comprising:
a first processing unit of a first type; a second processing unit a second type different than the first type; and a memory management unit (MMU) to:
translate virtual addresses for a virtual address space to a first set of physical addresses for the first processing unit; and
translate virtual addresses for the virtual address space to a second set of physical addresses for the second processing unit. 15. The processor of claim 14, wherein the second set of physical addresses includes addresses in the first set of physical addresses. 16. The processor of claim 14, wherein a first physical address in the first set of physical addresses corresponding to a virtual address in the virtual address space is different from a second physical address in the second set of physical addresses corresponding to the virtual address. 17. The processor of claim 14, wherein the MMU is to:
translate virtual addresses to the first set of physical addresses comprises translating the virtual addresses based on a first set of page tables; and translate virtual addresses to the second set of physical addresses comprises translating the virtual addresses based on a second set of page tables different from the first. 18. The processor of claim 17, further comprising:
a controller to migrate data from a first memory module associated with the processor to a second memory module associated with the processor, and to update the second set of page tables based on transferring the data so that the second set of physical addresses reflects physical addresses of the second memory module. 19. The processor of claim 18, wherein the controller is to:
maintain the first set of page tables so that the first of physical addresses for the data reflects physical addresses of the first memory module. 20. The processor of claim 14, wherein the first processing unit is a central processing unit and the second processing unit is a graphics processing unit. | 2,100 |
5,493 | 5,493 | 14,660,162 | 2,157 | Disclosed are systems, methods, and non-transitory computer-readable storage media for migrating content items from a source user account to a target user account. A user can specify content items in the source user account to be migrated to an existing or new target user account. A new content entry including an account identifier of the target account and a pointer to the content item can be created for each migrated content item. Further, a determination can be made as to whether a sharing link to each content item exists, and if so, the content pointer of the old content entry is modified to forward or redirect to the new content entry. An active flag associated with the old content entry can be set to false or 0 to indicate that the old content entry is no longer active. | 1. A method comprising:
migrating, by a server device, a content item from a first user account to a second user account; receiving, by a server device, a request from a client device to access the content item, the request identifying the first account and the content item; identifying, by the server device, a first content entry in a content directory, the first content entry corresponding to the first account and the content item; obtaining from the first content entry, by the server device, a first pointer to a second content entry in the content directory, the second content entry corresponding to the second account and the content item; obtaining from the second content entry, by the server device, a second pointer to the memory location of the content item. 2. The method of claim 1, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 3. The method of claim 1, further comprising: obtaining the content item from the second account based on the request identifying the first account. 4. The method of claim 1, further comprising: providing, to the client device, access to the content item in the second account in response to receiving the request to access the content item from the first account. 5. The method of claim 1, wherein the first content entry is distinct from the content item. 6. The method of claim 1, wherein the second content entry is distinct from the content item. 7. The method of claim 1, wherein the first content entry is distinct from the second content entry. 8. A non-transitory computer-readable medium including one or more sequences of instructions which, when executed by one or more processors, causes:
receiving, by a server device, a request from a client device to access a content item, the request identifying a first account; identifying, by the server device, a first content entry in a content directory, the first content entry corresponding to the first account; obtaining from the first content entry, by the server device, a first pointer to a second content entry in the content directory, the second content entry corresponding to a second account; obtaining from the second content entry, by the server device, a second pointer to the memory location of the content item. 9. The non-transitory computer-readable medium of claim 8, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 10. The non-transitory computer-readable medium of claim 8, wherein the instructions cause: obtaining the content item from the second account based on the request identifying the first account. 11. The non-transitory computer-readable medium of claim 8, wherein the instructions cause: providing, to the client device, access to the content item in the second account in response to receiving the request to access the content item from the first account. 12. The non-transitory computer-readable medium of claim 8, wherein the first content entry is distinct from the content item. 13. The non-transitory computer-readable medium of claim 8, wherein the second content entry is distinct from the content item. 14. The non-transitory computer-readable medium of claim 8, wherein the first content entry is distinct from the second content entry. 15. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by one or more processors, causes:
receiving a request from a client device to access the content item, the request identifying the first account and the content item;
identifying a first content entry in a content directory, the first content entry corresponding to the first account and the content item;
obtaining from the first content entry a first pointer to a second content entry in the content directory, the second content entry corresponding to the second account and the content item;
obtaining from the second content entry a second pointer to the memory location of the content item; and
providing, to the client device, access to the content item in the second account using the second pointer. 16. The system of claim 15, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 17. The system of claim 15, wherein the instructions cause: obtaining the content item from the second account based on the request identifying the first account. 18. The system of claim 15, wherein the first content entry is distinct from the content item. 19. The system of claim 15, wherein the second content entry is distinct from the content item. 20. The system of claim 15, wherein the first content entry is distinct from the second content entry. | Disclosed are systems, methods, and non-transitory computer-readable storage media for migrating content items from a source user account to a target user account. A user can specify content items in the source user account to be migrated to an existing or new target user account. A new content entry including an account identifier of the target account and a pointer to the content item can be created for each migrated content item. Further, a determination can be made as to whether a sharing link to each content item exists, and if so, the content pointer of the old content entry is modified to forward or redirect to the new content entry. An active flag associated with the old content entry can be set to false or 0 to indicate that the old content entry is no longer active.1. A method comprising:
migrating, by a server device, a content item from a first user account to a second user account; receiving, by a server device, a request from a client device to access the content item, the request identifying the first account and the content item; identifying, by the server device, a first content entry in a content directory, the first content entry corresponding to the first account and the content item; obtaining from the first content entry, by the server device, a first pointer to a second content entry in the content directory, the second content entry corresponding to the second account and the content item; obtaining from the second content entry, by the server device, a second pointer to the memory location of the content item. 2. The method of claim 1, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 3. The method of claim 1, further comprising: obtaining the content item from the second account based on the request identifying the first account. 4. The method of claim 1, further comprising: providing, to the client device, access to the content item in the second account in response to receiving the request to access the content item from the first account. 5. The method of claim 1, wherein the first content entry is distinct from the content item. 6. The method of claim 1, wherein the second content entry is distinct from the content item. 7. The method of claim 1, wherein the first content entry is distinct from the second content entry. 8. A non-transitory computer-readable medium including one or more sequences of instructions which, when executed by one or more processors, causes:
receiving, by a server device, a request from a client device to access a content item, the request identifying a first account; identifying, by the server device, a first content entry in a content directory, the first content entry corresponding to the first account; obtaining from the first content entry, by the server device, a first pointer to a second content entry in the content directory, the second content entry corresponding to a second account; obtaining from the second content entry, by the server device, a second pointer to the memory location of the content item. 9. The non-transitory computer-readable medium of claim 8, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 10. The non-transitory computer-readable medium of claim 8, wherein the instructions cause: obtaining the content item from the second account based on the request identifying the first account. 11. The non-transitory computer-readable medium of claim 8, wherein the instructions cause: providing, to the client device, access to the content item in the second account in response to receiving the request to access the content item from the first account. 12. The non-transitory computer-readable medium of claim 8, wherein the first content entry is distinct from the content item. 13. The non-transitory computer-readable medium of claim 8, wherein the second content entry is distinct from the content item. 14. The non-transitory computer-readable medium of claim 8, wherein the first content entry is distinct from the second content entry. 15. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by one or more processors, causes:
receiving a request from a client device to access the content item, the request identifying the first account and the content item;
identifying a first content entry in a content directory, the first content entry corresponding to the first account and the content item;
obtaining from the first content entry a first pointer to a second content entry in the content directory, the second content entry corresponding to the second account and the content item;
obtaining from the second content entry a second pointer to the memory location of the content item; and
providing, to the client device, access to the content item in the second account using the second pointer. 16. The system of claim 15, wherein the request to access the content item is based on a shared link to the content item that was created prior to migrating the content item from the first user account to the second user account and that identifies the first user account. 17. The system of claim 15, wherein the instructions cause: obtaining the content item from the second account based on the request identifying the first account. 18. The system of claim 15, wherein the first content entry is distinct from the content item. 19. The system of claim 15, wherein the second content entry is distinct from the content item. 20. The system of claim 15, wherein the first content entry is distinct from the second content entry. | 2,100 |
5,494 | 5,494 | 14,628,700 | 2,139 | Embodiments herein provide for dynamic storage system configuration. In one embodiment, a storage controller is operable to configure a storage volume from a plurality of storage devices. The storage controller includes an interface operable to receive a first write I/O request from a host system, and to extract a storage configuration attribute from the first write I/O request. The storage controller also includes a processor communicatively coupled to the interface and operable to identify a storage configuration required by the first write I/O request based on the storage configuration attribute, to determine whether the storage volume comprises the required storage configuration of the first write I/O request, and to configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. | 1. A storage controller operable to configure a storage volume from a plurality of storage devices, the storage controller comprising:
an interface operable to receive a first write Input/Output (I/O) request from a host system, and to extract a storage configuration attribute from the first write I/O request; and a processor communicatively coupled to the interface and operable to identify a storage configuration required by the first write I/O request based on the storage configuration attribute, to determine whether the storage volume comprises the required storage configuration of the first write I/O request, and to configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 2. The storage controller of claim 1, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 3. The storage controller of claim 2, wherein:
the interface is further operable to receive a second write I/O request from the host system, and to extract a storage configuration attribute from the second write I/O request; and the processor is further operable to identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request, to determine whether the storage volume comprises the RAID storage management level required by the second write I/O request, and to configure the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 4. The storage controller of claim 1, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the processor configures the SSD for storage of the first write I/O request and directs the first write I/O request to the SSD drive according to the required storage configuration. 5. The storage controller of claim 1, wherein:
the interface is further operable to receive a second write I/O request from the host system, and to extract a storage configuration attribute from the second write I/O request; and the processor is further operable to identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request, to determine whether the storage volume comprises the required storage configuration of the second write I/O request, and to direct the second write I/O request to the configured portion of the storage volume based on the determination. 6. The storage controller of claim 1, wherein:
the storage controller further comprises a cache memory; and the processor is further operable to determine whether the first write I/O request requires caching based on the storage configuration attribute, and to cache the first write I/O request based on the determination. 7. The storage controller of claim 1, further comprising:
a local memory operable to maintain a mapping of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 8. A method operable in a storage controller, the method comprising:
configuring a storage volume from a plurality of storage devices; receiving a first write Input/Output (I/O) request from a host system; extracting a storage configuration attribute from the first write I/O request; identifying a storage configuration required by the first write I/O request based on the storage configuration attribute; determining whether the storage volume comprises the required storage configuration of the first write I/O request; and configuring a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 9. The method of claim 8, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 10. The method of claim 9, further comprising:
receiving a second write I/O request from the host system; extracting a storage configuration attribute from the second write I/O request; identifying a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determining whether the storage volume comprises the RAID storage management level required by the second write I/O request; and configuring the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 11. The method of claim 8, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the method further comprising: configuring the SSD for storage of the first write I/O request; and directing the first write I/O request to the SSD drive according to the required storage configuration. 12. The method of claim 8, further comprising:
receiving a second write I/O request from the host system; extracting a storage configuration attribute from the second write I/O request; identifying a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determining whether the storage volume comprises the required storage configuration of the second write I/O request; and directing the second write I/O request to the configured portion of the storage volume based on the determination. 13. The method of claim 8, wherein:
the storage controller comprises a cache memory; and the method further comprises: determining whether the first write I/O request requires caching based on the storage configuration attribute; caching the first write I/O request based on the determination. 14. The method of claim 8, wherein:
the storage controller comprises a local memory; and the method further comprises generating a map of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 15. A non-transitory computer readable medium comprising instructions that, when directed by a processor of a storage controller, direct the processor to:
configure a storage volume from a plurality of storage devices; receive a first write Input/Output (I/O) request from a host system; extract a storage configuration attribute from the first write I/O request; identify a storage configuration required by the first write I/O request based on the storage configuration attribute; determine whether the storage volume comprises the required storage configuration of the first write I/O request; and configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 16. The computer readable medium of claim 15, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 17. The computer readable medium of claim 16, further comprising instructions that direct the processor to:
receive a second write I/O request from the host system; extract a storage configuration attribute from the second write I/O request; identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determine whether the storage volume comprises the RAID storage management level required by the second write I/O request; and configure the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 18. The computer readable medium of claim 15, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the computer readable medium further comprises instructions that direct the processor to: configure the SSD for storage of the first write I/O request; and direct the first write I/O request to the SSD drive according to the required storage configuration. 19. The computer readable medium of claim 15, further comprising instructions that direct the processor to:
receive a second write I/O request from the host system; extract a storage configuration attribute from the second write I/O request; identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determine whether the storage volume comprises the required storage configuration of the second write I/O request; and direct the second write I/O request to the configured portion of the storage volume based on the determination. 20. The computer readable medium of claim 15, wherein:
the storage controller comprises a cache memory; and the computer readable medium further comprises instructions that direct the processor to: determine whether the first write I/O request requires caching based on the storage configuration attribute; cache the first write I/O request based on the determination. 21. The computer readable medium of claim 15, wherein:
the storage controller comprises a local memory; and the computer readable medium further comprises instructions that direct the processor to generate a map of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 22. A storage controller operable to present a plurality of storage devices as a storage volume to a host system, the storage controller comprising:
an interface operable to receive a write I/O request from the host system to the storage volume; and a processor operable to identify a storage configuration required by the write I/O request, to determine whether the identified storage configuration resides in a storage volume configured from a plurality of storage devices coupled to the storage controller, to determine that the identified storage configuration does not reside in the storage volume, to apportion a number of the storage devices in the storage volume according to the identified storage configuration of the write I/O request, and to process the write I/O request to the apportioned storage devices. 23. The storage controller of claim 22, further comprising:
a cache module; wherein the processor is further operable to determine that the write I/O request requires caching, and to cache the write I/O request in the cache module. 24. The storage controller of claim 22, wherein:
the required storage configuration of the write I/O request is a RAID level storage management. 25. The storage controller of claim 22, wherein:
the plurality of storage devices comprises Hard Disk Drives, Solid State Drives, Secure Enabled Drives, and combinations thereof. 26. A storage controller driver configured with a host system and operable to:
configure a write input/output (I/O) request, the write I/O request comprising a storage configuration attribute that is operable to: direct a storage controller to identify a storage configuration required by the write I/O request; determine whether the identified storage configuration resides in a storage volume configured from a plurality of storage devices coupled to the storage controller; determine that the identified storage configuration does not reside in the storage volume; apportion a number of the storage devices in the storage volume according to the identified storage configuration of the write I/O request; and process the write I/O request to the apportioned storage devices. | Embodiments herein provide for dynamic storage system configuration. In one embodiment, a storage controller is operable to configure a storage volume from a plurality of storage devices. The storage controller includes an interface operable to receive a first write I/O request from a host system, and to extract a storage configuration attribute from the first write I/O request. The storage controller also includes a processor communicatively coupled to the interface and operable to identify a storage configuration required by the first write I/O request based on the storage configuration attribute, to determine whether the storage volume comprises the required storage configuration of the first write I/O request, and to configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration.1. A storage controller operable to configure a storage volume from a plurality of storage devices, the storage controller comprising:
an interface operable to receive a first write Input/Output (I/O) request from a host system, and to extract a storage configuration attribute from the first write I/O request; and a processor communicatively coupled to the interface and operable to identify a storage configuration required by the first write I/O request based on the storage configuration attribute, to determine whether the storage volume comprises the required storage configuration of the first write I/O request, and to configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 2. The storage controller of claim 1, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 3. The storage controller of claim 2, wherein:
the interface is further operable to receive a second write I/O request from the host system, and to extract a storage configuration attribute from the second write I/O request; and the processor is further operable to identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request, to determine whether the storage volume comprises the RAID storage management level required by the second write I/O request, and to configure the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 4. The storage controller of claim 1, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the processor configures the SSD for storage of the first write I/O request and directs the first write I/O request to the SSD drive according to the required storage configuration. 5. The storage controller of claim 1, wherein:
the interface is further operable to receive a second write I/O request from the host system, and to extract a storage configuration attribute from the second write I/O request; and the processor is further operable to identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request, to determine whether the storage volume comprises the required storage configuration of the second write I/O request, and to direct the second write I/O request to the configured portion of the storage volume based on the determination. 6. The storage controller of claim 1, wherein:
the storage controller further comprises a cache memory; and the processor is further operable to determine whether the first write I/O request requires caching based on the storage configuration attribute, and to cache the first write I/O request based on the determination. 7. The storage controller of claim 1, further comprising:
a local memory operable to maintain a mapping of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 8. A method operable in a storage controller, the method comprising:
configuring a storage volume from a plurality of storage devices; receiving a first write Input/Output (I/O) request from a host system; extracting a storage configuration attribute from the first write I/O request; identifying a storage configuration required by the first write I/O request based on the storage configuration attribute; determining whether the storage volume comprises the required storage configuration of the first write I/O request; and configuring a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 9. The method of claim 8, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 10. The method of claim 9, further comprising:
receiving a second write I/O request from the host system; extracting a storage configuration attribute from the second write I/O request; identifying a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determining whether the storage volume comprises the RAID storage management level required by the second write I/O request; and configuring the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 11. The method of claim 8, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the method further comprising: configuring the SSD for storage of the first write I/O request; and directing the first write I/O request to the SSD drive according to the required storage configuration. 12. The method of claim 8, further comprising:
receiving a second write I/O request from the host system; extracting a storage configuration attribute from the second write I/O request; identifying a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determining whether the storage volume comprises the required storage configuration of the second write I/O request; and directing the second write I/O request to the configured portion of the storage volume based on the determination. 13. The method of claim 8, wherein:
the storage controller comprises a cache memory; and the method further comprises: determining whether the first write I/O request requires caching based on the storage configuration attribute; caching the first write I/O request based on the determination. 14. The method of claim 8, wherein:
the storage controller comprises a local memory; and the method further comprises generating a map of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 15. A non-transitory computer readable medium comprising instructions that, when directed by a processor of a storage controller, direct the processor to:
configure a storage volume from a plurality of storage devices; receive a first write Input/Output (I/O) request from a host system; extract a storage configuration attribute from the first write I/O request; identify a storage configuration required by the first write I/O request based on the storage configuration attribute; determine whether the storage volume comprises the required storage configuration of the first write I/O request; and configure a portion of the storage volume according to the storage configuration required by the first write I/O request in response to a determination that the storage volume does not comprise the required storage configuration. 16. The computer readable medium of claim 15, wherein:
the required storage configuration comprises a Redundant Array of Independent Disk (RAID) storage management level. 17. The computer readable medium of claim 16, further comprising instructions that direct the processor to:
receive a second write I/O request from the host system; extract a storage configuration attribute from the second write I/O request; identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determine whether the storage volume comprises the RAID storage management level required by the second write I/O request; and configure the RAID storage management level required by the second write I/O request in another portion of the storage volume based on the determination. 18. The computer readable medium of claim 15, wherein:
the plurality of storage devices comprises a Hard Disk Drive, a Solid State Drive (SSD), a Secure Enabled Drives, or a combinations thereof; the required storage configuration of the first write I/O request requires a high speed write access; and the computer readable medium further comprises instructions that direct the processor to: configure the SSD for storage of the first write I/O request; and direct the first write I/O request to the SSD drive according to the required storage configuration. 19. The computer readable medium of claim 15, further comprising instructions that direct the processor to:
receive a second write I/O request from the host system; extract a storage configuration attribute from the second write I/O request; identify a storage configuration required by the second write I/O request based on the storage configuration attribute in the second write I/O request; determine whether the storage volume comprises the required storage configuration of the second write I/O request; and direct the second write I/O request to the configured portion of the storage volume based on the determination. 20. The computer readable medium of claim 15, wherein:
the storage controller comprises a cache memory; and the computer readable medium further comprises instructions that direct the processor to: determine whether the first write I/O request requires caching based on the storage configuration attribute; cache the first write I/O request based on the determination. 21. The computer readable medium of claim 15, wherein:
the storage controller comprises a local memory; and the computer readable medium further comprises instructions that direct the processor to generate a map of the first write I/O request according to the storage configuration attribute for subsequent read I/O requests and subsequent write I/O requests to the same configured portion of the storage volume. 22. A storage controller operable to present a plurality of storage devices as a storage volume to a host system, the storage controller comprising:
an interface operable to receive a write I/O request from the host system to the storage volume; and a processor operable to identify a storage configuration required by the write I/O request, to determine whether the identified storage configuration resides in a storage volume configured from a plurality of storage devices coupled to the storage controller, to determine that the identified storage configuration does not reside in the storage volume, to apportion a number of the storage devices in the storage volume according to the identified storage configuration of the write I/O request, and to process the write I/O request to the apportioned storage devices. 23. The storage controller of claim 22, further comprising:
a cache module; wherein the processor is further operable to determine that the write I/O request requires caching, and to cache the write I/O request in the cache module. 24. The storage controller of claim 22, wherein:
the required storage configuration of the write I/O request is a RAID level storage management. 25. The storage controller of claim 22, wherein:
the plurality of storage devices comprises Hard Disk Drives, Solid State Drives, Secure Enabled Drives, and combinations thereof. 26. A storage controller driver configured with a host system and operable to:
configure a write input/output (I/O) request, the write I/O request comprising a storage configuration attribute that is operable to: direct a storage controller to identify a storage configuration required by the write I/O request; determine whether the identified storage configuration resides in a storage volume configured from a plurality of storage devices coupled to the storage controller; determine that the identified storage configuration does not reside in the storage volume; apportion a number of the storage devices in the storage volume according to the identified storage configuration of the write I/O request; and process the write I/O request to the apportioned storage devices. | 2,100 |
5,495 | 5,495 | 14,453,546 | 2,159 | Partitioning of temporal databases can implement distributed storage of temporal data via time-based or space-based techniques to improve performance of operators on the database. A variety of operators can be supported for the partitioned tables, including temporal aggregation, time travel, and temporal join. The use of checkpoints can greatly increase performance in a variety of scenarios. The described partitioning techniques can be applied in a parallel execution context to great benefit. The partitioning can also reduce local memory footprint, facilitating in-memory database processing. | 1. A method implemented at least in part by a computing system, the method comprising:
for a database table timeline index represented as a plurality of partial timeline indexes associated with respective partitions of a temporal database table partitioned according to a temporal partition technique, generating a plurality of partial results of a temporal operator calculation with the partial timeline indexes; and generating a global result of the temporal operator calculation, wherein the generating comprises combining the partial results. 2. One or more computer-readable media comprising computer-executable instructions causing a computing system to perform the method of claim 1. 3. The method of claim 1 wherein:
the plurality of partial timeline indexes are stored at a plurality of different, distributed nodes. 4. The method of claim 1 wherein:
the plurality of partial results are computed in parallel at a plurality of different, distributed nodes. 5. The method of claim 1 wherein:
the temporal partition technique comprises a time-based technique grouping tuples of the temporal database table within different time intervals into different partitions. 6. The method of claim 1 wherein:
the temporal partition technique comprises a space-based technique grouping tuples of the temporal database table having different keys into different partitions. 7. The method of claim 6 further comprising:
based on the temporal operator calculation, switching among:
for temporal aggregation, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises computing aggregation locally for respective of the partitions, and combining the partial results comprises performing the aggregation across the partial results;
for time travel, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises computing time travel locally for respective of the partitions, and combining the partial results comprises forming a union of the tuples indicated in the partial results; and
for temporal join, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises generating join indexes for respective of the partitions, and combining the partial results comprises forming a union of the tuples indicated in the join indexes. 8. The method of claim 1 wherein:
a given partial timeline index of the partial timeline indexes comprises references to activations of tuples of a partition of the temporal database table that are activated within a time interval associated with the given partial timeline index. 9. The method of claim 1 wherein:
at least one partial timeline index out of the partial timeline indexes is associated with a partition of the temporal database table representing a time interval for the temporal database table;
the partial timeline index comprises a foreign component; and
the foreign component comprises references to invalidations of tuples in the partition of the temporal database table that are activated by a tuple in the partition of the temporal database table but invalided after the time interval. 10. The method of claim 9 wherein:
the partial timeline index further comprises a local component; and
the local component comprises references to tuples in the partition of the temporal database table that are activated within the time interval and references to tuples in the partition of the temporal database table that are invalidated within the time interval. 11. The method of claim 1 further comprising:
consulting a checkpoint associated with a given partition of the temporal database table, wherein the checkpoint indicates which tuples of the temporal database table are visible at a particular point in time. 12. The method of claim 1 wherein:
the temporal operator calculation comprises a temporal join between the temporal database table and a second temporal database table; and
the method further comprises:
for a given partition of the temporal database table, evolving an intersection map based on events indicated in a partial timeline index associated with the given partition. 13. The method of claim 1 wherein:
the temporal operator calculation comprises a temporal cumulative aggregation; and
combining the partial results comprises:
calculating a global result for a given version, wherein the calculation comprises combining the plurality of partial results for a particular version from a plurality of different partitions. 14. A system comprising one or more computer-readable media comprising:
a plurality of partial timeline indexes indexing a plurality of respective partitions of a temporal table, wherein a given partial timeline index out of the partial timeline indexes associated with a particular partition of the temporal table stores references to one or more tuples activated within the particular partition, references to one or more tuples invalidated within the particular partition, and references to one or more tuples invalidated in a subsequent partition. 15. The system of claim 14 wherein:
the references comprise a reference to the particular partition and a reference to a particular tuple within the particular partition. 16. The system of claim 14 wherein:
the partitions of the temporal table are associated with a respective plurality of system time intervals; and
the references to one or more tuples invalidated in a subsequent partition indicate one or more tuples invalidated outside of the system time interval associated with the particular partition. 17. The system of claim 14 further comprising:
a plurality of executable local temporal operator engines configured to accept a particular partial timeline index as input and output a partial temporal operator result as output, whereby a plurality of partial temporal operator results are generated for respective of the partial timeline indexes; and
a partial temporal operator result concentrator configured to accept the partial temporal operator results from the local temporal operator engines as input and output a global result for a temporal operator for the temporal table. 18. The system of claim 17 wherein the plurality of executable local temporal operator engines are executable in parallel. 19. The system of claim 17 wherein:
the temporal operator comprises a temporal join between the temporal table and an other temporal table; and
the partial temporal operator results comprise respective timeline indexes representing partial results of the temporal join. 20. One or more computer-readable media comprising computer-executable instructions causing a computing system to perform a method comprising:
for a temporal database table distributed into a plurality of partitions according to a system time represented by a global transaction number, calculating in parallel a plurality of partial results for a temporal operator, wherein the calculating comprises consulting a plurality of distributed partial timeline indexes with locations of tuples activating records within system time intervals associated with respective of the partitions, wherein the distributed partial timeline indexes comprise a local component and a foreign component, and wherein the calculating comprises consulting a plurality of checkpoints associated with respective of the partitions; combining the plurality of partial results into a global result for the temporal operator; and outputting the global result. | Partitioning of temporal databases can implement distributed storage of temporal data via time-based or space-based techniques to improve performance of operators on the database. A variety of operators can be supported for the partitioned tables, including temporal aggregation, time travel, and temporal join. The use of checkpoints can greatly increase performance in a variety of scenarios. The described partitioning techniques can be applied in a parallel execution context to great benefit. The partitioning can also reduce local memory footprint, facilitating in-memory database processing.1. A method implemented at least in part by a computing system, the method comprising:
for a database table timeline index represented as a plurality of partial timeline indexes associated with respective partitions of a temporal database table partitioned according to a temporal partition technique, generating a plurality of partial results of a temporal operator calculation with the partial timeline indexes; and generating a global result of the temporal operator calculation, wherein the generating comprises combining the partial results. 2. One or more computer-readable media comprising computer-executable instructions causing a computing system to perform the method of claim 1. 3. The method of claim 1 wherein:
the plurality of partial timeline indexes are stored at a plurality of different, distributed nodes. 4. The method of claim 1 wherein:
the plurality of partial results are computed in parallel at a plurality of different, distributed nodes. 5. The method of claim 1 wherein:
the temporal partition technique comprises a time-based technique grouping tuples of the temporal database table within different time intervals into different partitions. 6. The method of claim 1 wherein:
the temporal partition technique comprises a space-based technique grouping tuples of the temporal database table having different keys into different partitions. 7. The method of claim 6 further comprising:
based on the temporal operator calculation, switching among:
for temporal aggregation, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises computing aggregation locally for respective of the partitions, and combining the partial results comprises performing the aggregation across the partial results;
for time travel, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises computing time travel locally for respective of the partitions, and combining the partial results comprises forming a union of the tuples indicated in the partial results; and
for temporal join, generating the plurality of partial results of the temporal operator calculation with the partial timeline indexes comprises generating join indexes for respective of the partitions, and combining the partial results comprises forming a union of the tuples indicated in the join indexes. 8. The method of claim 1 wherein:
a given partial timeline index of the partial timeline indexes comprises references to activations of tuples of a partition of the temporal database table that are activated within a time interval associated with the given partial timeline index. 9. The method of claim 1 wherein:
at least one partial timeline index out of the partial timeline indexes is associated with a partition of the temporal database table representing a time interval for the temporal database table;
the partial timeline index comprises a foreign component; and
the foreign component comprises references to invalidations of tuples in the partition of the temporal database table that are activated by a tuple in the partition of the temporal database table but invalided after the time interval. 10. The method of claim 9 wherein:
the partial timeline index further comprises a local component; and
the local component comprises references to tuples in the partition of the temporal database table that are activated within the time interval and references to tuples in the partition of the temporal database table that are invalidated within the time interval. 11. The method of claim 1 further comprising:
consulting a checkpoint associated with a given partition of the temporal database table, wherein the checkpoint indicates which tuples of the temporal database table are visible at a particular point in time. 12. The method of claim 1 wherein:
the temporal operator calculation comprises a temporal join between the temporal database table and a second temporal database table; and
the method further comprises:
for a given partition of the temporal database table, evolving an intersection map based on events indicated in a partial timeline index associated with the given partition. 13. The method of claim 1 wherein:
the temporal operator calculation comprises a temporal cumulative aggregation; and
combining the partial results comprises:
calculating a global result for a given version, wherein the calculation comprises combining the plurality of partial results for a particular version from a plurality of different partitions. 14. A system comprising one or more computer-readable media comprising:
a plurality of partial timeline indexes indexing a plurality of respective partitions of a temporal table, wherein a given partial timeline index out of the partial timeline indexes associated with a particular partition of the temporal table stores references to one or more tuples activated within the particular partition, references to one or more tuples invalidated within the particular partition, and references to one or more tuples invalidated in a subsequent partition. 15. The system of claim 14 wherein:
the references comprise a reference to the particular partition and a reference to a particular tuple within the particular partition. 16. The system of claim 14 wherein:
the partitions of the temporal table are associated with a respective plurality of system time intervals; and
the references to one or more tuples invalidated in a subsequent partition indicate one or more tuples invalidated outside of the system time interval associated with the particular partition. 17. The system of claim 14 further comprising:
a plurality of executable local temporal operator engines configured to accept a particular partial timeline index as input and output a partial temporal operator result as output, whereby a plurality of partial temporal operator results are generated for respective of the partial timeline indexes; and
a partial temporal operator result concentrator configured to accept the partial temporal operator results from the local temporal operator engines as input and output a global result for a temporal operator for the temporal table. 18. The system of claim 17 wherein the plurality of executable local temporal operator engines are executable in parallel. 19. The system of claim 17 wherein:
the temporal operator comprises a temporal join between the temporal table and an other temporal table; and
the partial temporal operator results comprise respective timeline indexes representing partial results of the temporal join. 20. One or more computer-readable media comprising computer-executable instructions causing a computing system to perform a method comprising:
for a temporal database table distributed into a plurality of partitions according to a system time represented by a global transaction number, calculating in parallel a plurality of partial results for a temporal operator, wherein the calculating comprises consulting a plurality of distributed partial timeline indexes with locations of tuples activating records within system time intervals associated with respective of the partitions, wherein the distributed partial timeline indexes comprise a local component and a foreign component, and wherein the calculating comprises consulting a plurality of checkpoints associated with respective of the partitions; combining the plurality of partial results into a global result for the temporal operator; and outputting the global result. | 2,100 |
5,496 | 5,496 | 14,457,419 | 2,158 | A system includes reception of an instruction to determine configuration properties of an instance of a first business object, determination of a first type of the instance of the first business object, determination of whether or not the first type is extendable. In a case it is determined that the first type is extendable, a second reference object is determined, the second reference object conforming to the first type, an instance of the second reference object is determined, configuration properties of the instance of the second reference object are determined, and, in response to the instruction, at least the configuration properties of the instance of the second reference object are returned as the configuration properties of the first instance of the first business object. | 1. A system comprising:
a memory storing processor-executable process steps; and a processor to execute the processor-executable process steps to cause the system to:
receive an instruction to determine configuration properties of an instance of a first business object;
determine a first type of the instance of the first business object;
determine whether or not the first type is extendable; and
in a case it is determined that the first type is extendable,
determine a second reference object, the second reference object conforming to the first type;
determine an instance of the second reference object;
determine configuration properties of the instance of the second reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 2. A system according to claim 1, wherein determination of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the first business object. 3. A system according to claim 1, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object. 4. A system according to claim 1, wherein the processor is further to execute the processor-executable process steps to cause the system to:
determine a second type of the instance of the second business object; determine whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determine a third reference object, the third reference object conforming to the second type;
determine an instance of the third reference object;
determine configuration properties of the instance of the third reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 5. A system according to claim 4, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object, and
wherein determination of the configuration properties of the instance of the third reference object comprises determination of configuration properties of a configuration properties business object associated with the third business object. 6. A computer-implemented method comprising:
receiving an instruction to determine configuration properties of an instance of a first business object; determining a first type of the instance of the first business object; determining whether or not the first type is extendable; and in a case it is determined that the first type is extendable,
determining a second reference object, the second reference object conforming to the first type;
determining an instance of the second reference object;
determining configuration properties of the instance of the second reference object; and
returning, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 7. A computer-implemented method according to claim 6, wherein determining the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the first business object. 8. A computer-implemented method according to claim 6, wherein determining the configuration properties of the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the second business object. 9. A computer-implemented method according to claim 6, further comprising:
determining a second type of the instance of the second business object; determining whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determining a third reference object, the third reference object conforming to the second type;
determining an instance of the third reference object;
determining configuration properties of the instance of the third reference object; and
returning, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 10. A computer-implemented method according to claim 9, wherein determining the configuration properties of the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the second business object, and
wherein determining the configuration properties of the instance of the third reference object comprises determining configuration properties of a configuration properties business object associated with the third business object. 11. A non-transitory computer-readable medium storing program code, the program code executable by a computer system to cause to the computer system to:
receive an instruction to determine configuration properties of an instance of a first business object; determine a first type of the instance of the first business object; determine whether or not the first type is extendable; and in a case it is determined that the first type is extendable,
determine a second reference object, the second reference object conforming to the first type;
determine an instance of the second reference object;
determine configuration properties of the instance of the second reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 12. A medium according to claim 11, wherein determination of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the first business object. 13. A medium according to claim 11, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object. 14. A medium according to claim 11, the program code further executable by a computer system to cause to the computer system to:
determine a second type of the instance of the second business object; determine whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determine a third reference object, the third reference object conforming to the second type;
determine an instance of the third reference object;
determine configuration properties of the instance of the third reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 15. A medium according to claim 14, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object, and
wherein determination of the configuration properties of the instance of the third reference object comprises determination of configuration properties of a configuration properties business object associated with the third business object. | A system includes reception of an instruction to determine configuration properties of an instance of a first business object, determination of a first type of the instance of the first business object, determination of whether or not the first type is extendable. In a case it is determined that the first type is extendable, a second reference object is determined, the second reference object conforming to the first type, an instance of the second reference object is determined, configuration properties of the instance of the second reference object are determined, and, in response to the instruction, at least the configuration properties of the instance of the second reference object are returned as the configuration properties of the first instance of the first business object.1. A system comprising:
a memory storing processor-executable process steps; and a processor to execute the processor-executable process steps to cause the system to:
receive an instruction to determine configuration properties of an instance of a first business object;
determine a first type of the instance of the first business object;
determine whether or not the first type is extendable; and
in a case it is determined that the first type is extendable,
determine a second reference object, the second reference object conforming to the first type;
determine an instance of the second reference object;
determine configuration properties of the instance of the second reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 2. A system according to claim 1, wherein determination of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the first business object. 3. A system according to claim 1, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object. 4. A system according to claim 1, wherein the processor is further to execute the processor-executable process steps to cause the system to:
determine a second type of the instance of the second business object; determine whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determine a third reference object, the third reference object conforming to the second type;
determine an instance of the third reference object;
determine configuration properties of the instance of the third reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 5. A system according to claim 4, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object, and
wherein determination of the configuration properties of the instance of the third reference object comprises determination of configuration properties of a configuration properties business object associated with the third business object. 6. A computer-implemented method comprising:
receiving an instruction to determine configuration properties of an instance of a first business object; determining a first type of the instance of the first business object; determining whether or not the first type is extendable; and in a case it is determined that the first type is extendable,
determining a second reference object, the second reference object conforming to the first type;
determining an instance of the second reference object;
determining configuration properties of the instance of the second reference object; and
returning, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 7. A computer-implemented method according to claim 6, wherein determining the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the first business object. 8. A computer-implemented method according to claim 6, wherein determining the configuration properties of the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the second business object. 9. A computer-implemented method according to claim 6, further comprising:
determining a second type of the instance of the second business object; determining whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determining a third reference object, the third reference object conforming to the second type;
determining an instance of the third reference object;
determining configuration properties of the instance of the third reference object; and
returning, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 10. A computer-implemented method according to claim 9, wherein determining the configuration properties of the instance of the second reference object comprises determining configuration properties of a configuration properties business object associated with the second business object, and
wherein determining the configuration properties of the instance of the third reference object comprises determining configuration properties of a configuration properties business object associated with the third business object. 11. A non-transitory computer-readable medium storing program code, the program code executable by a computer system to cause to the computer system to:
receive an instruction to determine configuration properties of an instance of a first business object; determine a first type of the instance of the first business object; determine whether or not the first type is extendable; and in a case it is determined that the first type is extendable,
determine a second reference object, the second reference object conforming to the first type;
determine an instance of the second reference object;
determine configuration properties of the instance of the second reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 12. A medium according to claim 11, wherein determination of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the first business object. 13. A medium according to claim 11, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object. 14. A medium according to claim 11, the program code further executable by a computer system to cause to the computer system to:
determine a second type of the instance of the second business object; determine whether or not the second type is extendable;
in a case it is determined that the second type is extendable,
determine a third reference object, the third reference object conforming to the second type;
determine an instance of the third reference object;
determine configuration properties of the instance of the third reference object; and
return, in response to the instruction, at least the configuration properties of the instance of the third reference object and the configuration properties of the instance of the second reference object as the configuration properties of the first instance of the first business object. 15. A medium according to claim 14, wherein determination of the configuration properties of the instance of the second reference object comprises determination of configuration properties of a configuration properties business object associated with the second business object, and
wherein determination of the configuration properties of the instance of the third reference object comprises determination of configuration properties of a configuration properties business object associated with the third business object. | 2,100 |
5,497 | 5,497 | 14,270,585 | 2,171 | One or more techniques and/or systems are provided for surfacing scheduling conflicts and/or for facilitating appointment scheduling based upon conflict detection. A user may maintain user appointment data comprising user appointments (e.g., calendar entries within a work calendar). Because user activity may not be fully reflected in the appointment data (e.g., no calendar entries for routine grocery shopping, soccer practice, etc.), potential conflicts may exist between user appointments and the true availability of the user. Accordingly, user signals (e.g., email(s), location check-ins, etc. associated with soccer practice) may be evaluated to generate a user inferred behavior pattern that may be used to identify a potential conflict with a user appointment (e.g., where the user consents to the gathering and/or use of such user signals). A warning of the potential conflict may be surfaced to the user (e.g., a Tuesday dinner calendar meeting conflicts with routine soccer practice on Tuesday evenings). | 1. A method for surfacing scheduling conflicts, comprising:
evaluating a set of user signals to generate a first user inferred behavior pattern of a first user; evaluating user appointment data for the first user to identify a potential conflict between a user appointment for the first user and the first user inferred behavior pattern; and surfacing a warning of the potential conflict to the first user. 2. The method of claim 1, the surfacing a warning comprising:
providing a reschedule user appointment suggestion to the first user. 3. The method of claim 1, comprising:
receiving user feedback for the warning; and adjusting the first user inferred behavior pattern based upon the user feedback. 4. The method of claim 1, comprising:
evaluating a conversation between the first user and a second user to identify the user appointment data. 5. The method of claim 1, the evaluating a set of user signals comprising:
accessing a first shadow calendar maintained for the first user to identify the first user inferred behavior pattern. 6. The method of claim 1, comprising:
evaluating a social network profile of the first user to identify an activity of the first user as a user signal of the set of user signals. 7. The method of claim 1, comprising:
evaluating a device context of a device to identify an activity of the first user as a user signal of the set of user signals, the device context comprising at least one of: a device location, a device time, a mode of transportation, a device location check-in, an alarm, a charging state, a connectivity state, or user data stored on the device. 8. The method of claim 1, comprising:
providing a notification of the potential conflict to an appointment creator of the user appointment. 9. The method of claim 1, comprising:
receiving a user availability request from the first user, the user availability request specifying a potential user appointment; accessing a shadow calendar maintained for the first user to identify one or more shadow calendar entries, at least one shadow calendar entry corresponding to the first user inferred behavior pattern; responsive to the potential user appointment conflicting with a shadow calendar entry, providing a conflict response; and responsive to the potential user appointment not conflicting with at least one shadow calendar entry, providing an availability confirmation. 10. The method of claim 9, the providing a conflict response comprising:
providing an availability suggestion for the potential user appointment. 11. The method of claim 1, the surfacing a warning comprising:
providing an audible notification of the warning. 12. The method of claim 1, the surfacing a warning comprising:
providing a mobile alert of the warning. 13. The method of claim 1, the surfacing a warning comprising:
displaying the warning through a scheduling interface. 14. A system for surfacing scheduling conflicts, comprising:
a conflict warning component configured to:
evaluate a set of user signals to generate a first user inferred behavior pattern of a first user;
evaluate user appointment data for the first user to identify a potential conflict between a user appointment for the first user and the first user inferred behavior pattern; and
surface a warning of the potential conflict to the first user. 15. The system of claim 14, comprising:
a conversation evaluation component configured to:
evaluate a conversation between the first user and a second user to identify a potential user appointment;
access a first shadow calendar maintained for the first user to identify one or more first shadow calendar entries, at least one shadow calendar entry corresponding to the first user inferred behavior pattern; and
responsive to the potential user appointment conflicting with at least one of the one or more first shadow calendar entries, provide a potential conflict warning. 16. The system of claim 15, the conversation evaluation component configured to:
access a second shadow calendar maintained for the second user to identify one or more second shadow calendar entries inferred from behavior patterns of the second user; and responsive to the potential user appointment conflicting with at least one of the one or more second shadow calendar entries, provide the potential conflict warning. 17. A computer readable medium comprising instructions which when executed perform a method for facilitating appointment scheduling based upon conflict detection, comprising:
evaluating a conversation between a first user and a second user to identify a potential user appointment; accessing a first shadow calendar maintained for the first user to identify one or more first shadow calendar entries inferred from behavior patterns of the first user; and responsive to the potential user appointment conflicting with at least one of the one or more first shadow calendar entries, providing a potential conflict warning. 18. The computer readable medium of claim 17, the providing a potential conflict warning comprising:
providing the potential conflict warning during the conversation. 19. The computer readable medium of claim 17, comprising:
accessing a second shadow calendar maintained for the second user to identify one or more second shadow calendar entries inferred from behavior patterns of the second user; and responsive to the potential user appointment conflicting with at least one of the one or more second shadow calendar entries, providing the potential conflict warning. 20. The computer readable medium of claim 19, the providing a potential conflict warning comprising:
providing an appointment suggestion for the potential user appointment based upon the first shadow calendar and the second shadow calendar. | One or more techniques and/or systems are provided for surfacing scheduling conflicts and/or for facilitating appointment scheduling based upon conflict detection. A user may maintain user appointment data comprising user appointments (e.g., calendar entries within a work calendar). Because user activity may not be fully reflected in the appointment data (e.g., no calendar entries for routine grocery shopping, soccer practice, etc.), potential conflicts may exist between user appointments and the true availability of the user. Accordingly, user signals (e.g., email(s), location check-ins, etc. associated with soccer practice) may be evaluated to generate a user inferred behavior pattern that may be used to identify a potential conflict with a user appointment (e.g., where the user consents to the gathering and/or use of such user signals). A warning of the potential conflict may be surfaced to the user (e.g., a Tuesday dinner calendar meeting conflicts with routine soccer practice on Tuesday evenings).1. A method for surfacing scheduling conflicts, comprising:
evaluating a set of user signals to generate a first user inferred behavior pattern of a first user; evaluating user appointment data for the first user to identify a potential conflict between a user appointment for the first user and the first user inferred behavior pattern; and surfacing a warning of the potential conflict to the first user. 2. The method of claim 1, the surfacing a warning comprising:
providing a reschedule user appointment suggestion to the first user. 3. The method of claim 1, comprising:
receiving user feedback for the warning; and adjusting the first user inferred behavior pattern based upon the user feedback. 4. The method of claim 1, comprising:
evaluating a conversation between the first user and a second user to identify the user appointment data. 5. The method of claim 1, the evaluating a set of user signals comprising:
accessing a first shadow calendar maintained for the first user to identify the first user inferred behavior pattern. 6. The method of claim 1, comprising:
evaluating a social network profile of the first user to identify an activity of the first user as a user signal of the set of user signals. 7. The method of claim 1, comprising:
evaluating a device context of a device to identify an activity of the first user as a user signal of the set of user signals, the device context comprising at least one of: a device location, a device time, a mode of transportation, a device location check-in, an alarm, a charging state, a connectivity state, or user data stored on the device. 8. The method of claim 1, comprising:
providing a notification of the potential conflict to an appointment creator of the user appointment. 9. The method of claim 1, comprising:
receiving a user availability request from the first user, the user availability request specifying a potential user appointment; accessing a shadow calendar maintained for the first user to identify one or more shadow calendar entries, at least one shadow calendar entry corresponding to the first user inferred behavior pattern; responsive to the potential user appointment conflicting with a shadow calendar entry, providing a conflict response; and responsive to the potential user appointment not conflicting with at least one shadow calendar entry, providing an availability confirmation. 10. The method of claim 9, the providing a conflict response comprising:
providing an availability suggestion for the potential user appointment. 11. The method of claim 1, the surfacing a warning comprising:
providing an audible notification of the warning. 12. The method of claim 1, the surfacing a warning comprising:
providing a mobile alert of the warning. 13. The method of claim 1, the surfacing a warning comprising:
displaying the warning through a scheduling interface. 14. A system for surfacing scheduling conflicts, comprising:
a conflict warning component configured to:
evaluate a set of user signals to generate a first user inferred behavior pattern of a first user;
evaluate user appointment data for the first user to identify a potential conflict between a user appointment for the first user and the first user inferred behavior pattern; and
surface a warning of the potential conflict to the first user. 15. The system of claim 14, comprising:
a conversation evaluation component configured to:
evaluate a conversation between the first user and a second user to identify a potential user appointment;
access a first shadow calendar maintained for the first user to identify one or more first shadow calendar entries, at least one shadow calendar entry corresponding to the first user inferred behavior pattern; and
responsive to the potential user appointment conflicting with at least one of the one or more first shadow calendar entries, provide a potential conflict warning. 16. The system of claim 15, the conversation evaluation component configured to:
access a second shadow calendar maintained for the second user to identify one or more second shadow calendar entries inferred from behavior patterns of the second user; and responsive to the potential user appointment conflicting with at least one of the one or more second shadow calendar entries, provide the potential conflict warning. 17. A computer readable medium comprising instructions which when executed perform a method for facilitating appointment scheduling based upon conflict detection, comprising:
evaluating a conversation between a first user and a second user to identify a potential user appointment; accessing a first shadow calendar maintained for the first user to identify one or more first shadow calendar entries inferred from behavior patterns of the first user; and responsive to the potential user appointment conflicting with at least one of the one or more first shadow calendar entries, providing a potential conflict warning. 18. The computer readable medium of claim 17, the providing a potential conflict warning comprising:
providing the potential conflict warning during the conversation. 19. The computer readable medium of claim 17, comprising:
accessing a second shadow calendar maintained for the second user to identify one or more second shadow calendar entries inferred from behavior patterns of the second user; and responsive to the potential user appointment conflicting with at least one of the one or more second shadow calendar entries, providing the potential conflict warning. 20. The computer readable medium of claim 19, the providing a potential conflict warning comprising:
providing an appointment suggestion for the potential user appointment based upon the first shadow calendar and the second shadow calendar. | 2,100 |
5,498 | 5,498 | 14,551,667 | 2,128 | A method can include receiving information that defines a three-dimensional subterranean structure; splitting the three-dimensional subterranean structure into portions; generating convex hulls for the portions; and generating a discrete fracture network based at least in part on the convex hulls. | 1. A method comprising:
receiving information that defines a three-dimensional subterranean structure; splitting the three-dimensional subterranean structure into portions; generating convex hulls for the portions; and generating a discrete fracture network based at least in part on the convex hulls. 2. The method of claim 1 further comprising simulating phenomena associated with a subterranean formation based at least in part on a model that comprises the discrete fracture network. 3. The method of claim 1 wherein the generating convex hulls comprises applying a Graham scan algorithm. 4. The method of claim 1 wherein the splitting comprises implementing an angular splitting parameter. 5. The method of claim 1 wherein the splitting generates line segments. 6. The method of claim 5 wherein each of the line segments comprises end points. 7. The method of claim 1 wherein the splitting comprises splitting a curve wherein the curve is determined by intersection of the subterranean structure with a plane. 8. The method of claim 7 further comprising repeating the splitting for a plurality of positions of the plane along a coordinate direction. 9. The method of claim 1 wherein the splitting comprising intersecting the three-dimensional subterranean structure by a plane to generate intersection points that form a curve and then splitting the curve into portions. 10. The method of claim 9 wherein the splitting comprises representing each of the portions by a line segment. 11. The method of claim 10 wherein each of the line segments comprises an associated area. 12. The method of claim 1 wherein the generating convex hulls comprises determining a best fit plane. 13. The method of claim 1 wherein the outputting outputs a discrete fracture network as a model represented at least in part by a set of convex hulls. 14. The method of claim 1 further comprising tessellating at least a portion of the subterranean structure into polygons; computing a normal for each of the polygons; and determining one or more dip values based on the normals of the polygons. 15. A system comprising:
a processor; memory operatively coupled to the processor; one or more modules stored in the memory and comprising processor executable instructions to instruct the system wherein the instructions comprise instructions to:
receive information that defines a three-dimensional subterranean structure;
split the three-dimensional subterranean structure into portions;
generate convex hulls for the portions; and
generate a discrete fracture network based at least in part on the convex hulls. 16. The system of claim 15 wherein the one or more modules stored in the memory and comprising processor executable instructions to instruct the system comprise instructions to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network. 17. The system of claim 15 wherein the instructions to generate a convex hull for at least one of the portions comprises instructions to apply a Graham scan algorithm. 18. One or more computer-readable storage media comprising processor-executable instructions to instruct a computer to:
receive information that defines a three-dimensional subterranean structure; split the three-dimensional subterranean structure into portions; generate convex hulls for the portions; and generate a discrete fracture network based at least in part on the convex hulls. 19. The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network. 20. The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to generate a convex hull for at least one of the portions by applying a Graham scan algorithm. | A method can include receiving information that defines a three-dimensional subterranean structure; splitting the three-dimensional subterranean structure into portions; generating convex hulls for the portions; and generating a discrete fracture network based at least in part on the convex hulls.1. A method comprising:
receiving information that defines a three-dimensional subterranean structure; splitting the three-dimensional subterranean structure into portions; generating convex hulls for the portions; and generating a discrete fracture network based at least in part on the convex hulls. 2. The method of claim 1 further comprising simulating phenomena associated with a subterranean formation based at least in part on a model that comprises the discrete fracture network. 3. The method of claim 1 wherein the generating convex hulls comprises applying a Graham scan algorithm. 4. The method of claim 1 wherein the splitting comprises implementing an angular splitting parameter. 5. The method of claim 1 wherein the splitting generates line segments. 6. The method of claim 5 wherein each of the line segments comprises end points. 7. The method of claim 1 wherein the splitting comprises splitting a curve wherein the curve is determined by intersection of the subterranean structure with a plane. 8. The method of claim 7 further comprising repeating the splitting for a plurality of positions of the plane along a coordinate direction. 9. The method of claim 1 wherein the splitting comprising intersecting the three-dimensional subterranean structure by a plane to generate intersection points that form a curve and then splitting the curve into portions. 10. The method of claim 9 wherein the splitting comprises representing each of the portions by a line segment. 11. The method of claim 10 wherein each of the line segments comprises an associated area. 12. The method of claim 1 wherein the generating convex hulls comprises determining a best fit plane. 13. The method of claim 1 wherein the outputting outputs a discrete fracture network as a model represented at least in part by a set of convex hulls. 14. The method of claim 1 further comprising tessellating at least a portion of the subterranean structure into polygons; computing a normal for each of the polygons; and determining one or more dip values based on the normals of the polygons. 15. A system comprising:
a processor; memory operatively coupled to the processor; one or more modules stored in the memory and comprising processor executable instructions to instruct the system wherein the instructions comprise instructions to:
receive information that defines a three-dimensional subterranean structure;
split the three-dimensional subterranean structure into portions;
generate convex hulls for the portions; and
generate a discrete fracture network based at least in part on the convex hulls. 16. The system of claim 15 wherein the one or more modules stored in the memory and comprising processor executable instructions to instruct the system comprise instructions to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network. 17. The system of claim 15 wherein the instructions to generate a convex hull for at least one of the portions comprises instructions to apply a Graham scan algorithm. 18. One or more computer-readable storage media comprising processor-executable instructions to instruct a computer to:
receive information that defines a three-dimensional subterranean structure; split the three-dimensional subterranean structure into portions; generate convex hulls for the portions; and generate a discrete fracture network based at least in part on the convex hulls. 19. The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network. 20. The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to generate a convex hull for at least one of the portions by applying a Graham scan algorithm. | 2,100 |
5,499 | 5,499 | 14,679,383 | 2,129 | Disclosed herein is modeling method which is enabled to analyses neurons in order to reduce real neurons physiologically properly using the relationship between asymmetry in signal propagation between a soma and dendrites and dendritic excitability. The modeling method for neurons include determining voltage attenuation factors which represent properties of signal propagation between dendrites and a soma and is represented as functions of distance from the soma; and determining a plurality of passive parameter at a pre-determined path length using system parameters defined from the anatomical model comprising the voltage attenuation factors at the pre-determined path length. | 1. Reduced modeling method for neuron, comprising:
confirming asymmetry in signal propagation between a soma and dendrites of neuron which is modeled; confirming dendritic excitability of the neuron; identifying relationship between the asymmetry in signal propagation and the dendritic excitability; and determining the reduced modeling method of the neuron using the relationship between the asymmetry in signal propagation and the dendritic excitability. 2. The method as set forth in claim 1, wherein the relationship between the asymmetry in signal propagation and the dendritic excitability comprises:
increasing in signal attenuation from soma to dendrites increase activation threshold of a persistent inward current (PIC) dispersed over the dendrites (hypo-excitability); and increasing in signal attenuation from dendrites to soma decrease the activation threshold of the PIC dispersed over the dendrites (hyper-excitability). 3. The Method as set forth in claim 1, wherein the asymmetry in the signal propagation comprises spatial profiles of three voltage attenuation factors, wherein voltage attenuation factors have neuron voltage profiles in response to steady current injected at the soma (VASD DC), action potentials propagating from the initial segment and the soma into the dendrites (VASD AC), and steady synaptic inputs and plateau potential generated by VGICs in the dendrites (VADS DC). 4. The method as set forth in claim 3, wherein the VASD DC, the VASD AC and the VADS DC is determined using path length (Dpath) from the soma according to equation 1 to 3 respectively as below:
VA
SD
DC
(
D
path
)
=
exp
(
-
D
path
λ
SD
DC
)
(
1
)
VA
SD
AC
(
D
path
)
=
exp
(
-
D
path
λ
SD
AC
)
(
2
)
VA
DS
DC
(
D
path
)
=
1
1
-
exp
(
-
α
1
α
2
)
+
exp
(
D
path
-
α
1
α
2
)
.
(
3
) 5. The method as set forth in claim 3, wherein the asymmetry in the signal propagation is quantified by a ratio (VASD DC/VADS DC) of DC voltage between the soma and a single point in the dendrites as below:
R N,D(D path)=R N *VA SD DC(D path)/VA DS DC(D path), wherein the RN,D is input resistance (RN,D) at the same site of the dendrites. 6. Reduced modeling method for neuron, comprising:
determining voltage attenuation factors which represent properties of signal propagation between dendrites and a soma and is represented as functions of distance from the soma; and determining a plurality of passive parameter at a pre-determined path length using system parameters defined from the anatomical model comprising the voltage attenuation factors at the pre-determined path length. 7. The method as set forth in claim 6, wherein the voltage attenuation factors comprise VASD DC and VASD AC which are DC and AC component from soma to dendrites respectively, and VADS DC which is DC component from the dendrites to soma. 8. The method as set forth in claim 7, wherein the voltage attenuation factors representing signal propagation of the dendrites is defined as a ratio of voltage at measurement site to voltage at the current injection site in the passive membrane condition. 9. The method as set forth in claim 7, the VASD DC is measured at dendrites for propagation of steady current injected at the soma. 10. The method as set forth in claim 7, wherein the VADS DC is measured for propagation of steady synaptic inputs and persistent inward current generated by voltage gated ion channels(VGICs) that are distributed over all branches of the dendrites at the same distance from the soma. 11. The method as set forth in claim 7, wherein the VASD AC is measured for action potentials propagating from initial segment and the soma into the dendrites. 12. The method as set forth in claim 7, wherein the VASD DC and VASD AC is fitted by single exponential function with voltage decay constant (λSD DC and λSDAC). 13. The method as set forth in claim 12, wherein the VASD DC and VASD AC is determined by equation 1 and 2 as below:
VA
SD
DC
(
D
path
)
=
exp
(
-
D
path
λ
SD
DC
)
(
1
)
VA
SD
AC
(
D
path
)
=
exp
(
D
path
λ
SD
AC
)
.
(
2
) 14. The method as set forth in claim 7, wherein the VADS DC is fitted with a modified Boltzmann equation with two parameters α1 and α2, wherein α1 approximately represents the distance at the VADS DC=0.5 and α2 indicates the variation in the slope of the inverse-sigmoid curve of the VADS DC at α1. 15. The method as set forth in claim 14, wherein the VADS DC is determined by equation 3 as below:
VA
DS
DC
(
D
path
)
=
1
1
-
exp
(
-
α
1
α
2
)
+
exp
(
D
path
-
α
1
α
2
)
.
(
3
) 16. The method as set forth in claim 7, wherein the system parameters comprise the voltage attenuation factors, somatic input resistance of the neuron (RN) and membrane time constant of the neuron (τm). 17. The method as set forth in claim 16, wherein the plurality of passive parameter is determined at the specific Dpath from the soma by solving the inverse equations for the system parameters. 18. The method as set forth in claim 17, wherein the passive parameters comprise somatic membrane conductance and dendritic membrane conductance (Gm,S and Gm,D), somatic membrane capacitance and dendritic membrane capacitance (Cm,S and Cm,D), and one coupling conductance (GC) between the soma and dendrite. 19. The method as set forth in claim 18, wherein the determining a plurality of passive parameter comprises determining the plurality of passive parameter by equation 4 to 8 as below:
G
m
,
S
=
1
-
VA
DS
DC
r
N
(
1
-
VA
SD
DC
VA
DS
DC
)
(
4
)
G
m
,
D
=
p
VA
DS
DC
(
1
-
VA
SD
DC
)
(
1
-
p
)
r
N
VA
SD
DC
(
1
-
VA
SD
DC
VA
DS
DC
)
(
5
)
G
C
=
p
VA
DS
DC
r
N
(
1
-
VA
SD
DC
VA
DS
DC
)
(
6
)
C
m
,
D
=
1
ω
(
1
-
p
)
√
G
C
2
(
VA
SD
AC
)
2
-
{
G
C
+
G
m
,
D
(
1
-
p
)
}
2
(
7
)
C
m
,
S
=
τ
m
{
p
(
1
-
p
)
τ
m
G
m
,
S
G
m
,
D
+
pG
m
,
S
(
τ
m
G
C
-
C
m
,
D
)
+
p
2
G
m
,
S
C
m
,
D
+
(
1
-
p
)
(
τ
m
G
C
G
m
,
D
-
G
C
C
m
,
D
}
p
{
(
1
-
p
)
(
τ
m
G
m
,
D
-
C
m
,
D
)
+
τ
m
G
C
,
(
8
)
wherein rN is the input resistance (RN) normalized with the surface area of somatic compartment, ω is the maximum frequency component in an action potential, and p is the ratio of somatic to total surface area of the reduced model. 20. The method as set forth in claim 18 further comprises determining two-compartmental neuron model consisting of a somatic compartment and a dendritic compartment that are coupled with the single conductance (GC), wherein the somatic compartment has the Gm,S and the Cm,S as passive dynamics, and the dendritic compartment has the Gm,D and the Cm,D as passive dynamics. | Disclosed herein is modeling method which is enabled to analyses neurons in order to reduce real neurons physiologically properly using the relationship between asymmetry in signal propagation between a soma and dendrites and dendritic excitability. The modeling method for neurons include determining voltage attenuation factors which represent properties of signal propagation between dendrites and a soma and is represented as functions of distance from the soma; and determining a plurality of passive parameter at a pre-determined path length using system parameters defined from the anatomical model comprising the voltage attenuation factors at the pre-determined path length.1. Reduced modeling method for neuron, comprising:
confirming asymmetry in signal propagation between a soma and dendrites of neuron which is modeled; confirming dendritic excitability of the neuron; identifying relationship between the asymmetry in signal propagation and the dendritic excitability; and determining the reduced modeling method of the neuron using the relationship between the asymmetry in signal propagation and the dendritic excitability. 2. The method as set forth in claim 1, wherein the relationship between the asymmetry in signal propagation and the dendritic excitability comprises:
increasing in signal attenuation from soma to dendrites increase activation threshold of a persistent inward current (PIC) dispersed over the dendrites (hypo-excitability); and increasing in signal attenuation from dendrites to soma decrease the activation threshold of the PIC dispersed over the dendrites (hyper-excitability). 3. The Method as set forth in claim 1, wherein the asymmetry in the signal propagation comprises spatial profiles of three voltage attenuation factors, wherein voltage attenuation factors have neuron voltage profiles in response to steady current injected at the soma (VASD DC), action potentials propagating from the initial segment and the soma into the dendrites (VASD AC), and steady synaptic inputs and plateau potential generated by VGICs in the dendrites (VADS DC). 4. The method as set forth in claim 3, wherein the VASD DC, the VASD AC and the VADS DC is determined using path length (Dpath) from the soma according to equation 1 to 3 respectively as below:
VA
SD
DC
(
D
path
)
=
exp
(
-
D
path
λ
SD
DC
)
(
1
)
VA
SD
AC
(
D
path
)
=
exp
(
-
D
path
λ
SD
AC
)
(
2
)
VA
DS
DC
(
D
path
)
=
1
1
-
exp
(
-
α
1
α
2
)
+
exp
(
D
path
-
α
1
α
2
)
.
(
3
) 5. The method as set forth in claim 3, wherein the asymmetry in the signal propagation is quantified by a ratio (VASD DC/VADS DC) of DC voltage between the soma and a single point in the dendrites as below:
R N,D(D path)=R N *VA SD DC(D path)/VA DS DC(D path), wherein the RN,D is input resistance (RN,D) at the same site of the dendrites. 6. Reduced modeling method for neuron, comprising:
determining voltage attenuation factors which represent properties of signal propagation between dendrites and a soma and is represented as functions of distance from the soma; and determining a plurality of passive parameter at a pre-determined path length using system parameters defined from the anatomical model comprising the voltage attenuation factors at the pre-determined path length. 7. The method as set forth in claim 6, wherein the voltage attenuation factors comprise VASD DC and VASD AC which are DC and AC component from soma to dendrites respectively, and VADS DC which is DC component from the dendrites to soma. 8. The method as set forth in claim 7, wherein the voltage attenuation factors representing signal propagation of the dendrites is defined as a ratio of voltage at measurement site to voltage at the current injection site in the passive membrane condition. 9. The method as set forth in claim 7, the VASD DC is measured at dendrites for propagation of steady current injected at the soma. 10. The method as set forth in claim 7, wherein the VADS DC is measured for propagation of steady synaptic inputs and persistent inward current generated by voltage gated ion channels(VGICs) that are distributed over all branches of the dendrites at the same distance from the soma. 11. The method as set forth in claim 7, wherein the VASD AC is measured for action potentials propagating from initial segment and the soma into the dendrites. 12. The method as set forth in claim 7, wherein the VASD DC and VASD AC is fitted by single exponential function with voltage decay constant (λSD DC and λSDAC). 13. The method as set forth in claim 12, wherein the VASD DC and VASD AC is determined by equation 1 and 2 as below:
VA
SD
DC
(
D
path
)
=
exp
(
-
D
path
λ
SD
DC
)
(
1
)
VA
SD
AC
(
D
path
)
=
exp
(
D
path
λ
SD
AC
)
.
(
2
) 14. The method as set forth in claim 7, wherein the VADS DC is fitted with a modified Boltzmann equation with two parameters α1 and α2, wherein α1 approximately represents the distance at the VADS DC=0.5 and α2 indicates the variation in the slope of the inverse-sigmoid curve of the VADS DC at α1. 15. The method as set forth in claim 14, wherein the VADS DC is determined by equation 3 as below:
VA
DS
DC
(
D
path
)
=
1
1
-
exp
(
-
α
1
α
2
)
+
exp
(
D
path
-
α
1
α
2
)
.
(
3
) 16. The method as set forth in claim 7, wherein the system parameters comprise the voltage attenuation factors, somatic input resistance of the neuron (RN) and membrane time constant of the neuron (τm). 17. The method as set forth in claim 16, wherein the plurality of passive parameter is determined at the specific Dpath from the soma by solving the inverse equations for the system parameters. 18. The method as set forth in claim 17, wherein the passive parameters comprise somatic membrane conductance and dendritic membrane conductance (Gm,S and Gm,D), somatic membrane capacitance and dendritic membrane capacitance (Cm,S and Cm,D), and one coupling conductance (GC) between the soma and dendrite. 19. The method as set forth in claim 18, wherein the determining a plurality of passive parameter comprises determining the plurality of passive parameter by equation 4 to 8 as below:
G
m
,
S
=
1
-
VA
DS
DC
r
N
(
1
-
VA
SD
DC
VA
DS
DC
)
(
4
)
G
m
,
D
=
p
VA
DS
DC
(
1
-
VA
SD
DC
)
(
1
-
p
)
r
N
VA
SD
DC
(
1
-
VA
SD
DC
VA
DS
DC
)
(
5
)
G
C
=
p
VA
DS
DC
r
N
(
1
-
VA
SD
DC
VA
DS
DC
)
(
6
)
C
m
,
D
=
1
ω
(
1
-
p
)
√
G
C
2
(
VA
SD
AC
)
2
-
{
G
C
+
G
m
,
D
(
1
-
p
)
}
2
(
7
)
C
m
,
S
=
τ
m
{
p
(
1
-
p
)
τ
m
G
m
,
S
G
m
,
D
+
pG
m
,
S
(
τ
m
G
C
-
C
m
,
D
)
+
p
2
G
m
,
S
C
m
,
D
+
(
1
-
p
)
(
τ
m
G
C
G
m
,
D
-
G
C
C
m
,
D
}
p
{
(
1
-
p
)
(
τ
m
G
m
,
D
-
C
m
,
D
)
+
τ
m
G
C
,
(
8
)
wherein rN is the input resistance (RN) normalized with the surface area of somatic compartment, ω is the maximum frequency component in an action potential, and p is the ratio of somatic to total surface area of the reduced model. 20. The method as set forth in claim 18 further comprises determining two-compartmental neuron model consisting of a somatic compartment and a dendritic compartment that are coupled with the single conductance (GC), wherein the somatic compartment has the Gm,S and the Cm,S as passive dynamics, and the dendritic compartment has the Gm,D and the Cm,D as passive dynamics. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.