Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
4,700 | 13,961,542 | 2,126 | An aspect provides a method, including: collecting, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; processing, using one or more processors, the one or more inputs to detect an unauthorized behavior pattern; mapping, using the one or more processors, the unauthorized behavior pattern to a predetermined action; and executing the predetermined action. Other aspects are described and claimed. | 1. A method, comprising:
collecting, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; processing, using one or more processors, the one or more inputs to detect an unauthorized behavior pattern; mapping, using the one or more processors, the unauthorized behavior pattern to a predetermined action; and executing the predetermined action. 2. The method of claim 1, wherein the processing comprises analyzing the audio inputs to detect more than one speaker;
the analyzing the audio inputs to detect more than one speaker comprising detecting, using data derived from a microphone array, distinguishable speech data signals within the audio inputs collected. 3. The method of claim 2, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker recognition analysis to recognize at least one of two or more speakers detectable in the audio inputs collected. 4. The method of claim 2, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker detection analysis to distinguish two or more speakers in the audio inputs collected. 5. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing a data store of audio analysis information and comparing processed audio inputs collected from the learning environment to the audio analysis information. 6. The method of claim 5, wherein the data store of audio analysis information comprises audio analysis information selected from the group of audio analysis information consisting of: audio analysis information derived from a group of users; and audio analysis information derived from a single user. 7. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing processed visual inputs collected from the learning environment to the visual analysis information. 8. The method of claim 1, wherein the processing comprises analyzing the visual inputs to detect a gaze pattern of a user; and
wherein the detecting an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing the gaze pattern of the user to stored visual analysis information. 9. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing additional data responsive to an initial detection of an unauthorized behavior pattern. 10. The method of claim 9, wherein the additional data comprises data derived from one or more test inputs provided by a user selected from the group of users consisting of: a user providing the visual information collected and another user located in the same learning environment. 11. An information handling device, comprising:
one or more of an audio sensor and a visual sensor; one or more processors; and a memory accessible to the one or more processors storing instructions executable by the one or more processors to: collect, at one or more of the audio sensor and the visual sensor, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; process the one or more inputs to detect an unauthorized behavior pattern; map the unauthorized behavior pattern to a predetermined action; and execute the predetermined action. 12. The apparatus of claim 1, wherein to process comprises analyzing the audio inputs to detect more than one speaker;
the analyzing the audio inputs to detect more than one speaker comprising detecting, using data derived from a microphone array, distinguishable speech data signals within the audio inputs collected. 13. The apparatus of claim 12, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker recognition analysis to recognize at least one of two or more speakers detectable in the audio inputs collected. 14. The apparatus of claim 12, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker detection analysis to distinguish two or more speakers in the audio inputs collected. 15. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing a data store of audio analysis information and comparing processed audio inputs collected from the learning environment to the audio analysis information. 16. The apparatus of claim 15, wherein the data store of audio analysis information comprises audio analysis information selected from the group of audio analysis information consisting of: audio analysis information derived from a group of users; and audio analysis information derived from a single user. 17. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing processed visual inputs collected from the learning environment to the visual analysis information. 18. The apparatus of claim 11, wherein to process comprises analyzing the visual inputs to detect a gaze pattern of a user; and
wherein to detect an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing the gaze pattern of the user to stored visual analysis information. 19. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing additional data responsive to an initial detection of an unauthorized behavior pattern;
wherein the additional data comprises data derived from one or more test inputs provided by a user selected from the group of users consisting of: a user providing the visual information collected and another user located in the same learning environment. 20. A product, comprising:
a computer readable storage medium storing instructions executable by one or more processors, the instructions comprising: computer readable program code configured to collect, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; computer readable program code configured to process the one or more inputs to detect an unauthorized behavior pattern; computer readable program code configured to map the unauthorized behavior pattern to a predetermined action; and computer readable program code configured to execute the predetermined action. | An aspect provides a method, including: collecting, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; processing, using one or more processors, the one or more inputs to detect an unauthorized behavior pattern; mapping, using the one or more processors, the unauthorized behavior pattern to a predetermined action; and executing the predetermined action. Other aspects are described and claimed.1. A method, comprising:
collecting, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; processing, using one or more processors, the one or more inputs to detect an unauthorized behavior pattern; mapping, using the one or more processors, the unauthorized behavior pattern to a predetermined action; and executing the predetermined action. 2. The method of claim 1, wherein the processing comprises analyzing the audio inputs to detect more than one speaker;
the analyzing the audio inputs to detect more than one speaker comprising detecting, using data derived from a microphone array, distinguishable speech data signals within the audio inputs collected. 3. The method of claim 2, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker recognition analysis to recognize at least one of two or more speakers detectable in the audio inputs collected. 4. The method of claim 2, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker detection analysis to distinguish two or more speakers in the audio inputs collected. 5. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing a data store of audio analysis information and comparing processed audio inputs collected from the learning environment to the audio analysis information. 6. The method of claim 5, wherein the data store of audio analysis information comprises audio analysis information selected from the group of audio analysis information consisting of: audio analysis information derived from a group of users; and audio analysis information derived from a single user. 7. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing processed visual inputs collected from the learning environment to the visual analysis information. 8. The method of claim 1, wherein the processing comprises analyzing the visual inputs to detect a gaze pattern of a user; and
wherein the detecting an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing the gaze pattern of the user to stored visual analysis information. 9. The method of claim 1, wherein the detecting an unauthorized behavior pattern comprises accessing additional data responsive to an initial detection of an unauthorized behavior pattern. 10. The method of claim 9, wherein the additional data comprises data derived from one or more test inputs provided by a user selected from the group of users consisting of: a user providing the visual information collected and another user located in the same learning environment. 11. An information handling device, comprising:
one or more of an audio sensor and a visual sensor; one or more processors; and a memory accessible to the one or more processors storing instructions executable by the one or more processors to: collect, at one or more of the audio sensor and the visual sensor, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; process the one or more inputs to detect an unauthorized behavior pattern; map the unauthorized behavior pattern to a predetermined action; and execute the predetermined action. 12. The apparatus of claim 1, wherein to process comprises analyzing the audio inputs to detect more than one speaker;
the analyzing the audio inputs to detect more than one speaker comprising detecting, using data derived from a microphone array, distinguishable speech data signals within the audio inputs collected. 13. The apparatus of claim 12, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker recognition analysis to recognize at least one of two or more speakers detectable in the audio inputs collected. 14. The apparatus of claim 12, wherein the analyzing the audio inputs to detect more than one speaker comprises performing speaker detection analysis to distinguish two or more speakers in the audio inputs collected. 15. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing a data store of audio analysis information and comparing processed audio inputs collected from the learning environment to the audio analysis information. 16. The apparatus of claim 15, wherein the data store of audio analysis information comprises audio analysis information selected from the group of audio analysis information consisting of: audio analysis information derived from a group of users; and audio analysis information derived from a single user. 17. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing processed visual inputs collected from the learning environment to the visual analysis information. 18. The apparatus of claim 11, wherein to process comprises analyzing the visual inputs to detect a gaze pattern of a user; and
wherein to detect an unauthorized behavior pattern comprises accessing a data store of visual analysis information and comparing the gaze pattern of the user to stored visual analysis information. 19. The apparatus of claim 11, wherein to detect an unauthorized behavior pattern comprises accessing additional data responsive to an initial detection of an unauthorized behavior pattern;
wherein the additional data comprises data derived from one or more test inputs provided by a user selected from the group of users consisting of: a user providing the visual information collected and another user located in the same learning environment. 20. A product, comprising:
a computer readable storage medium storing instructions executable by one or more processors, the instructions comprising: computer readable program code configured to collect, at one or more device sensors, one or more inputs selected from the group of inputs consisting of audio inputs from a learning environment and visual inputs from a learning environment; computer readable program code configured to process the one or more inputs to detect an unauthorized behavior pattern; computer readable program code configured to map the unauthorized behavior pattern to a predetermined action; and computer readable program code configured to execute the predetermined action. | 2,100 |
4,701 | 14,170,482 | 2,199 | A software development platform comprising one or more user-selectable modular units containing a vertical stack of back-end business logic. One or more user-selectable modular units containing domain model components. One or more user-selectable modular units containing front end presentation components. A virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing front end presentation components. | 1. A software development platform comprising:
one or more user-selectable modular units containing a vertical stack of back-end business logic; one or more user-selectable modular units containing domain model components; one or more user-selectable modular units containing front end presentation components; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing front end presentation components. 2. The software development platform of claim 1 wherein the one or more user-selectable modular units containing the vertical stack of back-end business logic further comprises a query service, logical constructs, an authentication-authorization-accounting service, a tracking service, a template/profiles service, a compensation service, a license service, a persistence service and a discovery service. 3. The software development platform of claim 1 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing front end presentation components are configured to be dynamically deployed at runtime. 4. The software development platform of claim 1 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing front end presentation components are extensible, self-contained modular components. 5. The software development platform of claim 1 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 6. The software development platform of claim 5 wherein the business logic engine is configured to provide dynamic deployment and upgrade. 7. A converged infrastructure platform comprising:
one or more user-selectable modular units containing configuration fragments; one or more user-selectable modular units containing domain-specific model components; one or more user-selectable modular units containing front end presentation components; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the configuration fragments, one or more of the user-selectable modular units containing the domain-specific model components and one or more of the user-selectable modular units containing front end presentation components. 8. The software development platform of claim 7 wherein the one or more user-selectable modular units containing the configuration fragments further comprises
a configuration template having two or more predetermined configuration code segments. 9. The software development platform of claim 7 wherein each of the modular units containing the configuration fragments, the modular units containing the domain-specific model components and the modular units containing front end presentation components are configured to be dynamically deployed at runtime. 10. The software development platform of claim 7 wherein each of the modular units containing the configuration fragments, the modular units containing the domain-specific model components are declarative components. 11. The software development platform of claim 7 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 12. The software development platform of claim 11 wherein the business logic engine is configured to provide dynamic deployment and upgrade. 13. A software development platform comprising:
one or more user-selectable modular units containing a vertical stack of back-end business logic; one or more user-selectable modular units containing domain model components; one or more user-selectable modular units containing domain models of hardware devices; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing domain models of hardware devices. 14. The software development platform of claim 13 wherein the one or more user-selectable modular units containing the vertical stack of back-end business logic further comprises a query service, logical constructs, an authentication-authorization-accounting service, a tracking service, a template/profiles service, a compensation service, a license service, a persistence service and a discovery service. 15. The software development platform of claim 13 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing the domain models of hardware devices are configured to be dynamically deployed at runtime. 16. The software development platform of claim 13 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing the domain models of hardware devices are extensible components. 17. The software development platform of claim 13 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 18. The software development platform of claim 17 wherein the business logic engine is configured to provide dynamic deployment and upgrade. | A software development platform comprising one or more user-selectable modular units containing a vertical stack of back-end business logic. One or more user-selectable modular units containing domain model components. One or more user-selectable modular units containing front end presentation components. A virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing front end presentation components.1. A software development platform comprising:
one or more user-selectable modular units containing a vertical stack of back-end business logic; one or more user-selectable modular units containing domain model components; one or more user-selectable modular units containing front end presentation components; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing front end presentation components. 2. The software development platform of claim 1 wherein the one or more user-selectable modular units containing the vertical stack of back-end business logic further comprises a query service, logical constructs, an authentication-authorization-accounting service, a tracking service, a template/profiles service, a compensation service, a license service, a persistence service and a discovery service. 3. The software development platform of claim 1 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing front end presentation components are configured to be dynamically deployed at runtime. 4. The software development platform of claim 1 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing front end presentation components are extensible, self-contained modular components. 5. The software development platform of claim 1 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 6. The software development platform of claim 5 wherein the business logic engine is configured to provide dynamic deployment and upgrade. 7. A converged infrastructure platform comprising:
one or more user-selectable modular units containing configuration fragments; one or more user-selectable modular units containing domain-specific model components; one or more user-selectable modular units containing front end presentation components; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the configuration fragments, one or more of the user-selectable modular units containing the domain-specific model components and one or more of the user-selectable modular units containing front end presentation components. 8. The software development platform of claim 7 wherein the one or more user-selectable modular units containing the configuration fragments further comprises
a configuration template having two or more predetermined configuration code segments. 9. The software development platform of claim 7 wherein each of the modular units containing the configuration fragments, the modular units containing the domain-specific model components and the modular units containing front end presentation components are configured to be dynamically deployed at runtime. 10. The software development platform of claim 7 wherein each of the modular units containing the configuration fragments, the modular units containing the domain-specific model components are declarative components. 11. The software development platform of claim 7 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 12. The software development platform of claim 11 wherein the business logic engine is configured to provide dynamic deployment and upgrade. 13. A software development platform comprising:
one or more user-selectable modular units containing a vertical stack of back-end business logic; one or more user-selectable modular units containing domain model components; one or more user-selectable modular units containing domain models of hardware devices; and a virtual appliance comprising application-specific logic that includes one or more of the modular units containing the vertical stack of back-end business logic, one or more of the user-selectable modular units containing the domain model components and one or more of the user-selectable modular units containing domain models of hardware devices. 14. The software development platform of claim 13 wherein the one or more user-selectable modular units containing the vertical stack of back-end business logic further comprises a query service, logical constructs, an authentication-authorization-accounting service, a tracking service, a template/profiles service, a compensation service, a license service, a persistence service and a discovery service. 15. The software development platform of claim 13 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing the domain models of hardware devices are configured to be dynamically deployed at runtime. 16. The software development platform of claim 13 wherein each of the modular units containing the vertical stack of back-end business logic, the modular units containing the domain model components and the modular units containing the domain models of hardware devices are extensible components. 17. The software development platform of claim 13 further comprising a business logic engine configured to provide a container to define and execute application provided logics. 18. The software development platform of claim 17 wherein the business logic engine is configured to provide dynamic deployment and upgrade. | 2,100 |
4,702 | 15,190,153 | 2,165 | In certain implementations, first and second plans (for obtaining data from one or more data sources and/or processing the obtained data) may be determined. The first and second plans may be executed. A first cost for fully executing the first plan may be estimated based on partial execution of the first plan, and a second cost for fully executing the second plan may be estimated based on partial execution of the second plan, where the first and second costs are estimated after the executions of the first and second plans have begun and before the executions of the first and second plans are completed. The execution of one of the first or second plans may be prioritized over at least the execution of the other one of the first or second plans based on a comparison of the estimated first and second costs. | 1. A computer-implemented method of prioritizing execution of plans for obtaining and/or processing data based on partial execution of the plans, the method being implemented by a computer system that includes one or more physical processors executing one or more computer program instructions that, when executed, perform the method, the method comprising:
determining, by the computer system, at least a first plan and a second plan for obtaining data from one or more data sources and/or processing the obtained data; executing, by the computer system, the first plan and the second plan; estimating, by the computer system, based on partial execution of the first plan, a first cost for fully executing the first plan; estimating, by the computer system, based on partial execution of the second plan, a second cost for fully executing the second plan, wherein the first cost and the second cost are estimated after the execution of the first plan and the execution of the second plan have begun and before the execution of the first plan and the execution of the second plan are completed; and prioritizing, by the computer system, the execution of one of the first plan or the second plan over at least the execution of the other one of the first plan or the second plan based on a comparison of the estimated first cost and the estimated second cost. 2. The method of claim 1, wherein the execution of the first plan is prioritized over at least execution of the second plan based on the comparison indicating that the estimated first cost is less than the estimated second cost, the method further comprising:
continuing, by the computer system, the execution of the first plan based on the prioritization; and suspending or canceling, by the computer system, the execution of the second plan based on the prioritization. 3. The method of claim 1, further comprising:
estimating, by the computer system, based on the partial execution of the first plan, a percentage of the first plan that has been executed; and estimating, by the computer system, based on the partial execution of the second plan, a percentage of the second plan that has been executed, wherein the first cost for fully executing the first plan is estimated based on a cost of the partial execution of the first plan and the percentage of the first plan that has been executed, and wherein the second cost for fully executing the second plan is estimated based on a cost of the partial execution of the second plan and the percentage of the second plan that has been executed. 4. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a data source, and the second plan comprises obtaining results related to the data set from the data source. 5. The method of claim 4, wherein the first plan comprises utilizing a first path to obtain results related to the data set from the data source, and the second plan comprises utilizing a second path different than the first path to obtain results related to the data set from the data source. 6. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a first data source before obtaining results related to the data set from a second data source, and the second plan comprises obtaining results related to the data set from the second data source before obtaining results related to the data set from the first data source. 7. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a data source that is not utilized in the second plan for obtaining results related to the data set. 8. The method of claim 1, further comprising:
estimating, based on the partial execution of the first plan, a first delay associated with presenting a set of results related to a data set when the first plan is used; and estimating, based on the partial execution of the second plan, a second delay associated with presenting a set of results related to the data set when the second plan is used, wherein the first cost for fully executing the first plan is estimated based on the estimated first delay, and wherein the second cost for fully executing the second plan is estimated based on the estimated second delay. 9. The method of claim 1, further comprising:
estimating, based on the partial execution of the first plan, first delays between updates to a presentation of a data set to a user when the first plan is used; and estimating, based on the partial execution of the second plan, second delays between updates to a presentation of a data set to a user when the second plan is used, wherein the first cost for fully executing the first plan is estimated based on the estimated first delays, and wherein the second cost for fully executing the second plan is estimated based on the estimated second delays. 10. The method of claim 1, wherein estimating the first cost is based on predefined performance metrics associated with a first data source that is utilized in the first plan, and wherein estimating the second cost is based on predefined performance metrics associated with a second data source that is utilized in the second plan. 11. The method of claim 10, wherein the predefined performance metrics comprise one or both of latency and throughput of data through the data sources. 12. The method of claim 1, wherein estimating the first cost is based on historical cost information associated with one or more aspects of the first plan, and wherein estimating the second cost is based on historical cost information associated with one or more aspects of the second plan. 13. The method of claim 1, wherein the first plan and the second plan are executed in parallel before the prioritization. 14. The method of claim 13, wherein the first cost is estimated based on the partial execution of the first plan that occurred in parallel with the execution of the second plan, and the second cost is estimated based on the partial execution of the second plan that occurred in parallel with the execution of the first plan. 15. A system for prioritizing execution of plans for obtaining and/or processing data based on partial execution of the plans, the system comprising:
one or more physical processors programmed to execute one or more computer program instructions that, when executed, cause the one or more physical processors to:
determine at least a first plan and a second plan for obtaining data from one or more data sources and/or processing the obtained data;
execute the first plan and the second plan;
estimate, based on partial execution of the first plan, a first cost for fully executing the first plan;
estimate, based on partial execution of the second plan, a second cost for fully executing the second plan, wherein the first cost and the second cost are estimated after the execution of the first plan and the execution of the second plan have begun and before the execution of the first plan and the execution of the second plan are completed; and
prioritize the execution of one of the first plan or the second plan over at least the execution of the other one of the first plan or the second plan based on a comparison of the estimated first cost and the estimated second cost. 16. The system of claim 15, wherein the execution of the first plan is prioritized over at least execution of the second plan based on the comparison indicating that the estimated first cost is less than the estimated second cost, and wherein the one or more physical processors are further caused to:
continue the execution of the first plan based on the prioritization; and suspend or cancel the execution of the second plan based on the prioritization. 17. The system of claim 15, wherein the one or more physical processors are further caused to:
estimate, based on the partial execution of the first plan, a percentage of the first plan that has been executed; and estimate, based on the partial execution of the second plan, a percentage of the second plan that has been executed, wherein the first cost for fully executing the first plan is estimated based on a cost of the partial execution of the first plan and the percentage of the first plan that has been executed, and wherein the second cost for fully executing the second plan is estimated based on a cost of the partial execution of the second plan and the percentage of the second plan that has been executed. 18. The system of claim 15, wherein first plan comprises obtaining results related to a data set from a data source and comprises utilizing a first path to obtain results related to the data set from the data source, and the second plan comprises obtaining results related to the data set from the data source and utilizing a second path different than the first path to obtain results related to the data set from the data source. 19. The system of claim 15, wherein the first plan comprises obtaining results related to a data set from a first data source before obtaining results related to the data set from a second data source, and the second plan comprises obtaining results related to the data set from the second data source before obtaining results related to the data set from the first data source. 20. The system of claim 15, wherein the first plan comprises obtaining results related to a data set from a data source that is not utilized in the second plan for obtaining results related to the data set. | In certain implementations, first and second plans (for obtaining data from one or more data sources and/or processing the obtained data) may be determined. The first and second plans may be executed. A first cost for fully executing the first plan may be estimated based on partial execution of the first plan, and a second cost for fully executing the second plan may be estimated based on partial execution of the second plan, where the first and second costs are estimated after the executions of the first and second plans have begun and before the executions of the first and second plans are completed. The execution of one of the first or second plans may be prioritized over at least the execution of the other one of the first or second plans based on a comparison of the estimated first and second costs.1. A computer-implemented method of prioritizing execution of plans for obtaining and/or processing data based on partial execution of the plans, the method being implemented by a computer system that includes one or more physical processors executing one or more computer program instructions that, when executed, perform the method, the method comprising:
determining, by the computer system, at least a first plan and a second plan for obtaining data from one or more data sources and/or processing the obtained data; executing, by the computer system, the first plan and the second plan; estimating, by the computer system, based on partial execution of the first plan, a first cost for fully executing the first plan; estimating, by the computer system, based on partial execution of the second plan, a second cost for fully executing the second plan, wherein the first cost and the second cost are estimated after the execution of the first plan and the execution of the second plan have begun and before the execution of the first plan and the execution of the second plan are completed; and prioritizing, by the computer system, the execution of one of the first plan or the second plan over at least the execution of the other one of the first plan or the second plan based on a comparison of the estimated first cost and the estimated second cost. 2. The method of claim 1, wherein the execution of the first plan is prioritized over at least execution of the second plan based on the comparison indicating that the estimated first cost is less than the estimated second cost, the method further comprising:
continuing, by the computer system, the execution of the first plan based on the prioritization; and suspending or canceling, by the computer system, the execution of the second plan based on the prioritization. 3. The method of claim 1, further comprising:
estimating, by the computer system, based on the partial execution of the first plan, a percentage of the first plan that has been executed; and estimating, by the computer system, based on the partial execution of the second plan, a percentage of the second plan that has been executed, wherein the first cost for fully executing the first plan is estimated based on a cost of the partial execution of the first plan and the percentage of the first plan that has been executed, and wherein the second cost for fully executing the second plan is estimated based on a cost of the partial execution of the second plan and the percentage of the second plan that has been executed. 4. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a data source, and the second plan comprises obtaining results related to the data set from the data source. 5. The method of claim 4, wherein the first plan comprises utilizing a first path to obtain results related to the data set from the data source, and the second plan comprises utilizing a second path different than the first path to obtain results related to the data set from the data source. 6. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a first data source before obtaining results related to the data set from a second data source, and the second plan comprises obtaining results related to the data set from the second data source before obtaining results related to the data set from the first data source. 7. The method of claim 1, wherein the first plan comprises obtaining results related to a data set from a data source that is not utilized in the second plan for obtaining results related to the data set. 8. The method of claim 1, further comprising:
estimating, based on the partial execution of the first plan, a first delay associated with presenting a set of results related to a data set when the first plan is used; and estimating, based on the partial execution of the second plan, a second delay associated with presenting a set of results related to the data set when the second plan is used, wherein the first cost for fully executing the first plan is estimated based on the estimated first delay, and wherein the second cost for fully executing the second plan is estimated based on the estimated second delay. 9. The method of claim 1, further comprising:
estimating, based on the partial execution of the first plan, first delays between updates to a presentation of a data set to a user when the first plan is used; and estimating, based on the partial execution of the second plan, second delays between updates to a presentation of a data set to a user when the second plan is used, wherein the first cost for fully executing the first plan is estimated based on the estimated first delays, and wherein the second cost for fully executing the second plan is estimated based on the estimated second delays. 10. The method of claim 1, wherein estimating the first cost is based on predefined performance metrics associated with a first data source that is utilized in the first plan, and wherein estimating the second cost is based on predefined performance metrics associated with a second data source that is utilized in the second plan. 11. The method of claim 10, wherein the predefined performance metrics comprise one or both of latency and throughput of data through the data sources. 12. The method of claim 1, wherein estimating the first cost is based on historical cost information associated with one or more aspects of the first plan, and wherein estimating the second cost is based on historical cost information associated with one or more aspects of the second plan. 13. The method of claim 1, wherein the first plan and the second plan are executed in parallel before the prioritization. 14. The method of claim 13, wherein the first cost is estimated based on the partial execution of the first plan that occurred in parallel with the execution of the second plan, and the second cost is estimated based on the partial execution of the second plan that occurred in parallel with the execution of the first plan. 15. A system for prioritizing execution of plans for obtaining and/or processing data based on partial execution of the plans, the system comprising:
one or more physical processors programmed to execute one or more computer program instructions that, when executed, cause the one or more physical processors to:
determine at least a first plan and a second plan for obtaining data from one or more data sources and/or processing the obtained data;
execute the first plan and the second plan;
estimate, based on partial execution of the first plan, a first cost for fully executing the first plan;
estimate, based on partial execution of the second plan, a second cost for fully executing the second plan, wherein the first cost and the second cost are estimated after the execution of the first plan and the execution of the second plan have begun and before the execution of the first plan and the execution of the second plan are completed; and
prioritize the execution of one of the first plan or the second plan over at least the execution of the other one of the first plan or the second plan based on a comparison of the estimated first cost and the estimated second cost. 16. The system of claim 15, wherein the execution of the first plan is prioritized over at least execution of the second plan based on the comparison indicating that the estimated first cost is less than the estimated second cost, and wherein the one or more physical processors are further caused to:
continue the execution of the first plan based on the prioritization; and suspend or cancel the execution of the second plan based on the prioritization. 17. The system of claim 15, wherein the one or more physical processors are further caused to:
estimate, based on the partial execution of the first plan, a percentage of the first plan that has been executed; and estimate, based on the partial execution of the second plan, a percentage of the second plan that has been executed, wherein the first cost for fully executing the first plan is estimated based on a cost of the partial execution of the first plan and the percentage of the first plan that has been executed, and wherein the second cost for fully executing the second plan is estimated based on a cost of the partial execution of the second plan and the percentage of the second plan that has been executed. 18. The system of claim 15, wherein first plan comprises obtaining results related to a data set from a data source and comprises utilizing a first path to obtain results related to the data set from the data source, and the second plan comprises obtaining results related to the data set from the data source and utilizing a second path different than the first path to obtain results related to the data set from the data source. 19. The system of claim 15, wherein the first plan comprises obtaining results related to a data set from a first data source before obtaining results related to the data set from a second data source, and the second plan comprises obtaining results related to the data set from the second data source before obtaining results related to the data set from the first data source. 20. The system of claim 15, wherein the first plan comprises obtaining results related to a data set from a data source that is not utilized in the second plan for obtaining results related to the data set. | 2,100 |
4,703 | 14,216,812 | 2,131 | Systems and techniques are described for optimizing memory sharing. A described technique includes grouping virtual machines (VMs) into groups including a first group; initializing a first VM in the first group, wherein initializing the first VM includes identifying, for each of one or more first memory pages for the first VM, a respective base address for storing the first memory page using an address randomization technique, and storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group, and initializing a second VM while the first VM is active, wherein initializing the second VM includes determining that the second VM is a member of the first group, and in response, storing one or more second memory pages for the second VM using the respective base addresses stored for the first group. | 1. A computer-implemented method of optimizing memory sharing on a virtualized computer system including a plurality of virtual machines, the method comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group; initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 2. The method of claim 1, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 3. The method of claim 1, further comprising:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 4. The method of claim 1, further comprising:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. 5. The method of claim 1, wherein identifying a respective base address for each of the one or more first memory pages comprises receiving memory location data from a guest operating system of the first virtual machine in response to initializing the first virtual machine, the memory location data specifying the respective base address for the each of the one or more first memory pages. 6. The method of claim 5, wherein the guest operating system of the first virtual machine selected the respective base address for each of the one or more memory pages using the address randomization technique. 7. The method of claim 1, wherein the one or more first memory pages include at least one of the following: a system module, an executable, a stack, a heap, a library, a system driver, and a dynamic load library. 8. The method of claim 1, wherein the one or more first memory pages is subject to an address randomization feature of a guest operating system on the first virtual machine. 9. A system comprising:
data processing apparatus programmed to perform operations comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group;
initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 10. The system of claim 9, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 11. The system of claim 9, the operations further comprising:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 12. The system of claim 9, the operations further comprising:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. 13. The system of claim 9, wherein identifying a respective base address for each of the one or more first memory pages comprises receiving memory location data from a guest operating system of the first virtual machine in response to initializing the first virtual machine, the memory location data specifying the respective base address for the each of the one or more first memory pages. 14. The system of claim 13, wherein the guest operating system of the first virtual machine selected the respective base address for each of the one or more memory pages using the address randomization technique. 15. The system of claim 9, wherein the one or more first memory pages include at least one of the following: a system module, an executable, a stack, a heap, a library, a system driver, and a dynamic load library. 16. The system of claim 9, wherein the one or more first memory pages is subject to an address randomization feature of a guest operating system on the first virtual machine. 17. A non-transitory machine readable storage medium embodying computer software, the computer software causing a computer to perform a method, the method comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group; initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 18. The machine readable storage medium of claim 17, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 19. The machine readable storage medium of claim 17, wherein the method further comprises:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 20. The machine readable storage medium of claim 17, wherein the method further comprises:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. | Systems and techniques are described for optimizing memory sharing. A described technique includes grouping virtual machines (VMs) into groups including a first group; initializing a first VM in the first group, wherein initializing the first VM includes identifying, for each of one or more first memory pages for the first VM, a respective base address for storing the first memory page using an address randomization technique, and storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group, and initializing a second VM while the first VM is active, wherein initializing the second VM includes determining that the second VM is a member of the first group, and in response, storing one or more second memory pages for the second VM using the respective base addresses stored for the first group.1. A computer-implemented method of optimizing memory sharing on a virtualized computer system including a plurality of virtual machines, the method comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group; initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 2. The method of claim 1, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 3. The method of claim 1, further comprising:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 4. The method of claim 1, further comprising:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. 5. The method of claim 1, wherein identifying a respective base address for each of the one or more first memory pages comprises receiving memory location data from a guest operating system of the first virtual machine in response to initializing the first virtual machine, the memory location data specifying the respective base address for the each of the one or more first memory pages. 6. The method of claim 5, wherein the guest operating system of the first virtual machine selected the respective base address for each of the one or more memory pages using the address randomization technique. 7. The method of claim 1, wherein the one or more first memory pages include at least one of the following: a system module, an executable, a stack, a heap, a library, a system driver, and a dynamic load library. 8. The method of claim 1, wherein the one or more first memory pages is subject to an address randomization feature of a guest operating system on the first virtual machine. 9. A system comprising:
data processing apparatus programmed to perform operations comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group;
initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 10. The system of claim 9, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 11. The system of claim 9, the operations further comprising:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 12. The system of claim 9, the operations further comprising:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. 13. The system of claim 9, wherein identifying a respective base address for each of the one or more first memory pages comprises receiving memory location data from a guest operating system of the first virtual machine in response to initializing the first virtual machine, the memory location data specifying the respective base address for the each of the one or more first memory pages. 14. The system of claim 13, wherein the guest operating system of the first virtual machine selected the respective base address for each of the one or more memory pages using the address randomization technique. 15. The system of claim 9, wherein the one or more first memory pages include at least one of the following: a system module, an executable, a stack, a heap, a library, a system driver, and a dynamic load library. 16. The system of claim 9, wherein the one or more first memory pages is subject to an address randomization feature of a guest operating system on the first virtual machine. 17. A non-transitory machine readable storage medium embodying computer software, the computer software causing a computer to perform a method, the method comprising:
grouping a plurality of virtual machines into one or more groups including at least a first group; initializing a first virtual machine in the first group, wherein initializing the first virtual machine comprises:
identifying, for each of one or more first memory pages for the first virtual machine, a respective base address for storing the first memory page using an address randomization technique; and
storing, for each of the one or more first memory pages, data associating the first memory page with the respective base address for the first group; and
initializing a second virtual machine while the first virtual machine is active, wherein initializing the second virtual machine comprises:
determining that the second virtual machine is a member of the first group, and
in response to determining that the second virtual machine is a member of the first group, storing one or more second memory pages for the second virtual machine that have identical content to the one or more first memory pages using the respective base addresses previously stored for the first group, rather than identifying different base addresses for the second memory pages using the address randomization technique. 18. The machine readable storage medium of claim 17, wherein initializing the first virtual machine further comprises:
determining, prior to identifying the respective base address for each of the one or more first memory pages, that no other virtual machine in the first group is active, wherein the respective base address for each of the one or more first memory pages is identified using the address randomization technique in response to determining that no other virtual machine of the first group is active. 19. The machine readable storage medium of claim 17, wherein the method further comprises:
initiating a third virtual machine, wherein initiating the third virtual machine comprises: determining that the third virtual machine is a first active member of a second group and is not a member of the first group; and in response to determining that the third virtual machine is a first active member of a second group and is not a member of the first group:
identifying, for each of one or more third memory pages for the third virtual machine that have identical content to the one or more first memory pages, a respective base address for storing the third memory pages using the address randomization technique; and
storing the one or more third memory pages using the respective base addresses for the third memory pages. 20. The machine readable storage medium of claim 17, wherein the method further comprises:
determining that each virtual machine in the first group has become inactive; and deleting, for each of the one or more first memory pages, the data associating the first memory page with the respective base address for the first memory page in response to determining that each virtual machine of the first group has become inactive. | 2,100 |
4,704 | 13,587,850 | 2,175 | A method at a client device includes displaying media library information corresponding to a set of media items. The media items include one or more local media items, the one or more local media items including media items stored at the client device, and one or more remote media items, the one or more remote media items including media items stored at a remote system and not at the client device. The method also includes displaying, concurrently with displaying the media library information, affordances identifying the remote media items; detecting user interaction with an affordance identifying a respective remote media item; and in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device. | 1. A method comprising:
at a client device with a display:
displaying media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting a user command to activate playback of a respective remote media item;
in response to detecting the user command, initiating a process for playing the respective remote media item, including:
downloading a copy of the respective remote media item from the remote system to a cache at the client device, and
playing the copy of the respective remote media item in the cache; and
maintaining the affordance with respect to the respective remote media item. 2. The method of claim 1, wherein playing the copy comprises beginning play of the copy of the respective remote media item in the cache prior to the copy being completely downloaded. 3. A method comprising:
at a client device with a display:
displaying media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting user interaction with an affordance identifying a respective remote media item; and
in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device. 4. The method of claim 3, further comprising: responding to a predefined user command with respect to a playlist that includes one or more local media items and one or more remote media items, by playing the media items in the playlist in a sequence determined by the playlist. 5. The method of claim 3, further comprising:
determining whether the client device has a connection to the remote system; responding to a predefined user command with respect to a playlist that includes one or more local media items and one or more remote media items, when a connection to the remote system is present, by playing the media items in the playlist in a sequence determined by the playlist; and responding to a predefined user command with respect to the playlist, when a connection to the remote system is absent, by playing only the local media items in the playlist in the sequence determined by the playlist. 6. The method of claim 3, wherein downloading a copy of the respective remote media item includes downloading the copy for storage at the client device. 7. The method of claim 3, wherein downloading a copy of the respective remote media item includes downloading the copy into a cache. 8. The method of claim 3,
wherein displaying the media library information includes displaying a list identifying the local media items and the remote media items; and wherein displaying the affordances includes displaying respective icons identifying the remote media items in the list. 9. The method of claim 8,
wherein the respective icons identifying the remote media items are interactive; and wherein detecting interaction with the affordance corresponding to the respective remote media item includes detecting interaction with the respective icon corresponding to the respective remote media item. 10. The method of claim 8,
wherein an order of the media items in the list is irrespective of whether a respective media item is a local media item or a remote media item. 11. The method of claim 8,
wherein the list identifying the media items is ordered by one or more characteristics selected from the set consisting of title, artist or author, album or collection, rating, time, and genre, and wherein the order of the media items in the list is irrespective of which listed media items are local media items and which listed media items are remote media items. 12. The method of claim 3,
wherein displaying the media library information includes displaying a collections gallery comprising one or more collections, wherein each of a plurality of the media items is associated with a respective collection; and wherein displaying the affordances includes displaying respective icons to identify respective collections that are respectively associated with one or more remote media items. 13. The method of claim 12,
wherein displaying the affordances includes, for a respective collection having one or more remote media items, displaying a number indicating a count of remote media items in the respective collection. 14. The method of claim 12, further comprising:
detecting interaction with an affordance corresponding to a collection having an icon identifying the collection as associated with one or more remote media items; and in response to detecting the interaction, initiating a process for downloading respective copies of at least one of the remote media items associated with the collection to the client device for storage at the client device. 15. The method of claim 3, wherein one or more of the remote media items are copies of corresponding local media items that have been removed from the client device. 16. The method of claim 3, wherein one or more of the remote media items correspond to digital media purchases at a digital media store and have no corresponding local media item. 17. The method of claim 3, further comprising locally storing at the client device metadata for each media item in the set of media items, the locally stored metadata for a respective media item including storage location information indicating whether the respective media item is locally stored at the client device, and whether the respective media item is remotely stored at the remote system. 18. The method of claim 17, wherein the locally stored metadata for the respective media item includes a source indicia indicating whether the respective media item was purchased at a predefined digital media store. 19. The method of claim 17, further comprising updating a file path in the metadata for a respective media item when the respective media item is downloaded to the client device. 20. The method of claim 17, further comprising, in response to a predefined trigger condition, initiating synchronization of the locally stored metadata with corresponding metadata stored at the remote system. 21. The method of claim 17, wherein, when the storage location information indicates that a respective media item is locally stored at the client device, the storage location information further indicates whether the respective media item is durably stored at the client device or is cached at the client device. 22. The method of claim 17, wherein the storage location information for a respective media item includes state information selected from the set consisting of: locally stored, locally cached, remotely stored, and a plurality of transitional states. 23. The method of claim 22, wherein the plurality of transitional states comprises: transitioning to local storage, transitioning to cache, purchase transaction in process, and being deleted from local storage. 24. The method of claim 3, wherein one or more of the remote media items include corresponding copies cached at the client device, wherein the cached copies are subject to eviction from a cache at the client device in accordance with a cache management policy. 25. The method of claim 3, further comprising, while displaying the media library information corresponding to the set of media items, suppressing display of remote media items that have been marked as hidden. 26. The method of claim 3, further comprising receiving a user command to delete a respective local media item from the client device and to mark the respective local media item as hidden. 27. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the local media items and suppressing display of media library information corresponding to the remote media items stored at the remote system and not at the client device. 28. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system, and one or more of the remote media items stored at the remote system and not at the client device are members of a playlist of one or more media items; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the playlist, including displaying the media library information corresponding to the remote media items stored at the remote system and not at the client device with visual indicia identifying the remote media items in the playlist. 29. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the set of media items, including:
displaying, in accordance with a first predefined formatting, media library information for the one or more local media items stored at the client device; and
displaying, in accordance with a second predefined formatting that is visually distinct from the first predefined formatting, media library information for the one or more remote media items stored at the remote system and not at the client device. 30. The method of claim 3, wherein one or more of the local media items has a respective corresponding copy stored at the remote system. 31. The method of claim 3, further comprising: determining whether a respective media item is stored at both the client device and the remote system; and displaying an affordance identifying the respective media item if the respective media item is stored at the remote system and no corresponding copy is stored at the client device. 32. The method of claim 3, wherein displaying media library information further comprises suppressing display of respective media items in the set of media items that match predefined filter criteria. 33. The method of claim 3, wherein the copy of the respective remote media item downloaded to the client device for storage at the client device has one or more predefined quality metrics that are different from the predefined quality metrics of a corresponding previously deleted local media item. 34. The method of claim 3, further comprising, in response to a predefined user command, replacing a respective local media item with a higher quality media item downloaded from the remote system, the higher quality media item having content corresponding to content of the respective local media item. 35. A client device, comprising:
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 media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting user interaction with an affordance identifying a respective remote media item; and
in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device. 36. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer having one or more processors and memory, cause the device to:
display media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
display, concurrently with displaying the media library information, affordances identifying the remote media items; detect user interaction with an affordance identifying a respective remote media item; and in response to detecting the user interaction, initiate a process for downloading a copy of the respective remote media item to the client device for storage at the client device. | A method at a client device includes displaying media library information corresponding to a set of media items. The media items include one or more local media items, the one or more local media items including media items stored at the client device, and one or more remote media items, the one or more remote media items including media items stored at a remote system and not at the client device. The method also includes displaying, concurrently with displaying the media library information, affordances identifying the remote media items; detecting user interaction with an affordance identifying a respective remote media item; and in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device.1. A method comprising:
at a client device with a display:
displaying media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting a user command to activate playback of a respective remote media item;
in response to detecting the user command, initiating a process for playing the respective remote media item, including:
downloading a copy of the respective remote media item from the remote system to a cache at the client device, and
playing the copy of the respective remote media item in the cache; and
maintaining the affordance with respect to the respective remote media item. 2. The method of claim 1, wherein playing the copy comprises beginning play of the copy of the respective remote media item in the cache prior to the copy being completely downloaded. 3. A method comprising:
at a client device with a display:
displaying media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting user interaction with an affordance identifying a respective remote media item; and
in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device. 4. The method of claim 3, further comprising: responding to a predefined user command with respect to a playlist that includes one or more local media items and one or more remote media items, by playing the media items in the playlist in a sequence determined by the playlist. 5. The method of claim 3, further comprising:
determining whether the client device has a connection to the remote system; responding to a predefined user command with respect to a playlist that includes one or more local media items and one or more remote media items, when a connection to the remote system is present, by playing the media items in the playlist in a sequence determined by the playlist; and responding to a predefined user command with respect to the playlist, when a connection to the remote system is absent, by playing only the local media items in the playlist in the sequence determined by the playlist. 6. The method of claim 3, wherein downloading a copy of the respective remote media item includes downloading the copy for storage at the client device. 7. The method of claim 3, wherein downloading a copy of the respective remote media item includes downloading the copy into a cache. 8. The method of claim 3,
wherein displaying the media library information includes displaying a list identifying the local media items and the remote media items; and wherein displaying the affordances includes displaying respective icons identifying the remote media items in the list. 9. The method of claim 8,
wherein the respective icons identifying the remote media items are interactive; and wherein detecting interaction with the affordance corresponding to the respective remote media item includes detecting interaction with the respective icon corresponding to the respective remote media item. 10. The method of claim 8,
wherein an order of the media items in the list is irrespective of whether a respective media item is a local media item or a remote media item. 11. The method of claim 8,
wherein the list identifying the media items is ordered by one or more characteristics selected from the set consisting of title, artist or author, album or collection, rating, time, and genre, and wherein the order of the media items in the list is irrespective of which listed media items are local media items and which listed media items are remote media items. 12. The method of claim 3,
wherein displaying the media library information includes displaying a collections gallery comprising one or more collections, wherein each of a plurality of the media items is associated with a respective collection; and wherein displaying the affordances includes displaying respective icons to identify respective collections that are respectively associated with one or more remote media items. 13. The method of claim 12,
wherein displaying the affordances includes, for a respective collection having one or more remote media items, displaying a number indicating a count of remote media items in the respective collection. 14. The method of claim 12, further comprising:
detecting interaction with an affordance corresponding to a collection having an icon identifying the collection as associated with one or more remote media items; and in response to detecting the interaction, initiating a process for downloading respective copies of at least one of the remote media items associated with the collection to the client device for storage at the client device. 15. The method of claim 3, wherein one or more of the remote media items are copies of corresponding local media items that have been removed from the client device. 16. The method of claim 3, wherein one or more of the remote media items correspond to digital media purchases at a digital media store and have no corresponding local media item. 17. The method of claim 3, further comprising locally storing at the client device metadata for each media item in the set of media items, the locally stored metadata for a respective media item including storage location information indicating whether the respective media item is locally stored at the client device, and whether the respective media item is remotely stored at the remote system. 18. The method of claim 17, wherein the locally stored metadata for the respective media item includes a source indicia indicating whether the respective media item was purchased at a predefined digital media store. 19. The method of claim 17, further comprising updating a file path in the metadata for a respective media item when the respective media item is downloaded to the client device. 20. The method of claim 17, further comprising, in response to a predefined trigger condition, initiating synchronization of the locally stored metadata with corresponding metadata stored at the remote system. 21. The method of claim 17, wherein, when the storage location information indicates that a respective media item is locally stored at the client device, the storage location information further indicates whether the respective media item is durably stored at the client device or is cached at the client device. 22. The method of claim 17, wherein the storage location information for a respective media item includes state information selected from the set consisting of: locally stored, locally cached, remotely stored, and a plurality of transitional states. 23. The method of claim 22, wherein the plurality of transitional states comprises: transitioning to local storage, transitioning to cache, purchase transaction in process, and being deleted from local storage. 24. The method of claim 3, wherein one or more of the remote media items include corresponding copies cached at the client device, wherein the cached copies are subject to eviction from a cache at the client device in accordance with a cache management policy. 25. The method of claim 3, further comprising, while displaying the media library information corresponding to the set of media items, suppressing display of remote media items that have been marked as hidden. 26. The method of claim 3, further comprising receiving a user command to delete a respective local media item from the client device and to mark the respective local media item as hidden. 27. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the local media items and suppressing display of media library information corresponding to the remote media items stored at the remote system and not at the client device. 28. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system, and one or more of the remote media items stored at the remote system and not at the client device are members of a playlist of one or more media items; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the playlist, including displaying the media library information corresponding to the remote media items stored at the remote system and not at the client device with visual indicia identifying the remote media items in the playlist. 29. The method of claim 3, wherein displaying the media library information corresponding to the set of media items is performed while the client device has an online connection to the remote system; the method further comprising:
when the client device is offline, displaying the media library information corresponding to the set of media items, including:
displaying, in accordance with a first predefined formatting, media library information for the one or more local media items stored at the client device; and
displaying, in accordance with a second predefined formatting that is visually distinct from the first predefined formatting, media library information for the one or more remote media items stored at the remote system and not at the client device. 30. The method of claim 3, wherein one or more of the local media items has a respective corresponding copy stored at the remote system. 31. The method of claim 3, further comprising: determining whether a respective media item is stored at both the client device and the remote system; and displaying an affordance identifying the respective media item if the respective media item is stored at the remote system and no corresponding copy is stored at the client device. 32. The method of claim 3, wherein displaying media library information further comprises suppressing display of respective media items in the set of media items that match predefined filter criteria. 33. The method of claim 3, wherein the copy of the respective remote media item downloaded to the client device for storage at the client device has one or more predefined quality metrics that are different from the predefined quality metrics of a corresponding previously deleted local media item. 34. The method of claim 3, further comprising, in response to a predefined user command, replacing a respective local media item with a higher quality media item downloaded from the remote system, the higher quality media item having content corresponding to content of the respective local media item. 35. A client device, comprising:
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 media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
displaying, concurrently with displaying the media library information, affordances identifying the remote media items;
detecting user interaction with an affordance identifying a respective remote media item; and
in response to detecting the user interaction, initiating a process for downloading a copy of the respective remote media item to the client device for storage at the client device. 36. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer having one or more processors and memory, cause the device to:
display media library information corresponding to a set of media items, the media items comprising:
one or more local media items, the one or more local media items comprising media items stored at the client device, and
one or more remote media items, the one or more remote media items comprising media items stored at a remote system and not at the client device;
display, concurrently with displaying the media library information, affordances identifying the remote media items; detect user interaction with an affordance identifying a respective remote media item; and in response to detecting the user interaction, initiate a process for downloading a copy of the respective remote media item to the client device for storage at the client device. | 2,100 |
4,705 | 12,404,181 | 2,166 | Systems and methods for real time data management in a collaborative environment. In one embodiment, the systems and methods dynamically link stakeholders, through a collaborative environment, to current and updated data. The systems and methods also cross-reference data objects between stakeholders for calling data objects by a common name, and determine a preferred method for each operation related to processing data for a data object. | 1. A computer-implemented method for managing data in a collaborative environment, comprising:
creating a system name on a data-integration platform to identify an object class; selecting an object from the object class using a unique name for the object; linking the object and the system name on the data-integration platform; identifying each unique name for the object in the collaborative environment; and linking each unique name for the object and the system name on the data-integration platform. 2. The method of claim 1, wherein the object is selected from the object class in a database, the object comprising data related to the object. 3. The method of claim 2, further comprising:
identifying a server and a client, the server or the client comprising the database; and populating the data integration platform with the identification of the server and the client for accessing the database. 4. The method of claim 1, further comprising:
selecting another object from the object class using a unique name for the another object; linking the another object and the system name on the data integration platform; identifying each unique name for the another object in the collaborative environment; and linking each unique name for the another object and the system name on the data integration platform. 5. The method of claim 4, further comprising:
calling at least one of the object and the another object by at least one of the unique name for the object and the unique name for the another object. 6. The method of claim 1, wherein identifying each unique name for the object comprises comparing a data profile or a data attribute for the object and a data profile or a data attribute for one or more related objects to determine whether the data profile or the data attribute for the object and the data profile or the data attribute for the one or more related objects substantially identify the same object. 7. The method of claim 6, further comprising:
modifying one of the object and the one or more related objects; and calling the modified one of the object and the one or more related objects by at least one of the unique name for the object and each unique name for the object. 8. The method of claim 1, further comprising:
selecting each object from the object class using a unique name for each object until each object from the object class has been selected; linking each object and the system name on the data integration platform; identifying each unique name for each object in the collaborative environment; and linking each unique name for each object and the system name on the data integration platform. 9. The method of claim 4, further comprising repeating the steps of claim 4 until each object from the object class has been selected. 10. The method of claim 4, further comprising repeating the steps of claim 4 by a stakeholder until each object from the object class has been selected. 11. A program carrier device for carrying computer executable instructions for managing data in a collaborative environment, the instructions being executable to implement:
creating a system name to identify an object class; selecting an object from the object class using a unique name for the object; linking the object and the system name; identifying each unique name for the object in the collaborative environment; and linking each unique name for the object and the system name. 12. The program carrier device of claim 11, wherein the object is selected from the object class in a database, the object comprising data related to the object. 13. The program carrier device of claim 12, further comprising:
identifying a server and a client, the server or the client comprising the database; and populating a data integration platform with the identification of the server and the client for accessing the database. 14. The program carrier device of claim 11, further comprising:
selecting another object from the object class using a unique name for the another object; linking the another object and the system name; identifying each unique name for the another object in the collaborative environment; and linking each unique name for the another object and the system name. 15. The program carrier device of claim 14, further comprising:
calling at least one of the object and the another object by at least one of the unique name for the object and the unique name for the another object. 16. The program carrier device of claim 11, wherein identifying each unique name for the object comprises comparing a data profile or a data attribute for the object and a data profile or a data attribute for one or more related objects to determine whether the data profile or the data attribute for the object and the data profile or the data attribute for the one or more related objects substantially identify the same object. 17. The program carrier device of claim 16, further comprising:
modifying one of the object and the one or more related objects; and calling the modified one of the object and the one or more related objects by at least one of the unique name for the object and each unique name for the object. 18. The program carrier device of claim 11, further comprising:
selecting each object from the object class using a unique name for each object until each object from the object class has been selected; linking each object and the system name; identifying each unique name for each object in the collaborative environment; and linking each unique name for each object and the system name. 19. The program carrier device of claim 14, further comprising repeating the steps of claim 14 until each object from the object class has been selected. 20. The program carrier device of claim 14, further comprising repeating the steps of claim 14 by a stakeholder until each object from the object class has been selected. 21. A computer implemented method for processing data in a collaborative environment, comprising:
indexing multiple methods in a shared asset according to an intended operation for each method; identifying a preferred method in the shared asset for each intended operation; selecting an operation; and processing data using the preferred method for the selected operation. 22. The method of claim 21, wherein the intended operation for each method is the same. 23. The method of claim 22, wherein the preferred method is identified using a constraint for each method. 24. The method of claim 21, wherein the intended operation for each method is not the same. 25. The method of claim 24, wherein the preferred method is identified using a predetermined criteria for the multiple methods. 26. The method of claim 21, wherein the data is processed by an application in the shared asset using the preferred method for the selected operation. 27. The method of claim 21, wherein the data is processed by an application using a dynamically-bound instance of the preferred method for the selected operation in the application. 28. The method of claim 21, further comprising:
compiling additional methods in the shared asset; and repeating the steps of claim 21. 29. The method of claim 21, wherein the multiple methods comprise calculations and subroutines. 30. The method of claim 29, wherein the calculations comprise interpretation calculations and drilling calculations. 31. A program carrier device for carrying computer executable instructions for processing data in a collaborative environment, the instructions being executable to implement:
indexing multiple methods according to an intended operation for each method; identifying a preferred method for each intended operation; selecting an operation; and processing data using the preferred method for the selected operation. 32. The program carrier device of claim 31, wherein the intended operation for each method is the same. 33. The program carrier device of claim 32, wherein the preferred method is identified using a constraint for each method. 34. The program carrier device of claim 31, wherein the intended operation for each method is not the same. 35. The program carrier device of claim 34, wherein the preferred method is identified using a predetermined criteria for the multiple methods. 36. The program carrier device of claim 31, wherein the data is processed by an application in a shared asset using the preferred method for the selected operation. 37. The program carrier device of claim 31, wherein the data is processed by an application using a dynamically-bound instance of the preferred method for the selected operation in the application. 38. The program carrier device of claim 31, further comprising:
compiling additional methods in a shared asset; and repeating the steps of claim 31. 39. The program carrier device of claim 31, wherein the multiple methods comprise calculations and subroutines. 40. The program carrier device of claim 39, wherein the calculations comprise interpretation calculations and drilling calculations. | Systems and methods for real time data management in a collaborative environment. In one embodiment, the systems and methods dynamically link stakeholders, through a collaborative environment, to current and updated data. The systems and methods also cross-reference data objects between stakeholders for calling data objects by a common name, and determine a preferred method for each operation related to processing data for a data object.1. A computer-implemented method for managing data in a collaborative environment, comprising:
creating a system name on a data-integration platform to identify an object class; selecting an object from the object class using a unique name for the object; linking the object and the system name on the data-integration platform; identifying each unique name for the object in the collaborative environment; and linking each unique name for the object and the system name on the data-integration platform. 2. The method of claim 1, wherein the object is selected from the object class in a database, the object comprising data related to the object. 3. The method of claim 2, further comprising:
identifying a server and a client, the server or the client comprising the database; and populating the data integration platform with the identification of the server and the client for accessing the database. 4. The method of claim 1, further comprising:
selecting another object from the object class using a unique name for the another object; linking the another object and the system name on the data integration platform; identifying each unique name for the another object in the collaborative environment; and linking each unique name for the another object and the system name on the data integration platform. 5. The method of claim 4, further comprising:
calling at least one of the object and the another object by at least one of the unique name for the object and the unique name for the another object. 6. The method of claim 1, wherein identifying each unique name for the object comprises comparing a data profile or a data attribute for the object and a data profile or a data attribute for one or more related objects to determine whether the data profile or the data attribute for the object and the data profile or the data attribute for the one or more related objects substantially identify the same object. 7. The method of claim 6, further comprising:
modifying one of the object and the one or more related objects; and calling the modified one of the object and the one or more related objects by at least one of the unique name for the object and each unique name for the object. 8. The method of claim 1, further comprising:
selecting each object from the object class using a unique name for each object until each object from the object class has been selected; linking each object and the system name on the data integration platform; identifying each unique name for each object in the collaborative environment; and linking each unique name for each object and the system name on the data integration platform. 9. The method of claim 4, further comprising repeating the steps of claim 4 until each object from the object class has been selected. 10. The method of claim 4, further comprising repeating the steps of claim 4 by a stakeholder until each object from the object class has been selected. 11. A program carrier device for carrying computer executable instructions for managing data in a collaborative environment, the instructions being executable to implement:
creating a system name to identify an object class; selecting an object from the object class using a unique name for the object; linking the object and the system name; identifying each unique name for the object in the collaborative environment; and linking each unique name for the object and the system name. 12. The program carrier device of claim 11, wherein the object is selected from the object class in a database, the object comprising data related to the object. 13. The program carrier device of claim 12, further comprising:
identifying a server and a client, the server or the client comprising the database; and populating a data integration platform with the identification of the server and the client for accessing the database. 14. The program carrier device of claim 11, further comprising:
selecting another object from the object class using a unique name for the another object; linking the another object and the system name; identifying each unique name for the another object in the collaborative environment; and linking each unique name for the another object and the system name. 15. The program carrier device of claim 14, further comprising:
calling at least one of the object and the another object by at least one of the unique name for the object and the unique name for the another object. 16. The program carrier device of claim 11, wherein identifying each unique name for the object comprises comparing a data profile or a data attribute for the object and a data profile or a data attribute for one or more related objects to determine whether the data profile or the data attribute for the object and the data profile or the data attribute for the one or more related objects substantially identify the same object. 17. The program carrier device of claim 16, further comprising:
modifying one of the object and the one or more related objects; and calling the modified one of the object and the one or more related objects by at least one of the unique name for the object and each unique name for the object. 18. The program carrier device of claim 11, further comprising:
selecting each object from the object class using a unique name for each object until each object from the object class has been selected; linking each object and the system name; identifying each unique name for each object in the collaborative environment; and linking each unique name for each object and the system name. 19. The program carrier device of claim 14, further comprising repeating the steps of claim 14 until each object from the object class has been selected. 20. The program carrier device of claim 14, further comprising repeating the steps of claim 14 by a stakeholder until each object from the object class has been selected. 21. A computer implemented method for processing data in a collaborative environment, comprising:
indexing multiple methods in a shared asset according to an intended operation for each method; identifying a preferred method in the shared asset for each intended operation; selecting an operation; and processing data using the preferred method for the selected operation. 22. The method of claim 21, wherein the intended operation for each method is the same. 23. The method of claim 22, wherein the preferred method is identified using a constraint for each method. 24. The method of claim 21, wherein the intended operation for each method is not the same. 25. The method of claim 24, wherein the preferred method is identified using a predetermined criteria for the multiple methods. 26. The method of claim 21, wherein the data is processed by an application in the shared asset using the preferred method for the selected operation. 27. The method of claim 21, wherein the data is processed by an application using a dynamically-bound instance of the preferred method for the selected operation in the application. 28. The method of claim 21, further comprising:
compiling additional methods in the shared asset; and repeating the steps of claim 21. 29. The method of claim 21, wherein the multiple methods comprise calculations and subroutines. 30. The method of claim 29, wherein the calculations comprise interpretation calculations and drilling calculations. 31. A program carrier device for carrying computer executable instructions for processing data in a collaborative environment, the instructions being executable to implement:
indexing multiple methods according to an intended operation for each method; identifying a preferred method for each intended operation; selecting an operation; and processing data using the preferred method for the selected operation. 32. The program carrier device of claim 31, wherein the intended operation for each method is the same. 33. The program carrier device of claim 32, wherein the preferred method is identified using a constraint for each method. 34. The program carrier device of claim 31, wherein the intended operation for each method is not the same. 35. The program carrier device of claim 34, wherein the preferred method is identified using a predetermined criteria for the multiple methods. 36. The program carrier device of claim 31, wherein the data is processed by an application in a shared asset using the preferred method for the selected operation. 37. The program carrier device of claim 31, wherein the data is processed by an application using a dynamically-bound instance of the preferred method for the selected operation in the application. 38. The program carrier device of claim 31, further comprising:
compiling additional methods in a shared asset; and repeating the steps of claim 31. 39. The program carrier device of claim 31, wherein the multiple methods comprise calculations and subroutines. 40. The program carrier device of claim 39, wherein the calculations comprise interpretation calculations and drilling calculations. | 2,100 |
4,706 | 12,902,219 | 2,173 | A method and system for facilitating collaboration between two groups without impairing or affecting the structure of the two groups is provided. | 1. A method for facilitating collaboration by a first group and a second group, the method comprising the steps of:
creating a collaboration group, wherein a processing device stores data representative of the collaboration group in a memory operatively connected to the processing device; linking the first group to the collaboration group, wherein the processing devices stores data in the memory representative of the link between the first group and the collaboration group; linking the second group to the collaboration group, wherein the processing device stores data in the memory representative of the link between the second group and the collaboration group in the memory; and facilitating collaboration by the first and second groups, wherein a first structure of the first group remains unchanged by the collaboration and a second structure of the second group remains unchanged by the collaboration. 2. The method of claim 1 further comprising displaying on a display operatively connected to the processing device a collaboration group graphical user interface representative of the collaboration group. 3. The method of claim 1 wherein the step of facilitating collaboration comprises providing a discussion area configured to allow any member of the first or second groups to post material. 4. The method of claim 1 wherein the step of facilitating collaboration comprises providing a multimedia area configured to allow any member of the first or second groups to upload multimedia to be used by the collaboration group. 5. The method of claim 1 Wherein the step of facilitating collaboration comprises providing a document area configured to allow any member of the first or second groups to upload a document for use by the collaboration group. 6. The method of claim 1 further comprising providing a search engine configured to allow a first user of the first group to locate the second group. 7. The method of claim 1 further comprising providing a group directory configured to allow a first user of the first group to locate the second group. 8. The method of claim 1 further comprising sending an invitation from the first group to the second group to request the second group to participate in the collaboration group. 9. The method of claim 1 further comprising allowing additional users to become members of the collaboration group. 10. The method of claim 1 further comprising providing a graphical user interface configured to allow any member to interact with the collaboration group. 11. The method of claim 1 further comprising dissolving the collaboration group without affecting the first or second structures. 12. The method of claim 1 wherein the first structure is an identification of all of the members of the first group. 13. The method of claim 12 wherein the second structure is an identification of all the members of the second group. | A method and system for facilitating collaboration between two groups without impairing or affecting the structure of the two groups is provided.1. A method for facilitating collaboration by a first group and a second group, the method comprising the steps of:
creating a collaboration group, wherein a processing device stores data representative of the collaboration group in a memory operatively connected to the processing device; linking the first group to the collaboration group, wherein the processing devices stores data in the memory representative of the link between the first group and the collaboration group; linking the second group to the collaboration group, wherein the processing device stores data in the memory representative of the link between the second group and the collaboration group in the memory; and facilitating collaboration by the first and second groups, wherein a first structure of the first group remains unchanged by the collaboration and a second structure of the second group remains unchanged by the collaboration. 2. The method of claim 1 further comprising displaying on a display operatively connected to the processing device a collaboration group graphical user interface representative of the collaboration group. 3. The method of claim 1 wherein the step of facilitating collaboration comprises providing a discussion area configured to allow any member of the first or second groups to post material. 4. The method of claim 1 wherein the step of facilitating collaboration comprises providing a multimedia area configured to allow any member of the first or second groups to upload multimedia to be used by the collaboration group. 5. The method of claim 1 Wherein the step of facilitating collaboration comprises providing a document area configured to allow any member of the first or second groups to upload a document for use by the collaboration group. 6. The method of claim 1 further comprising providing a search engine configured to allow a first user of the first group to locate the second group. 7. The method of claim 1 further comprising providing a group directory configured to allow a first user of the first group to locate the second group. 8. The method of claim 1 further comprising sending an invitation from the first group to the second group to request the second group to participate in the collaboration group. 9. The method of claim 1 further comprising allowing additional users to become members of the collaboration group. 10. The method of claim 1 further comprising providing a graphical user interface configured to allow any member to interact with the collaboration group. 11. The method of claim 1 further comprising dissolving the collaboration group without affecting the first or second structures. 12. The method of claim 1 wherein the first structure is an identification of all of the members of the first group. 13. The method of claim 12 wherein the second structure is an identification of all the members of the second group. | 2,100 |
4,707 | 14,912,054 | 2,111 | This method and device makes it possible to implement maximum likelihood decoding of a sparse graph code at low computational complexity in the maximum likelihood decoding of the sparse graph code. This is, in the maximum likelihood of decoding of the sparse graph code, a lost data decoding process by a trivial decoding method and a lost data decoding process by a Gauss elimination method are performed repeatedly and alternately. | 1. A channel decoding device, comprising:
a maximum likelihood decoding unit that corrects an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 2. The channel decoding device according to claim 1,
wherein the maximum likelihood decoding unit includes a storage unit that regards lost data independent of other lost data among the lost data as restored data, and holds an operation result used for decoding of the restored data, a trivial decoding unit that reads the operation result held in the storage unit, decodes the restored data by applying the read operation result to the trivial decoding method, and stores the operation result in the decoding in the storage unit, and a Gauss elimination method decoding unit that reads the operation result held in the storage unit, decodes the restored data by applying the read operation result to the Gauss elimination method, and stores the operation result in the decoding in the storage unit. 3. The channel decoding device according to claim 2,
wherein the Gauss elimination method decoding unit includes a sorting unit that performs sorting so that an occurrence of fill-in in a pivot selecting/discharging unit which is executed later is reduced, and the pivot selecting/discharging unit that selects a pivot according to a sorting order of the sorting unit, and discharges as a triangular matrix using forward elimination. 4. The channel decoding device according to claim 3,
wherein the Gauss elimination method decoding unit further includes a trivial column selecting unit that selects a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column, and discharges the trivial column as an identity matrix, and a Gauss column selecting unit that selects a Gauss column in order from a column in which a degree of a sparse graph code is large, and increases selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. 5. A channel decoding method, comprising:
a maximum likelihood decoding process of correcting an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 6. The channel decoding method according to claim 5,
wherein the maximum likelihood decoding process includes regarding lost data independent of other lost data among the lost data as restored data, a trivial decoding process of reading an operation result held in a storage unit that holds the operation result used for decoding of the restored data, decoding the restored data by applying the read operation result to the trivial decoding method, and storing the operation result in the decoding in the storage unit, and a Gauss elimination method decoding process of reading the operation result held in the storage unit, decoding the restored data by applying the read operation result to the Gauss elimination method, and storing the operation result in the decoding in the storage unit. 7. The channel decoding method according to claim 6,
wherein the Gauss elimination method decoding process includes a sorting process of performing sorting so that an occurrence of fill-in in pivot selecting/discharging which is executed later is reduced, and the pivot selecting/discharging process of selecting a pivot according to a sorting order performed in the sorting process and discharging as a triangular matrix using forward elimination. 8. The channel decoding method according to claim 7,
wherein the Gauss elimination method decoding process includes a trivial column selecting process of selecting a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column and discharging the trivial column as an identity matrix, and a Gauss column selecting process of selecting a Gauss column in order from a column in which a degree of a sparse graph code is large and increasing selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. 9. A channel decoding medium causing a computer to execute:
a maximum likelihood decoding process of correcting an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 10. The channel decoding medium according to claim 9,
wherein the maximum likelihood decoding process includes regarding lost data independent of other lost data among the lost data as restored data, a trivial decoding process of reading an operation result held in a storage unit that holds the operation result used for decoding of the restored data, decoding the restored data by applying the read operation result to the trivial decoding method, and storing the operation result in the decoding in the storage unit, and a Gauss elimination method decoding process of reading the operation result held in the storage unit, decoding the restored data by applying the read operation result to the Gauss elimination method, and storing the operation result in the decoding in the storage unit. 11. The channel decoding medium according to claim 10,
wherein the Gauss elimination method decoding process includes a sorting process of performing sorting so that an occurrence of fill-in in pivot selecting/discharging which is executed later is reduced, and the pivot selecting/discharging process of selecting a pivot according to a sorting order performed in the sorting process and discharging as a triangular matrix using forward elimination. 12. The channel decoding medium according to claim 11,
wherein the Gauss elimination method decoding process includes a trivial column selecting process of selecting a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column and discharging the trivial column as an identity matrix, and a Gauss column selecting process of selecting a Gauss column in order from a column in which a degree of a sparse graph code is large and increasing selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. | This method and device makes it possible to implement maximum likelihood decoding of a sparse graph code at low computational complexity in the maximum likelihood decoding of the sparse graph code. This is, in the maximum likelihood of decoding of the sparse graph code, a lost data decoding process by a trivial decoding method and a lost data decoding process by a Gauss elimination method are performed repeatedly and alternately.1. A channel decoding device, comprising:
a maximum likelihood decoding unit that corrects an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 2. The channel decoding device according to claim 1,
wherein the maximum likelihood decoding unit includes a storage unit that regards lost data independent of other lost data among the lost data as restored data, and holds an operation result used for decoding of the restored data, a trivial decoding unit that reads the operation result held in the storage unit, decodes the restored data by applying the read operation result to the trivial decoding method, and stores the operation result in the decoding in the storage unit, and a Gauss elimination method decoding unit that reads the operation result held in the storage unit, decodes the restored data by applying the read operation result to the Gauss elimination method, and stores the operation result in the decoding in the storage unit. 3. The channel decoding device according to claim 2,
wherein the Gauss elimination method decoding unit includes a sorting unit that performs sorting so that an occurrence of fill-in in a pivot selecting/discharging unit which is executed later is reduced, and the pivot selecting/discharging unit that selects a pivot according to a sorting order of the sorting unit, and discharges as a triangular matrix using forward elimination. 4. The channel decoding device according to claim 3,
wherein the Gauss elimination method decoding unit further includes a trivial column selecting unit that selects a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column, and discharges the trivial column as an identity matrix, and a Gauss column selecting unit that selects a Gauss column in order from a column in which a degree of a sparse graph code is large, and increases selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. 5. A channel decoding method, comprising:
a maximum likelihood decoding process of correcting an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 6. The channel decoding method according to claim 5,
wherein the maximum likelihood decoding process includes regarding lost data independent of other lost data among the lost data as restored data, a trivial decoding process of reading an operation result held in a storage unit that holds the operation result used for decoding of the restored data, decoding the restored data by applying the read operation result to the trivial decoding method, and storing the operation result in the decoding in the storage unit, and a Gauss elimination method decoding process of reading the operation result held in the storage unit, decoding the restored data by applying the read operation result to the Gauss elimination method, and storing the operation result in the decoding in the storage unit. 7. The channel decoding method according to claim 6,
wherein the Gauss elimination method decoding process includes a sorting process of performing sorting so that an occurrence of fill-in in pivot selecting/discharging which is executed later is reduced, and the pivot selecting/discharging process of selecting a pivot according to a sorting order performed in the sorting process and discharging as a triangular matrix using forward elimination. 8. The channel decoding method according to claim 7,
wherein the Gauss elimination method decoding process includes a trivial column selecting process of selecting a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column and discharging the trivial column as an identity matrix, and a Gauss column selecting process of selecting a Gauss column in order from a column in which a degree of a sparse graph code is large and increasing selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. 9. A channel decoding medium causing a computer to execute:
a maximum likelihood decoding process of correcting an error of a data string on which an error is occurred due to data loss by performing decoding of lost data using a trivial decoding method and decoding of lost data using a Gauss elimination method on redundant data encoded based on a relation of a sparse graph multiple times alternately and repeatedly. 10. The channel decoding medium according to claim 9,
wherein the maximum likelihood decoding process includes regarding lost data independent of other lost data among the lost data as restored data, a trivial decoding process of reading an operation result held in a storage unit that holds the operation result used for decoding of the restored data, decoding the restored data by applying the read operation result to the trivial decoding method, and storing the operation result in the decoding in the storage unit, and a Gauss elimination method decoding process of reading the operation result held in the storage unit, decoding the restored data by applying the read operation result to the Gauss elimination method, and storing the operation result in the decoding in the storage unit. 11. The channel decoding medium according to claim 10,
wherein the Gauss elimination method decoding process includes a sorting process of performing sorting so that an occurrence of fill-in in pivot selecting/discharging which is executed later is reduced, and the pivot selecting/discharging process of selecting a pivot according to a sorting order performed in the sorting process and discharging as a triangular matrix using forward elimination. 12. The channel decoding medium according to claim 11,
wherein the Gauss elimination method decoding process includes a trivial column selecting process of selecting a column corresponding to lost data that is restored by the trivial decoding method using anticipated restored data expected to be restored by the Gauss elimination method as a trivial column and discharging the trivial column as an identity matrix, and a Gauss column selecting process of selecting a Gauss column in order from a column in which a degree of a sparse graph code is large and increasing selection of the Gauss columns one by one until a sum of the Gauss column and the trivial column reaches the number of lost data. | 2,100 |
4,708 | 14,788,587 | 2,159 | Methods and arrangements for displaying results of one or more query searches. Query search results are obtained and there are determined, from the query search results, a best object type, a best instance of the best object type and one or more alternative object types, wherein determining a best object type includes consulting a collection of domain ontologies. The search results are displayed on a single screen via showing the best object type, the best instance of the best object type and the one or more alternative object types. Other variants and embodiments are broadly contemplated herein. | 1. A method of displaying results of one or more query searches, said method comprising:
utilizing at least one processor to execute computer code that performs the steps of: obtaining query search results; determining, from the query search results, a plurality of object types; selecting one of the plurality of object types; identifying a primary instance of the selected object type; and displaying the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 2. The method according to claim 1, wherein said displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 3. The method according to claim 1, wherein said displaying comprises displaying on a mobile phone screen. 4. The method according to claim 1, wherein said displaying comprises displaying results of a single search. 5. The method according to claim 1, wherein said displaying comprises displaying results of a series of searches. 6. The method according to claim 1, comprising:
selecting an additional one or more of the plurality of object types; said displaying comprising showing the selected additional one or more of the plurality of object types. 7. The method according to claim 6, wherein said displaying comprises showing the selected object type and the selected additional one or more of the plurality of object types in accordance with a rank order. 8. The method according to claim 1, wherein said displaying comprises showing one or more previously browsed object types. 9. The method according to claim 8, comprising:
identifying a primary instance in each of the previously browsed object types; said displaying comprising showing the primary instance from each of the one or more previously browsed object types. 10. The method according to claim 8, wherein said displaying comprises showing an object type being currently browsed. 11. The method according to claim 10, comprising:
identifying a primary instance in the object type being currently browsed; said displaying comprising showing the primary instance from the object type being currently browsed. 12. The method according to claim 10, wherein said displaying comprises showing one or more additional object types. 13. The method according to claim 1, wherein said displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 14. The method according to claim 1, wherein said selecting comprises consulting a collection of domain ontologies. 15. An apparatus displaying results of one or more query searches, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to obtain query search results; computer readable program code configured to determine, from the query search results, a plurality of object types; computer readable program code configured to select one of the plurality of object types; computer readable program code configured to identify a primary instance of the selected object type; and computer readable program code configured to display the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 16. A computer program product for displaying results of one or more query searches, said 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 obtain query search results; computer readable program code configured to determine, from the query search results, a plurality of object types; computer readable program code configured to select one of the plurality of object types; computer readable program code configured to identify a primary instance of the selected object type; and computer readable program code configured to display the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 17. The computer program product according to claim 16, wherein the displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 18. The computer program product according to claim 16, wherein the displaying comprises displaying results of a single search. 19. The computer program product according to claim 16, wherein the displaying comprises displaying results of a series of searches. 20. A method comprising:
obtaining query search results; determining, from the query search results, a plurality of object types; selecting one of the plurality of object types, via consulting a collection of domain ontologies; selecting an additional one or more of the plurality of object types; identifying a primary instance of the selected object type; and displaying the search results on a single screen via:
showing the selected object type and the selected additional one or more of the plurality of object types in accordance with a rank order; and
showing the primary instance of the selected object type;
wherein the selected object type and the selected additional one or more of the plurality of object types comprise:
one or more previously browsed object types; and
an object type being currently browsed. | Methods and arrangements for displaying results of one or more query searches. Query search results are obtained and there are determined, from the query search results, a best object type, a best instance of the best object type and one or more alternative object types, wherein determining a best object type includes consulting a collection of domain ontologies. The search results are displayed on a single screen via showing the best object type, the best instance of the best object type and the one or more alternative object types. Other variants and embodiments are broadly contemplated herein.1. A method of displaying results of one or more query searches, said method comprising:
utilizing at least one processor to execute computer code that performs the steps of: obtaining query search results; determining, from the query search results, a plurality of object types; selecting one of the plurality of object types; identifying a primary instance of the selected object type; and displaying the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 2. The method according to claim 1, wherein said displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 3. The method according to claim 1, wherein said displaying comprises displaying on a mobile phone screen. 4. The method according to claim 1, wherein said displaying comprises displaying results of a single search. 5. The method according to claim 1, wherein said displaying comprises displaying results of a series of searches. 6. The method according to claim 1, comprising:
selecting an additional one or more of the plurality of object types; said displaying comprising showing the selected additional one or more of the plurality of object types. 7. The method according to claim 6, wherein said displaying comprises showing the selected object type and the selected additional one or more of the plurality of object types in accordance with a rank order. 8. The method according to claim 1, wherein said displaying comprises showing one or more previously browsed object types. 9. The method according to claim 8, comprising:
identifying a primary instance in each of the previously browsed object types; said displaying comprising showing the primary instance from each of the one or more previously browsed object types. 10. The method according to claim 8, wherein said displaying comprises showing an object type being currently browsed. 11. The method according to claim 10, comprising:
identifying a primary instance in the object type being currently browsed; said displaying comprising showing the primary instance from the object type being currently browsed. 12. The method according to claim 10, wherein said displaying comprises showing one or more additional object types. 13. The method according to claim 1, wherein said displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 14. The method according to claim 1, wherein said selecting comprises consulting a collection of domain ontologies. 15. An apparatus displaying results of one or more query searches, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to obtain query search results; computer readable program code configured to determine, from the query search results, a plurality of object types; computer readable program code configured to select one of the plurality of object types; computer readable program code configured to identify a primary instance of the selected object type; and computer readable program code configured to display the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 16. A computer program product for displaying results of one or more query searches, said 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 obtain query search results; computer readable program code configured to determine, from the query search results, a plurality of object types; computer readable program code configured to select one of the plurality of object types; computer readable program code configured to identify a primary instance of the selected object type; and computer readable program code configured to display the search results on a single screen via showing the selected object type, the primary instance of the selected object type and at least one other object type selected from the plurality of object types. 17. The computer program product according to claim 16, wherein the displaying comprises showing instances of the at least one other object type selected from the plurality of object types. 18. The computer program product according to claim 16, wherein the displaying comprises displaying results of a single search. 19. The computer program product according to claim 16, wherein the displaying comprises displaying results of a series of searches. 20. A method comprising:
obtaining query search results; determining, from the query search results, a plurality of object types; selecting one of the plurality of object types, via consulting a collection of domain ontologies; selecting an additional one or more of the plurality of object types; identifying a primary instance of the selected object type; and displaying the search results on a single screen via:
showing the selected object type and the selected additional one or more of the plurality of object types in accordance with a rank order; and
showing the primary instance of the selected object type;
wherein the selected object type and the selected additional one or more of the plurality of object types comprise:
one or more previously browsed object types; and
an object type being currently browsed. | 2,100 |
4,709 | 14,955,739 | 2,181 | The embodiments relate to dynamically allocating lanes of a computer bus. A computer system having a processor in communication with a module is booted. Allocation of lanes among adapters in communication with connectors of the computer bus is controlled, which includes the module controlling an allocation of the lanes to adapters present at boot-time. The allocation is dynamic and functions to maximize lane allocation and functionality for the detected adapters. | 1. A system comprising:
a processor in communication with memory; a module, the module comprising a multiplexer in communication with the processor, and two or more host bridges, wherein each host bridge is in communication with the multiplexer; and a plurality of connectors in communication with respective host bridges, including a first connector in communication with a first host bridge and a second connector in communication with a second host bridge, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, wherein each connector is configured to receive a respective adapter, and wherein the module is configured to:
at boot-time, detect a presence of each adapter present, and dynamically control an initial lane allocation to the connectors having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the dynamic control of the initial lane allocation comprises the module to assess a lane property for each detected adapter, and to allocate lanes to each detected adapter based on the assessment to maximize lane allocation and functionality for the detected adapters; and
perform an additional lane allocation in response to detection of an additional adapter. 2. The system of claim 1, wherein the module further comprises
detector circuitry in communication with each connector, wherein the detector circuitry is configured to detect the presence of each adapter. 3. (canceled) 4. The system of claim 1, wherein the dynamic control of the initial lane allocation further comprises the module to:
determine and compare two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and perform the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level. 5. The system of claim 1, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 6. A method comprising:
at boot-time of a computer system, a module detecting a presence of a plurality of adapters in communication with respective connectors, the module comprising a multiplexer in communication with a processor and two or more host bridges in communication with the multiplexer, the host bridges including a first host bridge and a second host bridge, wherein the first host bridge is in communication with a first connector and the second host bridge is in communication with the second connector, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, and wherein each connector is configured to receive a respective adapter; the module dynamically controlling an initial lane allocation to each connector having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the dynamic control further includes:
assessing a lane property for each detected adapter; and
allocating lanes to each detected adapter based on the assessment, the allocation maximizing lane allocation and functionality for the detected adapters; and
the module performing an additional lane allocation in response to detection of an additional adapter. 7. The method of claim 6, wherein dynamically controlling the initial lane allocation further comprises:
determining and comparing two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and performing the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level. 8. The method of claim 6, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 9. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processing unit to:
at boot-time of a computer system, detect a presence of a plurality of adapters in communication with respective connectors, wherein the detection is performed by a module comprising a multiplexer in communication with the processor and two or more host bridges in communication with the multiplexer, the host bridges including a first host bridge and a second host bridge, wherein the first host bridge is in communication with a first connector and the second host bridge is in communication with a second connector, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, and wherein each connector is configured to receive a respective adapter; and dynamically control an initial lane allocation to each connector having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the initial lane allocation comprises program code to:
assess a lane property for each detected adapter; and
allocate lanes to each detected adapter, the allocation to maximize lane allocation and functionality for the detected adapters; and
perform an additional lane allocation in response to detection of an additional adaptor. 10. The computer program product of claim 9, wherein the dynamic control of the initial lane allocation further comprises program code to:
determine and compare two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and perform the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level 11. The computer program product of claim 9, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 12. The system of claim 1, wherein the additional adapter is detected after boot-time. 13. The system of claim 12, wherein the additional adapter is a hot-pluggable component, and further comprising the module to detect the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. 14. The method of claim 6, wherein the additional adapter is detected after boot-time. 15. The method of claim 14, wherein the additional adapter is a hot-pluggable component, and further comprising detecting the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. 16. The computer program product of claim 9, wherein the additional adapter is detected after boot-time. 17. The computer program product of claim 16, wherein the additional adapter is a hot-pluggable component, and further comprising program code to detect the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. | The embodiments relate to dynamically allocating lanes of a computer bus. A computer system having a processor in communication with a module is booted. Allocation of lanes among adapters in communication with connectors of the computer bus is controlled, which includes the module controlling an allocation of the lanes to adapters present at boot-time. The allocation is dynamic and functions to maximize lane allocation and functionality for the detected adapters.1. A system comprising:
a processor in communication with memory; a module, the module comprising a multiplexer in communication with the processor, and two or more host bridges, wherein each host bridge is in communication with the multiplexer; and a plurality of connectors in communication with respective host bridges, including a first connector in communication with a first host bridge and a second connector in communication with a second host bridge, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, wherein each connector is configured to receive a respective adapter, and wherein the module is configured to:
at boot-time, detect a presence of each adapter present, and dynamically control an initial lane allocation to the connectors having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the dynamic control of the initial lane allocation comprises the module to assess a lane property for each detected adapter, and to allocate lanes to each detected adapter based on the assessment to maximize lane allocation and functionality for the detected adapters; and
perform an additional lane allocation in response to detection of an additional adapter. 2. The system of claim 1, wherein the module further comprises
detector circuitry in communication with each connector, wherein the detector circuitry is configured to detect the presence of each adapter. 3. (canceled) 4. The system of claim 1, wherein the dynamic control of the initial lane allocation further comprises the module to:
determine and compare two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and perform the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level. 5. The system of claim 1, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 6. A method comprising:
at boot-time of a computer system, a module detecting a presence of a plurality of adapters in communication with respective connectors, the module comprising a multiplexer in communication with a processor and two or more host bridges in communication with the multiplexer, the host bridges including a first host bridge and a second host bridge, wherein the first host bridge is in communication with a first connector and the second host bridge is in communication with the second connector, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, and wherein each connector is configured to receive a respective adapter; the module dynamically controlling an initial lane allocation to each connector having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the dynamic control further includes:
assessing a lane property for each detected adapter; and
allocating lanes to each detected adapter based on the assessment, the allocation maximizing lane allocation and functionality for the detected adapters; and
the module performing an additional lane allocation in response to detection of an additional adapter. 7. The method of claim 6, wherein dynamically controlling the initial lane allocation further comprises:
determining and comparing two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and performing the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level. 8. The method of claim 6, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 9. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processing unit to:
at boot-time of a computer system, detect a presence of a plurality of adapters in communication with respective connectors, wherein the detection is performed by a module comprising a multiplexer in communication with the processor and two or more host bridges in communication with the multiplexer, the host bridges including a first host bridge and a second host bridge, wherein the first host bridge is in communication with a first connector and the second host bridge is in communication with a second connector, wherein each host bridge is positioned as an interface between its respective connector and the multiplexer, and wherein each connector is configured to receive a respective adapter; and dynamically control an initial lane allocation to each connector having a detected adapter, wherein the initial lane allocation is dynamically controlled by the multiplexer, and wherein the initial lane allocation comprises program code to:
assess a lane property for each detected adapter; and
allocate lanes to each detected adapter, the allocation to maximize lane allocation and functionality for the detected adapters; and
perform an additional lane allocation in response to detection of an additional adaptor. 10. The computer program product of claim 9, wherein the dynamic control of the initial lane allocation further comprises program code to:
determine and compare two quantities related to lanes designated by each adapter present at boot-time and lanes available at boot-time; and perform the initial lane allocation based on the comparison, wherein the initial lane allocation allows each adapter to operate at least at a minimum functional level 11. The computer program product of claim 9, wherein the module is comprised in a PCI-Express (PCI-e) computer bus interface. 12. The system of claim 1, wherein the additional adapter is detected after boot-time. 13. The system of claim 12, wherein the additional adapter is a hot-pluggable component, and further comprising the module to detect the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. 14. The method of claim 6, wherein the additional adapter is detected after boot-time. 15. The method of claim 14, wherein the additional adapter is a hot-pluggable component, and further comprising detecting the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. 16. The computer program product of claim 9, wherein the additional adapter is detected after boot-time. 17. The computer program product of claim 16, wherein the additional adapter is a hot-pluggable component, and further comprising program code to detect the additional adapter during a hot-swap, wherein the additional lane allocation is performed in response to the hot-swap. | 2,100 |
4,710 | 14,457,989 | 2,179 | A method for accessing multimedia content from a server for consumption of the multimedia content at a mobile device. The method includes detecting user interaction with a graphic user interface of the mobile device and translating, by the mobile device, user interaction with the graphic user interface into a command. The user interaction includes request to retrieve or access the multimedia content from a server. The multimedia content includes the command to retrieve the multimedia content from a server in a message generated at the mobile device. The method includes transmitting the message to the server for execution of instructions associated with the command included in the message for multimedia content access and retrieval and receiving the multimedia content for access at the mobile device as a result of the execution of the instructions associated with the command included in the message. | 1. A method for accessing multimedia content from a server for consumption of the multimedia content at a mobile device, the method comprising:
detecting user interaction with a graphic user interface of the mobile device; translating, by the mobile device, user interaction with the graphic user interface into a command; wherein, the user interaction includes request to retrieve or access the multimedia content from a server; including the command to retrieve the multimedia content from a server in a message generated at the mobile device; transmitting the message to the server for execution of instructions associated with the command included in the message for multimedia content access and retrieval; and receiving the multimedia content for access at the mobile device as a result of the execution of the instructions associated with the command included in the message. 2. The method of claim 1, wherein the graphic user interface is associated with an application other than a text messaging application. 3. The method of claim 1, wherein the instructions associated with the command are stored and periodically updated at the server. 4. The method of claim 3, wherein the periodic update of the instructions at the server occurs independent from the graphic user interface at the mobile device. 5. The method of clam 1, wherein the user interaction includes input generated through a graphically displayed keyboard on the mobile device . 6. A method for providing access to multimedia content to a mobile device through messaging, the method comprising:
receiving at a first server a message from the mobile device, the message including a command based on user interaction at the mobile device with a graphically displayed keyboard on the mobile device; wherein, the user interaction with the mobile device is translated into a command by the mobile device; wherein, the command includes a request to retrieve or access the multimedia content or to access services from a merchant; including the command to retrieve the multimedia content or to access services from the merchant in a message generated at the mobile device, the message to include the command; processing instructions associated with the command at the first server; transmitting the multimedia content or providing the services for access at the mobile device, associated with processing the instructions; wherein the multimedia content is retrieved from an online account of a user of the mobile device who generated the command through the user interface. 7. The method of claim 6, wherein the multimedia content is transmitted to the mobile device by the first server. 8. The method of claim 6, wherein the multimedia content is generated by a second server communicatively coupled to the first server. 9. The method of claim 8, wherein the multimedia content is transmitted to the mobile device by the second server. 10. The method of claim 6, wherein the multimedia content includes audio and video content. | A method for accessing multimedia content from a server for consumption of the multimedia content at a mobile device. The method includes detecting user interaction with a graphic user interface of the mobile device and translating, by the mobile device, user interaction with the graphic user interface into a command. The user interaction includes request to retrieve or access the multimedia content from a server. The multimedia content includes the command to retrieve the multimedia content from a server in a message generated at the mobile device. The method includes transmitting the message to the server for execution of instructions associated with the command included in the message for multimedia content access and retrieval and receiving the multimedia content for access at the mobile device as a result of the execution of the instructions associated with the command included in the message.1. A method for accessing multimedia content from a server for consumption of the multimedia content at a mobile device, the method comprising:
detecting user interaction with a graphic user interface of the mobile device; translating, by the mobile device, user interaction with the graphic user interface into a command; wherein, the user interaction includes request to retrieve or access the multimedia content from a server; including the command to retrieve the multimedia content from a server in a message generated at the mobile device; transmitting the message to the server for execution of instructions associated with the command included in the message for multimedia content access and retrieval; and receiving the multimedia content for access at the mobile device as a result of the execution of the instructions associated with the command included in the message. 2. The method of claim 1, wherein the graphic user interface is associated with an application other than a text messaging application. 3. The method of claim 1, wherein the instructions associated with the command are stored and periodically updated at the server. 4. The method of claim 3, wherein the periodic update of the instructions at the server occurs independent from the graphic user interface at the mobile device. 5. The method of clam 1, wherein the user interaction includes input generated through a graphically displayed keyboard on the mobile device . 6. A method for providing access to multimedia content to a mobile device through messaging, the method comprising:
receiving at a first server a message from the mobile device, the message including a command based on user interaction at the mobile device with a graphically displayed keyboard on the mobile device; wherein, the user interaction with the mobile device is translated into a command by the mobile device; wherein, the command includes a request to retrieve or access the multimedia content or to access services from a merchant; including the command to retrieve the multimedia content or to access services from the merchant in a message generated at the mobile device, the message to include the command; processing instructions associated with the command at the first server; transmitting the multimedia content or providing the services for access at the mobile device, associated with processing the instructions; wherein the multimedia content is retrieved from an online account of a user of the mobile device who generated the command through the user interface. 7. The method of claim 6, wherein the multimedia content is transmitted to the mobile device by the first server. 8. The method of claim 6, wherein the multimedia content is generated by a second server communicatively coupled to the first server. 9. The method of claim 8, wherein the multimedia content is transmitted to the mobile device by the second server. 10. The method of claim 6, wherein the multimedia content includes audio and video content. | 2,100 |
4,711 | 13,734,161 | 2,144 | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet. | 1.-10. (canceled) 11. A method comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server; detecting, by the intermediate server, the directive; generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request; and responding to the request, by the intermediate server, with the localized version of the content. 12. The method of claim 11, wherein generating the localized version of the content comprises processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 13. The method of claim 11, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 14. The method of claim 11, further comprising:
caching the localized version of the content at the intermediate server. 15. The method of claim 11, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the method further comprising:
retrieving the content from the web server at a second network location. 16. The method of claim 15, further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 17. The method of claim 11, wherein detecting the directive comprises detecting a tag. 18. The method of claim 11, wherein generating the localized version of the content comprises generating a translated version of the content. 19. The method of claim 11, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is farther based on the identified geographic region. 20. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server; detecting, by the intermediate server, the directive; generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request; and responding to the request, by the intermediate server, with the localized version of the content. 21. The computer-readable storage device of claim 20, wherein generating the localized version of the content comprises processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 22. The computer-readable storage device of claim 20, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 23. The computer-readable storage device of claim 20, the operations further comprising:
caching the localized version of the content at the intermediate server. 24. The computer-readable storage device of claim 20, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the operations further comprising:
retrieving the content from the web server at a second network location. 25. The computer-readable storage device of claim 24, the operations further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 26. The computer-readable storage device of claim 20, wherein detecting the directive comprises detecting a tag. 27. The computer-readable storage device of claim 20, wherein generating the localized version of the content comprises generating a translated version of the content. 28. The computer-readable storage device of claim 20, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 29. A system comprising:
a memory configured to store instructions comprising:
instructions for receiving, by an intermediate server, a request for content served by a web server,
instructions for identifying, by the intermediate server, a language associated with the request,
instructions for retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server,
instructions for detecting, by the intermediate server, the directive,
instructions for generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request, and
instructions for responding to the request, by the intermediate server, with the localized version of the content; and
one or more processors configured to process the instructions. 30. The system of claim 29, wherein the instructions for generating the localized version of the content further comprise processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 31. The system of claim 29, wherein the instructions for identifying the language associated with the request comprise instructions for identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 32. The system of claim 29, the instructions further comprising:
instructions for caching the localized version of the content at the intermediate server. 33. The system of claim 29, wherein the instructions for receiving, by the intermediate server, the request for the content served by the web server comprise instructions for receiving, by the intermediate server at a first network location, the request for the content served by the web server, the system further comprising:
instructions for retrieving the content from the web server at a second network location. 34. The system of claim 33, the instructions further comprising:
instructions for configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 35. The system of claim 29, wherein the instructions for detecting the directive comprise instructions for detecting a tag. 36. The system of claim 29, wherein the instructions for generating the localized version of the content comprise instructions for generating a translated version of the content. 37. The system of claim 29, the instructions further comprising:
instructions for identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet.1.-10. (canceled) 11. A method comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server; detecting, by the intermediate server, the directive; generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request; and responding to the request, by the intermediate server, with the localized version of the content. 12. The method of claim 11, wherein generating the localized version of the content comprises processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 13. The method of claim 11, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 14. The method of claim 11, further comprising:
caching the localized version of the content at the intermediate server. 15. The method of claim 11, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the method further comprising:
retrieving the content from the web server at a second network location. 16. The method of claim 15, further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 17. The method of claim 11, wherein detecting the directive comprises detecting a tag. 18. The method of claim 11, wherein generating the localized version of the content comprises generating a translated version of the content. 19. The method of claim 11, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is farther based on the identified geographic region. 20. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server; detecting, by the intermediate server, the directive; generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request; and responding to the request, by the intermediate server, with the localized version of the content. 21. The computer-readable storage device of claim 20, wherein generating the localized version of the content comprises processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 22. The computer-readable storage device of claim 20, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 23. The computer-readable storage device of claim 20, the operations further comprising:
caching the localized version of the content at the intermediate server. 24. The computer-readable storage device of claim 20, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the operations further comprising:
retrieving the content from the web server at a second network location. 25. The computer-readable storage device of claim 24, the operations further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 26. The computer-readable storage device of claim 20, wherein detecting the directive comprises detecting a tag. 27. The computer-readable storage device of claim 20, wherein generating the localized version of the content comprises generating a translated version of the content. 28. The computer-readable storage device of claim 20, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 29. A system comprising:
a memory configured to store instructions comprising:
instructions for receiving, by an intermediate server, a request for content served by a web server,
instructions for identifying, by the intermediate server, a language associated with the request,
instructions for retrieving, by the intermediate server, the content from the web server, the content comprising a directive notifying the intermediate server of an operation for processing on the content specifically by the intermediate server,
instructions for detecting, by the intermediate server, the directive,
instructions for generating, by the intermediate server, a localized version of the content based on the operation and the language associated with the request, and
instructions for responding to the request, by the intermediate server, with the localized version of the content; and
one or more processors configured to process the instructions. 30. The system of claim 29, wherein the instructions for generating the localized version of the content further comprise processing, responsive to detection of the directive, the operation by the intermediate server in accordance with the language associated with the request. 31. The system of claim 29, wherein the instructions for identifying the language associated with the request comprise instructions for identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 32. The system of claim 29, the instructions further comprising:
instructions for caching the localized version of the content at the intermediate server. 33. The system of claim 29, wherein the instructions for receiving, by the intermediate server, the request for the content served by the web server comprise instructions for receiving, by the intermediate server at a first network location, the request for the content served by the web server, the system further comprising:
instructions for retrieving the content from the web server at a second network location. 34. The system of claim 33, the instructions further comprising:
instructions for configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 35. The system of claim 29, wherein the instructions for detecting the directive comprise instructions for detecting a tag. 36. The system of claim 29, wherein the instructions for generating the localized version of the content comprise instructions for generating a translated version of the content. 37. The system of claim 29, the instructions further comprising:
instructions for identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. | 2,100 |
4,712 | 14,529,298 | 2,173 | A computer implemented method of generating a graphical interface including receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; receiving and displaying formulas, each formula linking at least two properties of one element or several elements of the selection; and determining from the selection of elements and the formulas a separate graphical interface program, the execution of the separate graphical interface program resulting in the display of the selection of elements, the properties of which are linked by the formulas. | 1. A method, implemented by a data processor by the execution of a program defined in functional programming, of generating a graphical interface program comprising:
receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; displaying at least a window and receiving and displaying in said window referentially transparent formulas, each formula being an equation linking at least two properties of one element or several elements of said selection and comprising a least a mathematical and/or logic operator, said mathematical and/or logic operator being displayed in said window when said mathematical and/or logic operator is written by a designer on an input apparatus of the data processor or said mathematical and/or logic operator is displayed in a library and selected by the designer, the method further comprising a step of checking the referentially transparent formulas for inconsistencies using a computer algebra system before determining a separate graphical interface program, thereby preventing an inconsistency corresponding to the occurrence of a never-ending loop when the graphical interface program is executed, the method further comprising the step of displaying an alert message when at least one inconsistency is determined; and determining from said selection of elements and said formulas the separate graphical interface program, the execution of said separate graphical interface program resulting in the display of said selection of elements, the properties of which are linked by said formulas, any input of a user modifying an element with linked properties resulting in a re-evaluation of the formula and a possible update of the display of the linked element. 2. The method of claim 1, wherein the program defined with the components can be recursively used as a component itself, the properties of which will be defined by formulas. 3. The method of claim 1, further comprising the step of displaying an alert message when none of said formulas includes a first property among the plurality of graphics and/or activation and/or content properties. 4. The method of claim 3, further comprising the step of displaying an alert message when a second property included in the formulas remains unchanged when the other properties of the formulas are modified. 5. The method of claim 4, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property is allowed to be activated. 6. The method of claim 5, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property was used. 7. The method of claim 6, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property is displayed. 8. A data processor operating under control of a stored program containing a set of instructions that, when executed, control the data processor to execute a program defined in functional programming to perform the following functions:
receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; displaying at least a window and receiving and displaying in said window referentially transparent formulas, each formula being an equation linking at least two properties of one element or several elements of said selection and comprising a least a mathematical and/or logic operator, said mathematical and/or logic operator being displayed in said window when said mathematical and/or logic operator is written by a designer on an input apparatus of the data processor or said mathematical and/or logic operator is displayed in a library and selected by the designer, the method further comprising a step of checking the referentially transparent formulas for inconsistencies using a computer algebra system before determining a separate graphical interface program, thereby preventing an inconsistency corresponding to the occurrence of a never-ending loop when the graphical interface program is executed, the method further comprising the step of displaying an alert message when at least one inconsistency is determined; and determining from said selection of elements and said formulas the separate graphical interface program, the execution of said separate graphical interface program resulting in the display of said selection of elements, the properties of which are linked by said formulas, any input of a user modifying an element with linked properties resulting in a re-evaluation of the formula and a possible update of the display of the linked element. 9. The data processor of claim 8, operating under the control of the stored program containing a set of instructions that, when executed, control the data processor to display an alert message when none of said formulas includes a specific property among the plurality of graphical and/or activation and/or content properties. | A computer implemented method of generating a graphical interface including receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; receiving and displaying formulas, each formula linking at least two properties of one element or several elements of the selection; and determining from the selection of elements and the formulas a separate graphical interface program, the execution of the separate graphical interface program resulting in the display of the selection of elements, the properties of which are linked by the formulas.1. A method, implemented by a data processor by the execution of a program defined in functional programming, of generating a graphical interface program comprising:
receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; displaying at least a window and receiving and displaying in said window referentially transparent formulas, each formula being an equation linking at least two properties of one element or several elements of said selection and comprising a least a mathematical and/or logic operator, said mathematical and/or logic operator being displayed in said window when said mathematical and/or logic operator is written by a designer on an input apparatus of the data processor or said mathematical and/or logic operator is displayed in a library and selected by the designer, the method further comprising a step of checking the referentially transparent formulas for inconsistencies using a computer algebra system before determining a separate graphical interface program, thereby preventing an inconsistency corresponding to the occurrence of a never-ending loop when the graphical interface program is executed, the method further comprising the step of displaying an alert message when at least one inconsistency is determined; and determining from said selection of elements and said formulas the separate graphical interface program, the execution of said separate graphical interface program resulting in the display of said selection of elements, the properties of which are linked by said formulas, any input of a user modifying an element with linked properties resulting in a re-evaluation of the formula and a possible update of the display of the linked element. 2. The method of claim 1, wherein the program defined with the components can be recursively used as a component itself, the properties of which will be defined by formulas. 3. The method of claim 1, further comprising the step of displaying an alert message when none of said formulas includes a first property among the plurality of graphics and/or activation and/or content properties. 4. The method of claim 3, further comprising the step of displaying an alert message when a second property included in the formulas remains unchanged when the other properties of the formulas are modified. 5. The method of claim 4, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property is allowed to be activated. 6. The method of claim 5, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property was used. 7. The method of claim 6, wherein, for at least one formula among said formulas, at least one property of the at least two properties of said at least one formula is representative of whether or not, during the execution of said graphical interface program, the element associated with said at least one property is displayed. 8. A data processor operating under control of a stored program containing a set of instructions that, when executed, control the data processor to execute a program defined in functional programming to perform the following functions:
receiving and displaying a selection of elements among a plurality of graphical and/or data entry elements, each element having at least a property among a plurality of graphical and/or activation and/or content properties; displaying at least a window and receiving and displaying in said window referentially transparent formulas, each formula being an equation linking at least two properties of one element or several elements of said selection and comprising a least a mathematical and/or logic operator, said mathematical and/or logic operator being displayed in said window when said mathematical and/or logic operator is written by a designer on an input apparatus of the data processor or said mathematical and/or logic operator is displayed in a library and selected by the designer, the method further comprising a step of checking the referentially transparent formulas for inconsistencies using a computer algebra system before determining a separate graphical interface program, thereby preventing an inconsistency corresponding to the occurrence of a never-ending loop when the graphical interface program is executed, the method further comprising the step of displaying an alert message when at least one inconsistency is determined; and determining from said selection of elements and said formulas the separate graphical interface program, the execution of said separate graphical interface program resulting in the display of said selection of elements, the properties of which are linked by said formulas, any input of a user modifying an element with linked properties resulting in a re-evaluation of the formula and a possible update of the display of the linked element. 9. The data processor of claim 8, operating under the control of the stored program containing a set of instructions that, when executed, control the data processor to display an alert message when none of said formulas includes a specific property among the plurality of graphical and/or activation and/or content properties. | 2,100 |
4,713 | 14,030,344 | 2,182 | A method and system for a Hijri calendar are provided. The method includes: receiving date input for a date conversion; determining a conversion type associated with the date input; determining whether the date input falls within a predetermined Hijri calendar date range; and if the date input falls within the range, using the predetermined Hijri calendar to convert the date input, otherwise, using a predetermined Hijri conversion algorithm to convert the date input and returning a converted date output. The system includes: a calendar module configured to receive date input for a date conversion and determine a conversion type associated with the date input; and a conversion module configured to determine whether the date input falls within a predetermined Hijri calendar date range and further configured to, if the date input falls within the range, use the predetermined Hijri calendar to convert the date input, otherwise, use a predetermined Hijri conversion algorithm to convert the date input and return a converted date output. | 1. A method for managing a Hijri calendar comprising:
receiving date input from a first predetermined calendar for a date conversion; determining a conversion type associated with the date input; determining whether the date input falls within a predetermined Hijri calendar date range; if the date input falls within the date range, using the predetermined Hijri calendar to convert the date input, otherwise, using a predetermined Hijri conversion algorithm to convert the date input; returning a converted date output. 2. The method of claim 1 wherein the receiving of the date input comprises receiving an originating date and a date adjustment component. 3. The method of claim 2 wherein the determining as to whether the date input falls within a predetermined Hijri calendar date range comprises:
determining at least one resulting date by applying the date adjustment component to the originating date;
determining whether the at least one resulting date falls within the date range of the predetermined Hijri calendar; and
if the at least one resulting date falls within the date range, using the predetermined Hijri calendar to convert the at least one resulting date, otherwise, using the predetermined Hijri conversion algorithm to convert the at least one resulting date. 4. The method of claim 1 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the converted date output is a date range of possible conversion dates. 5. The method of claim 1 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the converted date output is a date and a warning that the date may be inaccurate. 6. The method of claim 1, wherein the predetermined Hijri calendar used to convert the date input is based upon a user's location. 7. The method of claim 1, wherein the predetermined Hijri calendar used to convert the date input is selected by a user. 8. The method of claim 1 further comprising:
determining if the date range of the predetermined Hijri calendar has been updated; and
if the date range has been updated, updating the conversion of any converted dates falling within the updated date range of the predetermined Hijri calendar. 9. The method of claim 1, wherein if the date input falls outside of the predetermined Hijri calendar, querying at least one third party system or database to retrieve a more accurate converted date for the date input. 10. The method of claim 6 further comprising:
receiving a change in the user's location to a new location;
determining whether a different predetermined Hijri calendar is used at the new location; and
if a different predetermined Hijri calendar is used at the new location, updating any converted dates using the different predetermined Hijri calendar used in the new location. 11. A system for a Hijri calendar comprising:
a calendar module configured to receive date input for a date conversion and to determine a conversion type associated with the date input; and a conversion module configured to determine whether the date input falls within a predetermined Hijri calendar date range and further configured to, if the date input falls within the date range, use the predetermined Hijri calendar to convert the date input, otherwise, use a predetermined Hijri conversion algorithm to convert the date input, and return a converted date output. 12. The system of claim 11 wherein the calendar module is further configured to receive an originating date and a date adjustment component. 13. The system of claim 12 wherein the conversion module, when determining whether the date input falls within a predetermined Hijri calendar date range, is further configured to:
determine at least one resulting date by applying the date adjustment component to the originating date;
determine whether the at least one resulting date falls within the date range of the predetermined Hijri calendar; and
if the at least one resulting date falls within the date range, using the predetermined Hijri calendar to convert the at least one resulting date, otherwise, using the predetermined Hijri conversion algorithm to convert the at least one resulting date. 14. The system of claim 11 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the calendar module is configured to return the converted date output as a date range of possible conversion dates. 15. The system of claim 11 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the calendar module is configured to return the converted date output as a date and a warning that the date may be inaccurate. 16. The system of claim 11, wherein the predetermined Hijri calendar used to convert the date input is based upon a user's location. 17. The system of claim 1 wherein the conversion module is further configured to:
determine if the date range of the predetermined Hijri calendar has been updated; and
if the date range has been updated, the conversion module is further configured to update the conversion of any converted dates falling within the updated date range of the predetermined Hijri calendar. 18. The system of claim 11, further comprising a connection module configured to query at least one third party system or database to retrieve a more accurate converted date for the date input, the date input falls outside of the predetermined Hijri calendar. 19. The system of claim 16 wherein the conversion module is further configured to:
receive a change in the user's location to a new location;
determine whether a different predetermined Hijri calendar is used at the new location; and
if a different predetermined Hijri calendar is sued at the new location, updating any converted dates using the different predetermined Hijri calendar used in the new location. 20. A non-transitory computer readable medium containing instructions, that, when executed, perform the method of claim 1. | A method and system for a Hijri calendar are provided. The method includes: receiving date input for a date conversion; determining a conversion type associated with the date input; determining whether the date input falls within a predetermined Hijri calendar date range; and if the date input falls within the range, using the predetermined Hijri calendar to convert the date input, otherwise, using a predetermined Hijri conversion algorithm to convert the date input and returning a converted date output. The system includes: a calendar module configured to receive date input for a date conversion and determine a conversion type associated with the date input; and a conversion module configured to determine whether the date input falls within a predetermined Hijri calendar date range and further configured to, if the date input falls within the range, use the predetermined Hijri calendar to convert the date input, otherwise, use a predetermined Hijri conversion algorithm to convert the date input and return a converted date output.1. A method for managing a Hijri calendar comprising:
receiving date input from a first predetermined calendar for a date conversion; determining a conversion type associated with the date input; determining whether the date input falls within a predetermined Hijri calendar date range; if the date input falls within the date range, using the predetermined Hijri calendar to convert the date input, otherwise, using a predetermined Hijri conversion algorithm to convert the date input; returning a converted date output. 2. The method of claim 1 wherein the receiving of the date input comprises receiving an originating date and a date adjustment component. 3. The method of claim 2 wherein the determining as to whether the date input falls within a predetermined Hijri calendar date range comprises:
determining at least one resulting date by applying the date adjustment component to the originating date;
determining whether the at least one resulting date falls within the date range of the predetermined Hijri calendar; and
if the at least one resulting date falls within the date range, using the predetermined Hijri calendar to convert the at least one resulting date, otherwise, using the predetermined Hijri conversion algorithm to convert the at least one resulting date. 4. The method of claim 1 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the converted date output is a date range of possible conversion dates. 5. The method of claim 1 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the converted date output is a date and a warning that the date may be inaccurate. 6. The method of claim 1, wherein the predetermined Hijri calendar used to convert the date input is based upon a user's location. 7. The method of claim 1, wherein the predetermined Hijri calendar used to convert the date input is selected by a user. 8. The method of claim 1 further comprising:
determining if the date range of the predetermined Hijri calendar has been updated; and
if the date range has been updated, updating the conversion of any converted dates falling within the updated date range of the predetermined Hijri calendar. 9. The method of claim 1, wherein if the date input falls outside of the predetermined Hijri calendar, querying at least one third party system or database to retrieve a more accurate converted date for the date input. 10. The method of claim 6 further comprising:
receiving a change in the user's location to a new location;
determining whether a different predetermined Hijri calendar is used at the new location; and
if a different predetermined Hijri calendar is used at the new location, updating any converted dates using the different predetermined Hijri calendar used in the new location. 11. A system for a Hijri calendar comprising:
a calendar module configured to receive date input for a date conversion and to determine a conversion type associated with the date input; and a conversion module configured to determine whether the date input falls within a predetermined Hijri calendar date range and further configured to, if the date input falls within the date range, use the predetermined Hijri calendar to convert the date input, otherwise, use a predetermined Hijri conversion algorithm to convert the date input, and return a converted date output. 12. The system of claim 11 wherein the calendar module is further configured to receive an originating date and a date adjustment component. 13. The system of claim 12 wherein the conversion module, when determining whether the date input falls within a predetermined Hijri calendar date range, is further configured to:
determine at least one resulting date by applying the date adjustment component to the originating date;
determine whether the at least one resulting date falls within the date range of the predetermined Hijri calendar; and
if the at least one resulting date falls within the date range, using the predetermined Hijri calendar to convert the at least one resulting date, otherwise, using the predetermined Hijri conversion algorithm to convert the at least one resulting date. 14. The system of claim 11 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the calendar module is configured to return the converted date output as a date range of possible conversion dates. 15. The system of claim 11 wherein, if the date is converted using the predetermined Hijri conversion algorithm, the calendar module is configured to return the converted date output as a date and a warning that the date may be inaccurate. 16. The system of claim 11, wherein the predetermined Hijri calendar used to convert the date input is based upon a user's location. 17. The system of claim 1 wherein the conversion module is further configured to:
determine if the date range of the predetermined Hijri calendar has been updated; and
if the date range has been updated, the conversion module is further configured to update the conversion of any converted dates falling within the updated date range of the predetermined Hijri calendar. 18. The system of claim 11, further comprising a connection module configured to query at least one third party system or database to retrieve a more accurate converted date for the date input, the date input falls outside of the predetermined Hijri calendar. 19. The system of claim 16 wherein the conversion module is further configured to:
receive a change in the user's location to a new location;
determine whether a different predetermined Hijri calendar is used at the new location; and
if a different predetermined Hijri calendar is sued at the new location, updating any converted dates using the different predetermined Hijri calendar used in the new location. 20. A non-transitory computer readable medium containing instructions, that, when executed, perform the method of claim 1. | 2,100 |
4,714 | 14,612,214 | 2,175 | An electronic device with a display and a fingerprint sensor displays a fingerprint enrollment interface and detects, on the fingerprint sensor, a plurality of finger gestures performed with a finger. The device collects fingerprint information from the plurality of finger gestures performed with the finger. After collecting the fingerprint information, the device determines whether the collected fingerprint information is sufficient to enroll a fingerprint of the finger. When the collected fingerprint information for the finger is sufficient to enroll the fingerprint of the finger, the device enrolls the fingerprint of the finger with the device. When the collected fingerprint information for the finger is not sufficient to enroll the fingerprint of the finger, the device displays a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the finger. | 1. A method, comprising:
at an electronic device with a display and a fingerprint sensor:
displaying a fingerprint enrollment interface;
detecting on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger;
collecting fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and
after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determining, based on fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enrolling the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, displaying a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 2. The method of claim 1, wherein fingerprint information from the plurality of separate and distinct finger gestures is collected for an area of the fingerprint of the respective finger that is at least twice as large as the area that can be captured by the fingerprint sensor during a single finger gesture. 3. The method of claim 1, including, after enrolling the fingerprint of the respective finger with the device:
receiving a request to perform a restricted operation and detecting a fingerprint on the fingerprint sensor; and in response to receiving the request to perform the restricted operation:
in accordance with a determination that the fingerprint is enrolled with the device, performing the restricted operation; and
in accordance with a determination that the fingerprint is not enrolled with the device, forgoing performance of the restricted operation. 4. The method of claim 1, wherein the message prompting the user to perform one or more additional finger gestures includes displayed instructions to perform subsequent finger gestures differently from the respective finger gesture. 5. The method of claim 1, wherein the message prompting the user to perform one or more additional finger gestures includes an indication of one or more portions or locations of the respective fingerprint for which fingerprint information is inadequate or has not been collected. 6. The method of claim 1, including, while the respective finger is on the fingerprint sensor during a respective gesture:
collecting fingerprint information; and after the fingerprint information has been collected, providing haptic feedback at the device to indicate that the fingerprint information has been collected. 7. The method of claim 1, including, after enrolling the fingerprint of the respective finger with the device:
displaying a fingerprint settings interface with a plurality of entries that correspond to respective enrolled fingerprints, wherein the plurality of entries includes a respective entry that corresponds to the fingerprint of the respective finger and one or more other entries that correspond to other enrolled fingerprints of other fingers besides the respective finger; detecting a second finger gesture on the fingerprint sensor that corresponds to the fingerprint of the respective finger; and in response to detecting the second finger gesture, highlighting the respective entry that corresponds to the fingerprint of the respective finger. 8. The method of claim 1, wherein the fingerprint enrollment interface includes a progress indicator, wherein the plurality of separate and distinct finger gestures performed with the respective finger includes a first distinct finger gesture and a second distinct finger gesture detected after the first distinct finger gesture, and the method includes:
in response to detecting on the fingerprint sensor the first distinct finger gesture, changing an appearance of the progress indicator to indicate the collection of fingerprint information from the first distinct finger gesture, and in response to detecting on the fingerprint sensor the second distinct finger gesture, further changing the appearance of the progress indicator to indicate the collection of additional fingerprint information from the second distinct finger gesture. 9. The method of claim 1, wherein the fingerprint enrollment interface includes a progress indicator, and the method includes:
in response to detecting on the fingerprint sensor a respective finger gesture performed with the respective finger, changing an appearance of the progress indicator to indicate the collection of additional fingerprint information from the respective finger gesture. 10. The method of claim 9, wherein the progress indicator includes a portion of a surface of a three-dimensional object. 11. The method of claim 9, wherein:
the progress indicator is in the shape of a fingerprint and includes lines that are representative of fingerprint ridges; and changing the appearance of the progress indicator includes coloring in a portion of the plurality of ridges. 12. The method of claim 9, wherein:
the progress indicator includes a plurality of concentric circles; and changing the appearance of the progress indicator includes filling in one of a plurality of concentric circles with a predefined fill. 13. The method of claim 9, wherein:
the progress indicator includes a plurality of progress-indicator portions that correspond to fingerprint portions of the respective fingerprint; and when fingerprint information from a respective fingerprint portion is collected, an appearance of the corresponding progress-indicator portion is changed to indicate that fingerprint information from the respective fingerprint portion has been collected. 14. The method of claim 13, including, after changing the appearance of a plurality of progress-indicator portions, in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, changing the appearance of one or more unchanged progress-indicator portions to match the appearance of the plurality of progress-indicator portions. 15. An electronic device, comprising:
a display; a fingerprint sensor; 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 fingerprint enrollment interface;
detecting on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger;
collecting fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and
after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determining, based on the fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enrolling the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, displaying a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 16. 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 fingerprint sensor, cause the device to:
display a fingerprint enrollment interface; detect on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger; collect fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determine, based on the fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enroll the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, display a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 17. The medium of claim 16, wherein fingerprint information from the plurality of separate and distinct finger gestures is collected for an area of the fingerprint of the respective finger that is at least twice as large as the area that can be captured by the fingerprint sensor during a single finger gesture. 18. The medium of claim 16, wherein the one or more programs further comprise instructions for: after enrolling the fingerprint of the respective finger with the device:
receiving a request to perform a restricted operation and detecting a fingerprint on the fingerprint sensor; and in response to receiving the request to perform the restricted operation:
in accordance with a determination that the fingerprint is enrolled with the device, performing the restricted operation; and
in accordance with a determination that the fingerprint is not enrolled with the device, forgoing performance of the restricted operation. 19. The medium of claim 16, wherein the message prompting the user to perform one or more additional finger gestures includes displayed instructions to perform subsequent finger gestures differently from the respective finger gesture. 20. The medium of claim 16, wherein the message prompting the user to perform one or more additional finger gestures includes an indication of one or more portions or locations of the respective fingerprint for which fingerprint information is inadequate or has not been collected. 21. The medium of claim 16, wherein the one or more programs further comprise instructions for: while the respective finger is on the fingerprint sensor during a respective gesture:
collecting fingerprint information; and after the fingerprint information has been collected, providing haptic feedback at the device to indicate that the fingerprint information has been collected. 22. The medium of claim 16, wherein the one or more programs further comprise instructions for: after enrolling the fingerprint of the respective finger with the device:
displaying a fingerprint settings interface with a plurality of entries that correspond to respective enrolled fingerprints, wherein the plurality of entries includes a respective entry that corresponds to the fingerprint of the respective finger and one or more other entries that correspond to other enrolled fingerprints of other fingers besides the respective finger; detecting a second finger gesture on the fingerprint sensor that corresponds to the fingerprint of the respective finger; and in response to detecting the second finger gesture, highlighting the respective entry that corresponds to the fingerprint of the respective finger. 23. The medium of claim 16, wherein the fingerprint enrollment interface includes a progress indicator, wherein the plurality of separate and distinct finger gestures performed with the respective finger includes a first distinct finger gesture and a second distinct finger gesture detected after the first distinct finger gesture, and the one or more programs further comprise instructions for:
in response to detecting on the fingerprint sensor the first distinct finger gesture, changing an appearance of the progress indicator to indicate the collection of fingerprint information from the first distinct finger gesture, and in response to detecting on the fingerprint sensor the second distinct finger gesture, further changing the appearance of the progress indicator to indicate the collection of additional fingerprint information from the second distinct finger gesture. 24. The medium of claim 16, wherein the fingerprint enrollment interface includes a progress indicator, and the one or more programs further comprise instructions for:
in response to detecting on the fingerprint sensor a respective finger gesture performed with the respective finger, changing an appearance of the progress indicator to indicate the collection of additional fingerprint information from the respective finger gesture. 25. The medium of claim 24, wherein the progress indicator includes a portion of a surface of a three-dimensional object. 26. The medium of claim 24, wherein:
the progress indicator is in the shape of a fingerprint and includes lines that are representative of fingerprint ridges; and changing the appearance of the progress indicator includes coloring in a portion of the plurality of ridges. 27. The medium of claim 24, wherein:
the progress indicator includes a plurality of concentric circles; and changing the appearance of the progress indicator includes filling in one of a plurality of concentric circles with a predefined fill. 28. The medium of claim 24, wherein:
the progress indicator includes a plurality of progress-indicator portions that correspond to fingerprint portions of the respective fingerprint; and when fingerprint information from a respective fingerprint portion is collected, an appearance of the corresponding progress-indicator portion is changed to indicate that fingerprint information from the respective fingerprint portion has been collected. 29. The medium of claim 28, wherein the one or more programs further comprise instructions for: after changing the appearance of a plurality of progress-indicator portions, in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, changing the appearance of one or more unchanged progress-indicator portions to match the appearance of the plurality of progress-indicator portions. 30. The medium of claim 16, wherein the plurality of separate and distinct finger gestures is a plurality of separate and distinct stationary finger gestures. | An electronic device with a display and a fingerprint sensor displays a fingerprint enrollment interface and detects, on the fingerprint sensor, a plurality of finger gestures performed with a finger. The device collects fingerprint information from the plurality of finger gestures performed with the finger. After collecting the fingerprint information, the device determines whether the collected fingerprint information is sufficient to enroll a fingerprint of the finger. When the collected fingerprint information for the finger is sufficient to enroll the fingerprint of the finger, the device enrolls the fingerprint of the finger with the device. When the collected fingerprint information for the finger is not sufficient to enroll the fingerprint of the finger, the device displays a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the finger.1. A method, comprising:
at an electronic device with a display and a fingerprint sensor:
displaying a fingerprint enrollment interface;
detecting on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger;
collecting fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and
after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determining, based on fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enrolling the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, displaying a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 2. The method of claim 1, wherein fingerprint information from the plurality of separate and distinct finger gestures is collected for an area of the fingerprint of the respective finger that is at least twice as large as the area that can be captured by the fingerprint sensor during a single finger gesture. 3. The method of claim 1, including, after enrolling the fingerprint of the respective finger with the device:
receiving a request to perform a restricted operation and detecting a fingerprint on the fingerprint sensor; and in response to receiving the request to perform the restricted operation:
in accordance with a determination that the fingerprint is enrolled with the device, performing the restricted operation; and
in accordance with a determination that the fingerprint is not enrolled with the device, forgoing performance of the restricted operation. 4. The method of claim 1, wherein the message prompting the user to perform one or more additional finger gestures includes displayed instructions to perform subsequent finger gestures differently from the respective finger gesture. 5. The method of claim 1, wherein the message prompting the user to perform one or more additional finger gestures includes an indication of one or more portions or locations of the respective fingerprint for which fingerprint information is inadequate or has not been collected. 6. The method of claim 1, including, while the respective finger is on the fingerprint sensor during a respective gesture:
collecting fingerprint information; and after the fingerprint information has been collected, providing haptic feedback at the device to indicate that the fingerprint information has been collected. 7. The method of claim 1, including, after enrolling the fingerprint of the respective finger with the device:
displaying a fingerprint settings interface with a plurality of entries that correspond to respective enrolled fingerprints, wherein the plurality of entries includes a respective entry that corresponds to the fingerprint of the respective finger and one or more other entries that correspond to other enrolled fingerprints of other fingers besides the respective finger; detecting a second finger gesture on the fingerprint sensor that corresponds to the fingerprint of the respective finger; and in response to detecting the second finger gesture, highlighting the respective entry that corresponds to the fingerprint of the respective finger. 8. The method of claim 1, wherein the fingerprint enrollment interface includes a progress indicator, wherein the plurality of separate and distinct finger gestures performed with the respective finger includes a first distinct finger gesture and a second distinct finger gesture detected after the first distinct finger gesture, and the method includes:
in response to detecting on the fingerprint sensor the first distinct finger gesture, changing an appearance of the progress indicator to indicate the collection of fingerprint information from the first distinct finger gesture, and in response to detecting on the fingerprint sensor the second distinct finger gesture, further changing the appearance of the progress indicator to indicate the collection of additional fingerprint information from the second distinct finger gesture. 9. The method of claim 1, wherein the fingerprint enrollment interface includes a progress indicator, and the method includes:
in response to detecting on the fingerprint sensor a respective finger gesture performed with the respective finger, changing an appearance of the progress indicator to indicate the collection of additional fingerprint information from the respective finger gesture. 10. The method of claim 9, wherein the progress indicator includes a portion of a surface of a three-dimensional object. 11. The method of claim 9, wherein:
the progress indicator is in the shape of a fingerprint and includes lines that are representative of fingerprint ridges; and changing the appearance of the progress indicator includes coloring in a portion of the plurality of ridges. 12. The method of claim 9, wherein:
the progress indicator includes a plurality of concentric circles; and changing the appearance of the progress indicator includes filling in one of a plurality of concentric circles with a predefined fill. 13. The method of claim 9, wherein:
the progress indicator includes a plurality of progress-indicator portions that correspond to fingerprint portions of the respective fingerprint; and when fingerprint information from a respective fingerprint portion is collected, an appearance of the corresponding progress-indicator portion is changed to indicate that fingerprint information from the respective fingerprint portion has been collected. 14. The method of claim 13, including, after changing the appearance of a plurality of progress-indicator portions, in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, changing the appearance of one or more unchanged progress-indicator portions to match the appearance of the plurality of progress-indicator portions. 15. An electronic device, comprising:
a display; a fingerprint sensor; 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 fingerprint enrollment interface;
detecting on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger;
collecting fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and
after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determining, based on the fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enrolling the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, displaying a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 16. 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 fingerprint sensor, cause the device to:
display a fingerprint enrollment interface; detect on the fingerprint sensor a plurality of separate and distinct finger gestures performed with a respective finger; collect fingerprint information from the plurality of separate and distinct finger gestures performed with the respective finger; and after collecting the fingerprint information from each of the plurality of separate and distinct finger gestures:
determine, based on the fingerprint information collected for the respective finger, whether the fingerprint information that has been collected is sufficient to enroll a fingerprint of the respective finger with the device;
in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, enroll the fingerprint of the respective finger with the device; and
in accordance with a determination that the fingerprint information that has been collected for the respective finger is not sufficient to enroll the fingerprint of the respective finger, display a message in the fingerprint enrollment interface prompting a user to perform one or more additional finger gestures on the fingerprint sensor with the respective finger. 17. The medium of claim 16, wherein fingerprint information from the plurality of separate and distinct finger gestures is collected for an area of the fingerprint of the respective finger that is at least twice as large as the area that can be captured by the fingerprint sensor during a single finger gesture. 18. The medium of claim 16, wherein the one or more programs further comprise instructions for: after enrolling the fingerprint of the respective finger with the device:
receiving a request to perform a restricted operation and detecting a fingerprint on the fingerprint sensor; and in response to receiving the request to perform the restricted operation:
in accordance with a determination that the fingerprint is enrolled with the device, performing the restricted operation; and
in accordance with a determination that the fingerprint is not enrolled with the device, forgoing performance of the restricted operation. 19. The medium of claim 16, wherein the message prompting the user to perform one or more additional finger gestures includes displayed instructions to perform subsequent finger gestures differently from the respective finger gesture. 20. The medium of claim 16, wherein the message prompting the user to perform one or more additional finger gestures includes an indication of one or more portions or locations of the respective fingerprint for which fingerprint information is inadequate or has not been collected. 21. The medium of claim 16, wherein the one or more programs further comprise instructions for: while the respective finger is on the fingerprint sensor during a respective gesture:
collecting fingerprint information; and after the fingerprint information has been collected, providing haptic feedback at the device to indicate that the fingerprint information has been collected. 22. The medium of claim 16, wherein the one or more programs further comprise instructions for: after enrolling the fingerprint of the respective finger with the device:
displaying a fingerprint settings interface with a plurality of entries that correspond to respective enrolled fingerprints, wherein the plurality of entries includes a respective entry that corresponds to the fingerprint of the respective finger and one or more other entries that correspond to other enrolled fingerprints of other fingers besides the respective finger; detecting a second finger gesture on the fingerprint sensor that corresponds to the fingerprint of the respective finger; and in response to detecting the second finger gesture, highlighting the respective entry that corresponds to the fingerprint of the respective finger. 23. The medium of claim 16, wherein the fingerprint enrollment interface includes a progress indicator, wherein the plurality of separate and distinct finger gestures performed with the respective finger includes a first distinct finger gesture and a second distinct finger gesture detected after the first distinct finger gesture, and the one or more programs further comprise instructions for:
in response to detecting on the fingerprint sensor the first distinct finger gesture, changing an appearance of the progress indicator to indicate the collection of fingerprint information from the first distinct finger gesture, and in response to detecting on the fingerprint sensor the second distinct finger gesture, further changing the appearance of the progress indicator to indicate the collection of additional fingerprint information from the second distinct finger gesture. 24. The medium of claim 16, wherein the fingerprint enrollment interface includes a progress indicator, and the one or more programs further comprise instructions for:
in response to detecting on the fingerprint sensor a respective finger gesture performed with the respective finger, changing an appearance of the progress indicator to indicate the collection of additional fingerprint information from the respective finger gesture. 25. The medium of claim 24, wherein the progress indicator includes a portion of a surface of a three-dimensional object. 26. The medium of claim 24, wherein:
the progress indicator is in the shape of a fingerprint and includes lines that are representative of fingerprint ridges; and changing the appearance of the progress indicator includes coloring in a portion of the plurality of ridges. 27. The medium of claim 24, wherein:
the progress indicator includes a plurality of concentric circles; and changing the appearance of the progress indicator includes filling in one of a plurality of concentric circles with a predefined fill. 28. The medium of claim 24, wherein:
the progress indicator includes a plurality of progress-indicator portions that correspond to fingerprint portions of the respective fingerprint; and when fingerprint information from a respective fingerprint portion is collected, an appearance of the corresponding progress-indicator portion is changed to indicate that fingerprint information from the respective fingerprint portion has been collected. 29. The medium of claim 28, wherein the one or more programs further comprise instructions for: after changing the appearance of a plurality of progress-indicator portions, in accordance with a determination that the fingerprint information that has been collected for the respective finger is sufficient to enroll the fingerprint of the respective finger, changing the appearance of one or more unchanged progress-indicator portions to match the appearance of the plurality of progress-indicator portions. 30. The medium of claim 16, wherein the plurality of separate and distinct finger gestures is a plurality of separate and distinct stationary finger gestures. | 2,100 |
4,715 | 14,013,154 | 2,131 | A computer receives data from a storage device. The computer identifies a state value of the storage device and at least one maintenance task included in the received data. The computer generates a set of instructions for limiting the workload of a storage device executing maintenance tasks. According to the generated instructions, the computer limits the workload placed on the storage device. | 1. A method for adapting a workload placed on a storage device, the method comprising:
a computer receiving a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device; the computer determining a status of the maintenance task to be executed based, at least in part, on the received data; and the computer limiting a workload of the storage device based on the status of the maintenance task. 2. The method in claim 1, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 3. The method in claim 1, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 4. The method in claim 1, wherein the data includes a state value associated with the queue of maintenance tasks. 5. The method in claim 1, wherein the state value of the storage device is based, at least in part, on at least one of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 6. The method in claim 1, the method further comprising the steps of:
the computer limiting a workload of the storage device is based, at least in part on interpreting the data received from the storage device, and the computer matching the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. 7. The method in claim 1, wherein the storage device comprises one or more of a Hard Disk Drive, a Solid State drive, a Random Access Memory (RAM), an Electrically Erasable Programmable Read Only Memory (EEPROM), an EPROM Erasable Programmable Read Only Memory (EPROM), or a flash memory. 8. A computer program product for adapting a workload placed on a storage device, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more storage devices, the program instructions comprising: program instructions to receive a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device; program instructions to determine a status of the maintenance task to be executed based, at least in part, on the received data; and program instructions to limit a workload of the storage device based on the status of the maintenance task. 9. The computer program product in claim 8, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 10. The computer program product in claim 8, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 11. The computer program product in claim 8, wherein the data includes a state value associated with the queue of maintenance tasks. 12. The computer program product in claim 8, wherein the state value of the storage device is based, at least in part on one or more of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 13. The computer program product in claim 8, the program instructions further comprising:
program instructions to limit a workload of the storage device based, at least in part on an interpretation of the data received from the storage device; and program instructions to match the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. 14. The computer program product in claim 8, wherein the storage device comprises one or more of a Hard Disk Drive, a Solid State drive, a Random Access Memory (RAM), an Electrically Erasable Programmable Read Only Memory (EEPROM), an EPROM Erasable Programmable Read Only Memory (EPROM), or a flash memory. 15. A computer system for adapting a workload placed on a storage device, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising:
program instructions to receive a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device;
program instructions to determine a status of the maintenance task to be executed based, at least in part, on the received data; and
program instructions to limit a workload of the storage device based on the status of the maintenance task. 16. The computer system in claim 15, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 17. The computer system in claim 15, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 18. The computer system in claim 15, wherein the data includes a state value associated with the queue of maintenance tasks. 19. The computer system in claim 15, wherein the state value of the storage device is based, at least in part on one or more of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 20. The computer system in claim 15, the program instructions further comprising:
program instructions to limit a workload of the storage device based, at least in part on an interpretation of the data received from the storage device, and program instructions to match the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. | A computer receives data from a storage device. The computer identifies a state value of the storage device and at least one maintenance task included in the received data. The computer generates a set of instructions for limiting the workload of a storage device executing maintenance tasks. According to the generated instructions, the computer limits the workload placed on the storage device.1. A method for adapting a workload placed on a storage device, the method comprising:
a computer receiving a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device; the computer determining a status of the maintenance task to be executed based, at least in part, on the received data; and the computer limiting a workload of the storage device based on the status of the maintenance task. 2. The method in claim 1, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 3. The method in claim 1, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 4. The method in claim 1, wherein the data includes a state value associated with the queue of maintenance tasks. 5. The method in claim 1, wherein the state value of the storage device is based, at least in part, on at least one of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 6. The method in claim 1, the method further comprising the steps of:
the computer limiting a workload of the storage device is based, at least in part on interpreting the data received from the storage device, and the computer matching the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. 7. The method in claim 1, wherein the storage device comprises one or more of a Hard Disk Drive, a Solid State drive, a Random Access Memory (RAM), an Electrically Erasable Programmable Read Only Memory (EEPROM), an EPROM Erasable Programmable Read Only Memory (EPROM), or a flash memory. 8. A computer program product for adapting a workload placed on a storage device, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more storage devices, the program instructions comprising: program instructions to receive a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device; program instructions to determine a status of the maintenance task to be executed based, at least in part, on the received data; and program instructions to limit a workload of the storage device based on the status of the maintenance task. 9. The computer program product in claim 8, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 10. The computer program product in claim 8, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 11. The computer program product in claim 8, wherein the data includes a state value associated with the queue of maintenance tasks. 12. The computer program product in claim 8, wherein the state value of the storage device is based, at least in part on one or more of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 13. The computer program product in claim 8, the program instructions further comprising:
program instructions to limit a workload of the storage device based, at least in part on an interpretation of the data received from the storage device; and program instructions to match the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. 14. The computer program product in claim 8, wherein the storage device comprises one or more of a Hard Disk Drive, a Solid State drive, a Random Access Memory (RAM), an Electrically Erasable Programmable Read Only Memory (EEPROM), an EPROM Erasable Programmable Read Only Memory (EPROM), or a flash memory. 15. A computer system for adapting a workload placed on a storage device, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising:
program instructions to receive a data from a storage device, wherein the received data includes at least one maintenance task to be executed on the storage device;
program instructions to determine a status of the maintenance task to be executed based, at least in part, on the received data; and
program instructions to limit a workload of the storage device based on the status of the maintenance task. 16. The computer system in claim 15, wherein the data received by the computer includes one or more of a current maintenance task queue, or an error status. 17. The computer system in claim 15, wherein the data received by the computer is based, at least in part, on a queue of maintenance tasks and a degree of completion of the tasks. 18. The computer system in claim 15, wherein the data includes a state value associated with the queue of maintenance tasks. 19. The computer system in claim 15, wherein the state value of the storage device is based, at least in part on one or more of a) a quantity of queued maintenance tasks, b) a duration of queued maintenance tasks, and c) an idle time between read or write tasks. 20. The computer system in claim 15, the program instructions further comprising:
program instructions to limit a workload of the storage device based, at least in part on an interpretation of the data received from the storage device, and program instructions to match the received data to a pre-determined set of actions for managing the load placed on the storage device, the actions including at least one of a) disabling a subset of monitoring commands, b) using a secondary drive for read requests, c) sending write commands to cache to be executed later after maintenance tasks finish, d) performing a RAID extract, and e) triggering a proactive failure of the storage device. | 2,100 |
4,716 | 14,714,715 | 2,175 | Embodiments relate to controlling display of a document, where the document comprises multiple columns. An aspect includes displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document. Another aspect includes determining the lowest numbered column that does not have its lowest point displayed in the viewport. Another aspect includes scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. | 1. A method of controlling display of a document, the document comprising multiple columns, the method comprising:
displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document, determining the lowest numbered column that does not have its lowest point displayed in the viewport, and scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 2. A method according to claim 1, further comprising calculating a total height of the multiple columns in the document and displaying a scrollbar sized to reflect the total height of the multiple columns in the document. 3. A method according to claim 1, further comprising receiving a user input defining an upwards scrolling for the document, determining a highest numbered column that does not have its highest point displayed in the viewport, and scrolling downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 4. A method according to claim 1, further comprising receiving a user input defining a downwards scrolling for the document, determining that all of the multiple columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 5. A method according to claim 1, further comprising receiving a user input defining an upwards scrolling for the document, determining that all of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. 6. A system for controlling display of a document, the document comprising multiple columns, the system comprising:
a display device configured to display the columns of the document in a viewport, a user interface device configured to receive a user input defining a downwards scrolling for the document, and a processor connected to the display device and the user interface device and configured to determine the lowest numbered column that does not have its lowest point displayed in the viewport, and scroll upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 7. A system according to claim 6, wherein the processor is further configured to calculate a total height of the multiple columns in the document and the display device is configured to display a scrollbar sized to reflect the total height of the multiple columns in the document. 8. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining an upwards scrolling for the document, and the processor is further configured to determine a highest numbered column that does not have its highest point displayed in the viewport, and scroll downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 9. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining a downwards scrolling for the document, and the processor is further configured to determine that all of the multiplied columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 10. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining an upwards scrolling for the document, and the processor is further configured to determine that all of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. 11. A computer program product for controlling display of a document, the document comprising multiple columns, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document, determining the lowest numbered column that does not have its lowest point displayed in the viewport, and scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 12. A computer program product according to claim 11, further comprising instructions for calculating a total height of the multiple columns in the document and displaying a scrollbar sized to reflect the total height of the multiple columns in the document. 13. A computer program product according to claim 11, further comprising instructions for receiving a user input defining an upwards scrolling for the document, determining a highest numbered column that does not have its highest point displayed in the viewport, and scrolling downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 14. A computer program product according to claim 11, further comprising instructions for receiving a user input defining a downwards scrolling for the document, determining that all columns of the multiple columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 15. A computer program product according to claim 11, further comprising instructions for receiving a user input defining an upwards scrolling for the document, determining that all columns of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. | Embodiments relate to controlling display of a document, where the document comprises multiple columns. An aspect includes displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document. Another aspect includes determining the lowest numbered column that does not have its lowest point displayed in the viewport. Another aspect includes scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport.1. A method of controlling display of a document, the document comprising multiple columns, the method comprising:
displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document, determining the lowest numbered column that does not have its lowest point displayed in the viewport, and scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 2. A method according to claim 1, further comprising calculating a total height of the multiple columns in the document and displaying a scrollbar sized to reflect the total height of the multiple columns in the document. 3. A method according to claim 1, further comprising receiving a user input defining an upwards scrolling for the document, determining a highest numbered column that does not have its highest point displayed in the viewport, and scrolling downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 4. A method according to claim 1, further comprising receiving a user input defining a downwards scrolling for the document, determining that all of the multiple columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 5. A method according to claim 1, further comprising receiving a user input defining an upwards scrolling for the document, determining that all of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. 6. A system for controlling display of a document, the document comprising multiple columns, the system comprising:
a display device configured to display the columns of the document in a viewport, a user interface device configured to receive a user input defining a downwards scrolling for the document, and a processor connected to the display device and the user interface device and configured to determine the lowest numbered column that does not have its lowest point displayed in the viewport, and scroll upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 7. A system according to claim 6, wherein the processor is further configured to calculate a total height of the multiple columns in the document and the display device is configured to display a scrollbar sized to reflect the total height of the multiple columns in the document. 8. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining an upwards scrolling for the document, and the processor is further configured to determine a highest numbered column that does not have its highest point displayed in the viewport, and scroll downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 9. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining a downwards scrolling for the document, and the processor is further configured to determine that all of the multiplied columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 10. A system according to claim 6, wherein the user interface device is further configured to receive a user input defining an upwards scrolling for the document, and the processor is further configured to determine that all of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. 11. A computer program product for controlling display of a document, the document comprising multiple columns, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
displaying the columns of the document in a viewport, receiving a user input defining a downwards scrolling for the document, determining the lowest numbered column that does not have its lowest point displayed in the viewport, and scrolling upwards only the lowest numbered column that does not have its lowest point displayed in the viewport, while maintaining all other columns stationary in the viewport. 12. A computer program product according to claim 11, further comprising instructions for calculating a total height of the multiple columns in the document and displaying a scrollbar sized to reflect the total height of the multiple columns in the document. 13. A computer program product according to claim 11, further comprising instructions for receiving a user input defining an upwards scrolling for the document, determining a highest numbered column that does not have its highest point displayed in the viewport, and scrolling downwards only the highest numbered column that does not have its highest point displayed in the viewport, while maintaining all other columns of the multiple columns stationary in the viewport. 14. A computer program product according to claim 11, further comprising instructions for receiving a user input defining a downwards scrolling for the document, determining that all columns of the multiple columns have their respective lowest point displayed in the viewport, and scrolling upwards the entire document. 15. A computer program product according to claim 11, further comprising instructions for receiving a user input defining an upwards scrolling for the document, determining that all columns of the multiple columns have their respective highest point displayed in the viewport, and scrolling downwards the entire document. | 2,100 |
4,717 | 12,957,937 | 2,159 | According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt. | 1. A method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, the method comprising:
a requester reading a shared data record including a payload and a first checksum; the requester calculating a second checksum of the payload of the data record; if the first and second checksums are not equal, the requester again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record; if the third and fourth checksums are equal, the requester processing the shared data record as valid; and if the second and fourth checksums are equal, the requester handling the shared data record as corrupt. 2. The method of claim 1, and further comprising:
if the first and second checksums are equal, the requester processing the shared data record as valid. 3. The method of claim 1, and further comprising:
the requester waiting for an update to the shared data record to complete prior to again reading the shared data record. 4. The method of claim 1, wherein the reading comprises reading the data record in one shot. 5. The method of claim 1, and further comprising:
the requester acquiring a lock on the shared data record and performing an update to the payload of the data record; the requester calculating and writing into the shared data record a fourth checksum of the updated payload; and the requester thereafter releasing the lock. 6. The method of claim 5, wherein performing the update to the payload comprises performing an update to the payload in one shot. 7. A program product for accessing a shared data record subject to contemporaneous read and write access by multiple requesters, the program product comprising:
a computer readable storage medium; and program code stored within the computer readable storage medium that, when processed by a computer, causes the computer to perform:
reading a shared data record including a payload and a first checksum;
calculating a second checksum of the payload of the data record;
if the first and second checksums are not equal, again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record;
if the third and fourth checksums are equal, processing the shared data record as valid; and
if the second and fourth checksums are equal, handling the shared data record as corrupt. 8. The program product of claim 8, wherein the program code further causes the computer to perform:
if the first and second checksums are equal, processing the shared data record as valid. 9. The program product of claim 8, wherein the program code further causes the computer to perform:
waiting for an update to the shared data record to complete prior to again reading the shared data record. 10. The program product of claim 8, wherein the reading comprises reading the data record in one shot. 11. The program product of claim 8, wherein the program code further causes the computer to perform:
acquiring a lock on the shared data record and performing an update to the payload of the data record; calculating and writing into the shared data record a fourth checksum of the updated payload; and thereafter releasing the lock. 12. The program product of claim 11, wherein performing the update to the payload comprises performing an update to the payload in one shot. 13. A data processing system comprising:
a processor; data storage; and program code stored within the data storage that, when processed by the data processing system, causes the data processing system to perform:
reading a shared data record including a payload and a first checksum;
calculating a second checksum of the payload of the data record;
if the first and second checksums are not equal, again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record;
if the third and fourth checksums are equal, processing the shared data record as valid; and
if the second and fourth checksums are equal, handling the shared data record as corrupt. 14. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
if the first and second checksums are equal, processing the shared data record as valid. 15. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
waiting for an update to the shared data record to complete prior to again reading the shared data record. 16. The data processing system of claim 13, wherein the reading comprises reading the data record in one shot. 17. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
acquiring a lock on the shared data record and performing an update to the payload of the data record; calculating and writing into the shared data record a fourth checksum of the updated payload; and thereafter releasing the lock. 18. The data processing system of claim 17, wherein performing the update to the payload comprises performing an update to the payload in one shot. | According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.1. A method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, the method comprising:
a requester reading a shared data record including a payload and a first checksum; the requester calculating a second checksum of the payload of the data record; if the first and second checksums are not equal, the requester again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record; if the third and fourth checksums are equal, the requester processing the shared data record as valid; and if the second and fourth checksums are equal, the requester handling the shared data record as corrupt. 2. The method of claim 1, and further comprising:
if the first and second checksums are equal, the requester processing the shared data record as valid. 3. The method of claim 1, and further comprising:
the requester waiting for an update to the shared data record to complete prior to again reading the shared data record. 4. The method of claim 1, wherein the reading comprises reading the data record in one shot. 5. The method of claim 1, and further comprising:
the requester acquiring a lock on the shared data record and performing an update to the payload of the data record; the requester calculating and writing into the shared data record a fourth checksum of the updated payload; and the requester thereafter releasing the lock. 6. The method of claim 5, wherein performing the update to the payload comprises performing an update to the payload in one shot. 7. A program product for accessing a shared data record subject to contemporaneous read and write access by multiple requesters, the program product comprising:
a computer readable storage medium; and program code stored within the computer readable storage medium that, when processed by a computer, causes the computer to perform:
reading a shared data record including a payload and a first checksum;
calculating a second checksum of the payload of the data record;
if the first and second checksums are not equal, again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record;
if the third and fourth checksums are equal, processing the shared data record as valid; and
if the second and fourth checksums are equal, handling the shared data record as corrupt. 8. The program product of claim 8, wherein the program code further causes the computer to perform:
if the first and second checksums are equal, processing the shared data record as valid. 9. The program product of claim 8, wherein the program code further causes the computer to perform:
waiting for an update to the shared data record to complete prior to again reading the shared data record. 10. The program product of claim 8, wherein the reading comprises reading the data record in one shot. 11. The program product of claim 8, wherein the program code further causes the computer to perform:
acquiring a lock on the shared data record and performing an update to the payload of the data record; calculating and writing into the shared data record a fourth checksum of the updated payload; and thereafter releasing the lock. 12. The program product of claim 11, wherein performing the update to the payload comprises performing an update to the payload in one shot. 13. A data processing system comprising:
a processor; data storage; and program code stored within the data storage that, when processed by the data processing system, causes the data processing system to perform:
reading a shared data record including a payload and a first checksum;
calculating a second checksum of the payload of the data record;
if the first and second checksums are not equal, again reading the shared data record, said shared data record including a third checksum, and calculating a fourth checksum of the payload of the shared data record;
if the third and fourth checksums are equal, processing the shared data record as valid; and
if the second and fourth checksums are equal, handling the shared data record as corrupt. 14. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
if the first and second checksums are equal, processing the shared data record as valid. 15. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
waiting for an update to the shared data record to complete prior to again reading the shared data record. 16. The data processing system of claim 13, wherein the reading comprises reading the data record in one shot. 17. The data processing system of claim 13, wherein the program code further causes the data processing system to perform:
acquiring a lock on the shared data record and performing an update to the payload of the data record; calculating and writing into the shared data record a fourth checksum of the updated payload; and thereafter releasing the lock. 18. The data processing system of claim 17, wherein performing the update to the payload comprises performing an update to the payload in one shot. | 2,100 |
4,718 | 12,300,594 | 2,191 | A device and a method for synchronization of a robot program and a graphical program. The device includes a first converter adapted to convert a graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program. A second converter is adapted to convert the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program. A modification command generator is adapted to compare the first and second sequences of tokens and based thereon generate modification commands. The first converter is adapted to receive the modification commands and edit the graphical program based on the modification commands so that the token sequence of the graphical program matches the token sequence of the robot program. The second converter is adapted to receive the modification commands and edit the robot program based on the modification commands so that the token sequence of the robot program matches the token sequence of the graphical program. | 1. A method for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the method comprising:
receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, converting the graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, converting the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, comparing the first and second sequences of tokens and based thereon generating modification commands in dependence on which program is the leader and which is the follower, and editing the follower program based on the generated modification commands so that the token sequence of the follower matches the sequence of the leader. 2. The method according to claim 1, wherein the editing comprises editing the sequence of tokens of the follower so that the token sequence matches the sequence of the leader, and converting the edited sequence of tokens of the follower back to the original program form. 3. The method according to claim 1, wherein said programs are converted into sequences of sentences built up of said tokens, and said modification commands includes insert sentence, delete sentence and edit token. 4. The method according to claim 1, wherein the difference between the first and second sequences of token is calculated by a Longest Common Subsequence algorithm. 5. A computer program product, comprising:
a computer readable medium; and computer program instructions recorded on the computer readable medium and executable by a processor for performing a method for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the method comprising receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, converting the graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, converting the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, comparing the first and second sequences of tokens and based thereon generating modification commands in dependence on which program is the leader and which is the follower, and editing the follower program based on the generated modification commands so that the token sequence of the follower matches the sequence of the leader. 6. (canceled) 7. A device for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the device comprising:
a first converter adapted to convert a graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, a second converter adapted to convert the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, and a modification command generator adapted to compare the first and second sequences of tokens and based thereon generate modification commands, wherein said first converter is adapted to receive said modification commands and edit the graphical program based on the modification commands so that the token sequence of the graphical program matches the token sequence of the robot program and said second converter is adapted to receive said modification commands and edit the robot program based on the modification commands so that the token sequence of the robot program matches the token sequence of the graphical program. 8. The device according to claim 7, wherein the device is adapted to receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, and the modification command generator is adapted to generate and send said modification commands to either the first or the second converter in dependence on which program is the leader and which is the follower. 9. The device according to claim 8, wherein said converters are adapted to edit the sequence of tokens of the follower so that the token sequence matches the sequence of the leader and converting the edited sequence of tokens of the follower back to the original program form. 10. The method according to claim 1, further comprising:
utilizing off-line programming of an industrial robot. | A device and a method for synchronization of a robot program and a graphical program. The device includes a first converter adapted to convert a graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program. A second converter is adapted to convert the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program. A modification command generator is adapted to compare the first and second sequences of tokens and based thereon generate modification commands. The first converter is adapted to receive the modification commands and edit the graphical program based on the modification commands so that the token sequence of the graphical program matches the token sequence of the robot program. The second converter is adapted to receive the modification commands and edit the robot program based on the modification commands so that the token sequence of the robot program matches the token sequence of the graphical program.1. A method for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the method comprising:
receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, converting the graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, converting the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, comparing the first and second sequences of tokens and based thereon generating modification commands in dependence on which program is the leader and which is the follower, and editing the follower program based on the generated modification commands so that the token sequence of the follower matches the sequence of the leader. 2. The method according to claim 1, wherein the editing comprises editing the sequence of tokens of the follower so that the token sequence matches the sequence of the leader, and converting the edited sequence of tokens of the follower back to the original program form. 3. The method according to claim 1, wherein said programs are converted into sequences of sentences built up of said tokens, and said modification commands includes insert sentence, delete sentence and edit token. 4. The method according to claim 1, wherein the difference between the first and second sequences of token is calculated by a Longest Common Subsequence algorithm. 5. A computer program product, comprising:
a computer readable medium; and computer program instructions recorded on the computer readable medium and executable by a processor for performing a method for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the method comprising receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, converting the graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, converting the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, comparing the first and second sequences of tokens and based thereon generating modification commands in dependence on which program is the leader and which is the follower, and editing the follower program based on the generated modification commands so that the token sequence of the follower matches the sequence of the leader. 6. (canceled) 7. A device for synchronizing a graphical program generated in an off-line simulation environment defining a movement path for a robot and attributes of the robot motion along the movement path, and a robot program including program code for a robot controller, the device comprising:
a first converter adapted to convert a graphical program into a first sequence of tokens representing data for motions and actions contained in the graphical program, a second converter adapted to convert the robot program into a second sequence of tokens representing data for motions and actions contained in the robot program, and a modification command generator adapted to compare the first and second sequences of tokens and based thereon generate modification commands, wherein said first converter is adapted to receive said modification commands and edit the graphical program based on the modification commands so that the token sequence of the graphical program matches the token sequence of the robot program and said second converter is adapted to receive said modification commands and edit the robot program based on the modification commands so that the token sequence of the robot program matches the token sequence of the graphical program. 8. The device according to claim 7, wherein the device is adapted to receiving information on which of the programs is to remain unchanged during the synchronization, in the following called a leader program for the synchronization, and which of the programs to be modified according to the program that is selected as the leader program, in the following called a follower program, and the modification command generator is adapted to generate and send said modification commands to either the first or the second converter in dependence on which program is the leader and which is the follower. 9. The device according to claim 8, wherein said converters are adapted to edit the sequence of tokens of the follower so that the token sequence matches the sequence of the leader and converting the edited sequence of tokens of the follower back to the original program form. 10. The method according to claim 1, further comprising:
utilizing off-line programming of an industrial robot. | 2,100 |
4,719 | 13,251,178 | 2,184 | A computer system comprising: a graphics processor, a display controller comprising a display-local frame buffer, a display device, and a memory. The memory stores instructions, that when executed by the computer system, perform a method of entering a power management state. The method comprises detecting that the computer system is idle and optional proximity detector for determining if a user is present in front of the system. With the computer system idle, and the user in proximity of the system, the display-local frame buffer is activated. Display information transmitted by the graphics processor is stored in the display-local frame buffer. Initially a power reduction state is initiated for the graphics subsystem including the graphics processor, and the display device is placed in a self-refresh state with the display self-refreshing from information stored in the local frame buffer. | 1. A computer system comprising:
a graphics processor; a local frame buffer; a display device; and a memory for storing instructions, that when executed by the computer system perform a method of entering a power conservation state, the method comprising: detecting a system idle event; activating the local frame buffer; storing display information in the local frame buffer from the graphics processor; initiating a power reduction state for the graphics processor; and self-refreshing the display device during the power reduction state with the display information stored in the local frame buffer. 2. The computer system of claim 1, wherein the computer system further comprises a display controller which comprises the local frame buffer. 3. The computer system of claim 1 comprising input devices, and wherein at least one input device remains active during the power conservation state. 4. The computer system of claim 3, wherein the method further comprises: exiting the power conservation state when an input is received from at least one input device. 5. The computer system of claim 1, further comprising a proximity device, and wherein the method further comprises:
detecting a presence or absence of a user with the proximity device, wherein the self-refreshed display device is dimmed after a prescribed length of time if the proximity device detected the absence of the user. 6. The computer system of Claim I, wherein the method further comprises:
displaying a graphical user interface for defining options of the power conservation state. 7. The computer system of claim 1, wherein the power reduction state for the graphics processor comprises powering down the graphics processor. 8. A method of entering a power conservation state, the method comprising:
detecting a system idle event of a computer system; activating a local frame buffer; storing display information in the local frame buffer froth a graphics processor; initiating a power reduction state for the graphics processor; and during the power reduction state, self-refreshing a display device with the display information stored in the local frame buffer. 9. The method of claim 8, wherein a display controller comprises the local frame buffer. 10. The method of claim 8, further comprising maintaining active at least one input device during the power conservation state. 11. The method of claim 10 further comprising exiting the power conservation state when the computer system receives an input from at least one input device. 12. The method of claim 8 further comprising:
detecting the presence or absence of a user with a proximity device of the computer system, and dimming the self-refreshed display device after a prescribed length of time when the proximity device has detected the absence of the user. 13. The method of claim 8 further comprising:
displaying a graphical user interface for defining options relating to the power conservation state. 14. A computer system comprising:
a graphics processor operable to generate display information, wherein the graphics processor is further operable to enter a power reduction state; a display device operable to display the generated display information; a local frame buffer that when activated is operable to store display information, wherein the local frame buffer is further operable to self-refresh the display device with the display information during a power reduction state of the graphics processor; and a processor operable to detect a system idle event, wherein the processor is further operable to activate the local frame buffer and to initiate the power reduction state of the graphics processor. 15. The computer system of claim 14, further comprising a display controller comprising the local frame buffer. 16. The computer system of claim 14 further comprising at least one input device operable to generate an input signal, and wherein at least one input device of the computer system is operable to remain active during the power reduction state of the graphics processor. 17. The computer system of claim 16, wherein the processor is further operable to initiate an exit from the power reduction state of the graphics processor when the processor receives an input signal from at least one input device of the computer system. 18. The computer system of claim 14, further comprising a proximity device operable to detect the presence or absence of a user, wherein the self-refreshed display device is dimmed after a prescribed length of time when the proximity device has detected the absence of the user. 19. The computer system of claim 14, further comprising an on-screen graphical user interface operable on the display device to define at least one option of the power conservation state. 20. The computer system of claim 14, wherein a power reduction state of the graphics processor comprises powering down the graphics processor. | A computer system comprising: a graphics processor, a display controller comprising a display-local frame buffer, a display device, and a memory. The memory stores instructions, that when executed by the computer system, perform a method of entering a power management state. The method comprises detecting that the computer system is idle and optional proximity detector for determining if a user is present in front of the system. With the computer system idle, and the user in proximity of the system, the display-local frame buffer is activated. Display information transmitted by the graphics processor is stored in the display-local frame buffer. Initially a power reduction state is initiated for the graphics subsystem including the graphics processor, and the display device is placed in a self-refresh state with the display self-refreshing from information stored in the local frame buffer.1. A computer system comprising:
a graphics processor; a local frame buffer; a display device; and a memory for storing instructions, that when executed by the computer system perform a method of entering a power conservation state, the method comprising: detecting a system idle event; activating the local frame buffer; storing display information in the local frame buffer from the graphics processor; initiating a power reduction state for the graphics processor; and self-refreshing the display device during the power reduction state with the display information stored in the local frame buffer. 2. The computer system of claim 1, wherein the computer system further comprises a display controller which comprises the local frame buffer. 3. The computer system of claim 1 comprising input devices, and wherein at least one input device remains active during the power conservation state. 4. The computer system of claim 3, wherein the method further comprises: exiting the power conservation state when an input is received from at least one input device. 5. The computer system of claim 1, further comprising a proximity device, and wherein the method further comprises:
detecting a presence or absence of a user with the proximity device, wherein the self-refreshed display device is dimmed after a prescribed length of time if the proximity device detected the absence of the user. 6. The computer system of Claim I, wherein the method further comprises:
displaying a graphical user interface for defining options of the power conservation state. 7. The computer system of claim 1, wherein the power reduction state for the graphics processor comprises powering down the graphics processor. 8. A method of entering a power conservation state, the method comprising:
detecting a system idle event of a computer system; activating a local frame buffer; storing display information in the local frame buffer froth a graphics processor; initiating a power reduction state for the graphics processor; and during the power reduction state, self-refreshing a display device with the display information stored in the local frame buffer. 9. The method of claim 8, wherein a display controller comprises the local frame buffer. 10. The method of claim 8, further comprising maintaining active at least one input device during the power conservation state. 11. The method of claim 10 further comprising exiting the power conservation state when the computer system receives an input from at least one input device. 12. The method of claim 8 further comprising:
detecting the presence or absence of a user with a proximity device of the computer system, and dimming the self-refreshed display device after a prescribed length of time when the proximity device has detected the absence of the user. 13. The method of claim 8 further comprising:
displaying a graphical user interface for defining options relating to the power conservation state. 14. A computer system comprising:
a graphics processor operable to generate display information, wherein the graphics processor is further operable to enter a power reduction state; a display device operable to display the generated display information; a local frame buffer that when activated is operable to store display information, wherein the local frame buffer is further operable to self-refresh the display device with the display information during a power reduction state of the graphics processor; and a processor operable to detect a system idle event, wherein the processor is further operable to activate the local frame buffer and to initiate the power reduction state of the graphics processor. 15. The computer system of claim 14, further comprising a display controller comprising the local frame buffer. 16. The computer system of claim 14 further comprising at least one input device operable to generate an input signal, and wherein at least one input device of the computer system is operable to remain active during the power reduction state of the graphics processor. 17. The computer system of claim 16, wherein the processor is further operable to initiate an exit from the power reduction state of the graphics processor when the processor receives an input signal from at least one input device of the computer system. 18. The computer system of claim 14, further comprising a proximity device operable to detect the presence or absence of a user, wherein the self-refreshed display device is dimmed after a prescribed length of time when the proximity device has detected the absence of the user. 19. The computer system of claim 14, further comprising an on-screen graphical user interface operable on the display device to define at least one option of the power conservation state. 20. The computer system of claim 14, wherein a power reduction state of the graphics processor comprises powering down the graphics processor. | 2,100 |
4,720 | 14,547,895 | 2,184 | A physiological data collection device obtains physiological data from a subject interface on a subject. The physiological data collection device includes a data connector such as a USB connector for connecting directly to a computer. When the physiological data collection device is connected to the computer, the physiological data is uploaded to a remote data processing center for computer-based analysis and review by a medical professional. A report can be provided to the subject based on the analysis and review. When the subject interface is physically connected to the physiological data collection device, the data connector is prevented from being connected to an external device such as the computer. | 1. A physiological data collection device comprising:
an electro-cardiogram (ECG) lead-wire set; a data collection unit comprising:
a data connector for connecting to an external computing device,
a lead-wire set connector for connecting to the ECG lead-wire set, and
non-volatile memory coupled with the data connector and the lead-wire set connector, and
a processor programmed to obtain ECG data from the ECG lead-wire set and store the obtained ECG data in the non-volatile memory; and
wherein the ECG lead-wire set or the data collection unit or both have one or more structural components that prevent a connection between the data connector and the external computing device when the ECG lead-wire set is connected to the data collection unit and vice versa. 2. The apparatus of claim 1, wherein the data connector comprises a male USB connector. 3. The apparatus of claim 2, wherein the lead-wire set comprises a female receptacle that is configured to receive the male USB connector when the lead-wire set is connected to the data collection unit. 4. The apparatus of claim 3,
wherein the lead-wire set comprises a male electrode connector having lead-wire set contacts; wherein the lead-wire set interface comprises an electrode connector receptacle having data collection unit contacts; and wherein the electrode connector receptacle is configured to receive the electrode connector such that the lead-wire set contacts make contact with the data collection unit contacts when the lead-wire set is connected to the data collection unit. 5. The apparatus of claim 2,
wherein the USB connector is configured to rotate into a recess in the data collection unit; and when the USB connector is rotated into the recess, the lead-wire set interface is exposed so that the lead-wire set can be connected to the data collection unit via the lead-wire set interface and the recess blocks a connection of the USB connector to the external computing device. 6. The apparatus of claim 2, wherein the male USB connector comprises standard USB contacts and customized data collection unit contacts; and wherein the lead-wire set connects to the male USB connector such that the lead-wire set interface interfaces with the lead-wire set via the customized data collection unit contacts in the USB connector. 7. An electro-cardiogram (ECG) self-assessment kit comprising:
an ECG sensor comprising one or more electrode leads; multiple ECG electrodes configured to connect to the one or more electrode leads; a power source; a portable subject ECG data collection unit comprising:
a USB connector configured to interface with a USB port on a computer,
non-volatile memory coupled with the USB connector, and
a processor powered by the power source and programmed to obtain ECG data from the electrode leads and to store the ECG data in the non-volatile memory; and
a medium storing program code that when run by the computer supports access to a remote data processing center for uploading the ECG data from the non-volatile memory to the remote data processing center when the USB connector is connected to a computer connected to a network. 8. The kit of claim 7, wherein the data collection unit includes the medium storing program code. 9. The kit of claim 8, wherein the program code when run by the computer supports access to the remote data processing center for uploading the ECG data without installing a software application on the computer. 10. The kit of claim 9, wherein the program code comprising a link to a website where the ECG data can be uploaded. 11. The kit of claim 8, wherein the program code when run by the computer supports access to the remote data processing center by automatically initiating an application for uploading of the ECG data upon determining that the USB connector is connected to the computer. 12. The kit of claim 7, wherein the program code supports access to the data processing center by supporting a download from a remote server system to the computer of a user application for uploading the ECG data to the remote data processing center. 13. The kit of claim 7,
wherein the subject interface is configured to be physically attached to the ECG data collection unit; and when the subject interface is connected to the ECG data collection unit, the USB connector is blocked so that the USB connector cannot be connected to the computer. 14. The kit of claim 13, wherein the USB connector comprises male USB connector that is received into a receptacle in the subject interface when the subject interface is connected to the data collection unit. 15. The kit of claim 7, wherein the non-volatile memory has sufficient memory to store ECG data for a predefined time period; and wherein the power source has sufficient power to power the data collection unit for the predefined time period. 16. The kit of claim 7, wherein the program code, when run by the computer, obtains and presents an ECG assessment report from the data processing center. 17. The kit of claim 7, wherein the subject interface comprises:
a clip for securing the subject interface to the data collection unit; and a lanyard that allows the data collection unit to be hung from the neck of a subject when the subject interface is secured to the data collection unit. 18. The kit of claim 7, wherein the subject interface comprises the power source. 19. A method of providing a monitoring service comprising:
providing a physiological data collection device to a subject, the physiological data collection device comprising:
an electro-cardiogram (ECG) subject interface;
a data collection unit comprising a USB data connector for connecting to a computer, an interface for connecting to the subject interface, non-volatile memory coupled with the data connector, and a processor programmed to obtain ECG data from the subject interface and store the ECG data in the non-volatile memory;
obtaining, at a remote data processing center, the ECG data from the data collection unit when the data collection unit is connected to a USB data port on a computer having a network connection; analyzing the ECG data for arrhythmia events; obtaining a physician review of the ECG data; and providing a report over the network to the subject based on the analyzing the ECG data and based on the physician review. 20. The method of claim 19, wherein obtaining the ECG data comprises obtaining the ECG data via a transmission of the ECG data over the network wherein the transmission initiates automatically upon determining that the data collection unit is connected to the USB data port. 21. The method of claim 19 further comprising:
obtaining demographic information regarding the subject's demographics;
wherein the analyzing the ECG data for arrhythmia events comprises analyzing the ECG data for arrhythmia events based at least in part on the subject's demographics. 22. The method of claim 19, wherein the USB data connector comprises a male USB data connector. 23. The method of claim 19, further comprising:
obtaining, at the remote data processing center, a unique identifier from the data collection unit; verifying based on the unique identifier that the physiological data collection device has been preauthorized for the steps of analyzing, obtaining a physician review, and providing; and performing the steps of analyzing, obtaining a physician review, and providing only upon successful verification. 24. The method of claim 23, wherein the verifying further comprises determining that a data analysis service has not already been performed for the physiological data collection device. 25. The method of claim 19, further comprising providing a medium storing program code that when run by the computer supports access to the remote data processing center for uploading the ECG data from the non-volatile memory to the remote data processing center when the USB data connector is connected to a computer connected to a network. 26. The method of claim 25, wherein the non-volatile memory comprises the medium. 27. The method of claim 19, wherein the computer comprises a public terminal, the public terminal comprising an application for providing the ECG data to the data processing center. | A physiological data collection device obtains physiological data from a subject interface on a subject. The physiological data collection device includes a data connector such as a USB connector for connecting directly to a computer. When the physiological data collection device is connected to the computer, the physiological data is uploaded to a remote data processing center for computer-based analysis and review by a medical professional. A report can be provided to the subject based on the analysis and review. When the subject interface is physically connected to the physiological data collection device, the data connector is prevented from being connected to an external device such as the computer.1. A physiological data collection device comprising:
an electro-cardiogram (ECG) lead-wire set; a data collection unit comprising:
a data connector for connecting to an external computing device,
a lead-wire set connector for connecting to the ECG lead-wire set, and
non-volatile memory coupled with the data connector and the lead-wire set connector, and
a processor programmed to obtain ECG data from the ECG lead-wire set and store the obtained ECG data in the non-volatile memory; and
wherein the ECG lead-wire set or the data collection unit or both have one or more structural components that prevent a connection between the data connector and the external computing device when the ECG lead-wire set is connected to the data collection unit and vice versa. 2. The apparatus of claim 1, wherein the data connector comprises a male USB connector. 3. The apparatus of claim 2, wherein the lead-wire set comprises a female receptacle that is configured to receive the male USB connector when the lead-wire set is connected to the data collection unit. 4. The apparatus of claim 3,
wherein the lead-wire set comprises a male electrode connector having lead-wire set contacts; wherein the lead-wire set interface comprises an electrode connector receptacle having data collection unit contacts; and wherein the electrode connector receptacle is configured to receive the electrode connector such that the lead-wire set contacts make contact with the data collection unit contacts when the lead-wire set is connected to the data collection unit. 5. The apparatus of claim 2,
wherein the USB connector is configured to rotate into a recess in the data collection unit; and when the USB connector is rotated into the recess, the lead-wire set interface is exposed so that the lead-wire set can be connected to the data collection unit via the lead-wire set interface and the recess blocks a connection of the USB connector to the external computing device. 6. The apparatus of claim 2, wherein the male USB connector comprises standard USB contacts and customized data collection unit contacts; and wherein the lead-wire set connects to the male USB connector such that the lead-wire set interface interfaces with the lead-wire set via the customized data collection unit contacts in the USB connector. 7. An electro-cardiogram (ECG) self-assessment kit comprising:
an ECG sensor comprising one or more electrode leads; multiple ECG electrodes configured to connect to the one or more electrode leads; a power source; a portable subject ECG data collection unit comprising:
a USB connector configured to interface with a USB port on a computer,
non-volatile memory coupled with the USB connector, and
a processor powered by the power source and programmed to obtain ECG data from the electrode leads and to store the ECG data in the non-volatile memory; and
a medium storing program code that when run by the computer supports access to a remote data processing center for uploading the ECG data from the non-volatile memory to the remote data processing center when the USB connector is connected to a computer connected to a network. 8. The kit of claim 7, wherein the data collection unit includes the medium storing program code. 9. The kit of claim 8, wherein the program code when run by the computer supports access to the remote data processing center for uploading the ECG data without installing a software application on the computer. 10. The kit of claim 9, wherein the program code comprising a link to a website where the ECG data can be uploaded. 11. The kit of claim 8, wherein the program code when run by the computer supports access to the remote data processing center by automatically initiating an application for uploading of the ECG data upon determining that the USB connector is connected to the computer. 12. The kit of claim 7, wherein the program code supports access to the data processing center by supporting a download from a remote server system to the computer of a user application for uploading the ECG data to the remote data processing center. 13. The kit of claim 7,
wherein the subject interface is configured to be physically attached to the ECG data collection unit; and when the subject interface is connected to the ECG data collection unit, the USB connector is blocked so that the USB connector cannot be connected to the computer. 14. The kit of claim 13, wherein the USB connector comprises male USB connector that is received into a receptacle in the subject interface when the subject interface is connected to the data collection unit. 15. The kit of claim 7, wherein the non-volatile memory has sufficient memory to store ECG data for a predefined time period; and wherein the power source has sufficient power to power the data collection unit for the predefined time period. 16. The kit of claim 7, wherein the program code, when run by the computer, obtains and presents an ECG assessment report from the data processing center. 17. The kit of claim 7, wherein the subject interface comprises:
a clip for securing the subject interface to the data collection unit; and a lanyard that allows the data collection unit to be hung from the neck of a subject when the subject interface is secured to the data collection unit. 18. The kit of claim 7, wherein the subject interface comprises the power source. 19. A method of providing a monitoring service comprising:
providing a physiological data collection device to a subject, the physiological data collection device comprising:
an electro-cardiogram (ECG) subject interface;
a data collection unit comprising a USB data connector for connecting to a computer, an interface for connecting to the subject interface, non-volatile memory coupled with the data connector, and a processor programmed to obtain ECG data from the subject interface and store the ECG data in the non-volatile memory;
obtaining, at a remote data processing center, the ECG data from the data collection unit when the data collection unit is connected to a USB data port on a computer having a network connection; analyzing the ECG data for arrhythmia events; obtaining a physician review of the ECG data; and providing a report over the network to the subject based on the analyzing the ECG data and based on the physician review. 20. The method of claim 19, wherein obtaining the ECG data comprises obtaining the ECG data via a transmission of the ECG data over the network wherein the transmission initiates automatically upon determining that the data collection unit is connected to the USB data port. 21. The method of claim 19 further comprising:
obtaining demographic information regarding the subject's demographics;
wherein the analyzing the ECG data for arrhythmia events comprises analyzing the ECG data for arrhythmia events based at least in part on the subject's demographics. 22. The method of claim 19, wherein the USB data connector comprises a male USB data connector. 23. The method of claim 19, further comprising:
obtaining, at the remote data processing center, a unique identifier from the data collection unit; verifying based on the unique identifier that the physiological data collection device has been preauthorized for the steps of analyzing, obtaining a physician review, and providing; and performing the steps of analyzing, obtaining a physician review, and providing only upon successful verification. 24. The method of claim 23, wherein the verifying further comprises determining that a data analysis service has not already been performed for the physiological data collection device. 25. The method of claim 19, further comprising providing a medium storing program code that when run by the computer supports access to the remote data processing center for uploading the ECG data from the non-volatile memory to the remote data processing center when the USB data connector is connected to a computer connected to a network. 26. The method of claim 25, wherein the non-volatile memory comprises the medium. 27. The method of claim 19, wherein the computer comprises a public terminal, the public terminal comprising an application for providing the ECG data to the data processing center. | 2,100 |
4,721 | 14,445,237 | 2,139 | A cache-coherent multiprocessor system comprising processing units, a shared memory resource accessible by the processing units, the shared memory resource being divided into at least one shared region, at least one first region, and at least one second region, a first cache, a second cache, a coherency unit, and a monitor unit, wherein the monitor unit is adapted to generate an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit, and a method for detecting failures in a such a cache-coherent multiprocessor system. | 1. A cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit,
a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit,
a first cache related to the first processing unit,
a second cache related to the second processing unit,
a coherency unit, and
a monitor unit,
wherein the coherency unit is adapted to secure the cache-coherency of the cache-coherent multiprocessor system, and wherein the monitor unit is adapted to generate an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. 2. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit is a single-core processing unit or a multi-core processing unit. 3. The cache-coherent multiprocessor system as claimed in claim 1, wherein the second processing unit is a single-core processing unit or a multi-core processing unit. 4. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit and the second processing unit are adapted to dynamically shift at least one boundary of the at least one shared region. 5. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit is adapted to dynamically shift at least one boundary of the at least one first region and/or at least one boundary of the at least one second region. 6. The cache-coherent multiprocessor system as claimed in claim 1, wherein the second processing unit is adapted to dynamically shift at least one boundary of the at least one second region and/or at least one boundary of the at least one first region. 7. The cache-coherent multiprocessor system as claimed in claim 1, wherein the coherency unit and/or the monitor unit and/or the first cache and/or the second cache is adapted to monitor a rate of coherency operations. 8. A method for detecting failures in a cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit,
a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit,
a first cache related to the first processing unit,
a second cache related to the second processing unit,
a coherency unit, and
a monitor unit,
said method comprising:
the coherency unit, securing the cache-coherency of the cache-coherent multiprocessor system, and
the monitor unit, generating an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. 9. The method as claimed in claim 8, further comprising:
At least one of the first processing unit and the second processing unit, dynamically shifting at least one boundary of the at least one shared region. 10. The method as claimed in one of claim 8, further comprising:
the first processing unit, dynamically shifting at least one boundary of the at least one first region and/or at least one boundary of the at least one second region. 11. The method as claimed in claim 8, further comprising:
the second processing unit, altering at least one boundary of the at least one second region and/or at least one boundary of the at least one first region. 12. The method as claimed in one of claim 8, further comprising:
the coherency unit, monitoring a rate of coherency operations. 13. A non-transitory, tangible computer-readable storage medium having stored thereon a computer program for detecting failures in a cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit, a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit, a first cache related to the first processing unit, a second cache related to the second processing unit, a coherency unit, and a monitor unit, the computer program comprising a set of instructions, which, when executed, cause the cache-coherent multiprocessor system to perform the method comprising: the coherency unit, securing the cache-coherency of the cache-coherent multiprocessor system, and the monitor unit, generating an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. | A cache-coherent multiprocessor system comprising processing units, a shared memory resource accessible by the processing units, the shared memory resource being divided into at least one shared region, at least one first region, and at least one second region, a first cache, a second cache, a coherency unit, and a monitor unit, wherein the monitor unit is adapted to generate an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit, and a method for detecting failures in a such a cache-coherent multiprocessor system.1. A cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit,
a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit,
a first cache related to the first processing unit,
a second cache related to the second processing unit,
a coherency unit, and
a monitor unit,
wherein the coherency unit is adapted to secure the cache-coherency of the cache-coherent multiprocessor system, and wherein the monitor unit is adapted to generate an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. 2. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit is a single-core processing unit or a multi-core processing unit. 3. The cache-coherent multiprocessor system as claimed in claim 1, wherein the second processing unit is a single-core processing unit or a multi-core processing unit. 4. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit and the second processing unit are adapted to dynamically shift at least one boundary of the at least one shared region. 5. The cache-coherent multiprocessor system as claimed in claim 1, wherein the first processing unit is adapted to dynamically shift at least one boundary of the at least one first region and/or at least one boundary of the at least one second region. 6. The cache-coherent multiprocessor system as claimed in claim 1, wherein the second processing unit is adapted to dynamically shift at least one boundary of the at least one second region and/or at least one boundary of the at least one first region. 7. The cache-coherent multiprocessor system as claimed in claim 1, wherein the coherency unit and/or the monitor unit and/or the first cache and/or the second cache is adapted to monitor a rate of coherency operations. 8. A method for detecting failures in a cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit,
a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit,
a first cache related to the first processing unit,
a second cache related to the second processing unit,
a coherency unit, and
a monitor unit,
said method comprising:
the coherency unit, securing the cache-coherency of the cache-coherent multiprocessor system, and
the monitor unit, generating an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. 9. The method as claimed in claim 8, further comprising:
At least one of the first processing unit and the second processing unit, dynamically shifting at least one boundary of the at least one shared region. 10. The method as claimed in one of claim 8, further comprising:
the first processing unit, dynamically shifting at least one boundary of the at least one first region and/or at least one boundary of the at least one second region. 11. The method as claimed in claim 8, further comprising:
the second processing unit, altering at least one boundary of the at least one second region and/or at least one boundary of the at least one first region. 12. The method as claimed in one of claim 8, further comprising:
the coherency unit, monitoring a rate of coherency operations. 13. A non-transitory, tangible computer-readable storage medium having stored thereon a computer program for detecting failures in a cache-coherent multiprocessor system comprising
a first processing unit and a second processing unit, a shared memory resource accessible by the first processing unit and the second processing unit, the shared memory resource being divided into at least one shared region, at least one first region assigned to the first processing unit, and at least one second region assigned to the second processing unit, a first cache related to the first processing unit, a second cache related to the second processing unit, a coherency unit, and a monitor unit, the computer program comprising a set of instructions, which, when executed, cause the cache-coherent multiprocessor system to perform the method comprising: the coherency unit, securing the cache-coherency of the cache-coherent multiprocessor system, and the monitor unit, generating an error signal, when the coherency unit affects the at least one first region due to a memory access from the second processing unit and/or when the coherency unit affects the at least one second region due to a memory access from the first processing unit. | 2,100 |
4,722 | 14,683,790 | 2,143 | A method of and electronic device for controlling a home screen in an electronic device equipped with a touch screen is provided. The method includes detecting whether a selected touch is inputted on the touch screen; displaying a home screen for each use mode when the selected touch is inputted; and controlling a setting of the home screen according to a user's selection. The electronic device includes a touch screen configured to detect whether a selected touch is inputted and display a home screen for each user mode when the selected touch is inputted; and a control module configured to control a setting of the home screen according to a user's selection. | 1. A method of controlling a home screen in an electronic device equipped with a touch screen, the method comprising:
detecting whether a selected touch is inputted on the touch screen; displaying a home screen for each use mode when the selected touch is inputted; and controlling a setting of the home screen according to a user's selection. 2. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when a touch is moved from a non-view area surrounding a view area of the touch screen to the view area. 3. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when one or more multi-touches are inputted. 4. The method of claim 1, wherein determining that the selected touch is inputted comprises:
detecting a touch in a first coordinate of the touch screen and a touch in a second coordinate different from the first coordinate; and determining that the selected touch is inputted when the touch of the first coordinate and the touch of the second coordinate are moved. 5. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when a selected area is touched within a view area of the touch screen. 6. The method of claim 5, wherein displaying the home screen comprises:
displaying a label for each user mode; and displaying a home screen related with a user mode of a selected label when a displayed label is selected. 7. The method of claim 1, wherein displaying the home screen comprises displaying a home screen for each user mode on an entire view area of the touch screen or a certain view area of the entire view area. 8. The method of claim 1, wherein displaying the home screen comprises displaying a home screen for each subject. 9. The method of claim 1, wherein displaying the home screen comprises displaying a home screen of a first user mode and items of another user mode or displaying the home screen of the first user mode and a scroll. 10. The method of claim 9, wherein displaying the home screen comprises at least one of:
displaying another home screen included in the first user mode when a touch is inputted on the home screen; displaying the home screen of the another user mode when one of the items of the another user mode is selected; or displaying a home screen of the another user mode when a touch is inputted to the scroll. 11. The method of claim 1, wherein controlling the setting of the home screen comprises controlling a setting of one of addition, deletion, and editing of the home screen of a user mode selected by the user. 12. The method of claim 11, wherein addition comprises:
searching a content related with an additionally requested user mode based on a user history; and displaying a recommended home screen template including the searched content. 13. The method of claim 11, wherein addition comprises:
displaying a default home screen template related with an additionally requested user mode; and receiving a selection of content to be added to the default home screen template from the user. 14. An electronic device, comprising:
a touch screen configured to detect whether a selected touch is inputted and display a home screen for each user mode when the selected touch is inputted; and a control module configured to control a setting of the home screen according to a user's selection. 15. The electronic device of claim 14, wherein the control module is further configured to determine that the selected touch is inputted when a touch is moved from a non-view area of the touch screen to a view area or when a selected area within the view area is touched, or detect a touch in a first coordinate of the touch screen and a touch in a second coordinate different from the first coordinate, and determine that the selected touch is inputted when the touch of the first coordinate and the touch of the second coordinate are moved. 16. The electronic device of claim 14, wherein the touch screen is further configured to display a label for each user mode, display a home screen related with a user mode of a selected label when a displayed label is selected, or display a home screen for each user mode on an entire view area of the electronic device or a certain view area of the entire view area, or display a home screen for each subject. 17. The electronic device of claim 14, wherein the touch screen is further configured to display a home screen of a first user mode and items of another user mode, or display a home screen of the first user mode and a scroll. 18. The electronic device of claim 17, wherein the touch screen is further configured to perform at least one of:
displaying another home screen included in the first user mode when a touch is inputted on the home screen, displaying a home screen of the another user mode when one of the items of the another user mode is selected, or displaying a home screen of the another user mode when a touch is inputted to the scroll. 19. The electronic device of claim 14, wherein the control module is further configured to control a setting of any of addition, deletion, and editing of the home screen of a user mode selected by the user. 20. The electronic device of claim 19, wherein the control module is further configured to control displaying a default home screen template related to an additionally requested user mode on the touch screen, searching a content related to an additionally requested user mode based on a user history, and displaying a recommended home screen template including the searched content on the touch screen. | A method of and electronic device for controlling a home screen in an electronic device equipped with a touch screen is provided. The method includes detecting whether a selected touch is inputted on the touch screen; displaying a home screen for each use mode when the selected touch is inputted; and controlling a setting of the home screen according to a user's selection. The electronic device includes a touch screen configured to detect whether a selected touch is inputted and display a home screen for each user mode when the selected touch is inputted; and a control module configured to control a setting of the home screen according to a user's selection.1. A method of controlling a home screen in an electronic device equipped with a touch screen, the method comprising:
detecting whether a selected touch is inputted on the touch screen; displaying a home screen for each use mode when the selected touch is inputted; and controlling a setting of the home screen according to a user's selection. 2. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when a touch is moved from a non-view area surrounding a view area of the touch screen to the view area. 3. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when one or more multi-touches are inputted. 4. The method of claim 1, wherein determining that the selected touch is inputted comprises:
detecting a touch in a first coordinate of the touch screen and a touch in a second coordinate different from the first coordinate; and determining that the selected touch is inputted when the touch of the first coordinate and the touch of the second coordinate are moved. 5. The method of claim 1, wherein detecting whether the selected touch is inputted comprises determining that the selected touch is inputted when a selected area is touched within a view area of the touch screen. 6. The method of claim 5, wherein displaying the home screen comprises:
displaying a label for each user mode; and displaying a home screen related with a user mode of a selected label when a displayed label is selected. 7. The method of claim 1, wherein displaying the home screen comprises displaying a home screen for each user mode on an entire view area of the touch screen or a certain view area of the entire view area. 8. The method of claim 1, wherein displaying the home screen comprises displaying a home screen for each subject. 9. The method of claim 1, wherein displaying the home screen comprises displaying a home screen of a first user mode and items of another user mode or displaying the home screen of the first user mode and a scroll. 10. The method of claim 9, wherein displaying the home screen comprises at least one of:
displaying another home screen included in the first user mode when a touch is inputted on the home screen; displaying the home screen of the another user mode when one of the items of the another user mode is selected; or displaying a home screen of the another user mode when a touch is inputted to the scroll. 11. The method of claim 1, wherein controlling the setting of the home screen comprises controlling a setting of one of addition, deletion, and editing of the home screen of a user mode selected by the user. 12. The method of claim 11, wherein addition comprises:
searching a content related with an additionally requested user mode based on a user history; and displaying a recommended home screen template including the searched content. 13. The method of claim 11, wherein addition comprises:
displaying a default home screen template related with an additionally requested user mode; and receiving a selection of content to be added to the default home screen template from the user. 14. An electronic device, comprising:
a touch screen configured to detect whether a selected touch is inputted and display a home screen for each user mode when the selected touch is inputted; and a control module configured to control a setting of the home screen according to a user's selection. 15. The electronic device of claim 14, wherein the control module is further configured to determine that the selected touch is inputted when a touch is moved from a non-view area of the touch screen to a view area or when a selected area within the view area is touched, or detect a touch in a first coordinate of the touch screen and a touch in a second coordinate different from the first coordinate, and determine that the selected touch is inputted when the touch of the first coordinate and the touch of the second coordinate are moved. 16. The electronic device of claim 14, wherein the touch screen is further configured to display a label for each user mode, display a home screen related with a user mode of a selected label when a displayed label is selected, or display a home screen for each user mode on an entire view area of the electronic device or a certain view area of the entire view area, or display a home screen for each subject. 17. The electronic device of claim 14, wherein the touch screen is further configured to display a home screen of a first user mode and items of another user mode, or display a home screen of the first user mode and a scroll. 18. The electronic device of claim 17, wherein the touch screen is further configured to perform at least one of:
displaying another home screen included in the first user mode when a touch is inputted on the home screen, displaying a home screen of the another user mode when one of the items of the another user mode is selected, or displaying a home screen of the another user mode when a touch is inputted to the scroll. 19. The electronic device of claim 14, wherein the control module is further configured to control a setting of any of addition, deletion, and editing of the home screen of a user mode selected by the user. 20. The electronic device of claim 19, wherein the control module is further configured to control displaying a default home screen template related to an additionally requested user mode on the touch screen, searching a content related to an additionally requested user mode based on a user history, and displaying a recommended home screen template including the searched content on the touch screen. | 2,100 |
4,723 | 14,476,930 | 2,136 | A method, apparatus, and system are provided for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD). Upon Power Loss Interruption (PLI) event detected in a solid state drive (SSD), the SSD transfers debug data directly to the host system main (DRAM) memory via a Peripheral Component Interconnect Express (PCIE) bus. | 1. A method for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) performed by the solid state drive (SSD) and host system, said method comprising:
detecting a Power Loss Interruption (PLI) event in a solid state drive (SSD); and transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 2. The method as recited in claim 1 wherein transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes transferring debug data to a predefined memory range in the host system main memory. 3. The method as recited in claim 2 wherein the host system main memory includes a dynamic random access memory (DRAM), and includes defining a debug buffer management device driver in a host system operating system for allocating the predefined memory range in the host system main memory including an allocated memory space having a starting memory address and a predefined memory length. 4. The method as recited in claim 1 wherein transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes transferring debug data to one or more predefined debug buffers in the host system main memory. 5. The method as recited in claim 1 further includes storing debug data to at least one separate non-volatile storage in the host system. 6. The method as recited in claim 1 includes reading stored debug data from the host system main memory and writing the read data to a reserved location in the solid state drive (SSD). 7. An apparatus for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) comprising:
said solid state drive (SSD) including a controller detecting a Power Loss Interruption (PLI) event; and said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 8. The apparatus as recited in claim 7 includes control code stored on a non-transitory computer readable medium, and wherein said controller and a host operating system use said control code for implementing debug data saving in host memory. 9. The apparatus as recited in claim 7 wherein the solid state drive (SSD) includes flash memory, said flash memory including one or more NAND chips. 10. The apparatus as recited in claim 7 wherein said SSD transfers debug data directly to a predefined memory range in the host system main memory. 11. The apparatus as recited in claim 7 wherein said SSD transfers debug data to one or more predefined debug buffers in the host system main memory. 12. The apparatus as recited in claim 7 further includes a host system operating system storing debug data to at least one separate host system non-volatile storage. 13. The apparatus as recited in claim 7 includes said controller reading stored debug data from the host system main memory and writing the read debug data to a reserved location in the solid state drive (SSD). 14. The apparatus as recited in claim 7 wherein said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the PLI event includes said SSD generating debug snapshot data saved in the solid state drive (SSD) and transferring the debug snapshot data to a predefined memory range in the host system main memory. 15. A system for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) comprising:
a host computer; a solid state drive (SSD); a Peripheral Component Interconnect Express (PCIE) bus connecting said host system and said solid state drive (SSD); said solid state drive (SSD) including a controller detecting a Power Loss Interruption (PLI) event; and said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 16. The system as recited in claim 15 includes control code stored on a non-transitory computer readable medium, and wherein said controller uses said control code for implementing debug data saving. 17. The system as recited in claim 15 wherein said host system transferring drive-side cache data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes said SSD transferring debug data to a predefined memory range in the host system main memory. 18. The system as recited in claim 15 wherein said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes said SSD transferring debug data to one or more predefined debug buffers in the host system main memory. 19. The system as recited in claim 15 further includes a host system operating system storing debug data to at least one separate host system non-volatile storage. 20. The system as recited in claim 15 includes said controller reading stored debug data from the host system main memory and writing the read data to a reserved location in said solid state drive (SSD). | A method, apparatus, and system are provided for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD). Upon Power Loss Interruption (PLI) event detected in a solid state drive (SSD), the SSD transfers debug data directly to the host system main (DRAM) memory via a Peripheral Component Interconnect Express (PCIE) bus.1. A method for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) performed by the solid state drive (SSD) and host system, said method comprising:
detecting a Power Loss Interruption (PLI) event in a solid state drive (SSD); and transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 2. The method as recited in claim 1 wherein transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes transferring debug data to a predefined memory range in the host system main memory. 3. The method as recited in claim 2 wherein the host system main memory includes a dynamic random access memory (DRAM), and includes defining a debug buffer management device driver in a host system operating system for allocating the predefined memory range in the host system main memory including an allocated memory space having a starting memory address and a predefined memory length. 4. The method as recited in claim 1 wherein transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes transferring debug data to one or more predefined debug buffers in the host system main memory. 5. The method as recited in claim 1 further includes storing debug data to at least one separate non-volatile storage in the host system. 6. The method as recited in claim 1 includes reading stored debug data from the host system main memory and writing the read data to a reserved location in the solid state drive (SSD). 7. An apparatus for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) comprising:
said solid state drive (SSD) including a controller detecting a Power Loss Interruption (PLI) event; and said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 8. The apparatus as recited in claim 7 includes control code stored on a non-transitory computer readable medium, and wherein said controller and a host operating system use said control code for implementing debug data saving in host memory. 9. The apparatus as recited in claim 7 wherein the solid state drive (SSD) includes flash memory, said flash memory including one or more NAND chips. 10. The apparatus as recited in claim 7 wherein said SSD transfers debug data directly to a predefined memory range in the host system main memory. 11. The apparatus as recited in claim 7 wherein said SSD transfers debug data to one or more predefined debug buffers in the host system main memory. 12. The apparatus as recited in claim 7 further includes a host system operating system storing debug data to at least one separate host system non-volatile storage. 13. The apparatus as recited in claim 7 includes said controller reading stored debug data from the host system main memory and writing the read debug data to a reserved location in the solid state drive (SSD). 14. The apparatus as recited in claim 7 wherein said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the PLI event includes said SSD generating debug snapshot data saved in the solid state drive (SSD) and transferring the debug snapshot data to a predefined memory range in the host system main memory. 15. A system for implementing debug data saving in host memory on a Peripheral Component Interconnect Express (PCIE) solid state drive (SSD) comprising:
a host computer; a solid state drive (SSD); a Peripheral Component Interconnect Express (PCIE) bus connecting said host system and said solid state drive (SSD); said solid state drive (SSD) including a controller detecting a Power Loss Interruption (PLI) event; and said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus, responsive to the detected PLI event. 16. The system as recited in claim 15 includes control code stored on a non-transitory computer readable medium, and wherein said controller uses said control code for implementing debug data saving. 17. The system as recited in claim 15 wherein said host system transferring drive-side cache data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes said SSD transferring debug data to a predefined memory range in the host system main memory. 18. The system as recited in claim 15 wherein said SSD transferring debug data directly to a host system main memory via a Peripheral Component Interconnect Express (PCIE) bus includes said SSD transferring debug data to one or more predefined debug buffers in the host system main memory. 19. The system as recited in claim 15 further includes a host system operating system storing debug data to at least one separate host system non-volatile storage. 20. The system as recited in claim 15 includes said controller reading stored debug data from the host system main memory and writing the read data to a reserved location in said solid state drive (SSD). | 2,100 |
4,724 | 13,730,322 | 2,115 | A computing device including an expandable component is described herein. The computing device also includes logic at least a portion of which is in hardware. The logic is to determine a desired performance range for the computing device and expand or compress the expandable component to provide the desired performance range for the computing device. | 1. A computing device, comprising:
an expandable component; and logic at least a portion of which is in hardware, the logic to:
determine a desired performance range for the computing device; and
expand or compress the expandable component to provide the desired performance range for the computing device. 2. The computing device of claim 1, wherein the expandable component comprises nested heat exchangers, and wherein the logic is to expand the nested heat exchangers by separating a plurality of fins of a first one of the nested heat exchangers from a plurality of fins of a second one of the nested heat exchangers via vertical linear motion. 3. The computing device of claim 1, wherein the expandable component comprises an expandable air vent, and wherein the logic is to expand the expandable air vent by increasing a size of the expandable air vent by increasing a size of a chassis of the computing device. 4. The computing device of claim 1, wherein the expandable component comprises an expandable display device, and wherein the logic is to expand the expandable display device by increasing a size of a display cover of the expandable display device. 5. The computing device of claim 1, wherein the expandable component comprises expandable speakers, and wherein the logic is to expand the expandable speakers by moving the expandable speakers from a compressed position in which the expandable speakers are stored inside a chassis of the computing device to an expanded position in which the expandable speakers are located at least partially outside the chassis of the computing device. 6. The computing device of claim 1, wherein the expandable component comprises an expandable chassis, and the logic is to expand the expandable chassis by increasing a size of a portion of the expandable chassis. 7. The computing device of claim 6, wherein the expansion of the expandable chassis provides for an exposure of a connector that is not exposed when the expandable chassis is compressed. 8. The computing device of claim 1, wherein the computing device comprises a plurality of expandable components, and wherein the logic is to determine a desired performance range for the computing device and expand or compress each of the plurality of expandable components to achieve the determined performance range. 9. The computing device of claim 1, wherein the expandable component comprises an expandable heat exchanger. 10. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of nested fins, and wherein the plurality of nested fins are at least partially separated when the expandable heat exchanger is expanded. 11. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of solid interlocking fins, and wherein the plurality of solid interlocking fins are at least partially separated when the expandable heat exchanger is expanded. 12. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of mesh columns coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of mesh columns are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 13. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of mesh fins coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of mesh fins are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 14. The computing device of claim 9, wherein the expandable heat exchanger comprises a honeycomb material coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the honeycomb material is expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 15. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of expandable cups coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of expandable cups are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 16. The computing device of claim 1, wherein the expandable component comprises an expandable fan that is configured to expand by increasing a size of a plurality of blades of the expandable fan. 17. The computing device of claim 16, wherein the plurality of blades comprises a plurality of nested blades. 18. The computing device of claim 16, wherein the plurality of blades comprises a plurality of elastic blades. 19. The computing device of claim 16, wherein the plurality of blades comprises a plurality of hinged blades. 20. The computing device of claim 1, wherein the expandable component comprises an expandable keyboard. 21. The computing device of claim 1, wherein the expandable component comprises an expandable pointing device. 22. The computing device of claim 1, wherein the logic is to determine the desired performance range for the computing device in response to input from a user of the computing device. 23. The computing device of claim 1, wherein the logic is to determine the desired performance range for the computing device automatically based on operating conditions of the computing device. 24. The computing device of claim 1, wherein the logic is to:
determine a cooling capacity for the computing device that corresponds to the desired performance range; and expand or compress the expandable component to provide the determined cooling capacity for the computing device. 25. The computing device of claim 1, wherein the logic is to:
determine a geometry of the expandable component that will provide the desired performance range for the computing device; and expand or compress the expandable component to achieve the determined geometry. 26. At least one machine readable medium having instructions stored therein that, in response to being executed on a computing device, cause the computing device to:
determine a desired performance range for the computing device; and expand or compress an expandable component of the computing device to achieve the desired performance range. 27. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to:
determine a cooling capacity for the computing device that corresponds to the desired performance range; and expand or compress the expandable component to provide the determined cooling capacity for the computing device. 28. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to:
determine a geometry of the expandable component that will provide the desired performance range for the computing device; and expand or compress the expandable component to achieve the determined geometry. 29. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to determine the desired performance range for the computing device in response to input from a user of the computing device. 30. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to determine the desired performance range for the computing device automatically based on operating conditions of the computing device. | A computing device including an expandable component is described herein. The computing device also includes logic at least a portion of which is in hardware. The logic is to determine a desired performance range for the computing device and expand or compress the expandable component to provide the desired performance range for the computing device.1. A computing device, comprising:
an expandable component; and logic at least a portion of which is in hardware, the logic to:
determine a desired performance range for the computing device; and
expand or compress the expandable component to provide the desired performance range for the computing device. 2. The computing device of claim 1, wherein the expandable component comprises nested heat exchangers, and wherein the logic is to expand the nested heat exchangers by separating a plurality of fins of a first one of the nested heat exchangers from a plurality of fins of a second one of the nested heat exchangers via vertical linear motion. 3. The computing device of claim 1, wherein the expandable component comprises an expandable air vent, and wherein the logic is to expand the expandable air vent by increasing a size of the expandable air vent by increasing a size of a chassis of the computing device. 4. The computing device of claim 1, wherein the expandable component comprises an expandable display device, and wherein the logic is to expand the expandable display device by increasing a size of a display cover of the expandable display device. 5. The computing device of claim 1, wherein the expandable component comprises expandable speakers, and wherein the logic is to expand the expandable speakers by moving the expandable speakers from a compressed position in which the expandable speakers are stored inside a chassis of the computing device to an expanded position in which the expandable speakers are located at least partially outside the chassis of the computing device. 6. The computing device of claim 1, wherein the expandable component comprises an expandable chassis, and the logic is to expand the expandable chassis by increasing a size of a portion of the expandable chassis. 7. The computing device of claim 6, wherein the expansion of the expandable chassis provides for an exposure of a connector that is not exposed when the expandable chassis is compressed. 8. The computing device of claim 1, wherein the computing device comprises a plurality of expandable components, and wherein the logic is to determine a desired performance range for the computing device and expand or compress each of the plurality of expandable components to achieve the determined performance range. 9. The computing device of claim 1, wherein the expandable component comprises an expandable heat exchanger. 10. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of nested fins, and wherein the plurality of nested fins are at least partially separated when the expandable heat exchanger is expanded. 11. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of solid interlocking fins, and wherein the plurality of solid interlocking fins are at least partially separated when the expandable heat exchanger is expanded. 12. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of mesh columns coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of mesh columns are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 13. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of mesh fins coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of mesh fins are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 14. The computing device of claim 9, wherein the expandable heat exchanger comprises a honeycomb material coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the honeycomb material is expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 15. The computing device of claim 9, wherein the expandable heat exchanger comprises a plurality of expandable cups coupled to an upper heat pipe and a lower heat pipe of the expandable heat exchanger, and wherein the plurality of expandable cups are expanded or compressed in response to a movement of the upper heat pipe or the lower heat pipe, or both. 16. The computing device of claim 1, wherein the expandable component comprises an expandable fan that is configured to expand by increasing a size of a plurality of blades of the expandable fan. 17. The computing device of claim 16, wherein the plurality of blades comprises a plurality of nested blades. 18. The computing device of claim 16, wherein the plurality of blades comprises a plurality of elastic blades. 19. The computing device of claim 16, wherein the plurality of blades comprises a plurality of hinged blades. 20. The computing device of claim 1, wherein the expandable component comprises an expandable keyboard. 21. The computing device of claim 1, wherein the expandable component comprises an expandable pointing device. 22. The computing device of claim 1, wherein the logic is to determine the desired performance range for the computing device in response to input from a user of the computing device. 23. The computing device of claim 1, wherein the logic is to determine the desired performance range for the computing device automatically based on operating conditions of the computing device. 24. The computing device of claim 1, wherein the logic is to:
determine a cooling capacity for the computing device that corresponds to the desired performance range; and expand or compress the expandable component to provide the determined cooling capacity for the computing device. 25. The computing device of claim 1, wherein the logic is to:
determine a geometry of the expandable component that will provide the desired performance range for the computing device; and expand or compress the expandable component to achieve the determined geometry. 26. At least one machine readable medium having instructions stored therein that, in response to being executed on a computing device, cause the computing device to:
determine a desired performance range for the computing device; and expand or compress an expandable component of the computing device to achieve the desired performance range. 27. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to:
determine a cooling capacity for the computing device that corresponds to the desired performance range; and expand or compress the expandable component to provide the determined cooling capacity for the computing device. 28. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to:
determine a geometry of the expandable component that will provide the desired performance range for the computing device; and expand or compress the expandable component to achieve the determined geometry. 29. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to determine the desired performance range for the computing device in response to input from a user of the computing device. 30. The at least one machine readable medium of claim 26, wherein the instructions cause the computing device to determine the desired performance range for the computing device automatically based on operating conditions of the computing device. | 2,100 |
4,725 | 14,109,272 | 2,158 | A method of creating a dynamic audio file may comprise associating a tag with an audio file having audio content and the tag may comprise a location file path of a source of the audio content. A method of updating a dynamic audio file may comprise sending a dynamic audio file, receiving a request for updated audio content, and sending the updated audio content in response to the request. In various embodiments, the dynamic audio file may comprise a tag and initial audio content and the tag may comprise a location file path of the audio content. | 1. A method of providing advertisements, the method comprising:
receiving user information at a server computer via a communications network; selecting a dynamic media file according to the user information, wherein said dynamic media file is configured to access content targeted to a user; and providing the dynamic media file to a computing device associated with the user via a communications network. 2. The method of claim 1, further comprising:
providing targeted advertising content from a location indicated by said dynamic media file. 3. The method of claim 1, further comprising:
setting a SetMember attribute of the dynamic media file indicating that the dynamic media file is a member of a set of media files; and setting a SetPosition attribute specifying a position of the dynamic media file within the set of media files. 4. The method of claim 1, further comprising:
setting a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting other content included in the dynamic media file. 5. The method of claim 1, further comprising:
setting a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting content obtained using a content source link associated with the dynamic media file. 6. The method of claim 1, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. 7. The method of claim 1, wherein said dynamic media file is further associated with:
a redirection source link; and an alternate source link. 8. The method of claim 1, further comprising:
receiving usage data including a notification packet indicating that a dynamic media file has been updated; and selecting said dynamic file based, at least in part, on the usage data. 9. A computing device configured to select dynamic media files, the computing device comprising:
a processor and associated memory configured to implement dynamic media file assembly software including:
at least one instruction to generate dynamic media files associated with content source links;
at least one instruction to select a dynamic media file according to user information obtained from a media consumer, wherein said dynamic media file is configured to access audio content targeted to the user; and
at least one instruction to provide the dynamic media file to a computing device associated with the user via a communications network. 10. The computing device of claim 9, further comprising:
providing targeted advertising content from a location indicated by a content source link associated with the dynamic media file selected. 11. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a SetMember attribute of the dynamic media file indicating that the dynamic media file is a member of a set of media files; and at least one instruction configured to set a SetPosition attribute specifying a position of the dynamic media file within the set of media files. 12. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting other content included in the dynamic media file. 13. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a pre-roll attribute identifying a location of media content to be presented to a user prior to presenting content obtained a content source link associated with said dynamic media file selected. 14. The computing device of claim 9, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. 15. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction to receive usage data including a notification packet indicating that a dynamic media file has been updated; and at least one instruction to select said dynamic media file based, at least in part, on the usage data. 16. A method of providing advertisements, the method comprising:
receiving user information at a server computer via a communications network; selecting a dynamic media file according to the user information, wherein said dynamic media file is configured to access content targeted to a user; setting a pre-roll attribute of the dynamic media file identifying a location of an advertisement to be presented to the user prior to presenting other media content; and providing the dynamic media file to a computing device associated with the user via a communications network. 17. The method of claim 16, wherein the:
PreRoll attribute specifies a location of an advertisement to be presented to a user prior to presenting other content included in said dynamic media file. 18. The method of claim 16, wherein the:
PreRoll attribute specifies a location of an advertisement to be presented to a user prior to presenting content obtained using a content source link associated with said dynamic media file. 19. The method of claim 16, further comprising:
providing the targeted advertising content from a location indicated by a content source link associated with said dynamic media file. 20. The method of claim 16, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. | A method of creating a dynamic audio file may comprise associating a tag with an audio file having audio content and the tag may comprise a location file path of a source of the audio content. A method of updating a dynamic audio file may comprise sending a dynamic audio file, receiving a request for updated audio content, and sending the updated audio content in response to the request. In various embodiments, the dynamic audio file may comprise a tag and initial audio content and the tag may comprise a location file path of the audio content.1. A method of providing advertisements, the method comprising:
receiving user information at a server computer via a communications network; selecting a dynamic media file according to the user information, wherein said dynamic media file is configured to access content targeted to a user; and providing the dynamic media file to a computing device associated with the user via a communications network. 2. The method of claim 1, further comprising:
providing targeted advertising content from a location indicated by said dynamic media file. 3. The method of claim 1, further comprising:
setting a SetMember attribute of the dynamic media file indicating that the dynamic media file is a member of a set of media files; and setting a SetPosition attribute specifying a position of the dynamic media file within the set of media files. 4. The method of claim 1, further comprising:
setting a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting other content included in the dynamic media file. 5. The method of claim 1, further comprising:
setting a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting content obtained using a content source link associated with the dynamic media file. 6. The method of claim 1, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. 7. The method of claim 1, wherein said dynamic media file is further associated with:
a redirection source link; and an alternate source link. 8. The method of claim 1, further comprising:
receiving usage data including a notification packet indicating that a dynamic media file has been updated; and selecting said dynamic file based, at least in part, on the usage data. 9. A computing device configured to select dynamic media files, the computing device comprising:
a processor and associated memory configured to implement dynamic media file assembly software including:
at least one instruction to generate dynamic media files associated with content source links;
at least one instruction to select a dynamic media file according to user information obtained from a media consumer, wherein said dynamic media file is configured to access audio content targeted to the user; and
at least one instruction to provide the dynamic media file to a computing device associated with the user via a communications network. 10. The computing device of claim 9, further comprising:
providing targeted advertising content from a location indicated by a content source link associated with the dynamic media file selected. 11. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a SetMember attribute of the dynamic media file indicating that the dynamic media file is a member of a set of media files; and at least one instruction configured to set a SetPosition attribute specifying a position of the dynamic media file within the set of media files. 12. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a PreRoll attribute identifying a location of media content to be presented to a user prior to presenting other content included in the dynamic media file. 13. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction configured to set a pre-roll attribute identifying a location of media content to be presented to a user prior to presenting content obtained a content source link associated with said dynamic media file selected. 14. The computing device of claim 9, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. 15. The computing device of claim 9, wherein the dynamic media file assembly software further comprises:
at least one instruction to receive usage data including a notification packet indicating that a dynamic media file has been updated; and at least one instruction to select said dynamic media file based, at least in part, on the usage data. 16. A method of providing advertisements, the method comprising:
receiving user information at a server computer via a communications network; selecting a dynamic media file according to the user information, wherein said dynamic media file is configured to access content targeted to a user; setting a pre-roll attribute of the dynamic media file identifying a location of an advertisement to be presented to the user prior to presenting other media content; and providing the dynamic media file to a computing device associated with the user via a communications network. 17. The method of claim 16, wherein the:
PreRoll attribute specifies a location of an advertisement to be presented to a user prior to presenting other content included in said dynamic media file. 18. The method of claim 16, wherein the:
PreRoll attribute specifies a location of an advertisement to be presented to a user prior to presenting content obtained using a content source link associated with said dynamic media file. 19. The method of claim 16, further comprising:
providing the targeted advertising content from a location indicated by a content source link associated with said dynamic media file. 20. The method of claim 16, further comprising:
wherein the user information specifies a geographic area; and said dynamic media file is selected based, at least in part, on the geographic area. | 2,100 |
4,726 | 14,187,853 | 2,175 | A system described herein includes a receiver component that receives an indication that a conversation window for a first messaging contact is desirably collapsed, wherein the conversation window for the first messaging contact corresponds to an instant messaging application that is executable on a computing device. The system can further include a window minimizer component that collapses the conversation window into a contacts window of the instant messaging application, wherein the contacts window depicts a graphical indication of at least the first contact, wherein the graphical indication is highlighted to indicate that a conversation exists with the first messaging contact. | 1. A method executed at a computing device, the method comprising:
displaying a conversation window of an instant messaging application on a display of the computing device, the conversation window comprising a message transmitted between the computing device and a second computing device; receiving a request to remove the conversation window from the display; responsive to receiving the request, removing the conversation window from the display; and responsive to removing the conversation window from the display, displaying a graphical indicator on the display, the graphical indicator displayed in a contacts window of the instant messaging application, the graphical indicator indicating that the conversation window comprised the message prior to the conversation window being removed from the display. 2. The method of claim 1, the computing device being a smart phone. 3. The method of claim 1, the message transmitted from the computing device to the second computing device. 4. The method of claim 1, the message transmitted from the second computing device to the computing device. 5. The method of claim 1, wherein receiving the request to remove the conversation window from the display comprises receiving a selection of a depressible button that, when selected, causes the conversation window to be closed. 6. The method of claim 1, wherein receiving the request to remove the conversation window from the display comprises receiving an indication that a user of the computing device has altered a messaging status from a first messaging status to a second messaging status. 7. The method of claim 1, the contacts window comprises an identifier that identifies the contact, wherein the graphical indicator is a highlighting of the identifier. 8. The method of claim 1, the contacts window comprises a first identifier that identifies the contact and a second identifier that identifies the second contact, the second identifier presented in the contacts window to indicate that a message has not been transmitted to or received from a third computing device of the second contact during a current instant messaging session. 9. The method of claim 1, the contacts window comprises an identifier that identifies the contact, wherein the graphical indicator is a blinking of the identifier. 10. The method of 1, further comprising:
subsequent to removing the conversation window from the display, receiving a request to redisplay the conversation window on the display; responsive to receiving the request to redisplay the conversation window on the display, redisplaying the conversation window on the conversation window on the display, wherein the conversation window, when redisplayed, comprises the message transmitted between the computing device and a second computing device. 11. The method of claim 1, the display being a touch-sensitive display, wherein the request to remove the conversation window from the display is received via the touch-sensitive display. 12. A computing device, comprising:
a display; a processor; and a memory that comprises an instant messaging application that is executed by the processor, the instant messaging application comprising:
a receiver component that receives a request to remove a conversation window of the instant messaging application from the display, the conversation window comprises a message transmitted from the computing device to a second computing device that executes the instant messaging application; and
a window modifier component that:
removes the conversation window from the display responsive to the receiver component receiving the request; and
responsive to removing the conversation window from the display, causes a graphical indicator to be displayed in a contacts window of the instant messaging application, the graphical indicator representative of a user of the second computing device, the graphical indicator indicating that the message was transmitted to the second computing device during a current instant messaging session and prior to the conversation window being removed from the display. 13. The computing device of claim 12 being a smart phone. 14. The computing device of claim 12, wherein the display is a touch-sensitive display, and the request to remove the conversation window of the instant messaging application from the display is received by way of the touch-sensitive display. 15. The computing device of claim 12, wherein the window modifier component highlights the graphical indicator relative to graphical indicators that are respectively representative of other users of other computing devices that are executing the instant messaging application to indicate that the message was transmitted to the second computing device during the current instant messaging session. 16. The computing device of claim 12, wherein the window modifier component causes the graphical indicator to blink to indicate that the message was transmitted to the second computing device during the current instant messaging session. 17. The computing device of claim 12, wherein the request to remove the conversation window of the instant messaging application from the display is a request to close the conversation window. 18. The computing device of claim 12, wherein the request to remove the conversation window of the instant messaging application from the display is a request to minimize the conversation window. 19. The computing device of claim 12, wherein the receiver component receives a request to re-display the conversation window, the request received subsequent to the window modifier component removing the conversation window from the display, and wherein the window modifier component causes the conversation window to be re-displayed responsive to the receiver component receiving the request to re-display the conversation window, the conversation window, when re-displayed, comprises the message. 20. A computer-readable data storage device comprising instructions that, when executed by a computing device, cause the computing device to perform acts comprising:
displaying a conversation window of an instant messaging application on a display, the conversation window comprises an instant message transmitted from the computing device to a second computing device; receiving a request to close the conversation window; responsive to receiving the request, closing the conversation window; and responsive to closing the conversation window, displaying a graphical indicator in a contacts window, the graphical indicator displayed to indicate that the conversation window comprised the instant message prior to the conversation window being closed, the graphical indicator representative of a recipient of the instant message. | A system described herein includes a receiver component that receives an indication that a conversation window for a first messaging contact is desirably collapsed, wherein the conversation window for the first messaging contact corresponds to an instant messaging application that is executable on a computing device. The system can further include a window minimizer component that collapses the conversation window into a contacts window of the instant messaging application, wherein the contacts window depicts a graphical indication of at least the first contact, wherein the graphical indication is highlighted to indicate that a conversation exists with the first messaging contact.1. A method executed at a computing device, the method comprising:
displaying a conversation window of an instant messaging application on a display of the computing device, the conversation window comprising a message transmitted between the computing device and a second computing device; receiving a request to remove the conversation window from the display; responsive to receiving the request, removing the conversation window from the display; and responsive to removing the conversation window from the display, displaying a graphical indicator on the display, the graphical indicator displayed in a contacts window of the instant messaging application, the graphical indicator indicating that the conversation window comprised the message prior to the conversation window being removed from the display. 2. The method of claim 1, the computing device being a smart phone. 3. The method of claim 1, the message transmitted from the computing device to the second computing device. 4. The method of claim 1, the message transmitted from the second computing device to the computing device. 5. The method of claim 1, wherein receiving the request to remove the conversation window from the display comprises receiving a selection of a depressible button that, when selected, causes the conversation window to be closed. 6. The method of claim 1, wherein receiving the request to remove the conversation window from the display comprises receiving an indication that a user of the computing device has altered a messaging status from a first messaging status to a second messaging status. 7. The method of claim 1, the contacts window comprises an identifier that identifies the contact, wherein the graphical indicator is a highlighting of the identifier. 8. The method of claim 1, the contacts window comprises a first identifier that identifies the contact and a second identifier that identifies the second contact, the second identifier presented in the contacts window to indicate that a message has not been transmitted to or received from a third computing device of the second contact during a current instant messaging session. 9. The method of claim 1, the contacts window comprises an identifier that identifies the contact, wherein the graphical indicator is a blinking of the identifier. 10. The method of 1, further comprising:
subsequent to removing the conversation window from the display, receiving a request to redisplay the conversation window on the display; responsive to receiving the request to redisplay the conversation window on the display, redisplaying the conversation window on the conversation window on the display, wherein the conversation window, when redisplayed, comprises the message transmitted between the computing device and a second computing device. 11. The method of claim 1, the display being a touch-sensitive display, wherein the request to remove the conversation window from the display is received via the touch-sensitive display. 12. A computing device, comprising:
a display; a processor; and a memory that comprises an instant messaging application that is executed by the processor, the instant messaging application comprising:
a receiver component that receives a request to remove a conversation window of the instant messaging application from the display, the conversation window comprises a message transmitted from the computing device to a second computing device that executes the instant messaging application; and
a window modifier component that:
removes the conversation window from the display responsive to the receiver component receiving the request; and
responsive to removing the conversation window from the display, causes a graphical indicator to be displayed in a contacts window of the instant messaging application, the graphical indicator representative of a user of the second computing device, the graphical indicator indicating that the message was transmitted to the second computing device during a current instant messaging session and prior to the conversation window being removed from the display. 13. The computing device of claim 12 being a smart phone. 14. The computing device of claim 12, wherein the display is a touch-sensitive display, and the request to remove the conversation window of the instant messaging application from the display is received by way of the touch-sensitive display. 15. The computing device of claim 12, wherein the window modifier component highlights the graphical indicator relative to graphical indicators that are respectively representative of other users of other computing devices that are executing the instant messaging application to indicate that the message was transmitted to the second computing device during the current instant messaging session. 16. The computing device of claim 12, wherein the window modifier component causes the graphical indicator to blink to indicate that the message was transmitted to the second computing device during the current instant messaging session. 17. The computing device of claim 12, wherein the request to remove the conversation window of the instant messaging application from the display is a request to close the conversation window. 18. The computing device of claim 12, wherein the request to remove the conversation window of the instant messaging application from the display is a request to minimize the conversation window. 19. The computing device of claim 12, wherein the receiver component receives a request to re-display the conversation window, the request received subsequent to the window modifier component removing the conversation window from the display, and wherein the window modifier component causes the conversation window to be re-displayed responsive to the receiver component receiving the request to re-display the conversation window, the conversation window, when re-displayed, comprises the message. 20. A computer-readable data storage device comprising instructions that, when executed by a computing device, cause the computing device to perform acts comprising:
displaying a conversation window of an instant messaging application on a display, the conversation window comprises an instant message transmitted from the computing device to a second computing device; receiving a request to close the conversation window; responsive to receiving the request, closing the conversation window; and responsive to closing the conversation window, displaying a graphical indicator in a contacts window, the graphical indicator displayed to indicate that the conversation window comprised the instant message prior to the conversation window being closed, the graphical indicator representative of a recipient of the instant message. | 2,100 |
4,727 | 13,924,885 | 2,145 | An Entertainment System including a website, in combination with a commercially purchased product, wherein the system allows a product user to register a primary product online using a registration code, allowing the user access to various activities and scenarios in a “virtual world” including a virtual representation of the product, via a computer connected to the Internet. Additional ancillary products are also provided that may be related to the primary product or the virtual world, with these ancillary products also being provided with one or more codes to provide additional content, bonus items, and/or bonus access in the virtual world. | 1. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a first product on a website, using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website, using a second registration code provided with the second product, wherein, during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product that is an accessory to said first product, and wherein said second product being a real world non virtual product; responsive to registering the second product, displaying a virtual replica of the second product on said website, said virtual replica of the second product also being associated with said user ID, wherein said virtual replica of the first product interacts with said virtual replica of the second product on said website. 2. The method of claim 1, further comprising the step of, further responsive to said registering of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting. 3. The method of claim 2, further comprising the step of, further responsive to said registering of the second product, granting access to a second subset of restricted content on said website, said second subset of restricted content being in addition to said first subset of restricted content. 4. The method of claim 1, further comprising the step of, further responsive to said registering of the second product, granting access to a subset of restricted content on said website, wherein said subset of restricted content interacts with said virtual replica of the first product. 5. The method of claim 1, wherein the first product is registered using a first registration code, and wherein the second product is registered using a second registration code different from the first registration code. 6. The method of claim 5, wherein the second product is provided with an additional registration code, said method further comprising the steps of:
providing the additional registration code to said website; and responsive to providing the additional registration code, granting access to a subset of restricted content on said website, said subset of restricted content being associated with said user ID such that logging in to said website using said user ID also provides access to said subset of restricted content. 7. The method of claim 6, wherein said subset of restricted content interacts with one or both of said virtual replica of the first product and said virtual replica of the second product. 8. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a first product on a website using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website using a second registration code provided with the second product, wherein during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product; responsive to said successful registration of the second product, performing one or both of the steps of:
(1) displaying a virtual representation of the second product on the website, said virtual representation of the second product being related to the second product and also being associated with said user ID, and
(2) granting access to a second subset of restricted content on said website, said second subset of restricted content interacting with one or more of said virtual replica of the first product, said virtual representation of the second product, and said first subset of restricted content, said second subset of restricted content also being associated with said user ID;
entering a bonus code on said website, said bonus code also being provided with the second product and said bonus code being different than said second registration code; and responsive to said entering of the bonus code, performing one or both of the steps of:
(1) displaying a virtual image on the website, said virtual image interacting with at least said virtual representation of the second product and/or said second subset of restricted content that is associated with registration of said second product, wherein said virtual image is also associated with said user ID and said virtual image being different than said virtual replica of said first product and different than said virtual representation of said second product, and
(2) granting access to a third subset of restricted content on said website, said third subset of restricted content interacting with one or more of said virtual replica of the first product, said virtual representation of the second product, said first subset of restricted content, and said second subset of restricted content, wherein
said third subset of restricted content is also associated with said user ID;
whereby logging in to said website using said user ID provides access to all of said virtual replica of the first product, said first subset of restricted content, said second subset of restricted content and/or said virtual representation of the second product, and said third subset of restricted content and/or said virtual image, to allow said interacting. 9. The method of claim 8, wherein said virtual representation of the second product comprises a virtual replica of the second product. 10. The method of claim 8, wherein the second product is provided with an additional bonus code, said method further comprising the steps of:
providing said additional bonus code to said website; and responsive to providing said additional bonus code, performing one or both of the steps of:
(1) displaying an additional virtual image on the website, said additional virtual image interacting with one or more of said virtual replica of the first product, said first subset of restricted content, said virtual representation of the second product and/or said second subset of restricted content, said virtual image and/or said third subset of restricted content, and a fourth subset of restricted content, wherein said additional virtual image is also associated with said user ID, and
(2) granting access to said fourth subset of restricted content on said website, said fourth subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said fourth subset of restricted content. 11. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a toy on a website using a first registration code provided with the toy, wherein, during said registering of the toy, a successful registration verifies said first registration code, wherein the toy is a real world non virtual product; responsive to said successful registration of the toy, displaying a virtual replica of the toy on said website, said virtual replica of the toy being associated with a user ID and being animated on said website; further responsive to said successful registration of the toy, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the toy such that said virtual replica of the toy is animated within an environment provided by said first subset of restricted content, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the toy to allow said interacting; registering a peripheral product on said website using a second registration code provided with the peripheral product, said peripheral product being related to said toy, wherein a successful registering of the peripheral product verifies said second registration code, wherein the peripheral product is a real world non virtual product; responsive to said successful registration of the peripheral product, performing one or both of the steps of:
(1) displaying a virtual representation of the peripheral product on the website, said virtual representation of the peripheral product also being associated with said user ID, such that said virtual representation of the peripheral product also interacting with one or all of said first subset of restricted content, said virtual representation of the toy, and a second subset of restricted content, and
(2) granting access to said second subset of restricted content on said website, said second subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said second subset of restricted content. 12. The method of claim 11, wherein responsive to said successful registration of the peripheral product, performing both steps of (1) displaying a virtual representation of the peripheral product on the website and (2) granting access to said second subset of restricted content on said website. 13. The method of claim 11, wherein the peripheral product is provided with an additional code, said method further comprising the steps of:
providing said additional code to said website; and responsive to providing said additional code, granting access to an additional subset of restricted content on said website, said additional subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said additional subset of restricted content. 14. The method of claim 11, wherein said peripheral product is capable of use without the toy. 15. The method of claim 11, wherein the first registration code is hidden in the packaging of the toy prior to purchase. 16. The method of claim 15, wherein the second registration code is hidden in the packaging of the peripheral product prior to purchase. 17. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering the user on a website using a user ID; registering a code provided with a first product on the website, wherein the first product is a real world non virtual product; responsive to registering the first product, performing one or both of the steps of:
(1) displaying a virtual representation of the first product on said website, said virtual representation of the first product being associated with said user ID, and
(2) granting access to a first subset of restricted content on said website, said first subset of restricted content providing an activity for the user;
after said registering of the user and the code, registering a second code provided with a second product on said website, wherein said second product is associated with said user ID, wherein the second product is a real world non virtual product; registering a bonus code on said website, wherein said bonus code is provided with said second product; responsive to registering the second product, providing access to additional restricted content on the website, and in response to registering said bonus code, providing a bonus feature associated with said first product that was not available prior to said registering of the bonus code and that would not have been available without said registering of the first product and wherein said bonus feature is other than the second product itself. 18. A method for selling products, said method comprising the steps of:
providing a toy for sale, said toy being provided with an associated registration code, wherein the toy is a real world non virtual product; providing a plurality of accessories to said toy for sale, each of said accessories being provided with an associated registration code, wherein each of said accessories is a real world non virtual product; registering said toy on a website using said associated registration code, wherein, during said registering of said toy, a successful registration verifies said associated registration code; responsive to said successful registration of said toy, obtaining a user ID and obtaining access to a subset of restricted content on said website, with said subset of restricted content being associated with a user having said user ID such that the user logging in to said website using said user ID gains access to said subset of restricted content; and offering said plurality of accessories for sale to the user, said offering including notifying a user that purchase of one or more of said accessories provides access to additional subsets of restricted content on said website. 19. The method of claim 18, further comprising the steps of:
selling one or more of said accessories; registering said one or more of said accessories on said website using the associated registration codes provided with said one or more accessories, wherein a successful registering of said one or more accessories verifies said associated registration codes; responsive to said successful registration of said one or more accessories, granting access to additional subsets of restricted content on said website for each one of said one or more accessories successfully registered, said additional subsets of restricted content also being associated with said user ID such that the user logging in to said website using said user ID also gains access to said additional subsets of restricted content. 20. The method of claim 19, further comprising the steps of:
further responsive to said successful registration of said toy, displaying a virtual replica of said toy on said website, said virtual replica of said toy being associated with said user ID and interacting with said subset of restricted content; and further responsive to said successful registration of said one or more accessories, displaying a virtual representation of said one or more accessories on said website, said virtual representation of said one or more accessories being associated with the user ID and interacting with one or more of: said subset of restricted content, said additional subset of restricted content, and said virtual replica of said toy. 21. The method of claim 20, wherein said virtual representation of said one or more accessories include virtual replicas of said one or more accessories. 22. The method of claim 22, further comprising the step of, further responsive to said successful registration of said toy, displaying a virtual replica of said toy on said website, said virtual replica of said toy being associated with said user ID and interacting with said subset of restricted content. 23. A method comprising:
registering a first product on a website, using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website, using a second registration code provided with the second product, wherein, during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product that is an accessory to said first product, and wherein said second product being a real world non virtual product; responsive to registering the second product, displaying a virtual replica of the second product on said website, said virtual replica of the second product also being associated with said user ID, wherein said virtual replica of the first product interacts with said virtual replica of the second product on said website, and wherein said registering said second product allows access to a second portion of said website, wherein said second portion has a theme that is based on said accessory. | An Entertainment System including a website, in combination with a commercially purchased product, wherein the system allows a product user to register a primary product online using a registration code, allowing the user access to various activities and scenarios in a “virtual world” including a virtual representation of the product, via a computer connected to the Internet. Additional ancillary products are also provided that may be related to the primary product or the virtual world, with these ancillary products also being provided with one or more codes to provide additional content, bonus items, and/or bonus access in the virtual world.1. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a first product on a website, using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website, using a second registration code provided with the second product, wherein, during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product that is an accessory to said first product, and wherein said second product being a real world non virtual product; responsive to registering the second product, displaying a virtual replica of the second product on said website, said virtual replica of the second product also being associated with said user ID, wherein said virtual replica of the first product interacts with said virtual replica of the second product on said website. 2. The method of claim 1, further comprising the step of, further responsive to said registering of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting. 3. The method of claim 2, further comprising the step of, further responsive to said registering of the second product, granting access to a second subset of restricted content on said website, said second subset of restricted content being in addition to said first subset of restricted content. 4. The method of claim 1, further comprising the step of, further responsive to said registering of the second product, granting access to a subset of restricted content on said website, wherein said subset of restricted content interacts with said virtual replica of the first product. 5. The method of claim 1, wherein the first product is registered using a first registration code, and wherein the second product is registered using a second registration code different from the first registration code. 6. The method of claim 5, wherein the second product is provided with an additional registration code, said method further comprising the steps of:
providing the additional registration code to said website; and responsive to providing the additional registration code, granting access to a subset of restricted content on said website, said subset of restricted content being associated with said user ID such that logging in to said website using said user ID also provides access to said subset of restricted content. 7. The method of claim 6, wherein said subset of restricted content interacts with one or both of said virtual replica of the first product and said virtual replica of the second product. 8. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a first product on a website using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website using a second registration code provided with the second product, wherein during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product; responsive to said successful registration of the second product, performing one or both of the steps of:
(1) displaying a virtual representation of the second product on the website, said virtual representation of the second product being related to the second product and also being associated with said user ID, and
(2) granting access to a second subset of restricted content on said website, said second subset of restricted content interacting with one or more of said virtual replica of the first product, said virtual representation of the second product, and said first subset of restricted content, said second subset of restricted content also being associated with said user ID;
entering a bonus code on said website, said bonus code also being provided with the second product and said bonus code being different than said second registration code; and responsive to said entering of the bonus code, performing one or both of the steps of:
(1) displaying a virtual image on the website, said virtual image interacting with at least said virtual representation of the second product and/or said second subset of restricted content that is associated with registration of said second product, wherein said virtual image is also associated with said user ID and said virtual image being different than said virtual replica of said first product and different than said virtual representation of said second product, and
(2) granting access to a third subset of restricted content on said website, said third subset of restricted content interacting with one or more of said virtual replica of the first product, said virtual representation of the second product, said first subset of restricted content, and said second subset of restricted content, wherein
said third subset of restricted content is also associated with said user ID;
whereby logging in to said website using said user ID provides access to all of said virtual replica of the first product, said first subset of restricted content, said second subset of restricted content and/or said virtual representation of the second product, and said third subset of restricted content and/or said virtual image, to allow said interacting. 9. The method of claim 8, wherein said virtual representation of the second product comprises a virtual replica of the second product. 10. The method of claim 8, wherein the second product is provided with an additional bonus code, said method further comprising the steps of:
providing said additional bonus code to said website; and responsive to providing said additional bonus code, performing one or both of the steps of:
(1) displaying an additional virtual image on the website, said additional virtual image interacting with one or more of said virtual replica of the first product, said first subset of restricted content, said virtual representation of the second product and/or said second subset of restricted content, said virtual image and/or said third subset of restricted content, and a fourth subset of restricted content, wherein said additional virtual image is also associated with said user ID, and
(2) granting access to said fourth subset of restricted content on said website, said fourth subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said fourth subset of restricted content. 11. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering a toy on a website using a first registration code provided with the toy, wherein, during said registering of the toy, a successful registration verifies said first registration code, wherein the toy is a real world non virtual product; responsive to said successful registration of the toy, displaying a virtual replica of the toy on said website, said virtual replica of the toy being associated with a user ID and being animated on said website; further responsive to said successful registration of the toy, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the toy such that said virtual replica of the toy is animated within an environment provided by said first subset of restricted content, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the toy to allow said interacting; registering a peripheral product on said website using a second registration code provided with the peripheral product, said peripheral product being related to said toy, wherein a successful registering of the peripheral product verifies said second registration code, wherein the peripheral product is a real world non virtual product; responsive to said successful registration of the peripheral product, performing one or both of the steps of:
(1) displaying a virtual representation of the peripheral product on the website, said virtual representation of the peripheral product also being associated with said user ID, such that said virtual representation of the peripheral product also interacting with one or all of said first subset of restricted content, said virtual representation of the toy, and a second subset of restricted content, and
(2) granting access to said second subset of restricted content on said website, said second subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said second subset of restricted content. 12. The method of claim 11, wherein responsive to said successful registration of the peripheral product, performing both steps of (1) displaying a virtual representation of the peripheral product on the website and (2) granting access to said second subset of restricted content on said website. 13. The method of claim 11, wherein the peripheral product is provided with an additional code, said method further comprising the steps of:
providing said additional code to said website; and responsive to providing said additional code, granting access to an additional subset of restricted content on said website, said additional subset of restricted content also being associated with said user ID such that logging in to said website using said user ID also provides access to said additional subset of restricted content. 14. The method of claim 11, wherein said peripheral product is capable of use without the toy. 15. The method of claim 11, wherein the first registration code is hidden in the packaging of the toy prior to purchase. 16. The method of claim 15, wherein the second registration code is hidden in the packaging of the peripheral product prior to purchase. 17. A method for providing a virtual world presentation to a user, said method comprising the steps of:
registering the user on a website using a user ID; registering a code provided with a first product on the website, wherein the first product is a real world non virtual product; responsive to registering the first product, performing one or both of the steps of:
(1) displaying a virtual representation of the first product on said website, said virtual representation of the first product being associated with said user ID, and
(2) granting access to a first subset of restricted content on said website, said first subset of restricted content providing an activity for the user;
after said registering of the user and the code, registering a second code provided with a second product on said website, wherein said second product is associated with said user ID, wherein the second product is a real world non virtual product; registering a bonus code on said website, wherein said bonus code is provided with said second product; responsive to registering the second product, providing access to additional restricted content on the website, and in response to registering said bonus code, providing a bonus feature associated with said first product that was not available prior to said registering of the bonus code and that would not have been available without said registering of the first product and wherein said bonus feature is other than the second product itself. 18. A method for selling products, said method comprising the steps of:
providing a toy for sale, said toy being provided with an associated registration code, wherein the toy is a real world non virtual product; providing a plurality of accessories to said toy for sale, each of said accessories being provided with an associated registration code, wherein each of said accessories is a real world non virtual product; registering said toy on a website using said associated registration code, wherein, during said registering of said toy, a successful registration verifies said associated registration code; responsive to said successful registration of said toy, obtaining a user ID and obtaining access to a subset of restricted content on said website, with said subset of restricted content being associated with a user having said user ID such that the user logging in to said website using said user ID gains access to said subset of restricted content; and offering said plurality of accessories for sale to the user, said offering including notifying a user that purchase of one or more of said accessories provides access to additional subsets of restricted content on said website. 19. The method of claim 18, further comprising the steps of:
selling one or more of said accessories; registering said one or more of said accessories on said website using the associated registration codes provided with said one or more accessories, wherein a successful registering of said one or more accessories verifies said associated registration codes; responsive to said successful registration of said one or more accessories, granting access to additional subsets of restricted content on said website for each one of said one or more accessories successfully registered, said additional subsets of restricted content also being associated with said user ID such that the user logging in to said website using said user ID also gains access to said additional subsets of restricted content. 20. The method of claim 19, further comprising the steps of:
further responsive to said successful registration of said toy, displaying a virtual replica of said toy on said website, said virtual replica of said toy being associated with said user ID and interacting with said subset of restricted content; and further responsive to said successful registration of said one or more accessories, displaying a virtual representation of said one or more accessories on said website, said virtual representation of said one or more accessories being associated with the user ID and interacting with one or more of: said subset of restricted content, said additional subset of restricted content, and said virtual replica of said toy. 21. The method of claim 20, wherein said virtual representation of said one or more accessories include virtual replicas of said one or more accessories. 22. The method of claim 22, further comprising the step of, further responsive to said successful registration of said toy, displaying a virtual replica of said toy on said website, said virtual replica of said toy being associated with said user ID and interacting with said subset of restricted content. 23. A method comprising:
registering a first product on a website, using a first registration code provided with the first product, wherein, during said registering of the first product, a successful registration verifies said first registration code, wherein said first product being a real world non virtual product; responsive to said successful registration of the first product, displaying a virtual replica of the first product on said website, said virtual replica of the first product being associated with a user ID; further responsive to said successful registration of the first product, granting access to a first subset of restricted content on said website, said first subset of restricted content interacting with said virtual replica of the first product, with said first subset of restricted content also being associated with said user ID such that logging in to said website using said user ID provides access to said first subset of restricted content and said virtual replica of the first product to allow said interacting; registering a second product on said website, using a second registration code provided with the second product, wherein, during said registering of the second product, a successful registration verifies said second registration code, wherein said second product being a real world non virtual product that is an accessory to said first product, and wherein said second product being a real world non virtual product; responsive to registering the second product, displaying a virtual replica of the second product on said website, said virtual replica of the second product also being associated with said user ID, wherein said virtual replica of the first product interacts with said virtual replica of the second product on said website, and wherein said registering said second product allows access to a second portion of said website, wherein said second portion has a theme that is based on said accessory. | 2,100 |
4,728 | 14,262,298 | 2,136 | Systems, apparatuses, and methods for aggregating memory requests with opportunism in a display pipeline. Memory requests are aggregated for each requestor of a plurality of requestors in the display pipeline. When the number of memory requests for a given requestor reaches a corresponding threshold, memory requests may be issued for the given requestor. In response to determining the given requestor has reached its threshold, other requestors may issue memory requests even if they have not yet aggregated enough memory requests to reach their corresponding thresholds. | 1. A display pipeline comprising:
a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and logic configured to monitor a number of pending requests corresponding to each of the plurality of requestors; wherein in response to determining a first requestor of the plurality of requestors has reached its corresponding threshold number of requests, one or more other requestors of the plurality of requestors are permitted to transmit a request prior to aggregating its corresponding threshold number of requests. 2. The system as recited in claim 1, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 3. The system as recited in claim 1, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 4. The system as recited in claim 1, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 5. The system as recited in claim 1, further comprising one or more programmable registers, each configured to store a value indicative of a threshold number for a requestor of the plurality of requestors. 6. The system as recited in claim 1, wherein in response to said determining, a notification that the first requestor has reached its threshold number of requests is conveyed to one or more of the other requestors. 7. The system as recited in claim 1, wherein one or more of the other requestors are configured to determine that the first requestor has reached its threshold number of requests via a status register. 8. An apparatus comprising:
a memory; a display pipeline comprising a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and an interface coupled between the display pipeline and the memory; wherein the display pipeline is configured to:
monitor a number of pending requests corresponding to each of the plurality of requestors; and
permit one or more requestors of the plurality of requestors to transmit a request prior to aggregating its corresponding threshold number of requests, in response to determining a first requestor of the plurality of requestors other than the one or more requestors has reached its corresponding threshold number of requests. 9. The apparatus as recited in claim 1, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 10. The apparatus as recited in claim 1, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 11. The apparatus as recited in claim 1, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 12. The apparatus as recited in claim 1, further comprising a memory controller configured to control access to the memory. 13. The apparatus as recited in claim 1, wherein the display pipeline comprises a plurality of pixel processing pipelines, wherein the first requestor corresponds to a first pixel processing pipeline of the plurality of pixel processing pipelines, and wherein a second requestor of the plurality of requestors corresponds to a second pixel processing pipeline of the plurality of pixel processing pipelines. 14. The apparatus as recited in claim 1, wherein the display pipeline comprises a first pixel processing pipeline, wherein the first requestor corresponds to the first pixel processing pipeline, and wherein a second requestor of the plurality of requestors corresponds to the first pixel processing pipeline. 15. A method comprising:
monitoring a number of pending requests corresponding to each of a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and permitting one or more requestors of the plurality of requestors to transmit a request prior to aggregating its corresponding threshold number of requests, in response to determining a first requestor of the plurality of requestors other than the one or more requestors has reached its corresponding threshold number of requests. 16. The method as recited in claim 15, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 17. The method as recited in claim 15, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 18. The method as recited in claim 15, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 19. The method as recited in claim 15, wherein in response to said determining, the method comprises conveying a notification that the first requestor has reached its threshold number of requests to one or more of the other requestors. 20. The method as recited in claim 15, further comprising one or more of the other requestors determining that the first requestor has reached its threshold number of requests via a status register. | Systems, apparatuses, and methods for aggregating memory requests with opportunism in a display pipeline. Memory requests are aggregated for each requestor of a plurality of requestors in the display pipeline. When the number of memory requests for a given requestor reaches a corresponding threshold, memory requests may be issued for the given requestor. In response to determining the given requestor has reached its threshold, other requestors may issue memory requests even if they have not yet aggregated enough memory requests to reach their corresponding thresholds.1. A display pipeline comprising:
a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and logic configured to monitor a number of pending requests corresponding to each of the plurality of requestors; wherein in response to determining a first requestor of the plurality of requestors has reached its corresponding threshold number of requests, one or more other requestors of the plurality of requestors are permitted to transmit a request prior to aggregating its corresponding threshold number of requests. 2. The system as recited in claim 1, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 3. The system as recited in claim 1, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 4. The system as recited in claim 1, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 5. The system as recited in claim 1, further comprising one or more programmable registers, each configured to store a value indicative of a threshold number for a requestor of the plurality of requestors. 6. The system as recited in claim 1, wherein in response to said determining, a notification that the first requestor has reached its threshold number of requests is conveyed to one or more of the other requestors. 7. The system as recited in claim 1, wherein one or more of the other requestors are configured to determine that the first requestor has reached its threshold number of requests via a status register. 8. An apparatus comprising:
a memory; a display pipeline comprising a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and an interface coupled between the display pipeline and the memory; wherein the display pipeline is configured to:
monitor a number of pending requests corresponding to each of the plurality of requestors; and
permit one or more requestors of the plurality of requestors to transmit a request prior to aggregating its corresponding threshold number of requests, in response to determining a first requestor of the plurality of requestors other than the one or more requestors has reached its corresponding threshold number of requests. 9. The apparatus as recited in claim 1, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 10. The apparatus as recited in claim 1, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 11. The apparatus as recited in claim 1, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 12. The apparatus as recited in claim 1, further comprising a memory controller configured to control access to the memory. 13. The apparatus as recited in claim 1, wherein the display pipeline comprises a plurality of pixel processing pipelines, wherein the first requestor corresponds to a first pixel processing pipeline of the plurality of pixel processing pipelines, and wherein a second requestor of the plurality of requestors corresponds to a second pixel processing pipeline of the plurality of pixel processing pipelines. 14. The apparatus as recited in claim 1, wherein the display pipeline comprises a first pixel processing pipeline, wherein the first requestor corresponds to the first pixel processing pipeline, and wherein a second requestor of the plurality of requestors corresponds to the first pixel processing pipeline. 15. A method comprising:
monitoring a number of pending requests corresponding to each of a plurality of requestors, wherein each requestor of the plurality of requestors has a corresponding threshold number of requests to be aggregated before transmission of a request is permitted; and permitting one or more requestors of the plurality of requestors to transmit a request prior to aggregating its corresponding threshold number of requests, in response to determining a first requestor of the plurality of requestors other than the one or more requestors has reached its corresponding threshold number of requests. 16. The method as recited in claim 15, wherein each requestor of the plurality of requestors is configured to issue memory requests responsive to an indication that all remaining requests for a given frame have been aggregated. 17. The method as recited in claim 15, wherein the first requestor corresponds to a first plane of a source image, and wherein a second requestor of the plurality of requestors corresponds to a second plane of the source image. 18. The method as recited in claim 15, wherein the first requestor corresponds to a first plane of a first source image, and wherein a second requestor of the plurality of requestors corresponds to a first plane of a second source image. 19. The method as recited in claim 15, wherein in response to said determining, the method comprises conveying a notification that the first requestor has reached its threshold number of requests to one or more of the other requestors. 20. The method as recited in claim 15, further comprising one or more of the other requestors determining that the first requestor has reached its threshold number of requests via a status register. | 2,100 |
4,729 | 14,059,410 | 2,156 | Apparatus and methods are provided for performing a digital forensic investigation. Aspects of the apparatus and methods determine the location of forensically relevant data on a data source and copy this relevant data to a storage device in a forensically sound manner. Information related to the location of the relevant data may also be stored on the storage device. | 1. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device identifying data stored on said data source, wherein said data indicates additional data stored on said data source; said secondary device parsing said data; said secondary device analyzing said parsed data to identify said additional data; and, said secondary device copying at least a portion of said additional data to a storage device associated with said secondary device. 2. The Method according to claim 1 further comprising storing said identification of said additional data on said storage device. 3. The method according to claim 1 further comprising said secondary device analyzing said parsed data to identify relevant data in said additional data and only copying said relevant data to said storage device. 4. The method according to claim 3 wherein said secondary device determines relevance based on at least one predetermined Boolean expression. 5. The method according to claim 3 wherein said secondary device determines relevance based on a ratio of expected relevance to a size of said additional data. 6. The method according to claim 1 wherein said copying said at least a portion of said additional data is performed at a device level. 7. The method according to claim 1 wherein said copying said at least a portion of said additional data includes copying an identifier associated with said at least a portion of said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 8. The method according to claim 1 wherein said copying said at least a portion of said additional data includes copying an identifier associated with said at least a portion of said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 9. The method according to claim 3 further comprising copying data proximal to said additional data and storing said proximal data on said storage device. 10. Apparatus for imaging a data source, the apparatus comprising:
a connector configured for selectively connecting said apparatus to said data source; a processor in electrical communication with said connector; and, a storage device in electrical communication with said processor; said processor being configured to communicate with said storage device through said connector and identify data located on said data source; wherein said identified data identifies additional data stored on said data source; said processor being further configured to parse said identified data; analyze said parsed data to identify said additional data; and, copy at least a portion of said additional data to said storage device. 11. The apparatus according to claim 10 wherein said processor is further configured to store the identification of said additional data on said storage device. 12. The apparatus according to claim 10 wherein said processor is further configured to analyze said parsed data to identify relevant data in said additional data and copy only said relevant data to said storage device. 13. The apparatus according to claim 12 wherein said processor is configured to determine relevance based on at least one predetermined Boolean expression. 14. The apparatus according to claim 10 wherein said connector is a wireless connector. 15. The apparatus according to claim 10 wherein said connector is a network. 16. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data at a device level. 17. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data by copying an identifier associated with said at least a portion of said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 18. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data by copying an identifier associated with said at least a portion of said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 19. The apparatus according to claim 10 further comprising an adapter in electrical communication with said storage device; said adaptor configured to monitor said storage device for an attempt to access data on said storage device;
wherein when the data is stored within said storage device said adapter returns the data; and,
wherein when the data is not stored on said storage device, the adapter returns a response, said response being selected from at least one member of the group of responses consisting of an indication that an error occurred, an indication that the requested data is bad or corrupt, an indication that the request data was not collected or is missing, and predetermined dummy data. 20. The apparatus according to claim 10 further comprising an adapter in electrical communication with said storage device; said adaptor configured to monitor said storage device for an attempt to access data corresponding to data stored at a location on said data source;
wherein when the location is stored within said storage device said adapter returns the corresponding data; and,
wherein when the location is not stored on said storage device, the adapter returns a response, said response being selected from at least one member of the group of responses consisting of an indication that an error occurred, an indication that the requested location is bad or corrupt, an indication that the request location was not collected or is missing, and predetermined dummy data. 21. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device identifying data on said data source wherein said data enables said secondary device to identify additional portions of said data source; and, said secondary device copying additional data from said data source, which is not said additional portions, to a storage device. 22. The method according to claim 21 wherein said additional portions include unused portions of the data source. 23. The method according to claim 21 wherein said additional portions include irrelevant data. 24. The Method according to claim 21 further comprising storing an identification of said additional data on said storage device. 25. The method according to claim 21 further comprising said secondary device parsing said data and analyzing said parsed data to identify irrelevant data and only copying data that is not said irrelevant data to said storage device. 26. The method according to claim 21 wherein said copying said additional data is performed at a device level. 27. The method according to claim 21 wherein said copying said additional data includes copying an identifier associated with said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 28. The method according to claim 21 wherein said copying said additional data includes copying an identifier associated with said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 29. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device locating data stored on said data source, wherein said data indicates additional data stored on said data source; said secondary device parsing said data; said secondary device analyzing said parsed data to locate said additional data; said secondary device copying, at a device level, at least a portion of said additional data to a storage device associated with said secondary device; and, said secondary device computing a hash of said copied data. 30. The method according to claim 29 further comprising said secondary device, prior to computing said hash, inserting known dummy values into said storage device in place of data from said data source that was not stored and then computing said hash on both said copied data and said inserted dummy values. 31. The method according to claim 29 further comprising said secondary device creating a list of identifiers of data that were stored and calculating a hash of said list. 32. The method according to claim 29 further comprising said secondary device creating a list of locations of data that were stored and calculating a hash of said list. 33. The method according to claim 29 further comprising said secondary device creating a list of locations of data that were not stored and calculating a hash of said list. | Apparatus and methods are provided for performing a digital forensic investigation. Aspects of the apparatus and methods determine the location of forensically relevant data on a data source and copy this relevant data to a storage device in a forensically sound manner. Information related to the location of the relevant data may also be stored on the storage device.1. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device identifying data stored on said data source, wherein said data indicates additional data stored on said data source; said secondary device parsing said data; said secondary device analyzing said parsed data to identify said additional data; and, said secondary device copying at least a portion of said additional data to a storage device associated with said secondary device. 2. The Method according to claim 1 further comprising storing said identification of said additional data on said storage device. 3. The method according to claim 1 further comprising said secondary device analyzing said parsed data to identify relevant data in said additional data and only copying said relevant data to said storage device. 4. The method according to claim 3 wherein said secondary device determines relevance based on at least one predetermined Boolean expression. 5. The method according to claim 3 wherein said secondary device determines relevance based on a ratio of expected relevance to a size of said additional data. 6. The method according to claim 1 wherein said copying said at least a portion of said additional data is performed at a device level. 7. The method according to claim 1 wherein said copying said at least a portion of said additional data includes copying an identifier associated with said at least a portion of said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 8. The method according to claim 1 wherein said copying said at least a portion of said additional data includes copying an identifier associated with said at least a portion of said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 9. The method according to claim 3 further comprising copying data proximal to said additional data and storing said proximal data on said storage device. 10. Apparatus for imaging a data source, the apparatus comprising:
a connector configured for selectively connecting said apparatus to said data source; a processor in electrical communication with said connector; and, a storage device in electrical communication with said processor; said processor being configured to communicate with said storage device through said connector and identify data located on said data source; wherein said identified data identifies additional data stored on said data source; said processor being further configured to parse said identified data; analyze said parsed data to identify said additional data; and, copy at least a portion of said additional data to said storage device. 11. The apparatus according to claim 10 wherein said processor is further configured to store the identification of said additional data on said storage device. 12. The apparatus according to claim 10 wherein said processor is further configured to analyze said parsed data to identify relevant data in said additional data and copy only said relevant data to said storage device. 13. The apparatus according to claim 12 wherein said processor is configured to determine relevance based on at least one predetermined Boolean expression. 14. The apparatus according to claim 10 wherein said connector is a wireless connector. 15. The apparatus according to claim 10 wherein said connector is a network. 16. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data at a device level. 17. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data by copying an identifier associated with said at least a portion of said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 18. The apparatus according to claim 10 wherein said processor is configured to copy said at least a portion of said additional data by copying an identifier associated with said at least a portion of said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 19. The apparatus according to claim 10 further comprising an adapter in electrical communication with said storage device; said adaptor configured to monitor said storage device for an attempt to access data on said storage device;
wherein when the data is stored within said storage device said adapter returns the data; and,
wherein when the data is not stored on said storage device, the adapter returns a response, said response being selected from at least one member of the group of responses consisting of an indication that an error occurred, an indication that the requested data is bad or corrupt, an indication that the request data was not collected or is missing, and predetermined dummy data. 20. The apparatus according to claim 10 further comprising an adapter in electrical communication with said storage device; said adaptor configured to monitor said storage device for an attempt to access data corresponding to data stored at a location on said data source;
wherein when the location is stored within said storage device said adapter returns the corresponding data; and,
wherein when the location is not stored on said storage device, the adapter returns a response, said response being selected from at least one member of the group of responses consisting of an indication that an error occurred, an indication that the requested location is bad or corrupt, an indication that the request location was not collected or is missing, and predetermined dummy data. 21. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device identifying data on said data source wherein said data enables said secondary device to identify additional portions of said data source; and, said secondary device copying additional data from said data source, which is not said additional portions, to a storage device. 22. The method according to claim 21 wherein said additional portions include unused portions of the data source. 23. The method according to claim 21 wherein said additional portions include irrelevant data. 24. The Method according to claim 21 further comprising storing an identification of said additional data on said storage device. 25. The method according to claim 21 further comprising said secondary device parsing said data and analyzing said parsed data to identify irrelevant data and only copying data that is not said irrelevant data to said storage device. 26. The method according to claim 21 wherein said copying said additional data is performed at a device level. 27. The method according to claim 21 wherein said copying said additional data includes copying an identifier associated with said additional data, said identifier being selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 28. The method according to claim 21 wherein said copying said additional data includes copying an identifier associated with said additional data, said identifier being sufficient to reconstruct an identifier selected from at least one member of the group consisting of a sector number, a block number, a block address, a byte address, a memory address, a sequence number, a cluster number, a byte number and a device address. 29. A method for imaging a data source, the method comprising:
a secondary device selectively communicating with the data source; said secondary device locating data stored on said data source, wherein said data indicates additional data stored on said data source; said secondary device parsing said data; said secondary device analyzing said parsed data to locate said additional data; said secondary device copying, at a device level, at least a portion of said additional data to a storage device associated with said secondary device; and, said secondary device computing a hash of said copied data. 30. The method according to claim 29 further comprising said secondary device, prior to computing said hash, inserting known dummy values into said storage device in place of data from said data source that was not stored and then computing said hash on both said copied data and said inserted dummy values. 31. The method according to claim 29 further comprising said secondary device creating a list of identifiers of data that were stored and calculating a hash of said list. 32. The method according to claim 29 further comprising said secondary device creating a list of locations of data that were stored and calculating a hash of said list. 33. The method according to claim 29 further comprising said secondary device creating a list of locations of data that were not stored and calculating a hash of said list. | 2,100 |
4,730 | 13,688,357 | 2,162 | According to example implementations, computing devices are configured using a template. The template specifies at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system. The computing devices are reconfigured in response to modification of the template. | 1. A method comprising:
configuring a plurality of computing devices using a template that specifies at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system; and responsive to a change of the template, reconfiguring the plurality of computing devices according to the changed template. 2. The method of claim 1, wherein configuring the computing devices comprises computing agents in the computing devices that perform backup operations to the backup system. 3. The method of claim 1, further comprising:
setting provisioning information associated with a particular one of the computing devices, the provisioning information indicating that configuration of the particular computing device is based on the template. 4. The method of claim 3, wherein the provisioning information includes an association indication to indicate that the particular computing device is to be configured using the template, and wherein the provisioning information is without the association indication to indicate that the particular computing device is not to be configured using the template. 5. The method of claim 3, further comprising:
receiving input to disassociate the particular computing device from the template. 6. The method of claim 1, wherein the reconfiguring comprises:
determining whether the change of the template would affect an ongoing operation of a particular computing device. 7. The method of claim 6, wherein the reconfiguring comprises:
in response to determining that the change of the template would not affect the ongoing operation, applying the changed template to the particular computing device without waiting for the ongoing operation to complete. 8. The method of claim 6, wherein the reconfiguring comprises:
in response to determining that the change of the template would affect the ongoing operation, waiting for the ongoing operation to complete and applying the changed template to the particular computing device after the ongoing operation completes. 9. An article comprising at least one machine-readable storage medium storing instructions that upon execution cause a system to:
receive input information that relates to content of a template useable to configure computing devices, the template specifying at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system; create the template based on the received input information; configure the computing devices based on the template; receive further input information relating to modification of the template; modify the template based on the received further input information; and trigger reconfiguration of the computing devices in response to the modified template. 10. The article of claim 9, wherein configuring the computing devices comprises setting the at least one computing device property and the backup control information of each of the computing devices in a configuration system. 11. The article of claim 9, wherein the instructions upon execution cause the system to further update provisioning information for the computing devices to associate the computing devices with the template. 12. The article of claim 9, wherein the instructions upon execution cause the system to further:
receive additional information specifying disassociation of a particular one of the computing devices from the template; and update provisioning information for the particular computing device to disassociate the particular computing device from the template. 13. The article of claim 9, wherein receiving the input information and receiving the further input information are from a management interface device. 14. A configuration system comprising:
at least one processor; and configuration code executable on the at least one processor to:
configure, using a template, computing devices, wherein the template specifies at least one computing device property and backup control information relating to backing up data from each of the computing devices to a backup system; and
reconfigure the computing devices in response to modification of the template. 15. The configuration system of claim 14, wherein the backup control information includes a backup policy that specifies at least one selected from among: a schedule for performing backup, and a retention policy for backup data. 16. The configuration system of claim 14, wherein the backup control information includes a backup rule identifying a type of data to backup. 17. The configuration system of claim 14, further comprising a configuration database to store configuration data for the computing devices, wherein the configuration database includes configuration data instances for the respective computing devices, and wherein each of the configuration data instances includes at least one computing device property and backup control information,
wherein the configuration code is configured to set the configuration data instances based on the template. 18. The configuration system of claim 17, further comprising a database server module to access the configuration data instances in response to requests from the computing devices. 19. The configuration system of claim 14, wherein the computing devices include data servers having backup agents to back up data from the data servers to a backup system. | According to example implementations, computing devices are configured using a template. The template specifies at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system. The computing devices are reconfigured in response to modification of the template.1. A method comprising:
configuring a plurality of computing devices using a template that specifies at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system; and responsive to a change of the template, reconfiguring the plurality of computing devices according to the changed template. 2. The method of claim 1, wherein configuring the computing devices comprises computing agents in the computing devices that perform backup operations to the backup system. 3. The method of claim 1, further comprising:
setting provisioning information associated with a particular one of the computing devices, the provisioning information indicating that configuration of the particular computing device is based on the template. 4. The method of claim 3, wherein the provisioning information includes an association indication to indicate that the particular computing device is to be configured using the template, and wherein the provisioning information is without the association indication to indicate that the particular computing device is not to be configured using the template. 5. The method of claim 3, further comprising:
receiving input to disassociate the particular computing device from the template. 6. The method of claim 1, wherein the reconfiguring comprises:
determining whether the change of the template would affect an ongoing operation of a particular computing device. 7. The method of claim 6, wherein the reconfiguring comprises:
in response to determining that the change of the template would not affect the ongoing operation, applying the changed template to the particular computing device without waiting for the ongoing operation to complete. 8. The method of claim 6, wherein the reconfiguring comprises:
in response to determining that the change of the template would affect the ongoing operation, waiting for the ongoing operation to complete and applying the changed template to the particular computing device after the ongoing operation completes. 9. An article comprising at least one machine-readable storage medium storing instructions that upon execution cause a system to:
receive input information that relates to content of a template useable to configure computing devices, the template specifying at least one computing device property and backup control information relating to backing up data from the computing devices to a backup system; create the template based on the received input information; configure the computing devices based on the template; receive further input information relating to modification of the template; modify the template based on the received further input information; and trigger reconfiguration of the computing devices in response to the modified template. 10. The article of claim 9, wherein configuring the computing devices comprises setting the at least one computing device property and the backup control information of each of the computing devices in a configuration system. 11. The article of claim 9, wherein the instructions upon execution cause the system to further update provisioning information for the computing devices to associate the computing devices with the template. 12. The article of claim 9, wherein the instructions upon execution cause the system to further:
receive additional information specifying disassociation of a particular one of the computing devices from the template; and update provisioning information for the particular computing device to disassociate the particular computing device from the template. 13. The article of claim 9, wherein receiving the input information and receiving the further input information are from a management interface device. 14. A configuration system comprising:
at least one processor; and configuration code executable on the at least one processor to:
configure, using a template, computing devices, wherein the template specifies at least one computing device property and backup control information relating to backing up data from each of the computing devices to a backup system; and
reconfigure the computing devices in response to modification of the template. 15. The configuration system of claim 14, wherein the backup control information includes a backup policy that specifies at least one selected from among: a schedule for performing backup, and a retention policy for backup data. 16. The configuration system of claim 14, wherein the backup control information includes a backup rule identifying a type of data to backup. 17. The configuration system of claim 14, further comprising a configuration database to store configuration data for the computing devices, wherein the configuration database includes configuration data instances for the respective computing devices, and wherein each of the configuration data instances includes at least one computing device property and backup control information,
wherein the configuration code is configured to set the configuration data instances based on the template. 18. The configuration system of claim 17, further comprising a database server module to access the configuration data instances in response to requests from the computing devices. 19. The configuration system of claim 14, wherein the computing devices include data servers having backup agents to back up data from the data servers to a backup system. | 2,100 |
4,731 | 13,291,122 | 2,144 | A web template author can author interactive web templates via a static markup language-based authoring tool. The web template author can insert static markup language snippets representing one or more configurable controls of a web template into a static markup language-based authoring tool. Each snippet includes a definition of a preview of a configurable control in a static markup language as well as one or more disabled CMS instructions for the configurable control. The web template author can configure and view previews of the inserted configurable controls as they are added to the web template being developed within the static markup language-based authoring tool. When the web template author is satisfied with a version of a web template, the web template author can upload the static markup language definition of the web template to the server, where the web template is converted into a CMS-compatible web template. | 1. A method comprising:
receiving static markup language defining a web template, the static markup language including one or more static markup language instructions defining a preview of a configurable control displayable within a static markup language authoring system and one or more content management system instructions defining the configurable control, the one or more content management system instructions being disabled within the static markup language of the web template; disabling the one or more static markup language instructions defining the preview of the configurable control; enabling the one or more content management system instructions defining the configurable control; and rendering the web template using the one or more enabled content management system instructions for the configurable control. 2. The method of claim 1 wherein the web template is rendered as part of a webpage in combination with content via a content management system. 3. The method of claim 1 wherein the web template is rendered as a preview in a browser. 4. The method of claim 1 wherein the rendering operation comprises:
presenting one or more messages pertaining to the rendering of the web template as a preview. 5. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and the one or more disabled content management system instructions defining the configurable control. 6. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section through which the customized configurable control is previewed. 7. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and one or more disabled content management system instructions defining the configurable control, the copyable static markup language instructions including customization defined by the editable properties. 8. The method of claim 1 wherein the disabling operation comprises:
deleting the one or more static markup language instructions defining the preview of the configurable control. 9. The method of claim 1 wherein the enabling operation comprises:
removing one or more comment structures used to disable the one or more content management system instructions. 10. One or more computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
accessing a web template including one or more content management system instruction defining the configurable control, the one or more content management system instructions being disabled within the web template; enabling the one or more content management system instructions defining the configurable control; and rendering the web template using the one or more enabled content management system instructions for the configurable control. 11. The one or more computer-readable storage media of claim 10, wherein the web template further includes one or more static markup language instructions defining a preview of a configurable control displayable within a static markup language authoring system, and the computer process further comprises:
disabling the one or more static markup language instructions defining the preview of the configurable control. 12. The one or more computer-readable storage media of claim 11 wherein the disabling operation comprises:
deleting the one or more static markup language instructions defining the preview of the configurable control. 13. The one or more computer-readable storage media of claim 10 wherein the web template is rendered as part of a webpage in combination with content via a content management system. 14. The one or more computer-readable storage media of claim 10 wherein the web template is rendered as a preview in a browser. 15. The one or more computer-readable storage media of claim 10 wherein the rendering operation comprises:
presenting one or more messages pertaining to the rendering of the web template as a preview. 16. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and the one or more disabled content management system instructions defining the configurable control. 17. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section through which the customized configurable control is previewed. 18. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and one or more disabled content management system instructions defining the configurable control, the copyable static markup language instructions including customization defined by the editable properties. 19. The one or more computer-readable storage media of claim 10 wherein the enabling operation comprises:
removing one or more comment structures used to disable the one or more content management system instructions. 20. A system comprising:
a markup language converter configured to access a web template including one or more content management system instruction defining the configurable control, the one or more content management system instructions being disabled within the web template, the markup language converter being further configured to enable the one or more content management system instructions defining the configurable control; and a web server configured to render the web template using the one or more enabled content management system instructions for the configurable control. | A web template author can author interactive web templates via a static markup language-based authoring tool. The web template author can insert static markup language snippets representing one or more configurable controls of a web template into a static markup language-based authoring tool. Each snippet includes a definition of a preview of a configurable control in a static markup language as well as one or more disabled CMS instructions for the configurable control. The web template author can configure and view previews of the inserted configurable controls as they are added to the web template being developed within the static markup language-based authoring tool. When the web template author is satisfied with a version of a web template, the web template author can upload the static markup language definition of the web template to the server, where the web template is converted into a CMS-compatible web template.1. A method comprising:
receiving static markup language defining a web template, the static markup language including one or more static markup language instructions defining a preview of a configurable control displayable within a static markup language authoring system and one or more content management system instructions defining the configurable control, the one or more content management system instructions being disabled within the static markup language of the web template; disabling the one or more static markup language instructions defining the preview of the configurable control; enabling the one or more content management system instructions defining the configurable control; and rendering the web template using the one or more enabled content management system instructions for the configurable control. 2. The method of claim 1 wherein the web template is rendered as part of a webpage in combination with content via a content management system. 3. The method of claim 1 wherein the web template is rendered as a preview in a browser. 4. The method of claim 1 wherein the rendering operation comprises:
presenting one or more messages pertaining to the rendering of the web template as a preview. 5. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and the one or more disabled content management system instructions defining the configurable control. 6. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section through which the customized configurable control is previewed. 7. The method of claim 1 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and one or more disabled content management system instructions defining the configurable control, the copyable static markup language instructions including customization defined by the editable properties. 8. The method of claim 1 wherein the disabling operation comprises:
deleting the one or more static markup language instructions defining the preview of the configurable control. 9. The method of claim 1 wherein the enabling operation comprises:
removing one or more comment structures used to disable the one or more content management system instructions. 10. One or more computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
accessing a web template including one or more content management system instruction defining the configurable control, the one or more content management system instructions being disabled within the web template; enabling the one or more content management system instructions defining the configurable control; and rendering the web template using the one or more enabled content management system instructions for the configurable control. 11. The one or more computer-readable storage media of claim 10, wherein the web template further includes one or more static markup language instructions defining a preview of a configurable control displayable within a static markup language authoring system, and the computer process further comprises:
disabling the one or more static markup language instructions defining the preview of the configurable control. 12. The one or more computer-readable storage media of claim 11 wherein the disabling operation comprises:
deleting the one or more static markup language instructions defining the preview of the configurable control. 13. The one or more computer-readable storage media of claim 10 wherein the web template is rendered as part of a webpage in combination with content via a content management system. 14. The one or more computer-readable storage media of claim 10 wherein the web template is rendered as a preview in a browser. 15. The one or more computer-readable storage media of claim 10 wherein the rendering operation comprises:
presenting one or more messages pertaining to the rendering of the web template as a preview. 16. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and the one or more disabled content management system instructions defining the configurable control. 17. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section through which the customized configurable control is previewed. 18. The one or more computer-readable storage media of claim 10 further comprising:
presenting a gallery of configurable controls, the gallery including a section through which the configurable control is customized by one or more editable properties and a section presenting copyable static markup language instructions including the one or more instructions defining the preview of the configurable control and one or more disabled content management system instructions defining the configurable control, the copyable static markup language instructions including customization defined by the editable properties. 19. The one or more computer-readable storage media of claim 10 wherein the enabling operation comprises:
removing one or more comment structures used to disable the one or more content management system instructions. 20. A system comprising:
a markup language converter configured to access a web template including one or more content management system instruction defining the configurable control, the one or more content management system instructions being disabled within the web template, the markup language converter being further configured to enable the one or more content management system instructions defining the configurable control; and a web server configured to render the web template using the one or more enabled content management system instructions for the configurable control. | 2,100 |
4,732 | 14,010,863 | 2,167 | A computer implemented method for target group management is described. The method includes producing a table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes, and producing a visual representation of a marketing campaign, the representation including one or more instances of defined contact group entities, with the one or more instances having a second set of group attributes and with the representation linked to the table according to the second set of group attributes. | 1. A computer-implemented method for target group management, comprising:
producing a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and producing a visual representation of a marketing campaign, wherein the representation including one or more instances of defined contact group entities, the one or more instances having a second set of group attributes, and the representation linked to the table according to the second set of group attributes. 2. The method of claim 6, wherein
the second set of group attributes correspond to the first set of group attributes, and the table and the flowchart representing promotions assigned to contact group entities in a marketing campaign. 3. The method of claim 1, wherein
the one or more first group attributes comprise:
a group name, and
a group code corresponding to a group of contact entities. 4. The method of claim 1, wherein
the one or more first group attributes comprise one or more group-level custom attributes, and the one or more group-level custom attributes corresponding to metadata associated with the group. 5. The method of claim 2, wherein
the group code is a first group code, and each of the one or more flowchart instances comprise a second group code corresponding to a first group code of one or more group spreadsheet records. 6. The method of claim 1, wherein
the table is a spreadsheet, and the visual representation is flowchart. 7. The method of claim 6, further comprising
updating the one or more first group attributes of one or more of the group spreadsheet records; and mirroring the updating in the one or more second group attributes of the one or more flowchart instances corresponding to the one or more first group attributes of the one or more group spreadsheet records. 8. The method of claim 6, further comprising
updating the one or more second group attributes of one or more of the flowchart instances; and mirroring the updating in the one or more first group attributes of the one or more group spreadsheet records corresponding to the one or more second group attributes of the one or more flowchart instances. 9. The method of claim 6, further comprising
linking one or more group spreadsheet records with one or more flowchart instances; and populating the first group attributes of the one or more group spreadsheet records from the second group attributes of the one or more flowchart instances. 10-13. (canceled) 14. A computer program product residing on a computer readable storage medium for target group management, comprising
computer readable instructions for causing a computer hardware system to:
produce a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and
produce a visual representation of a marketing campaign, wherein
the representation including one or more instances of defined contact group entities,
the one or more instances having a second set of group attributes, and
the representation linked to the table according to the second set of group attributes. 15. The computer program product of claim 19, wherein
the second set of group attributes correspond to the first set of group attributes, and the table and the flowchart representing promotions assigned to contact group entities in a marketing campaign. 16. The computer program product of claim 14, wherein
the one or more first group attributes comprise:
a group name, and
a group code corresponding to a group of contact entities. 17. The computer program product of claim 14, wherein
the one or more first group attributes comprise one or more group-level custom attributes, and the one or more group-level custom attributes corresponding to metadata associated with the group. 18. The computer program product of claim 15, wherein
the group code is a first group code, and each of the one or more flowchart instances comprise a second group code corresponding to a first group code of one or more group spreadsheet records. 19. The computer program product of claim 14, wherein
the table is a spreadsheet and the visual representation is flowchart. 20. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
update the one or more first group attributes of one or more of the group spreadsheet records; and mirror the updating in the one or more second group attributes of the one or more flowchart instances corresponding to the one or more first group attributes of the one or more group spreadsheet records. 21. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
update the one or more second group attributes of one or more of the flowchart instances; and mirror the updating in the one or more first group attributes of the one or more group spreadsheet records corresponding to the one or more second group attributes of the one or more flowchart instances. 22. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
link one or more group spreadsheet records with one or more flowchart instances; and populate the first group attributes of the one or more group spreadsheet records from the second group attributes of the one or more flowchart instances. 23-26. (canceled) 27. An apparatus, comprising:
a processor; and memory executing a computer program product for target group management, the computer program product comprising instructions for causing the processor to:
produce a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and
produce a visual representation of a marketing campaign, wherein
the representation including one or more instances of defined contact group entities, with the one or more instances having a second set of group attributes, and the representation linked to the table according to the second set of group attributes. | A computer implemented method for target group management is described. The method includes producing a table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes, and producing a visual representation of a marketing campaign, the representation including one or more instances of defined contact group entities, with the one or more instances having a second set of group attributes and with the representation linked to the table according to the second set of group attributes.1. A computer-implemented method for target group management, comprising:
producing a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and producing a visual representation of a marketing campaign, wherein the representation including one or more instances of defined contact group entities, the one or more instances having a second set of group attributes, and the representation linked to the table according to the second set of group attributes. 2. The method of claim 6, wherein
the second set of group attributes correspond to the first set of group attributes, and the table and the flowchart representing promotions assigned to contact group entities in a marketing campaign. 3. The method of claim 1, wherein
the one or more first group attributes comprise:
a group name, and
a group code corresponding to a group of contact entities. 4. The method of claim 1, wherein
the one or more first group attributes comprise one or more group-level custom attributes, and the one or more group-level custom attributes corresponding to metadata associated with the group. 5. The method of claim 2, wherein
the group code is a first group code, and each of the one or more flowchart instances comprise a second group code corresponding to a first group code of one or more group spreadsheet records. 6. The method of claim 1, wherein
the table is a spreadsheet, and the visual representation is flowchart. 7. The method of claim 6, further comprising
updating the one or more first group attributes of one or more of the group spreadsheet records; and mirroring the updating in the one or more second group attributes of the one or more flowchart instances corresponding to the one or more first group attributes of the one or more group spreadsheet records. 8. The method of claim 6, further comprising
updating the one or more second group attributes of one or more of the flowchart instances; and mirroring the updating in the one or more first group attributes of the one or more group spreadsheet records corresponding to the one or more second group attributes of the one or more flowchart instances. 9. The method of claim 6, further comprising
linking one or more group spreadsheet records with one or more flowchart instances; and populating the first group attributes of the one or more group spreadsheet records from the second group attributes of the one or more flowchart instances. 10-13. (canceled) 14. A computer program product residing on a computer readable storage medium for target group management, comprising
computer readable instructions for causing a computer hardware system to:
produce a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and
produce a visual representation of a marketing campaign, wherein
the representation including one or more instances of defined contact group entities,
the one or more instances having a second set of group attributes, and
the representation linked to the table according to the second set of group attributes. 15. The computer program product of claim 19, wherein
the second set of group attributes correspond to the first set of group attributes, and the table and the flowchart representing promotions assigned to contact group entities in a marketing campaign. 16. The computer program product of claim 14, wherein
the one or more first group attributes comprise:
a group name, and
a group code corresponding to a group of contact entities. 17. The computer program product of claim 14, wherein
the one or more first group attributes comprise one or more group-level custom attributes, and the one or more group-level custom attributes corresponding to metadata associated with the group. 18. The computer program product of claim 15, wherein
the group code is a first group code, and each of the one or more flowchart instances comprise a second group code corresponding to a first group code of one or more group spreadsheet records. 19. The computer program product of claim 14, wherein
the table is a spreadsheet and the visual representation is flowchart. 20. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
update the one or more first group attributes of one or more of the group spreadsheet records; and mirror the updating in the one or more second group attributes of the one or more flowchart instances corresponding to the one or more first group attributes of the one or more group spreadsheet records. 21. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
update the one or more second group attributes of one or more of the flowchart instances; and mirror the updating in the one or more first group attributes of the one or more group spreadsheet records corresponding to the one or more second group attributes of the one or more flowchart instances. 22. The computer program product of claim 19, further comprising instructions for causing the computer hardware system to:
link one or more group spreadsheet records with one or more flowchart instances; and populate the first group attributes of the one or more group spreadsheet records from the second group attributes of the one or more flowchart instances. 23-26. (canceled) 27. An apparatus, comprising:
a processor; and memory executing a computer program product for target group management, the computer program product comprising instructions for causing the processor to:
produce a computer data table including one or more group entries corresponding to one or more defined contact group entities with each of the entries having a first set of group attributes; and
produce a visual representation of a marketing campaign, wherein
the representation including one or more instances of defined contact group entities, with the one or more instances having a second set of group attributes, and the representation linked to the table according to the second set of group attributes. | 2,100 |
4,733 | 14,306,640 | 2,195 | A technique for assigning physical resources of a data processing system to a virtual machine (VM) includes reading, by a hypervisor executing on the data processing system, a fold factor attribute for the VM. The fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM. The technique also includes mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. | 1-7. (canceled) 8. A computer program product, comprising:
a computer-readable storage device; and program code embodied on the computer-readable storage device, wherein the program code, when executed on a processor, configures the processor to:
read a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of a data processing system by the VM; and
map, based on a value of the fold factor attribute, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 9. The computer program product of claim 8, wherein the fold factor attribute is a processor fold factor attribute. 10. The computer program product of claim 8, wherein the fold factor attribute is a memory fold factor attribute. 11. The computer program product of claim 8, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 12. The computer program product of claim 8, wherein the physical resources include multiple processor cores. 13. The computer program product of claim 12, wherein the physical resources include respective local memory associated with each of the multiple processor cores. 14. The computer program product of claim 8, wherein the physical resources include input/output (I/O). 15. A processor, comprising:
a processor core; and a memory coupled to the processor core, wherein the processor core is configured to:
read a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of a data processing system by the VM; and
map, based on a value of the fold factor attribute, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 16. The processor of claim 15, wherein the fold factor attribute is a processor fold factor attribute. 17. The processor of claim 15, wherein the fold factor attribute is a memory fold factor attribute. 18. The processor of claim 15, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 19. The processor of claim 15, wherein the physical resources include multiple processor cores and respective local memory associated with each of the multiple processor cores. 20. The processor of claim 15, wherein the physical resources include input/output (I/O). | A technique for assigning physical resources of a data processing system to a virtual machine (VM) includes reading, by a hypervisor executing on the data processing system, a fold factor attribute for the VM. The fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM. The technique also includes mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized.1-7. (canceled) 8. A computer program product, comprising:
a computer-readable storage device; and program code embodied on the computer-readable storage device, wherein the program code, when executed on a processor, configures the processor to:
read a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of a data processing system by the VM; and
map, based on a value of the fold factor attribute, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 9. The computer program product of claim 8, wherein the fold factor attribute is a processor fold factor attribute. 10. The computer program product of claim 8, wherein the fold factor attribute is a memory fold factor attribute. 11. The computer program product of claim 8, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 12. The computer program product of claim 8, wherein the physical resources include multiple processor cores. 13. The computer program product of claim 12, wherein the physical resources include respective local memory associated with each of the multiple processor cores. 14. The computer program product of claim 8, wherein the physical resources include input/output (I/O). 15. A processor, comprising:
a processor core; and a memory coupled to the processor core, wherein the processor core is configured to:
read a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of a data processing system by the VM; and
map, based on a value of the fold factor attribute, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 16. The processor of claim 15, wherein the fold factor attribute is a processor fold factor attribute. 17. The processor of claim 15, wherein the fold factor attribute is a memory fold factor attribute. 18. The processor of claim 15, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 19. The processor of claim 15, wherein the physical resources include multiple processor cores and respective local memory associated with each of the multiple processor cores. 20. The processor of claim 15, wherein the physical resources include input/output (I/O). | 2,100 |
4,734 | 13,286,040 | 2,128 | A method for quantifying uncertainty in a subterranean formation quality including calculating a plurality of values of a property of an individual block of a grid, calculating a probability of the property in the block, distributing the property and probability of the blocks onto a map, and performing a service on a formation wherein the service comprises information in the property and probability-map. A method for quantifying uncertainty in a subterranean formation quality including calculating a property of an individual block of a grid, calculating a probability of the property of the block, establishing a block value as a representation of a probability resolution, calculating the probability of the block value, distributing the block value and the block value probability onto a map, and performing a service on a formation wherein the service includes information in the map. A well position may be included in the calculation of a block property. | 1. A method for performing an oilfield operation, comprising:
calculating a plurality of values for a property of an individual block within a grid; calculating a probability of the property of the block; distributing the block property and its probability onto a map; and performing a service on a formation wherein the service comprises information in the property and the probability-map. 2. The method of claim 1, wherein the map indicates probability of the property value exceeding a specified threshold value. 3. The method of claim 1, wherein the map indicates the property value corresponding to a specified probability threshold. 4. The method of claim 1, wherein the oilfield operation is selected from the group consisting of CO2 sequestration, enhanced oil recovery, and oil and gas production. 5. The method of claim 1, wherein the map is generated for a plurality of blocks comprising at least one selected from a group consisting of a reservoir, a surface, and a well. 6. The method of claim 1, wherein the property is a predicted measurement response calculated from the group of physical properties consisting of density, resistivity or conductivity, pressure, temperature, saturation, concentration, nuclear capture cross-section, and acoustic velocities. 7. The method of claim 1, wherein the service is selected from the group consisting of evaluating and identifying the location of a monitoring well, evaluating and designing the completion of a monitoring well. 8. The method of claim 1, wherein the probability encompasses a property wherein the signal exceeds the sensitivity threshold of a measurement of the property. 9. The method of claim 6, wherein the probability encompasses a property wherein the signal exceeds the operational limit of the hardware. 10. The method of claim 1, further comprising evaluating and designing a monitoring program. 11. The method of claim 10, further comprising a cross-well or surface to borehole monitoring program. 12. A method for performing an oilfield operation, comprising:
evaluating an uncertainty of a predicted measurement value of a block in a grid; estimating a probability that the predicted measurement value exceeds a threshold value; applying a global sensitivity analysis to the estimated probability value in the blocks of the grid; identifying a reservoir property that influences the estimated uncertainty using the analysis; and performing a service on a formation wherein the service comprises information in the grid. 13. The method of claim 12, wherein the identifying the property comprises quantifying a contribution of the property to the estimated uncertainty. 14. The method of claim 12, wherein the service comprises the measurement of the identified reservoir property. 15. The method of claim 12, further comprising using the reservoir property in a reservoir characterization program. 16. The method of claim 12, wherein the operation comprises CO2 storage, well monitoring, well location placement, sweep efficiency analysis, or surface to borehole monitoring. | A method for quantifying uncertainty in a subterranean formation quality including calculating a plurality of values of a property of an individual block of a grid, calculating a probability of the property in the block, distributing the property and probability of the blocks onto a map, and performing a service on a formation wherein the service comprises information in the property and probability-map. A method for quantifying uncertainty in a subterranean formation quality including calculating a property of an individual block of a grid, calculating a probability of the property of the block, establishing a block value as a representation of a probability resolution, calculating the probability of the block value, distributing the block value and the block value probability onto a map, and performing a service on a formation wherein the service includes information in the map. A well position may be included in the calculation of a block property.1. A method for performing an oilfield operation, comprising:
calculating a plurality of values for a property of an individual block within a grid; calculating a probability of the property of the block; distributing the block property and its probability onto a map; and performing a service on a formation wherein the service comprises information in the property and the probability-map. 2. The method of claim 1, wherein the map indicates probability of the property value exceeding a specified threshold value. 3. The method of claim 1, wherein the map indicates the property value corresponding to a specified probability threshold. 4. The method of claim 1, wherein the oilfield operation is selected from the group consisting of CO2 sequestration, enhanced oil recovery, and oil and gas production. 5. The method of claim 1, wherein the map is generated for a plurality of blocks comprising at least one selected from a group consisting of a reservoir, a surface, and a well. 6. The method of claim 1, wherein the property is a predicted measurement response calculated from the group of physical properties consisting of density, resistivity or conductivity, pressure, temperature, saturation, concentration, nuclear capture cross-section, and acoustic velocities. 7. The method of claim 1, wherein the service is selected from the group consisting of evaluating and identifying the location of a monitoring well, evaluating and designing the completion of a monitoring well. 8. The method of claim 1, wherein the probability encompasses a property wherein the signal exceeds the sensitivity threshold of a measurement of the property. 9. The method of claim 6, wherein the probability encompasses a property wherein the signal exceeds the operational limit of the hardware. 10. The method of claim 1, further comprising evaluating and designing a monitoring program. 11. The method of claim 10, further comprising a cross-well or surface to borehole monitoring program. 12. A method for performing an oilfield operation, comprising:
evaluating an uncertainty of a predicted measurement value of a block in a grid; estimating a probability that the predicted measurement value exceeds a threshold value; applying a global sensitivity analysis to the estimated probability value in the blocks of the grid; identifying a reservoir property that influences the estimated uncertainty using the analysis; and performing a service on a formation wherein the service comprises information in the grid. 13. The method of claim 12, wherein the identifying the property comprises quantifying a contribution of the property to the estimated uncertainty. 14. The method of claim 12, wherein the service comprises the measurement of the identified reservoir property. 15. The method of claim 12, further comprising using the reservoir property in a reservoir characterization program. 16. The method of claim 12, wherein the operation comprises CO2 storage, well monitoring, well location placement, sweep efficiency analysis, or surface to borehole monitoring. | 2,100 |
4,735 | 14,491,391 | 2,195 | A technique for assigning physical resources of a data processing system to a virtual machine (VM) includes reading, by a hypervisor executing on the data processing system, a fold factor attribute for the VM. The fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM. The technique also includes mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. | 1. A method of assigning physical resources of a data processing system to a virtual machine, comprising:
reading, by a hypervisor executing on a data processing system, a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM; and mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 2. The method of claim 1, wherein the fold factor attribute is a processor fold factor attribute. 3. The method of claim 1, wherein the fold factor attribute is a memory fold factor attribute. 4. The method of claim 1, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 5. The method of claim 1, wherein the physical resources include multiple processor cores. 6. The method of claim 5, wherein the physical resources include respective local memory associated with each of the multiple processor cores. 7. The method of claim 1, wherein the physical resources include multiple processor cores, memory, and input/output (I/O). | A technique for assigning physical resources of a data processing system to a virtual machine (VM) includes reading, by a hypervisor executing on the data processing system, a fold factor attribute for the VM. The fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM. The technique also includes mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized.1. A method of assigning physical resources of a data processing system to a virtual machine, comprising:
reading, by a hypervisor executing on a data processing system, a fold factor attribute for a virtual machine (VM), wherein the fold factor attribute defines an anticipated usage of physical resources of the data processing system by the VM; and mapping based on a value of the fold factor attribute, by the hypervisor, allocated virtual processors of the VM to the physical resources to maximize processor core access to local memory for ones of the allocated virtual processors that are anticipated to be utilized. 2. The method of claim 1, wherein the fold factor attribute is a processor fold factor attribute. 3. The method of claim 1, wherein the fold factor attribute is a memory fold factor attribute. 4. The method of claim 1, wherein the fold factor attribute includes a processor fold factor attribute and a memory fold factor attribute. 5. The method of claim 1, wherein the physical resources include multiple processor cores. 6. The method of claim 5, wherein the physical resources include respective local memory associated with each of the multiple processor cores. 7. The method of claim 1, wherein the physical resources include multiple processor cores, memory, and input/output (I/O). | 2,100 |
4,736 | 15,136,314 | 2,124 | A method of increasing the processing speed of a computer having a computer processing unit that executes a nonlinear optimization routine is described. A favorable approximation of the derivative f′ (x+αd) at the critical point can be obtained by one differential calculation at each search step. As a result, when a large-scale nonlinear optimization problem requiring a large amount of calculations is processed, m k at each search step is reduced and consequently the calculation time T is reduced significantly. | 1. A method of increasing the processing speed of a computer having a computer processing unit that executes a non-linear optimization routine, comprising:
the computer processing unit executing a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f (x), each search step includes:
a) assigning a vector g a gradient of f(x);
b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size;
c) using g and the determined search direction vector and step size to approximate a gradient of f(x);
d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion;
e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b);
f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 2. The method of claim 1, wherein outputting x from the computer processing unit comprises outputting x to an application system. 3. The method of claim 1, wherein outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, or to a control system. 4. The method of claim 1, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 5. The method of claim 1, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. 6. A processing system that performs non-linear optimization with increased processing speed, comprising:
a computer having memory and a computer processing unit connected to the memory; the memory storing therein a non-linear optimization program that is executed by the computer processing unit for causing the computer to execute a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f(x), each search step includes:
a) assigning a vector g a gradient of f(x);
b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size;
c) using g and the determined search direction vector and step size to approximate a gradient of f(x);
d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion;
e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b);
f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 7. The processing system of claim 6, wherein outputting x from the computer processing unit comprises outputting x to an application system. 8. The processing system of claim 6, wherein outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, or a control system, all of which receive x from the computer processing unit. 9. The processing system of claim 6, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 10. The processing system of claim 6, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. 11. Anon-transitory computer readable medium having recorded thereon a non-linear optimization program that is executable by a computer processing unit of a computer for causing the computer to execute a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f(x), where each search step includes:
a) assigning a vector g a gradient of f(x); b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size; c) using g and the determined search direction vector and step size to approximate a gradient of f(x); d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion; e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b); f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 12. The non-transitory computer readable medium of claim 11, outputting x from the computer processing unit comprises outputting x to an application system. 13. The non-transitory computer readable medium of claim 11, outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, an automatic driving system, or to a control system. 14. The non-transitory computer readable medium of claim 11, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 15. The non-transitory computer readable medium of claim 11, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. | A method of increasing the processing speed of a computer having a computer processing unit that executes a nonlinear optimization routine is described. A favorable approximation of the derivative f′ (x+αd) at the critical point can be obtained by one differential calculation at each search step. As a result, when a large-scale nonlinear optimization problem requiring a large amount of calculations is processed, m k at each search step is reduced and consequently the calculation time T is reduced significantly.1. A method of increasing the processing speed of a computer having a computer processing unit that executes a non-linear optimization routine, comprising:
the computer processing unit executing a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f (x), each search step includes:
a) assigning a vector g a gradient of f(x);
b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size;
c) using g and the determined search direction vector and step size to approximate a gradient of f(x);
d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion;
e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b);
f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 2. The method of claim 1, wherein outputting x from the computer processing unit comprises outputting x to an application system. 3. The method of claim 1, wherein outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, or to a control system. 4. The method of claim 1, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 5. The method of claim 1, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. 6. A processing system that performs non-linear optimization with increased processing speed, comprising:
a computer having memory and a computer processing unit connected to the memory; the memory storing therein a non-linear optimization program that is executed by the computer processing unit for causing the computer to execute a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f(x), each search step includes:
a) assigning a vector g a gradient of f(x);
b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size;
c) using g and the determined search direction vector and step size to approximate a gradient of f(x);
d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion;
e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b);
f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 7. The processing system of claim 6, wherein outputting x from the computer processing unit comprises outputting x to an application system. 8. The processing system of claim 6, wherein outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, or a control system, all of which receive x from the computer processing unit. 9. The processing system of claim 6, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 10. The processing system of claim 6, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. 11. Anon-transitory computer readable medium having recorded thereon a non-linear optimization program that is executable by a computer processing unit of a computer for causing the computer to execute a plurality of search steps to improve a vector x so that x minimizes or maximizes a value of a function of x, f(x), where each search step includes:
a) assigning a vector g a gradient of f(x); b) using g to determine a search direction vector, determining a step size, and changing x by using the determined search direction vector and step size; c) using g and the determined search direction vector and step size to approximate a gradient of f(x); d) determining if f(x) is close to a minimum or a maximum by using a convergence criterion; e) if f(x) is not close to the minimum or the maximum, assigning the gradient of f(x) to g and returning to step b); f) if f (x) is close to the minimum or the maximum, outputting x from the computer processing unit. 12. The non-transitory computer readable medium of claim 11, outputting x from the computer processing unit comprises outputting x to an application system. 13. The non-transitory computer readable medium of claim 11, outputting x from the computer processing unit comprises outputting x to a control simulation system, a solver system, a machine learning system, an artificial neural network, a recognition system, a forecasting system, an automatic operation system, an automatic driving system, an automatic driving system, or to a control system. 14. The non-transitory computer readable medium of claim 11, wherein the computer processing unit comprises computer hardware that executes programmed instructions. 15. The non-transitory computer readable medium of claim 11, wherein the computer processing unit comprises one or more of a single core central processing unit, a multi-core processing unit, a graphical processing unit, and a computer cluster. | 2,100 |
4,737 | 14,529,757 | 2,158 | Methods, systems, and apparatus for generating a query are described. A query submitted by a user is accessed and the submitted query is identified as corresponding to a theme by determining a strength score of the submitted query. In one example embodiment, the strength score indicates a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query. A thematic query is generated based on the submitted query and the determined strength score. | 1. A system comprising:
an access module configured to access a query submitted by a user; an identification module, executable by a processor and configured to identify the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query; and a query module to generate a thematic query based on the submitted query and the determined strength score. 2. The system of claim 1, wherein:
the submitted query is submitted by a particular user having a particular username that corresponds to a particular activity level with respect to a network-based system; and the determining of the strength score is based on the particular username corresponding to the particular activity level. 3. The system of claim 2, wherein:
a further query among a plurality of submitted queries is submitted by a further user among a plurality of users, the further user having a further username that corresponds to a different activity level; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 4. The system of claim 2, wherein:
the particular activity level transgresses a threshold activity level that indicates a minimum level of activity with respect to the network-based system; and the particular activity level is representative of at least one of a number of transactions conducted using the network-based system, a number of queries submitted to the network-based system, an age of the username, or a reputation score of the username. 5. The system of claim 1, wherein:
the submitted query is submitted within a time span that includes a reference time; and the determining of the strength score is based on the submitted query being submitted within the time span. 6. The system of claim 5, wherein:
the reference time marks a periodic event; and at least some of the time span is precedent to the reference time that marks the periodic event. 7. The system of claim 6, wherein:
the periodic event is at least one of an annual event, it monthly event, a calendar event, an astronomical event, a religious event, a government event, a holiday, or a season. 8. The system of claim 5, wherein:
the reference time marks a news event; and at least some of the time span is subsequent to the reference time that marks the news event. 9. The system of claim 8, wherein:
the news event is at least one of a press release, a blog posting, a social network posting, or a publication of a news report. 10. A method comprising:
accessing a query submitted by a user; identifying the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query, the identifying being performed by a processor; and generating a thematic query based on the submitted query and the determined strength score, the thematic query being different than the submitted query. 11. The method of claim 10, further comprising:
obtaining search results by executing the thematic query, the search results referencing a plurality of items that each correspond to the theme; and presenting at least some of the plurality of items in a single collection that corresponds to the theme. 12. The method of claim 10, wherein:
the submitted query includes multiple search criteria; and the determining of the strength score is based on a count of the multiple search criteria. 13. The method of claim 12, wherein:
a further query among a plurality of submitted queries includes only one search criterion; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 14. The method of claim 10, wherein:
the submitted query and a different query among a plurality of submitted queries are submitted in a single browser session that corresponds to a session identifier; the determining of the strength score is based on the submitted query and the different query being submitted in the single browser session. 15. The method of claim 14, wherein:
a further query among the plurality of submitted queries is submitted in a different browser session; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 16. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing a query submitted by a user; identifying the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query; and generating a thematic query based on the submitted query and the determined strength score, the thematic query being different than the submitted query. 17. The non-transitory machine-rear able storage medium of claim 16, wherein:
the submitted query and a further query among a plurality of submitted queries are submitted within a time span; and the determining of the strength score includes determining that a subset of the plurality of submitted queries is submitted during the time span. 18. The non-transitory machine-readable storage medium of claim 17, wherein:
the subset is indicative of an increase in submission of queries that correspond to the theme; and the determining of the strength score includes determining that the time span is less than an average time span for submission of queries that correspond to the theme. 19. The non-transitory machine-readable storage medium of claim 17, wherein:
the subset is indicative of a decrease in submission of queries that correspond to the theme; and the determining of the strength score includes determining that the time span is greater than an average time span for submission of queries that correspond to the theme. 20. The non-transitory machine-readable storage medium of claim 16, wherein:
the theme includes a descriptive token absent from the submitted query; and the submitted query is included in a plurality of submitted queries. | Methods, systems, and apparatus for generating a query are described. A query submitted by a user is accessed and the submitted query is identified as corresponding to a theme by determining a strength score of the submitted query. In one example embodiment, the strength score indicates a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query. A thematic query is generated based on the submitted query and the determined strength score.1. A system comprising:
an access module configured to access a query submitted by a user; an identification module, executable by a processor and configured to identify the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query; and a query module to generate a thematic query based on the submitted query and the determined strength score. 2. The system of claim 1, wherein:
the submitted query is submitted by a particular user having a particular username that corresponds to a particular activity level with respect to a network-based system; and the determining of the strength score is based on the particular username corresponding to the particular activity level. 3. The system of claim 2, wherein:
a further query among a plurality of submitted queries is submitted by a further user among a plurality of users, the further user having a further username that corresponds to a different activity level; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 4. The system of claim 2, wherein:
the particular activity level transgresses a threshold activity level that indicates a minimum level of activity with respect to the network-based system; and the particular activity level is representative of at least one of a number of transactions conducted using the network-based system, a number of queries submitted to the network-based system, an age of the username, or a reputation score of the username. 5. The system of claim 1, wherein:
the submitted query is submitted within a time span that includes a reference time; and the determining of the strength score is based on the submitted query being submitted within the time span. 6. The system of claim 5, wherein:
the reference time marks a periodic event; and at least some of the time span is precedent to the reference time that marks the periodic event. 7. The system of claim 6, wherein:
the periodic event is at least one of an annual event, it monthly event, a calendar event, an astronomical event, a religious event, a government event, a holiday, or a season. 8. The system of claim 5, wherein:
the reference time marks a news event; and at least some of the time span is subsequent to the reference time that marks the news event. 9. The system of claim 8, wherein:
the news event is at least one of a press release, a blog posting, a social network posting, or a publication of a news report. 10. A method comprising:
accessing a query submitted by a user; identifying the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query, the identifying being performed by a processor; and generating a thematic query based on the submitted query and the determined strength score, the thematic query being different than the submitted query. 11. The method of claim 10, further comprising:
obtaining search results by executing the thematic query, the search results referencing a plurality of items that each correspond to the theme; and presenting at least some of the plurality of items in a single collection that corresponds to the theme. 12. The method of claim 10, wherein:
the submitted query includes multiple search criteria; and the determining of the strength score is based on a count of the multiple search criteria. 13. The method of claim 12, wherein:
a further query among a plurality of submitted queries includes only one search criterion; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 14. The method of claim 10, wherein:
the submitted query and a different query among a plurality of submitted queries are submitted in a single browser session that corresponds to a session identifier; the determining of the strength score is based on the submitted query and the different query being submitted in the single browser session. 15. The method of claim 14, wherein:
a further query among the plurality of submitted queries is submitted in a different browser session; and the determining of the strength score includes determining that the pertinence of the submitted query to the theme is greater than a further pertinence of the further query to the theme. 16. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing a query submitted by a user; identifying the submitted query as corresponding to a theme by determining a strength score of the submitted query, the strength score indicating a pertinence of the submitted query to the theme, the theme being a descriptor of a concept that is applicable to the submitted query; and generating a thematic query based on the submitted query and the determined strength score, the thematic query being different than the submitted query. 17. The non-transitory machine-rear able storage medium of claim 16, wherein:
the submitted query and a further query among a plurality of submitted queries are submitted within a time span; and the determining of the strength score includes determining that a subset of the plurality of submitted queries is submitted during the time span. 18. The non-transitory machine-readable storage medium of claim 17, wherein:
the subset is indicative of an increase in submission of queries that correspond to the theme; and the determining of the strength score includes determining that the time span is less than an average time span for submission of queries that correspond to the theme. 19. The non-transitory machine-readable storage medium of claim 17, wherein:
the subset is indicative of a decrease in submission of queries that correspond to the theme; and the determining of the strength score includes determining that the time span is greater than an average time span for submission of queries that correspond to the theme. 20. The non-transitory machine-readable storage medium of claim 16, wherein:
the theme includes a descriptive token absent from the submitted query; and the submitted query is included in a plurality of submitted queries. | 2,100 |
4,738 | 13,400,263 | 2,154 | A recommendation method includes receiving a user's review of an item that includes a textual comment. Deficient features of the reviewed item are identified from the text by applying a set of extraction patterns. Each pattern is satisfied when a term in the text, which is associated in a structured terminology with one of a predefined set of features, is in a syntactic relation with another term in the text, such as a polar adjective or expression of a wish or a lack. When such a pattern is satisfied, the corresponding feature is considered a deficient feature. Feature attributes of the reviewed item are compared with corresponding feature attributes of a set of items to identify any improved items whose attribute for the deficient feature is better than that for the reviewed item. The improved item or items can be recommended to the user or to others reading the review. | 1. A method for generating recommendations comprising:
receiving a user's review of an item which includes a textual comment; applying a set of extraction patterns to the textual comment, each of the extraction patterns being configured to identify a deficient feature of the item based on a finding of a specified syntactic relation between words of the textual comment; providing for when a deficient feature is identified:
identifying an attribute of each of a plurality of features for the reviewed item, the plurality of features including the identified deficient feature;
comparing the identified attributes of the reviewed item with stored attributes for the plurality of features for items in a set of items to identify an improved item from the set of items which has an attribute for the deficient feature which is determined to be an improvement over the attribute of the deficient feature for the reviewed item; and
generating a recommendation for the identified improved item. 2. The method of claim 1, wherein at least one of the identifying of the deficient feature, identifying of attributes, comparing, and generating is performed with a computer processor. 3. The method of claim 1, comprising providing a structured terminology which, for each of the features in the set, includes a set of associated terms, the at least one extraction pattern being configured for identifying the specified syntactic relation between one of the associated terms and another term in the textual review, the deficient feature being identified as the feature with which the associated term is associated. 4. The method of claim 3, wherein at least one of the extraction patterns is configured for identifying a negative opinion of the item from the textual review, wherein the other term in the extraction pattern being found in a polar vocabulary which assigns a polarity to each of a set of polar terms. 5. The method of claim 1, wherein at least one of the extraction patterns is configured for identifying a suggestion of improvement for the item from the textual review. 6. The method of claim 5, wherein the other term in the extraction pattern is found in a thesaurus of terms relating to at least one of a lack and a wish. 7. The method of claim 1, wherein the identification of the attributes of the reviewed item comprises extracting, from the review, item identification information for the reviewed item and wherein the identification of the attributes of the reviewed item are identified based on the item identification information. 8. The method of claim 1, wherein the comparing of the identified attributes of the reviewed item with the stored attributes for the set of items comprises identifying items which have attributes which match the respective attributes of the reviewed item, and wherein the identified improved item has an attribute for the deficient feature which is better than the attribute of the deficient feature for the reviewed item. 9. The method of claim 8, wherein the identifying items which have attributes which match the respective attributes of the reviewed item comprises, for at least one of the features other than the deficient feature, identifying items which have a respective attribute which is in a same range as the attribute of the reviewed item. 10. The method of claim 1, wherein the generating a recommendation for the identified improved item comprises adding, to the review, a link to a description of the improved item. 11. The method of claim 1, wherein the item comprises a product or service. 12. The method of claim 1, wherein the item comprises a non-transitory product. 13. A system comprising memory which stores instructions for performing the method of claim 1 and a processor, in communication with the memory, for executing the instructions. 14. A computer program product comprising a non-transitory recording medium storing instructions, which when executed on a computer, causes the computer to perform the method of claim 1. 15. A system for generating recommendations comprising:
a semantic extraction component configured to identify a deficient feature of a reviewed item from a textual comment in a user's review of the item using a set of extraction patterns, each of the extraction patterns configured for identifying a specified syntactic relation between words of the textual comment; a mapping component configured to query an associated database with attributes of the reviewed item for identifying improved items, the associated database including, for each of a set of items, attributes for each of a set of features, the set of features including the identified deficient feature, each of the identified improved items having an attribute which is determined to be better, for the deficient feature, than the attribute of the reviewed item; a recommendation generator configured to generate a recommendation for the identified improved item; and a processor which implements the semantic extraction component, mapping component, and the recommendation generator. 16. The system of claim 15, further comprising a structured terminology stored in memory which, for each of the features in the set, includes a set of associated terms, at least one of the extraction patterns being configured for identifying when one of the associated terms from the structured ontology is in the specified syntactic relation, the deficient feature being identified as the feature with which the associated term is associated. 17. The system of claim 15, further comprising a polar vocabulary stores in memory which assigns a polarity to each of a set of polar terms and wherein at least one of the extraction patterns specifies that the syntactic relation includes one of the terms from the polar vocabulary. 18. The system of claim 15, further comprising a thesaurus of terms relating to wish or lack stored in memory and wherein at least one of the extraction patterns specifies that the syntactic relation includes one of the terms from the thesaurus. 19. The system of claim 15, wherein the semantic extraction component comprises an opinion detection component which applies extraction patterns for detecting negative opinions about features of reviewed items and a suggestion extraction component which applies extraction patterns for detecting suggestions for improvement in features of reviewed items. 20. A method for generating recommendations comprising:
receiving a user's review of an item which includes a textual comment; applying extraction patterns to the textual comment, each of the patterns being satisfied when a first term in a textual comment is in a syntactic relation with a second term in the textual comment, the first term being associated in memory with one of a set of features, the second term comprising a term from a polar vocabulary or an expression of a wish or a lack; when one of the extraction patterns is satisfied, identifying the associated feature as a deficient feature of the reviewed item; comparing feature attributes of the reviewed item with feature attributes of items stored in a database to identify an item in the database for which the feature attribute for the feature identified as deficient in the item is an improvement; and generating a recommendation based on an identified improved item. | A recommendation method includes receiving a user's review of an item that includes a textual comment. Deficient features of the reviewed item are identified from the text by applying a set of extraction patterns. Each pattern is satisfied when a term in the text, which is associated in a structured terminology with one of a predefined set of features, is in a syntactic relation with another term in the text, such as a polar adjective or expression of a wish or a lack. When such a pattern is satisfied, the corresponding feature is considered a deficient feature. Feature attributes of the reviewed item are compared with corresponding feature attributes of a set of items to identify any improved items whose attribute for the deficient feature is better than that for the reviewed item. The improved item or items can be recommended to the user or to others reading the review.1. A method for generating recommendations comprising:
receiving a user's review of an item which includes a textual comment; applying a set of extraction patterns to the textual comment, each of the extraction patterns being configured to identify a deficient feature of the item based on a finding of a specified syntactic relation between words of the textual comment; providing for when a deficient feature is identified:
identifying an attribute of each of a plurality of features for the reviewed item, the plurality of features including the identified deficient feature;
comparing the identified attributes of the reviewed item with stored attributes for the plurality of features for items in a set of items to identify an improved item from the set of items which has an attribute for the deficient feature which is determined to be an improvement over the attribute of the deficient feature for the reviewed item; and
generating a recommendation for the identified improved item. 2. The method of claim 1, wherein at least one of the identifying of the deficient feature, identifying of attributes, comparing, and generating is performed with a computer processor. 3. The method of claim 1, comprising providing a structured terminology which, for each of the features in the set, includes a set of associated terms, the at least one extraction pattern being configured for identifying the specified syntactic relation between one of the associated terms and another term in the textual review, the deficient feature being identified as the feature with which the associated term is associated. 4. The method of claim 3, wherein at least one of the extraction patterns is configured for identifying a negative opinion of the item from the textual review, wherein the other term in the extraction pattern being found in a polar vocabulary which assigns a polarity to each of a set of polar terms. 5. The method of claim 1, wherein at least one of the extraction patterns is configured for identifying a suggestion of improvement for the item from the textual review. 6. The method of claim 5, wherein the other term in the extraction pattern is found in a thesaurus of terms relating to at least one of a lack and a wish. 7. The method of claim 1, wherein the identification of the attributes of the reviewed item comprises extracting, from the review, item identification information for the reviewed item and wherein the identification of the attributes of the reviewed item are identified based on the item identification information. 8. The method of claim 1, wherein the comparing of the identified attributes of the reviewed item with the stored attributes for the set of items comprises identifying items which have attributes which match the respective attributes of the reviewed item, and wherein the identified improved item has an attribute for the deficient feature which is better than the attribute of the deficient feature for the reviewed item. 9. The method of claim 8, wherein the identifying items which have attributes which match the respective attributes of the reviewed item comprises, for at least one of the features other than the deficient feature, identifying items which have a respective attribute which is in a same range as the attribute of the reviewed item. 10. The method of claim 1, wherein the generating a recommendation for the identified improved item comprises adding, to the review, a link to a description of the improved item. 11. The method of claim 1, wherein the item comprises a product or service. 12. The method of claim 1, wherein the item comprises a non-transitory product. 13. A system comprising memory which stores instructions for performing the method of claim 1 and a processor, in communication with the memory, for executing the instructions. 14. A computer program product comprising a non-transitory recording medium storing instructions, which when executed on a computer, causes the computer to perform the method of claim 1. 15. A system for generating recommendations comprising:
a semantic extraction component configured to identify a deficient feature of a reviewed item from a textual comment in a user's review of the item using a set of extraction patterns, each of the extraction patterns configured for identifying a specified syntactic relation between words of the textual comment; a mapping component configured to query an associated database with attributes of the reviewed item for identifying improved items, the associated database including, for each of a set of items, attributes for each of a set of features, the set of features including the identified deficient feature, each of the identified improved items having an attribute which is determined to be better, for the deficient feature, than the attribute of the reviewed item; a recommendation generator configured to generate a recommendation for the identified improved item; and a processor which implements the semantic extraction component, mapping component, and the recommendation generator. 16. The system of claim 15, further comprising a structured terminology stored in memory which, for each of the features in the set, includes a set of associated terms, at least one of the extraction patterns being configured for identifying when one of the associated terms from the structured ontology is in the specified syntactic relation, the deficient feature being identified as the feature with which the associated term is associated. 17. The system of claim 15, further comprising a polar vocabulary stores in memory which assigns a polarity to each of a set of polar terms and wherein at least one of the extraction patterns specifies that the syntactic relation includes one of the terms from the polar vocabulary. 18. The system of claim 15, further comprising a thesaurus of terms relating to wish or lack stored in memory and wherein at least one of the extraction patterns specifies that the syntactic relation includes one of the terms from the thesaurus. 19. The system of claim 15, wherein the semantic extraction component comprises an opinion detection component which applies extraction patterns for detecting negative opinions about features of reviewed items and a suggestion extraction component which applies extraction patterns for detecting suggestions for improvement in features of reviewed items. 20. A method for generating recommendations comprising:
receiving a user's review of an item which includes a textual comment; applying extraction patterns to the textual comment, each of the patterns being satisfied when a first term in a textual comment is in a syntactic relation with a second term in the textual comment, the first term being associated in memory with one of a set of features, the second term comprising a term from a polar vocabulary or an expression of a wish or a lack; when one of the extraction patterns is satisfied, identifying the associated feature as a deficient feature of the reviewed item; comparing feature attributes of the reviewed item with feature attributes of items stored in a database to identify an item in the database for which the feature attribute for the feature identified as deficient in the item is an improvement; and generating a recommendation based on an identified improved item. | 2,100 |
4,739 | 13,726,370 | 2,169 | Risk assessment for a computing system being developed can include receiving a user input specifying a proposed topology for a computing system. The proposed topology is defined by a first software product to be used and an architecture having a first non-functional component. A problem knowledge repository is searched using a processor for records of problems correlated with the proposed topology. A level of risk in implementing the computing system using the proposed topology is calculated according to the searching using the processor. | 1-9. (canceled) 10. A system comprising:
a processor programmed to initiate executable operations comprising: receiving a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching a problem knowledge repository for records of problems correlated with the proposed topology; and calculating a level of risk in implementing the computing system using the proposed topology according to the searching. 11. The system of claim 10, wherein the processor is further programmed to initiate an executable operation comprising:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 12. The system of claim 11, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 13. The system of claim 11, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 14. The system of claim 10, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 15. The system of claim 14, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 16. The system of claim 10, wherein a type is specified for the first non-functional component. 17. The system of claim 16, wherein a selected implementation is specified for the first non-functional component. 18. A computer program product for assessing risk of a computing system, the 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, using the processor, a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching, using the processor, a problem knowledge repository for records of problems correlated with the proposed topology; and calculating, using the processor, a level of risk in implementing the computing system using the proposed topology according to the searching. 19. The computer program product of claim 18, wherein the method further comprises:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 20. The computer program product of claim 19, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 21. The computer program product of claim 19, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 22. The computer program product of claim 18, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 23. The computer program product of claim 22, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 24. The computer program product of claim 18, wherein a type is specified for the first non-functional component. 25. The computer program product of claim 24, wherein a selected implementation is specified for the first non-functional component. | Risk assessment for a computing system being developed can include receiving a user input specifying a proposed topology for a computing system. The proposed topology is defined by a first software product to be used and an architecture having a first non-functional component. A problem knowledge repository is searched using a processor for records of problems correlated with the proposed topology. A level of risk in implementing the computing system using the proposed topology is calculated according to the searching using the processor.1-9. (canceled) 10. A system comprising:
a processor programmed to initiate executable operations comprising: receiving a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching a problem knowledge repository for records of problems correlated with the proposed topology; and calculating a level of risk in implementing the computing system using the proposed topology according to the searching. 11. The system of claim 10, wherein the processor is further programmed to initiate an executable operation comprising:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 12. The system of claim 11, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 13. The system of claim 11, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 14. The system of claim 10, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 15. The system of claim 14, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 16. The system of claim 10, wherein a type is specified for the first non-functional component. 17. The system of claim 16, wherein a selected implementation is specified for the first non-functional component. 18. A computer program product for assessing risk of a computing system, the 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, using the processor, a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching, using the processor, a problem knowledge repository for records of problems correlated with the proposed topology; and calculating, using the processor, a level of risk in implementing the computing system using the proposed topology according to the searching. 19. The computer program product of claim 18, wherein the method further comprises:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 20. The computer program product of claim 19, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 21. The computer program product of claim 19, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 22. The computer program product of claim 18, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 23. The computer program product of claim 22, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 24. The computer program product of claim 18, wherein a type is specified for the first non-functional component. 25. The computer program product of claim 24, wherein a selected implementation is specified for the first non-functional component. | 2,100 |
4,740 | 14,024,711 | 2,169 | Risk assessment for a computing system being developed can include receiving a user input specifying a proposed topology for a computing system. The proposed topology is defined by a first software product to be used and an architecture having a first non-functional component. A problem knowledge repository is searched using a processor for records of problems correlated with the proposed topology. A level of risk in implementing the computing system using the proposed topology is calculated according to the searching using the processor. | 1. A method, comprising:
receiving a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching, using a processor, a problem knowledge repository for records of problems correlated with the proposed topology; and calculating, using the processor, a level of risk in implementing the computing system using the proposed topology according to the searching. 2. The method of claim 1, further comprising:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 3. The method of claim 2, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 4. The method of claim 2, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 5. The method of claim 1, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 6. The method of claim 5, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 7. The method of claim 1, wherein the proposed topology is further defined by a use case for the computing system. 8. The method of claim 1, wherein a type is specified for the first non-functional component. 9. The method of claim 8, wherein a selected implementation is specified for the first non-functional component. 10-25. (canceled) | Risk assessment for a computing system being developed can include receiving a user input specifying a proposed topology for a computing system. The proposed topology is defined by a first software product to be used and an architecture having a first non-functional component. A problem knowledge repository is searched using a processor for records of problems correlated with the proposed topology. A level of risk in implementing the computing system using the proposed topology is calculated according to the searching using the processor.1. A method, comprising:
receiving a user input specifying a proposed topology for a computing system, wherein the proposed topology is defined by a first software product to be used and an architecture having a first non-functional component; searching, using a processor, a problem knowledge repository for records of problems correlated with the proposed topology; and calculating, using the processor, a level of risk in implementing the computing system using the proposed topology according to the searching. 2. The method of claim 1, further comprising:
determining an alternative topology for the computing system having a lower level of risk than the proposed topology. 3. The method of claim 2, wherein the alternative topology comprises a second non-functional component in place of the first non-functional component. 4. The method of claim 2, wherein the alternative topology is determined responsive to determining that the level of risk of the proposed topology exceeds a risk threshold. 5. The method of claim 1, wherein the proposed topology is further defined by a plurality of nodes and a communication link between at least two of the plurality of nodes. 6. The method of claim 5, wherein the proposed topology is further defined by an application programming interface used by at least one of the nodes of the communication link. 7. The method of claim 1, wherein the proposed topology is further defined by a use case for the computing system. 8. The method of claim 1, wherein a type is specified for the first non-functional component. 9. The method of claim 8, wherein a selected implementation is specified for the first non-functional component. 10-25. (canceled) | 2,100 |
4,741 | 14,193,019 | 2,193 | Certain embodiments disclosed herein relate to compositions, methods, devices, systems, and products regarding frozen particles. In certain embodiments, the frozen particles include materials at low temperatures. In certain embodiments, the frozen particles provide vehicles for delivery of particular agents. In certain embodiments, the frozen particles are administered to at least one substrate. | 1. A device, comprising:
at least one propulsion means configured for propelling at least one therapeutic composition to a biological tissue; at least one delivery means operably linked to the at least one propulsion means and configured for administration of the at least one therapeutic composition to a biological tissue; at least one ultrasonic image detector; at least one microprocessor in electronic communication with at least one of the at least one propulsion means, the at least one delivery means, or the at least one ultrasonic image detector, and configured to provide real-time feedback of at least one characteristic of the delivery of the at least one therapeutic composition to the biological tissue. 2. The device of claim 1, wherein the device provides output related to the feedback. 3. The device of claim 1, wherein the at least one microprocessor is further configured to instruct alteration of the delivery of the at least one therapeutic composition based on the real-time feedback. 4. The device of claim 3, wherein the real-time feedback of delivery of at least one therapeutic composition is utilized to alter the delivery of at least one subsequent therapeutic composition. 5. The device of claim 1, wherein the propulsion means includes at least one mechanical or electrical propulsion means. 6. The device of claim 1, wherein the propulsion means includes at least one of an inkjet ejector, fluid ejector, striker, or thermal bubble propulsion. 7. The device of claim 1, wherein the biological tissue includes at least one of skin tissue, muscle tissue, eye tissue, nervous tissue, peritoneal tissue, an organ, connective tissue, neoplastic tissue, or bone tissue. 8. The device of claim 6, wherein the eye tissue includes at least one of retinal tissue, vitreal tissue, ductal tissue, scleral tissue, corneal tissue, lens tissue, lacrimal tissue, musculature of the eye, ligamental tissue of the eye, or neural tissue of the eye. 9. The device of claim 1, wherein the biological tissue includes tumor tissue. 10. The device of claim 1, wherein the propulsion means is configured to deliver the at least one therapeutic composition to or at a velocity of approximately 1 m/s, approximately 5 m/s, approximately 10 m/s, approximately 20 m/s, approximately 30 m/s, approximately 40 m/s, approximately 50 m/s, approximately 60 m/s, approximately 70 m/s, approximately 80 m/s, approximately 90 m/s, approximately 100 m/s, approximately 200 m/s, approximately 300 m/s, approximately 400 m/s, approximately 500 m/s, approximately 600 m/s, approximately 700 m/s, approximately 800 m/s, approximately 900 m/s, approximately 1000 m/s, approximately 1500 m/s, approximately 2000 m/s, approximately 3000 m/s, approximately 4000 m/s, approximately 5000 m/s, or any value greater or therebetween. 11. The device of claim 1, wherein the at least one therapeutic composition includes at least one sugar glass. 12. The device of claim 10, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 13. The device of claim 1, wherein the at least one therapeutic composition includes at least one polyol. 14. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 15. The device of claim 13, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 16. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 17. The device of claim 1, wherein the at least one therapeutic composition includes at least one frozen particle composition or frozen piercing implement composition. 18. The device of claim 16, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 19. The device of claim 17, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 20. The device of claim 16, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 21. The device of claim 1, wherein the feedback of the at least one characteristic of the delivery includes one or more of the amount of the at least one therapeutic composition delivered, the content of the at least one therapeutic composition delivered, the depth of penetration of the at least one therapeutic composition, the trajectory of the at least one therapeutic composition, the configuration of the at least one therapeutic composition, status of the at least one therapeutic composition, status of the target biological tissue, determination of first delivery of the at least one therapeutic composition, status of a spatial or temporal delivery pattern, specific spatial or temporal location of the at least one therapeutic composition delivered, velocity of delivery of the at least one therapeutic composition, deceleration of the at least one therapeutic composition upon delivery, or status of the delivery device itself. 22. The device of claim 1, further including at least one magnetic deflector configured to assist in directing the at least one therapeutic composition. 23. The device of claim 1, wherein the at least one therapeutic composition is biodegradable. 24. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one of a therapeutic agent, reinforcement agent, biological remodeling agent, adhesive agent, or abrasive. 25. The device of claim 1, wherein the therapeutic agent includes at least one of an anti-inflammatory agent, coagulant, anti-microbial agent, anesthetic, analgesic; vasodilator, immunological agent, angiogenic factor, anti-angiogenic factor, vasoconstrictor, or growth factor inhibitor. 26. A system, comprising:
a device including at least one propulsion means configured for propelling at least one therapeutic composition to a biological tissue; at least one delivery means operably linked to the at least one propulsion means and configured for administration of the at least one therapeutic composition to a biological tissue; at least one ultrasonic image detector; at least one microprocessor in electronic communication with at least one of the at least one propulsion means, the at least one delivery means, or the at least one ultrasonic image detector, and configured to provide real-time feedback of at least one characteristic of the delivery of the at least one therapeutic composition to the biological tissue. 27. The system of claim 26, wherein the at least one microprocessor is further configured to instruct alteration of the delivery of the at least one therapeutic composition based on the real-time feedback. 28. The system of claim 27, wherein the real-time feedback of delivery of at least one therapeutic composition is utilized to alter the delivery of at least one subsequent therapeutic composition. 29. The system of claim 26, wherein the propulsion means includes at least one mechanical or electrical propulsion means. 30. The system of claim 26, wherein the propulsion means includes at least one of an inkjet ejector, fluid ejector, striker, or thermal bubble propulsion. 31. The system of claim 26, wherein the biological tissue includes at least one of skin tissue, muscle tissue, eye tissue, nervous tissue, peritoneal tissue, an organ, connective tissue, neoplastic tissue, or bone tissue. 32. The system of claim 31, wherein the eye tissue includes at least one of retinal tissue, vitreal tissue, ductal tissue, scleral tissue, corneal tissue, lens tissue, lacrimal tissue, musculature of the eye, ligamental tissue of the eye, or neural tissue of the eye. 33. The system of claim 26, wherein the biological tissue includes tumor tissue. 34. The system of claim 26, wherein the propulsion means is configured to deliver the at least one therapeutic composition to or at a velocity of approximately 1 m/s, approximately 5 m/s, approximately 10 m/s, approximately 20 m/s, approximately 30 m/s, approximately 40 m/s, approximately 50 m/s, approximately 60 m/s, approximately 70 m/s, approximately 80 m/s, approximately 90 m/s, approximately 100 m/s, approximately 200 m/s, approximately 300 m/s, approximately 400 m/s, approximately 500 m/s, approximately 600 m/s, approximately 700 m/s, approximately 800 m/s, approximately 900 m/s, approximately 1000 m/s, approximately 1500 m/s, approximately 2000 m/s, approximately 3000 m/s, approximately 4000 m/s, approximately 5000 m/s, or any value greater or therebetween. 35. The system of claim 26, wherein the at least one therapeutic composition includes at least one sugar glass. 36. The system of claim 35, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 37. The system of claim 26, wherein the at least one therapeutic composition includes at least one polyol. 38. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 39. The system of claim 38, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 40. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 41. The system of claim 26, wherein the at least one therapeutic composition includes at least one frozen particle composition or frozen piercing implement composition. 42. The system of claim 41, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 43. The system of claim 42, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 44. The system of claim 41, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 45. The system of claim 26, wherein the feedback of the at least one characteristic of the delivery includes one or more of the amount of the at least one therapeutic composition delivered, the content of the at least one therapeutic composition delivered, the depth of penetration of the at least one therapeutic composition, the trajectory of the at least one therapeutic composition, the configuration of the at least one therapeutic composition, status of the at least one therapeutic composition, status of the target biological tissue, determination of first delivery of the at least one therapeutic composition, status of a spatial or temporal delivery pattern, specific spatial or temporal location of the at least one therapeutic composition delivered, velocity of delivery of the at least one therapeutic composition, deceleration of the at least one therapeutic composition upon delivery, or status of the delivery device itself. 46. The system of claim 26, further including at least one magnetic deflector configured to assist in directing the at least one therapeutic composition. 47. The system of claim 26, wherein the at least one therapeutic composition is biodegradable. 48. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one of a therapeutic agent, reinforcement agent, biological remodeling agent, adhesive agent, or abrasive. 49. The system of claim 26, wherein the therapeutic agent includes at least one of an anti-inflammatory agent, coagulant, anti-microbial agent, anesthetic, analgesic; vasodilator, immunological agent, angiogenic factor, anti-angiogenic factor, vasoconstrictor, or growth factor inhibitor. | Certain embodiments disclosed herein relate to compositions, methods, devices, systems, and products regarding frozen particles. In certain embodiments, the frozen particles include materials at low temperatures. In certain embodiments, the frozen particles provide vehicles for delivery of particular agents. In certain embodiments, the frozen particles are administered to at least one substrate.1. A device, comprising:
at least one propulsion means configured for propelling at least one therapeutic composition to a biological tissue; at least one delivery means operably linked to the at least one propulsion means and configured for administration of the at least one therapeutic composition to a biological tissue; at least one ultrasonic image detector; at least one microprocessor in electronic communication with at least one of the at least one propulsion means, the at least one delivery means, or the at least one ultrasonic image detector, and configured to provide real-time feedback of at least one characteristic of the delivery of the at least one therapeutic composition to the biological tissue. 2. The device of claim 1, wherein the device provides output related to the feedback. 3. The device of claim 1, wherein the at least one microprocessor is further configured to instruct alteration of the delivery of the at least one therapeutic composition based on the real-time feedback. 4. The device of claim 3, wherein the real-time feedback of delivery of at least one therapeutic composition is utilized to alter the delivery of at least one subsequent therapeutic composition. 5. The device of claim 1, wherein the propulsion means includes at least one mechanical or electrical propulsion means. 6. The device of claim 1, wherein the propulsion means includes at least one of an inkjet ejector, fluid ejector, striker, or thermal bubble propulsion. 7. The device of claim 1, wherein the biological tissue includes at least one of skin tissue, muscle tissue, eye tissue, nervous tissue, peritoneal tissue, an organ, connective tissue, neoplastic tissue, or bone tissue. 8. The device of claim 6, wherein the eye tissue includes at least one of retinal tissue, vitreal tissue, ductal tissue, scleral tissue, corneal tissue, lens tissue, lacrimal tissue, musculature of the eye, ligamental tissue of the eye, or neural tissue of the eye. 9. The device of claim 1, wherein the biological tissue includes tumor tissue. 10. The device of claim 1, wherein the propulsion means is configured to deliver the at least one therapeutic composition to or at a velocity of approximately 1 m/s, approximately 5 m/s, approximately 10 m/s, approximately 20 m/s, approximately 30 m/s, approximately 40 m/s, approximately 50 m/s, approximately 60 m/s, approximately 70 m/s, approximately 80 m/s, approximately 90 m/s, approximately 100 m/s, approximately 200 m/s, approximately 300 m/s, approximately 400 m/s, approximately 500 m/s, approximately 600 m/s, approximately 700 m/s, approximately 800 m/s, approximately 900 m/s, approximately 1000 m/s, approximately 1500 m/s, approximately 2000 m/s, approximately 3000 m/s, approximately 4000 m/s, approximately 5000 m/s, or any value greater or therebetween. 11. The device of claim 1, wherein the at least one therapeutic composition includes at least one sugar glass. 12. The device of claim 10, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 13. The device of claim 1, wherein the at least one therapeutic composition includes at least one polyol. 14. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 15. The device of claim 13, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 16. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 17. The device of claim 1, wherein the at least one therapeutic composition includes at least one frozen particle composition or frozen piercing implement composition. 18. The device of claim 16, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 19. The device of claim 17, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 20. The device of claim 16, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 21. The device of claim 1, wherein the feedback of the at least one characteristic of the delivery includes one or more of the amount of the at least one therapeutic composition delivered, the content of the at least one therapeutic composition delivered, the depth of penetration of the at least one therapeutic composition, the trajectory of the at least one therapeutic composition, the configuration of the at least one therapeutic composition, status of the at least one therapeutic composition, status of the target biological tissue, determination of first delivery of the at least one therapeutic composition, status of a spatial or temporal delivery pattern, specific spatial or temporal location of the at least one therapeutic composition delivered, velocity of delivery of the at least one therapeutic composition, deceleration of the at least one therapeutic composition upon delivery, or status of the delivery device itself. 22. The device of claim 1, further including at least one magnetic deflector configured to assist in directing the at least one therapeutic composition. 23. The device of claim 1, wherein the at least one therapeutic composition is biodegradable. 24. The device of claim 1, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one of a therapeutic agent, reinforcement agent, biological remodeling agent, adhesive agent, or abrasive. 25. The device of claim 1, wherein the therapeutic agent includes at least one of an anti-inflammatory agent, coagulant, anti-microbial agent, anesthetic, analgesic; vasodilator, immunological agent, angiogenic factor, anti-angiogenic factor, vasoconstrictor, or growth factor inhibitor. 26. A system, comprising:
a device including at least one propulsion means configured for propelling at least one therapeutic composition to a biological tissue; at least one delivery means operably linked to the at least one propulsion means and configured for administration of the at least one therapeutic composition to a biological tissue; at least one ultrasonic image detector; at least one microprocessor in electronic communication with at least one of the at least one propulsion means, the at least one delivery means, or the at least one ultrasonic image detector, and configured to provide real-time feedback of at least one characteristic of the delivery of the at least one therapeutic composition to the biological tissue. 27. The system of claim 26, wherein the at least one microprocessor is further configured to instruct alteration of the delivery of the at least one therapeutic composition based on the real-time feedback. 28. The system of claim 27, wherein the real-time feedback of delivery of at least one therapeutic composition is utilized to alter the delivery of at least one subsequent therapeutic composition. 29. The system of claim 26, wherein the propulsion means includes at least one mechanical or electrical propulsion means. 30. The system of claim 26, wherein the propulsion means includes at least one of an inkjet ejector, fluid ejector, striker, or thermal bubble propulsion. 31. The system of claim 26, wherein the biological tissue includes at least one of skin tissue, muscle tissue, eye tissue, nervous tissue, peritoneal tissue, an organ, connective tissue, neoplastic tissue, or bone tissue. 32. The system of claim 31, wherein the eye tissue includes at least one of retinal tissue, vitreal tissue, ductal tissue, scleral tissue, corneal tissue, lens tissue, lacrimal tissue, musculature of the eye, ligamental tissue of the eye, or neural tissue of the eye. 33. The system of claim 26, wherein the biological tissue includes tumor tissue. 34. The system of claim 26, wherein the propulsion means is configured to deliver the at least one therapeutic composition to or at a velocity of approximately 1 m/s, approximately 5 m/s, approximately 10 m/s, approximately 20 m/s, approximately 30 m/s, approximately 40 m/s, approximately 50 m/s, approximately 60 m/s, approximately 70 m/s, approximately 80 m/s, approximately 90 m/s, approximately 100 m/s, approximately 200 m/s, approximately 300 m/s, approximately 400 m/s, approximately 500 m/s, approximately 600 m/s, approximately 700 m/s, approximately 800 m/s, approximately 900 m/s, approximately 1000 m/s, approximately 1500 m/s, approximately 2000 m/s, approximately 3000 m/s, approximately 4000 m/s, approximately 5000 m/s, or any value greater or therebetween. 35. The system of claim 26, wherein the at least one therapeutic composition includes at least one sugar glass. 36. The system of claim 35, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 37. The system of claim 26, wherein the at least one therapeutic composition includes at least one polyol. 38. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 39. The system of claim 38, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 40. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 41. The system of claim 26, wherein the at least one therapeutic composition includes at least one frozen particle composition or frozen piercing implement composition. 42. The system of claim 41, wherein the at least one frozen particle composition or frozen piercing implement composition further includes at least one sugar glass. 43. The system of claim 42, wherein the at least one sugar glass includes one or more of trehalose, glucose, maltose, lactose, multulose, iso-maltulose, lactulose, mono-reducing glycosides of polydydroxy compounds. 44. The system of claim 41, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one polyol. 45. The system of claim 26, wherein the feedback of the at least one characteristic of the delivery includes one or more of the amount of the at least one therapeutic composition delivered, the content of the at least one therapeutic composition delivered, the depth of penetration of the at least one therapeutic composition, the trajectory of the at least one therapeutic composition, the configuration of the at least one therapeutic composition, status of the at least one therapeutic composition, status of the target biological tissue, determination of first delivery of the at least one therapeutic composition, status of a spatial or temporal delivery pattern, specific spatial or temporal location of the at least one therapeutic composition delivered, velocity of delivery of the at least one therapeutic composition, deceleration of the at least one therapeutic composition upon delivery, or status of the delivery device itself. 46. The system of claim 26, further including at least one magnetic deflector configured to assist in directing the at least one therapeutic composition. 47. The system of claim 26, wherein the at least one therapeutic composition is biodegradable. 48. The system of claim 26, wherein the at least one frozen particle composition or frozen piercing implement composition includes at least one of a therapeutic agent, reinforcement agent, biological remodeling agent, adhesive agent, or abrasive. 49. The system of claim 26, wherein the therapeutic agent includes at least one of an anti-inflammatory agent, coagulant, anti-microbial agent, anesthetic, analgesic; vasodilator, immunological agent, angiogenic factor, anti-angiogenic factor, vasoconstrictor, or growth factor inhibitor. | 2,100 |
4,742 | 15,167,949 | 2,132 | One embodiment of the present invention is a method including: (a) representing virtual primary disk data and state data of a virtual machine in a unit of storage; (b) exposing the virtual primary disk data of the virtual machine to a guest of the virtual machine to allow the guest to access the virtual primary disk data; and (c) preventing the guest from accessing the state data for the virtual machine. | 1. A non-transitory computer-readable storage medium storing a computer program product comprising:
virtualization code executable to intercept a read access from the guest and prevent the read access when the read access is for accessing the state data of the virtual machine, wherein the state data comprises execution state data of the virtual machine. 2. The non-transitory computer-readable storage medium of claim 1, wherein the virtualization code is executable to verify that a virtual disk access request from a guest indicates a location that falls within access request location boundaries for the guest. 3. The non-transitory computer-readable storage medium of claim 1, wherein the virtualization code is executable to modify a location indication of a virtual disk access request according to an offset that corresponds to an exposed partition table for the virtual disk. 4. The non-transitory computer-readable storage medium of claim 3, wherein the virtualization code is executable to verify that a modified location indication falls within access request location boundaries. 5. An apparatus comprising:
a communication interface; and means for securing state data of a virtual machine by intercepting a read access from a guest operating system and preventing the read access when the read access is for accessing state data of the virtual machine, wherein the state data comprises execution state data of the virtual machine. 6. The apparatus of claim 5 further comprising means for exposing the virtual disk to a guest of the virtual machine. 7. The apparatus of claim 5 further comprising means for preventing circumvention of the securing means. | One embodiment of the present invention is a method including: (a) representing virtual primary disk data and state data of a virtual machine in a unit of storage; (b) exposing the virtual primary disk data of the virtual machine to a guest of the virtual machine to allow the guest to access the virtual primary disk data; and (c) preventing the guest from accessing the state data for the virtual machine.1. A non-transitory computer-readable storage medium storing a computer program product comprising:
virtualization code executable to intercept a read access from the guest and prevent the read access when the read access is for accessing the state data of the virtual machine, wherein the state data comprises execution state data of the virtual machine. 2. The non-transitory computer-readable storage medium of claim 1, wherein the virtualization code is executable to verify that a virtual disk access request from a guest indicates a location that falls within access request location boundaries for the guest. 3. The non-transitory computer-readable storage medium of claim 1, wherein the virtualization code is executable to modify a location indication of a virtual disk access request according to an offset that corresponds to an exposed partition table for the virtual disk. 4. The non-transitory computer-readable storage medium of claim 3, wherein the virtualization code is executable to verify that a modified location indication falls within access request location boundaries. 5. An apparatus comprising:
a communication interface; and means for securing state data of a virtual machine by intercepting a read access from a guest operating system and preventing the read access when the read access is for accessing state data of the virtual machine, wherein the state data comprises execution state data of the virtual machine. 6. The apparatus of claim 5 further comprising means for exposing the virtual disk to a guest of the virtual machine. 7. The apparatus of claim 5 further comprising means for preventing circumvention of the securing means. | 2,100 |
4,743 | 14,199,107 | 2,141 | An electronic device outputs a first caption of a plurality of captions while a first segment of a video is being played, where the first video segment corresponds to the first caption. While outputting the first caption, the device receives a first user input. In response to receiving the first user input, the device determines a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria; determines a second segment of the video that corresponds to the second caption; sends instructions to change from playing the first segment of the video to playing the second segment of the video; and outputs the second caption. | 1. A method, comprising:
at an electronic device:
outputting a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption;
while outputting the first caption, receiving a first user input; and,
in response to receiving the first user input:
determining a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determining a second segment of the video that corresponds to the second caption;
sending instructions to change from playing the first segment of the video to playing the second segment of the video; and
outputting the second caption. 2. The method of claim 1, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same location on a display. 3. The method of claim 1, wherein captions that satisfy the predefined caption selection criteria have a sequence, and the first caption is adjacent to the second caption in the sequence. 4. The method of claim 1, wherein outputting the first caption includes outputting a first audible voice signal corresponding to the first caption, and outputting the second caption includes outputting a second audible voice signal corresponding to the second caption. 5. The method of claim 1, wherein:
the first caption corresponds to a first speaker and the second caption corresponds to a second speaker distinct from the first speaker; outputting the first audible voice signal includes converting the first caption into the first audible voice signal based on a first speaker profile; and outputting the second audible voice signal includes converting the second caption into the second audible voice signal based on a second speaker profile distinct from the first speaker profile. 6. The method of claims 1, wherein:
the electronic device is coupled with a Braille display; outputting the first caption includes sending instructions to the Braille display to output the first caption; and outputting the second caption includes sending instructions to the Braille display to output the second caption. 7. The method of claim 6, wherein the Braille display is configured to indicate a first location of the first caption and a second location of the second caption. 8. The method of claim 7, wherein:
the Braille display includes a plurality of Braille cells; and the Braille display is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective location of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 9. The method of claim 6, wherein the Braille display is configured to indicate a first speaker of the first caption and a second speaker of the second caption. 10. The method of claim 9, wherein:
the Braille display includes a plurality of Braille cells; and the Braille display is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective speaker of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 11. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device, cause the device to:
output a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption; while outputting the first caption, receive a first user input; and, in response to receiving the first user input:
determine a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determine a second segment of the video that corresponds to the second caption;
send instructions to change from playing the first segment of the video to playing the second segment of the video; and
output the second caption. 12. A graphical user interface on an electronic device, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a video; wherein:
a first caption of the plurality of captions is output while a first segment of the video is being played, wherein the first video segment corresponds to the first caption; and,
in response to receiving a first user input while outputting the first caption:
a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria, is determined;
a second segment of the video that corresponds to the second caption is determined;
instructions to change from playing the first segment of the video to playing the second segment of the video are sent; and
the second caption is output. 13. An electronic device, comprising:
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:
outputting a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption;
while outputting the first caption, receive a first user input; and,
in response to receiving the first user input:
determining a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determining a second segment of the video that corresponds to the second caption;
sending instructions to change from playing the first segment of the video to playing the second segment of the video; and
outputting the second caption. 14. The device of claim 13, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same location on a display. 15. The device of claim 13, wherein captions that satisfy the predefined caption selection criteria have a sequence, and the first caption is adjacent to the second caption in the sequence. 16. The device of claim 13, wherein outputting the first caption includes outputting a first audible voice signal corresponding to the first caption, and outputting the second caption includes outputting a second audible voice signal corresponding to the second caption. 17. The device of claim 13, wherein:
the first caption corresponds to a first speaker and the second caption corresponds to a second speaker distinct from the first speaker; outputting the first audible voice signal includes converting the first caption into the first audible voice signal based on a first speaker profile; and outputting the second audible voice signal includes converting the second caption into the second audible voice signal based on a second speaker profile distinct from the first speaker profile. 18. The device of claims 13, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same speaker. 19. The device of claim 13, wherein:
the electronic device is coupled with a Braille display unit; outputting the first caption includes sending instructions to the Braille display unit to output the first caption; and outputting the second caption includes sending instructions to the Braille display unit to output the second caption. 20. The device of claim 19, wherein the Braille display unit is configured to indicate a first location of the first caption and a second location of the second caption. 21. The device of claim 20, wherein:
the Braille display unit includes a plurality of Braille cells; and the Braille display unit is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective location of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 22. The device of claim 19, wherein the Braille display unit is configured to indicate a first speaker of the first caption and a second speaker of the second caption. 23. The device of claim 22, wherein:
the Braille display unit includes a plurality of Braille cells; and the Braille display unit is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective speaker of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 24. The device of claims 13, wherein:
the video includes video signals and audio signals; and playing the video includes outputting audio signals of the video without outputting the video signals of the video. | An electronic device outputs a first caption of a plurality of captions while a first segment of a video is being played, where the first video segment corresponds to the first caption. While outputting the first caption, the device receives a first user input. In response to receiving the first user input, the device determines a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria; determines a second segment of the video that corresponds to the second caption; sends instructions to change from playing the first segment of the video to playing the second segment of the video; and outputs the second caption.1. A method, comprising:
at an electronic device:
outputting a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption;
while outputting the first caption, receiving a first user input; and,
in response to receiving the first user input:
determining a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determining a second segment of the video that corresponds to the second caption;
sending instructions to change from playing the first segment of the video to playing the second segment of the video; and
outputting the second caption. 2. The method of claim 1, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same location on a display. 3. The method of claim 1, wherein captions that satisfy the predefined caption selection criteria have a sequence, and the first caption is adjacent to the second caption in the sequence. 4. The method of claim 1, wherein outputting the first caption includes outputting a first audible voice signal corresponding to the first caption, and outputting the second caption includes outputting a second audible voice signal corresponding to the second caption. 5. The method of claim 1, wherein:
the first caption corresponds to a first speaker and the second caption corresponds to a second speaker distinct from the first speaker; outputting the first audible voice signal includes converting the first caption into the first audible voice signal based on a first speaker profile; and outputting the second audible voice signal includes converting the second caption into the second audible voice signal based on a second speaker profile distinct from the first speaker profile. 6. The method of claims 1, wherein:
the electronic device is coupled with a Braille display; outputting the first caption includes sending instructions to the Braille display to output the first caption; and outputting the second caption includes sending instructions to the Braille display to output the second caption. 7. The method of claim 6, wherein the Braille display is configured to indicate a first location of the first caption and a second location of the second caption. 8. The method of claim 7, wherein:
the Braille display includes a plurality of Braille cells; and the Braille display is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective location of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 9. The method of claim 6, wherein the Braille display is configured to indicate a first speaker of the first caption and a second speaker of the second caption. 10. The method of claim 9, wherein:
the Braille display includes a plurality of Braille cells; and the Braille display is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective speaker of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 11. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device, cause the device to:
output a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption; while outputting the first caption, receive a first user input; and, in response to receiving the first user input:
determine a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determine a second segment of the video that corresponds to the second caption;
send instructions to change from playing the first segment of the video to playing the second segment of the video; and
output the second caption. 12. A graphical user interface on an electronic device, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a video; wherein:
a first caption of the plurality of captions is output while a first segment of the video is being played, wherein the first video segment corresponds to the first caption; and,
in response to receiving a first user input while outputting the first caption:
a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria, is determined;
a second segment of the video that corresponds to the second caption is determined;
instructions to change from playing the first segment of the video to playing the second segment of the video are sent; and
the second caption is output. 13. An electronic device, comprising:
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:
outputting a first caption of a plurality of captions while a first segment of a video is being played, wherein the first video segment corresponds to the first caption;
while outputting the first caption, receive a first user input; and,
in response to receiving the first user input:
determining a second caption in the plurality of captions, distinct from the first caption, that meets predefined caption selection criteria;
determining a second segment of the video that corresponds to the second caption;
sending instructions to change from playing the first segment of the video to playing the second segment of the video; and
outputting the second caption. 14. The device of claim 13, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same location on a display. 15. The device of claim 13, wherein captions that satisfy the predefined caption selection criteria have a sequence, and the first caption is adjacent to the second caption in the sequence. 16. The device of claim 13, wherein outputting the first caption includes outputting a first audible voice signal corresponding to the first caption, and outputting the second caption includes outputting a second audible voice signal corresponding to the second caption. 17. The device of claim 13, wherein:
the first caption corresponds to a first speaker and the second caption corresponds to a second speaker distinct from the first speaker; outputting the first audible voice signal includes converting the first caption into the first audible voice signal based on a first speaker profile; and outputting the second audible voice signal includes converting the second caption into the second audible voice signal based on a second speaker profile distinct from the first speaker profile. 18. The device of claims 13, wherein the predefined caption selection criteria include that the first caption and the second caption correspond to a same speaker. 19. The device of claim 13, wherein:
the electronic device is coupled with a Braille display unit; outputting the first caption includes sending instructions to the Braille display unit to output the first caption; and outputting the second caption includes sending instructions to the Braille display unit to output the second caption. 20. The device of claim 19, wherein the Braille display unit is configured to indicate a first location of the first caption and a second location of the second caption. 21. The device of claim 20, wherein:
the Braille display unit includes a plurality of Braille cells; and the Braille display unit is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective location of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 22. The device of claim 19, wherein the Braille display unit is configured to indicate a first speaker of the first caption and a second speaker of the second caption. 23. The device of claim 22, wherein:
the Braille display unit includes a plurality of Braille cells; and the Braille display unit is configured to output a respective caption with a first set of one or more Braille cells and indicate a respective speaker of the respective caption with a second set of one or more Braille cells distinct from the first set of one or more Braille cells. 24. The device of claims 13, wherein:
the video includes video signals and audio signals; and playing the video includes outputting audio signals of the video without outputting the video signals of the video. | 2,100 |
4,744 | 14,074,896 | 2,153 | Techniques for topic recommendation are described herein. The techniques include a method that topic recommendation includes identifying topics associated with events within a social network environment. A rank may be determined indicating interest for an identified topic within the social network environment. The method may include recommending a topic to a user for posting in the social network environment based on the rank. | 1. A method for topic recommendation, comprising:
identifying topics associated with events within a social network environment; determining a rank indicating interest for an identified topic within the social network environment; and recommending a topic to a user for posting in the social network environment based on the rank. 2. The method of claim 1, wherein determining the rank comprises:
ranking a topic based on whether the topic is associated with events in which the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events in which a follower of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events for which a manager of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on the recentcy of an event associated with the topic; ranking a topic based on the uniqueness of the topic in relation to other topics; ranking a topic based on a type of event associated with the topic; or ranking a topic based on a composite rank of any of the above. 3. The method of claim 1, wherein the events comprise an activity stream, and wherein the topics are identified by extracting a list of topics from the activity stream. 4. The method of claim 1, wherein determining the rank comprises determining a rank based on a subset of the social network environment, the subset comprising:
the user, wherein the rank is determined as being of interest to the user; a follower of the user, wherein the rank is determined as being of interest to a follower of the user; a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user; a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or any combination of the above. 5. The method of claim 4, comprising:
rendering the recommendation to the user; and displaying options to enable the user to select a subset of the social network for which recommendations are determined to target. 6. The method of claim 1, wherein the social network environment is a social network environment of an enterprise environment related to employment of the user, wherein the rank is based on an employment position. 7. The method of claim 1, wherein recommending the topic to the user for posting in the social network environment based on the rank comprises:
compiling recent posts associated with the recommended topic; and recommending reposting of one or more of the recent posts. 8. The method of claim 1, comprising adjusting the quantity of recommendations for topics based on the rank of the topic. 9. The method of claim 1, comprising:
rendering the recommended topic to the user; receiving a selection indicating a given topic; and providing additional topics related to the recommended topic. 10. A computing device, comprising:
a storage device; a processor; the storage device having instructions that when executed by the processor, cause the computing device to:
identify topics associated with events within a social network environment;
determine a rank indicating interest for an identified topic within the social network environment; and
recommend a topic to a user for posting in the social network environment based on the rank. 11. The computing device of claim 10, wherein determining the rank comprises:
ranking a topic based on whether the topic is associated with events in which the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events in which a follower of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events for which a manager of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on the recentcy of an event associated with the topic; ranking a topic based on the uniqueness of the topic in relation to other topics; ranking a topic based on a type of event associated with the topic; or ranking a topic based on a composite rank of any of the above. 12. The computing device of claim 1, wherein the events comprise an activity stream, and wherein the topics are identified by extracting a list of topics from the activity stream. 13. The computing device of claim 1, wherein determining the rank comprises determining a rank based on a subset of the social network environment, the subset comprising:
the user, wherein the rank is determined as being of interest to the user;
a follower of the user, wherein the rank is determined as being of interest to a follower of the user;
a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user;
a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or
any combination of the above. 14. The computing device of claim 13, comprising:
rendering the recommendation to the user; and displaying options to enable the user to select a subset of the social network for which recommendations are determined to target. 15. The computing device of claim 10, wherein the social network environment is a social network environment of an enterprise environment related to employment of the user, wherein the rank is based on an employment position. 16. The computing device of claim 10, wherein recommending the topic to the user for posting in the social network environment based on the rank comprises:
compiling recent posts associated with the recommended topic; and recommending reposting of one or more of the recent posts. 17. The computing device of claim 10, comprising adjusting the quantity of recommendations for topics based on the rank of the topic. 18. The computing device of claim 10, comprising:
rendering the recommended topic to the user; receiving a selection indicating a given topic; and providing additional topics related to the recommended topic 19. A computer program product for monitoring application design, the computer product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
identifying, by the processor, topics associated with events within a social network environment; determining, by the processor, a rank indicating interest for an identified topic within the social network environment; and recommending, by the processor, a topic to a user for posting in the social network environment based on the rank. 20. The computer program product of claim 16, wherein determining the rank is based on subsets of the social network environment, the subsets comprising:
the user, wherein the rank is determined as being of interest to the user;
a follower of the user, wherein the rank is determined as being of interest to a follower of the user;
a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user;
a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or
any combination of the above. | Techniques for topic recommendation are described herein. The techniques include a method that topic recommendation includes identifying topics associated with events within a social network environment. A rank may be determined indicating interest for an identified topic within the social network environment. The method may include recommending a topic to a user for posting in the social network environment based on the rank.1. A method for topic recommendation, comprising:
identifying topics associated with events within a social network environment; determining a rank indicating interest for an identified topic within the social network environment; and recommending a topic to a user for posting in the social network environment based on the rank. 2. The method of claim 1, wherein determining the rank comprises:
ranking a topic based on whether the topic is associated with events in which the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events in which a follower of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events for which a manager of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on the recentcy of an event associated with the topic; ranking a topic based on the uniqueness of the topic in relation to other topics; ranking a topic based on a type of event associated with the topic; or ranking a topic based on a composite rank of any of the above. 3. The method of claim 1, wherein the events comprise an activity stream, and wherein the topics are identified by extracting a list of topics from the activity stream. 4. The method of claim 1, wherein determining the rank comprises determining a rank based on a subset of the social network environment, the subset comprising:
the user, wherein the rank is determined as being of interest to the user; a follower of the user, wherein the rank is determined as being of interest to a follower of the user; a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user; a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or any combination of the above. 5. The method of claim 4, comprising:
rendering the recommendation to the user; and displaying options to enable the user to select a subset of the social network for which recommendations are determined to target. 6. The method of claim 1, wherein the social network environment is a social network environment of an enterprise environment related to employment of the user, wherein the rank is based on an employment position. 7. The method of claim 1, wherein recommending the topic to the user for posting in the social network environment based on the rank comprises:
compiling recent posts associated with the recommended topic; and recommending reposting of one or more of the recent posts. 8. The method of claim 1, comprising adjusting the quantity of recommendations for topics based on the rank of the topic. 9. The method of claim 1, comprising:
rendering the recommended topic to the user; receiving a selection indicating a given topic; and providing additional topics related to the recommended topic. 10. A computing device, comprising:
a storage device; a processor; the storage device having instructions that when executed by the processor, cause the computing device to:
identify topics associated with events within a social network environment;
determine a rank indicating interest for an identified topic within the social network environment; and
recommend a topic to a user for posting in the social network environment based on the rank. 11. The computing device of claim 10, wherein determining the rank comprises:
ranking a topic based on whether the topic is associated with events in which the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events in which a follower of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on whether the topic is associated with events for which a manager of the user has an actor role, a target role, or any combination of an actor and target role; ranking a topic based on the recentcy of an event associated with the topic; ranking a topic based on the uniqueness of the topic in relation to other topics; ranking a topic based on a type of event associated with the topic; or ranking a topic based on a composite rank of any of the above. 12. The computing device of claim 1, wherein the events comprise an activity stream, and wherein the topics are identified by extracting a list of topics from the activity stream. 13. The computing device of claim 1, wherein determining the rank comprises determining a rank based on a subset of the social network environment, the subset comprising:
the user, wherein the rank is determined as being of interest to the user;
a follower of the user, wherein the rank is determined as being of interest to a follower of the user;
a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user;
a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or
any combination of the above. 14. The computing device of claim 13, comprising:
rendering the recommendation to the user; and displaying options to enable the user to select a subset of the social network for which recommendations are determined to target. 15. The computing device of claim 10, wherein the social network environment is a social network environment of an enterprise environment related to employment of the user, wherein the rank is based on an employment position. 16. The computing device of claim 10, wherein recommending the topic to the user for posting in the social network environment based on the rank comprises:
compiling recent posts associated with the recommended topic; and recommending reposting of one or more of the recent posts. 17. The computing device of claim 10, comprising adjusting the quantity of recommendations for topics based on the rank of the topic. 18. The computing device of claim 10, comprising:
rendering the recommended topic to the user; receiving a selection indicating a given topic; and providing additional topics related to the recommended topic 19. A computer program product for monitoring application design, the computer product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
identifying, by the processor, topics associated with events within a social network environment; determining, by the processor, a rank indicating interest for an identified topic within the social network environment; and recommending, by the processor, a topic to a user for posting in the social network environment based on the rank. 20. The computer program product of claim 16, wherein determining the rank is based on subsets of the social network environment, the subsets comprising:
the user, wherein the rank is determined as being of interest to the user;
a follower of the user, wherein the rank is determined as being of interest to a follower of the user;
a social network of the user including other users of the social network who are not following the user as well as followers of the user, wherein the rank is determined as being of interest to the social network of the user;
a manager of the user, wherein the rank is determined as being of interest to the manager of the user; or
any combination of the above. | 2,100 |
4,745 | 15,040,208 | 2,156 | Identifying an electronic data file for exclusion from a data backup operation. A method identifies either or both of a first data file stored on an electronic file system, and a set of data elements within the first data file. Either or both of the first data file and the set of data elements within the first data file have at least one feature matching a predefined exclusion feature. The method designates either or both of the first data file and the set of data elements within the first data file for exclusion from a backup operation. | 1. A method for providing electronic image security on a mobile device, comprising:
identifying one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating the first electronic image for exclusion from a backup operation based on the identification; detecting existing backups of the first electronic image on a server; and removing all the existing backups of the first electronic image from the server based on the designating. 2. The method of claim 1, further comprising:
capturing the first electronic image, by an electronic image-capturing component of the mobile device. 3. The method of claim 1, further comprising:
initiating execution of a backup operation, the initiation comprising selection, for backup, of one or more electronic images other than the first electronic image. 4. The method of claim 3, further comprising:
executing the backup operation. 5. The method of claim 1, wherein identifying one or more data elements comprises:
identifying one or more pixel sets in the first image matching a pattern associated with all or parts of a person. 6. The method of claim 5, wherein the predefined exclusion feature comprises one or more of:
a pixel pattern associated with all or parts of a person; and a frequency, of a pixel pattern associated with all or parts of a person, exceeding a threshold value. 7. The method of claim 5, wherein the pixel pattern associated with all or parts of a person comprises:
a pixel pattern associated with a human face. 8. The method of claim 7, wherein the predefined exclusion feature comprises a pixel pattern associated with a specific face. 9. The method of claim 7, wherein the pixel pattern is further associated with an age of the person. 10. The method of claim 9, wherein the predefined exclusion feature comprises the age falling below a threshold value. 11. The method of claim 1, further comprising:
defining a set of exclusion features including the identified exclusion feature, where the defining comprises receiving a selection of a plurality of features in one or more files from a user; and generate a data model based on the plurality of features, wherein the identifying is based, at least in part, on the data model. 12. A computer system for providing electronic image security on a mobile device, comprising:
one or more computer devices each having one or more processors and one or more tangible storage devices; and a program embodied on at least one of the one or more storage devices, the program having a plurality of program instructions for execution by the one or more processors, the program instructions comprising instructions for: identifying one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating the first electronic image for exclusion from a backup operation based on the identification; detecting existing backups of the first electronic image on a server; and removing all the existing backups of the first electronic image from the server based on the designating. 13. The computer system of claim 12, wherein the program instructions further comprise:
capturing the first electronic image, by an electronic image-capturing component of the mobile device. 14. The computer system of claim 12, wherein the program instructions further comprise:
initiating execution of a backup operation, the initiation comprising selection, for backup, of one or more electronic images other than the first electronic image. 15. The computer system of claim 14, wherein the program instructions further comprise:
executing the backup operation. 16. The computer system of claim 12, wherein identifying one or more data elements comprises:
identifying one or more pixel sets in the first image matching a pattern associated with all or parts of a person. 17. The computer system of claim 16, wherein the predefined exclusion feature comprises one or more of:
a pixel pattern associated with all or parts of a person; and a frequency, of a pixel pattern associated with all or parts of a person, exceeding a threshold value. 18. The computer system of claim 12, wherein the pixel pattern associated with all or parts of a person comprises:
a pixel pattern associated with a human face. 19. The computer system of claim 18, wherein the predefined exclusion feature comprises a pixel pattern associated with a specific face. 20. A computer program product for providing electronic image security on a mobile device, comprising a non-transitory tangible storage device having program code embodied therewith, the program code executable by a processor of a computer to perform a method, the method comprising:
identifying, by the processor, one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating, by the processor, the first electronic image for exclusion from a backup operation based on the identification; detecting, by the processor, existing backups of the first electronic image on a server; and removing, by the processor, all the existing backups of the first electronic image from the server based on the designating. | Identifying an electronic data file for exclusion from a data backup operation. A method identifies either or both of a first data file stored on an electronic file system, and a set of data elements within the first data file. Either or both of the first data file and the set of data elements within the first data file have at least one feature matching a predefined exclusion feature. The method designates either or both of the first data file and the set of data elements within the first data file for exclusion from a backup operation.1. A method for providing electronic image security on a mobile device, comprising:
identifying one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating the first electronic image for exclusion from a backup operation based on the identification; detecting existing backups of the first electronic image on a server; and removing all the existing backups of the first electronic image from the server based on the designating. 2. The method of claim 1, further comprising:
capturing the first electronic image, by an electronic image-capturing component of the mobile device. 3. The method of claim 1, further comprising:
initiating execution of a backup operation, the initiation comprising selection, for backup, of one or more electronic images other than the first electronic image. 4. The method of claim 3, further comprising:
executing the backup operation. 5. The method of claim 1, wherein identifying one or more data elements comprises:
identifying one or more pixel sets in the first image matching a pattern associated with all or parts of a person. 6. The method of claim 5, wherein the predefined exclusion feature comprises one or more of:
a pixel pattern associated with all or parts of a person; and a frequency, of a pixel pattern associated with all or parts of a person, exceeding a threshold value. 7. The method of claim 5, wherein the pixel pattern associated with all or parts of a person comprises:
a pixel pattern associated with a human face. 8. The method of claim 7, wherein the predefined exclusion feature comprises a pixel pattern associated with a specific face. 9. The method of claim 7, wherein the pixel pattern is further associated with an age of the person. 10. The method of claim 9, wherein the predefined exclusion feature comprises the age falling below a threshold value. 11. The method of claim 1, further comprising:
defining a set of exclusion features including the identified exclusion feature, where the defining comprises receiving a selection of a plurality of features in one or more files from a user; and generate a data model based on the plurality of features, wherein the identifying is based, at least in part, on the data model. 12. A computer system for providing electronic image security on a mobile device, comprising:
one or more computer devices each having one or more processors and one or more tangible storage devices; and a program embodied on at least one of the one or more storage devices, the program having a plurality of program instructions for execution by the one or more processors, the program instructions comprising instructions for: identifying one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating the first electronic image for exclusion from a backup operation based on the identification; detecting existing backups of the first electronic image on a server; and removing all the existing backups of the first electronic image from the server based on the designating. 13. The computer system of claim 12, wherein the program instructions further comprise:
capturing the first electronic image, by an electronic image-capturing component of the mobile device. 14. The computer system of claim 12, wherein the program instructions further comprise:
initiating execution of a backup operation, the initiation comprising selection, for backup, of one or more electronic images other than the first electronic image. 15. The computer system of claim 14, wherein the program instructions further comprise:
executing the backup operation. 16. The computer system of claim 12, wherein identifying one or more data elements comprises:
identifying one or more pixel sets in the first image matching a pattern associated with all or parts of a person. 17. The computer system of claim 16, wherein the predefined exclusion feature comprises one or more of:
a pixel pattern associated with all or parts of a person; and a frequency, of a pixel pattern associated with all or parts of a person, exceeding a threshold value. 18. The computer system of claim 12, wherein the pixel pattern associated with all or parts of a person comprises:
a pixel pattern associated with a human face. 19. The computer system of claim 18, wherein the predefined exclusion feature comprises a pixel pattern associated with a specific face. 20. A computer program product for providing electronic image security on a mobile device, comprising a non-transitory tangible storage device having program code embodied therewith, the program code executable by a processor of a computer to perform a method, the method comprising:
identifying, by the processor, one or more data elements, in a first electronic image, having at least one feature, comprising at least one pixel region of the first electronic image, matching a predefined exclusion feature; designating, by the processor, the first electronic image for exclusion from a backup operation based on the identification; detecting, by the processor, existing backups of the first electronic image on a server; and removing, by the processor, all the existing backups of the first electronic image from the server based on the designating. | 2,100 |
4,746 | 13,896,430 | 2,185 | A data communication system is provided. The data communication system includes a data bus, and a line replacement unit including a terminal controller, and a plastic optical fiber serial interface module (POFSIM) coupled between the terminal controller and the data bus. The POFSIM is configured to transmit digital optical signals to the data bus based on electrical signals received from the terminal controller, and transmit electrical signals to the terminal controller based on digital optical signals received from the data bus. | 1. A data communication system comprising:
a data bus; and a line replacement unit comprising:
a terminal controller; and
a plastic optical fiber serial interface module (POFSIM) coupled between said terminal controller and said data bus, wherein said POFSIM is configured to:
transmit digital optical signals to said data bus based on electrical signals received from said terminal controller; and
transmit electrical signals to said terminal controller based on digital optical signals received from said data bus. 2. A data communication system in accordance with claim 1, wherein said POFSIM comprises an optical source configured to generate digital optical signals to be transmitted to said data bus. 3. A data communication system in accordance with claim 2, further comprising:
a transmission light pipe optically coupled to said optical source; and a transmission plastic optical fiber (POF) coupled between said transmission light pipe and said data bus. 4. A data communication system in accordance with claim 1, wherein said POFSIM comprises a detector configured to receive digital optical signals from said data bus. 5. A data communication system in accordance with claim 4, further comprising:
a reception light pipe optically coupled to said detector; and a reception plastic optical fiber (POF) coupled between said reception light pipe and said data bus. 6. A data communication system in accordance with claim 1, wherein said POFSIM is hermetically sealed. 7. A data communication system in accordance with claim 1, wherein said data bus is a plastic optical star coupler. 8. A plastic optical fiber serial interface module (POFSIM) comprising:
a terminal controller interface electronic circuit (TCIEC) configured to receive electrical signals from a terminal controller; an optical source coupled to said TCIEC and configured to transmit digital optical signals to a data bus based on the received electrical signals; and a detector coupled to said TCIEC and configured to receive digital optical signals from the data bus, wherein said TCIEC is further configured to transmit electrical signals to the terminal controller based on the received digital optical signals. 9. A POFSIM in accordance with claim 8, further comprising a driver circuit coupled between said TCIEC and said optical source, said driver circuit configured to:
receive a transistor-transistor logic signal from said TCIEC; and transmit a drive current to said optical source based on the received transistor-transistor logic signal. 10. A POFSIM in accordance with claim 8, further comprising a receiver circuit coupled between said TCIEC and said detector, said receiver circuit configured to transmit a transistor-transistor logic signal to said TCIEC based on a digital optical signal received at said detector. 11. A POFSIM in accordance with claim 8, further comprising:
a transmission light pipe optically coupled to said optical source; and a reception light pipe optically coupled to said detector, wherein said transmission and reception light pipes are each configured to couple to a respective plastic optical fiber. 12. A POFSIM in accordance with claim 8, wherein said TCIEC, said optical source, and said detector are all mounted to an MN substrate. 13. A POFSIM in accordance with claim 8, wherein said optical source comprises:
a submount; and at least one of an edge-emitting laser, an edge-emitting light emitting diode, a vertical cavity surface-emitting laser, and a surface-emitting light emitting diode mounted to said submount. 14. A POFSIM in accordance with claim 8, wherein said optical source comprises a multi-element array having a width of less than 0.5 millimeters, wherein said multi-element array is one of a multi-stripe edge-emitting laser array and a multi-stripe edge-emitting light emitting diode array. 15. A POFSIM in accordance with claim 8, wherein said optical source comprises an array that includes a plurality of vertical cavity surface emitting laser elements or a plurality of surface emitting light emitting diode elements, and wherein the elements of the array are arranged within a 1 millimeter diameter that matches a diameter of a transmission light pipe optically coupled to said optical source. 16. A POFSIM in accordance with claim 8, wherein said detector comprises:
a submount; and a high sensitivity detector that is integrated with a ball lens and mounted to said submount. 17. A method for use in communicating data between a terminal controller and a data bus, said method comprising:
receiving, at a plastic optical fiber serial interface module (POFSIM), an electrical signal from the terminal controller; generating, using the POFSIM, a digital optical signal based on the received electrical signal; and transmitting the digital optical signal to the data bus from the POFSIM. 18. A method in accordance with claim 17, wherein generating a digital optical signal comprises:
receiving a transistor-transistor logic signal at a driver circuit; generating a drive current based on the transistor-transistor logic signal; transmitting the drive current to an optical source; and generating, using the optical source, the digital optical signal based on the drive signal. 19. A method in accordance with claim 17, wherein generating a digital optical signal comprises generating a digital optical signal using an optical source that includes at least one of an edge-emitting laser, an edge-emitting light emitting diode, a surface-emitting laser, and a surface-emitting light emitting diode. 20. A method in accordance with claim 17, wherein transmitting the digital optical signal to the data bus comprises transmitting the digital optical signal to a plastic optical star coupler. | A data communication system is provided. The data communication system includes a data bus, and a line replacement unit including a terminal controller, and a plastic optical fiber serial interface module (POFSIM) coupled between the terminal controller and the data bus. The POFSIM is configured to transmit digital optical signals to the data bus based on electrical signals received from the terminal controller, and transmit electrical signals to the terminal controller based on digital optical signals received from the data bus.1. A data communication system comprising:
a data bus; and a line replacement unit comprising:
a terminal controller; and
a plastic optical fiber serial interface module (POFSIM) coupled between said terminal controller and said data bus, wherein said POFSIM is configured to:
transmit digital optical signals to said data bus based on electrical signals received from said terminal controller; and
transmit electrical signals to said terminal controller based on digital optical signals received from said data bus. 2. A data communication system in accordance with claim 1, wherein said POFSIM comprises an optical source configured to generate digital optical signals to be transmitted to said data bus. 3. A data communication system in accordance with claim 2, further comprising:
a transmission light pipe optically coupled to said optical source; and a transmission plastic optical fiber (POF) coupled between said transmission light pipe and said data bus. 4. A data communication system in accordance with claim 1, wherein said POFSIM comprises a detector configured to receive digital optical signals from said data bus. 5. A data communication system in accordance with claim 4, further comprising:
a reception light pipe optically coupled to said detector; and a reception plastic optical fiber (POF) coupled between said reception light pipe and said data bus. 6. A data communication system in accordance with claim 1, wherein said POFSIM is hermetically sealed. 7. A data communication system in accordance with claim 1, wherein said data bus is a plastic optical star coupler. 8. A plastic optical fiber serial interface module (POFSIM) comprising:
a terminal controller interface electronic circuit (TCIEC) configured to receive electrical signals from a terminal controller; an optical source coupled to said TCIEC and configured to transmit digital optical signals to a data bus based on the received electrical signals; and a detector coupled to said TCIEC and configured to receive digital optical signals from the data bus, wherein said TCIEC is further configured to transmit electrical signals to the terminal controller based on the received digital optical signals. 9. A POFSIM in accordance with claim 8, further comprising a driver circuit coupled between said TCIEC and said optical source, said driver circuit configured to:
receive a transistor-transistor logic signal from said TCIEC; and transmit a drive current to said optical source based on the received transistor-transistor logic signal. 10. A POFSIM in accordance with claim 8, further comprising a receiver circuit coupled between said TCIEC and said detector, said receiver circuit configured to transmit a transistor-transistor logic signal to said TCIEC based on a digital optical signal received at said detector. 11. A POFSIM in accordance with claim 8, further comprising:
a transmission light pipe optically coupled to said optical source; and a reception light pipe optically coupled to said detector, wherein said transmission and reception light pipes are each configured to couple to a respective plastic optical fiber. 12. A POFSIM in accordance with claim 8, wherein said TCIEC, said optical source, and said detector are all mounted to an MN substrate. 13. A POFSIM in accordance with claim 8, wherein said optical source comprises:
a submount; and at least one of an edge-emitting laser, an edge-emitting light emitting diode, a vertical cavity surface-emitting laser, and a surface-emitting light emitting diode mounted to said submount. 14. A POFSIM in accordance with claim 8, wherein said optical source comprises a multi-element array having a width of less than 0.5 millimeters, wherein said multi-element array is one of a multi-stripe edge-emitting laser array and a multi-stripe edge-emitting light emitting diode array. 15. A POFSIM in accordance with claim 8, wherein said optical source comprises an array that includes a plurality of vertical cavity surface emitting laser elements or a plurality of surface emitting light emitting diode elements, and wherein the elements of the array are arranged within a 1 millimeter diameter that matches a diameter of a transmission light pipe optically coupled to said optical source. 16. A POFSIM in accordance with claim 8, wherein said detector comprises:
a submount; and a high sensitivity detector that is integrated with a ball lens and mounted to said submount. 17. A method for use in communicating data between a terminal controller and a data bus, said method comprising:
receiving, at a plastic optical fiber serial interface module (POFSIM), an electrical signal from the terminal controller; generating, using the POFSIM, a digital optical signal based on the received electrical signal; and transmitting the digital optical signal to the data bus from the POFSIM. 18. A method in accordance with claim 17, wherein generating a digital optical signal comprises:
receiving a transistor-transistor logic signal at a driver circuit; generating a drive current based on the transistor-transistor logic signal; transmitting the drive current to an optical source; and generating, using the optical source, the digital optical signal based on the drive signal. 19. A method in accordance with claim 17, wherein generating a digital optical signal comprises generating a digital optical signal using an optical source that includes at least one of an edge-emitting laser, an edge-emitting light emitting diode, a surface-emitting laser, and a surface-emitting light emitting diode. 20. A method in accordance with claim 17, wherein transmitting the digital optical signal to the data bus comprises transmitting the digital optical signal to a plastic optical star coupler. | 2,100 |
4,747 | 14,237,192 | 2,167 | A data storage system includes a partitioning module to partition data across multiple dimensions simultaneously. The partitioning may be based on a sizing parameter for each dimension. The partitioning module stores a cluster including the partitioned event data and metadata including attributes identifying the cluster. | 1. A data storage system comprising:
a partitioning module executed by at least one processor to determine a plurality of dimensions, partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension, and store a cluster including the partitioned event data and metadata including attributes identifying the cluster from a plurality of stored clusters. 2. The data storage system of claim 1, wherein the partitioning module is to receive a batch of event data and determine a seed event from the batch of event data, and the sizing parameter for each dimension is a distance from the seed event. 3. The data storage system of claim 2, wherein the plurality of dimensions are time-based attributes of the event data, and the distance for each time-based attribute comprises a time period. 4. The data storage system of claim 3, wherein the time-based attributes comprise Manager Receipt Time (MRT) and Event End Time (ET), and the MRT for each event in the event data is when the event is received by the data storage system and the ET for each event is when the event happened. 5. The data storage system of claim 3, wherein the partitioning module is to partition the event data across the plurality of dimensions simultaneously by determining for each event whether the time-based attributes for each event in the event data are all within the distances of the event seed, and including the event in the cluster if all the time-based attributes for the event are within the distances of the event seed. 6. The data storage system of claim 1, wherein the partitioning module is to determine a plurality of clusters for received event data based on the plurality of dimensions, sizing parameters for the dimensions and events seeds for the clusters, wherein each event seed is selected from the received event data, and store the plurality of clusters and metadata for each cluster. 7. The data storage system of claim 6, comprising a query manager to receive a query, identify a cluster from the metadata for the clusters that includes data relevant to the query, and execute the query on the identified cluster. 8. The data storage system of claim 7, wherein the query manager is to provide results of the query to an event processing engine for a security information and event management system to correlate event data to identify network security threats. 9. The data storage system of claim 7, wherein the query manager is to provide results of the query via a user interface. 10. The data storage system of claim 1, comprising:
a data storage device to store the cluster and metadata; and a network interface to receive the event data from a data source over a network. 11. A security information and event management system comprising:
a partitioning module executed by at least one processor to determine a plurality of dimensions, partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension, and store a cluster including the partitioned event data; a data storage device to store a plurality of clusters and metadata for each cluster, wherein the metadata for each cluster includes attributes identifying the cluster from other stored clusters; a query manager to receive a query, identify a cluster from the metadata for the plurality of stored clusters that includes data relevant to the query, and execute the query on the identified cluster; and an event processing engine to correlate query results from the executed query in accordance with rules, instructions or requests to identify network security threats. 12. The security information and event management system of claim 11, wherein the partitioning module is to receive a batch of event data and determine a seed event from the batch of event data, and the sizing parameter for each dimension is a distance from the seed event. 13. The security information and event management system of claim 12, wherein the plurality of dimensions are time-based attributes of the event data, and the distance for each time-based attribute comprises a time period. 14. The security information and event management system of claim 13, wherein the partitioning module is to partition the event data across the plurality of dimensions simultaneously by determining for each event in the event data whether the time-based attributes for each event are all within the distances of the event seed, and including the event in the cluster if all the time-based attributes for the event are within the distances of the event seed. 15. A non-volatile computer readable medium including machine readable instructions executable by at least one processor to:
determine a plurality of dimensions; partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension; and store a cluster including the partitioned event data and metadata including attributes identifying the cluster from a plurality of stored clusters. | A data storage system includes a partitioning module to partition data across multiple dimensions simultaneously. The partitioning may be based on a sizing parameter for each dimension. The partitioning module stores a cluster including the partitioned event data and metadata including attributes identifying the cluster.1. A data storage system comprising:
a partitioning module executed by at least one processor to determine a plurality of dimensions, partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension, and store a cluster including the partitioned event data and metadata including attributes identifying the cluster from a plurality of stored clusters. 2. The data storage system of claim 1, wherein the partitioning module is to receive a batch of event data and determine a seed event from the batch of event data, and the sizing parameter for each dimension is a distance from the seed event. 3. The data storage system of claim 2, wherein the plurality of dimensions are time-based attributes of the event data, and the distance for each time-based attribute comprises a time period. 4. The data storage system of claim 3, wherein the time-based attributes comprise Manager Receipt Time (MRT) and Event End Time (ET), and the MRT for each event in the event data is when the event is received by the data storage system and the ET for each event is when the event happened. 5. The data storage system of claim 3, wherein the partitioning module is to partition the event data across the plurality of dimensions simultaneously by determining for each event whether the time-based attributes for each event in the event data are all within the distances of the event seed, and including the event in the cluster if all the time-based attributes for the event are within the distances of the event seed. 6. The data storage system of claim 1, wherein the partitioning module is to determine a plurality of clusters for received event data based on the plurality of dimensions, sizing parameters for the dimensions and events seeds for the clusters, wherein each event seed is selected from the received event data, and store the plurality of clusters and metadata for each cluster. 7. The data storage system of claim 6, comprising a query manager to receive a query, identify a cluster from the metadata for the clusters that includes data relevant to the query, and execute the query on the identified cluster. 8. The data storage system of claim 7, wherein the query manager is to provide results of the query to an event processing engine for a security information and event management system to correlate event data to identify network security threats. 9. The data storage system of claim 7, wherein the query manager is to provide results of the query via a user interface. 10. The data storage system of claim 1, comprising:
a data storage device to store the cluster and metadata; and a network interface to receive the event data from a data source over a network. 11. A security information and event management system comprising:
a partitioning module executed by at least one processor to determine a plurality of dimensions, partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension, and store a cluster including the partitioned event data; a data storage device to store a plurality of clusters and metadata for each cluster, wherein the metadata for each cluster includes attributes identifying the cluster from other stored clusters; a query manager to receive a query, identify a cluster from the metadata for the plurality of stored clusters that includes data relevant to the query, and execute the query on the identified cluster; and an event processing engine to correlate query results from the executed query in accordance with rules, instructions or requests to identify network security threats. 12. The security information and event management system of claim 11, wherein the partitioning module is to receive a batch of event data and determine a seed event from the batch of event data, and the sizing parameter for each dimension is a distance from the seed event. 13. The security information and event management system of claim 12, wherein the plurality of dimensions are time-based attributes of the event data, and the distance for each time-based attribute comprises a time period. 14. The security information and event management system of claim 13, wherein the partitioning module is to partition the event data across the plurality of dimensions simultaneously by determining for each event in the event data whether the time-based attributes for each event are all within the distances of the event seed, and including the event in the cluster if all the time-based attributes for the event are within the distances of the event seed. 15. A non-volatile computer readable medium including machine readable instructions executable by at least one processor to:
determine a plurality of dimensions; partition event data across the plurality of dimensions simultaneously based on a sizing parameter for each dimension; and store a cluster including the partitioned event data and metadata including attributes identifying the cluster from a plurality of stored clusters. | 2,100 |
4,748 | 12,108,545 | 2,194 | A computer system with a first messaging application communicates a message to another computer system with a second messaging application via a coupling facility storage device. If the message does not exceed a predetermined threshold, the message is put onto the queue in the coupling facility. If the message does exceed a predetermined threshold, the message is put onto a log associated with the first messaging application and readable by the second messaging application. A pointer to the message is put onto the queue in the coupling facility. The pointer can be used to access the message in the log. | 1. A method for message handling comprising:
intercepting a message before it is received into a storage device; comparing a size associated with the message against a predetermined threshold; generating, in response to the size exceeding the predetermined threshold, a pointer associated with the message; storing the pointer in the storage device; and storing the message in a log associated with a first messaging application. 2. The method of claim 1, wherein the storage device is accessible by the first messaging application and a second messaging application. 3. The method of claim 2, wherein the first messaging application has read/write access to the log and the second messaging application has read access to the log. 4. The method of claim 3, wherein the pointer in the storage device is configured for use by the second messaging application to access the message in the log. 5. The method of claim 4, wherein the first messaging application comprises a catalogue having data associating the message with at least one of the log and an offload storage device. 6. The method of claim 5, wherein the storage device comprises a coupling facility operable to maintain a queue. 7. The method of claim 6, wherein the message is non-persistent. 8. The method of claim 6, wherein the message is persistent. 9. The method of claim 6, wherein the log is implementable using at least one of direct access memory and a magnetic disk. 10. The method of claim 2, further comprising:
determining an offload storage device onto which the message in the log is to be offloaded. 11. The method of claim 10, wherein determining an offload storage device further comprises:
using weight data associated with one or more offload storage devices. 12. The method of claim 11, wherein the weight data is associated with at least one of: a priority of the message and a size of the message. 13. The method of claim 11, wherein determining an offload storage device further comprises checking whether there is a pointer in the storage device associated with the message to be offloaded before offload of the message. 14. The method of claim 13, wherein the offload storage device comprises a database. 15. A computer program product for message handling, comprising:
a computer readable medium; first program instructions to intercept a message before it is received into a storage device; second program instructions to compare a size associated with the message against a predetermined threshold; third program instructions to generate, in response to the size exceeding the predetermined threshold, a pointer associated with the message; fourth program instructions to store the pointer in the storage device; fifth program instructions to store the message in a log associated with a first messaging application; and wherein said program instructions are stored on said computer readable medium. 16. The computer program product of claim 15, wherein the storage device is accessible by the first messaging application and a second messaging application. 17. The computer program product of claim 16, wherein the first messaging application has read/write access to the log and the second messaging application has read access to the log. 18. The computer program product of claim 17, wherein the pointer in the storage device is configured for use by the second messaging application to access the message in the log. 19. The computer program product of claim 18, wherein the first messaging application comprises a catalogue having data associating the message with at least one of: the log and an offload storage device. 20. The computer program product of claim 19, wherein the storage device comprises a coupling facility operable to maintain a queue. 21. The computer program product of claim 16, further comprising:
sixth program instructions to determine an offload storage device onto which the message in the log is to be offloaded. 22. The computer program product of claim 21, wherein said sixth program instructions to determine an offload storage device further comprises:
program instructions to use weight data associated with one or more offload storage devices. 23. The computer program product of claim 22, wherein the weight data is associated with at least one of: a priority of the message and a size of the message. 24. The computer program product of claim 22, wherein the sixth program instructions to determine an offload storage device further comprises:
program instructions to check whether there is a pointer in the storage device associated with the message to be offloaded before offload of the message. 25. The computer program product of claim 24, wherein the offload storage device comprises a database. | A computer system with a first messaging application communicates a message to another computer system with a second messaging application via a coupling facility storage device. If the message does not exceed a predetermined threshold, the message is put onto the queue in the coupling facility. If the message does exceed a predetermined threshold, the message is put onto a log associated with the first messaging application and readable by the second messaging application. A pointer to the message is put onto the queue in the coupling facility. The pointer can be used to access the message in the log.1. A method for message handling comprising:
intercepting a message before it is received into a storage device; comparing a size associated with the message against a predetermined threshold; generating, in response to the size exceeding the predetermined threshold, a pointer associated with the message; storing the pointer in the storage device; and storing the message in a log associated with a first messaging application. 2. The method of claim 1, wherein the storage device is accessible by the first messaging application and a second messaging application. 3. The method of claim 2, wherein the first messaging application has read/write access to the log and the second messaging application has read access to the log. 4. The method of claim 3, wherein the pointer in the storage device is configured for use by the second messaging application to access the message in the log. 5. The method of claim 4, wherein the first messaging application comprises a catalogue having data associating the message with at least one of the log and an offload storage device. 6. The method of claim 5, wherein the storage device comprises a coupling facility operable to maintain a queue. 7. The method of claim 6, wherein the message is non-persistent. 8. The method of claim 6, wherein the message is persistent. 9. The method of claim 6, wherein the log is implementable using at least one of direct access memory and a magnetic disk. 10. The method of claim 2, further comprising:
determining an offload storage device onto which the message in the log is to be offloaded. 11. The method of claim 10, wherein determining an offload storage device further comprises:
using weight data associated with one or more offload storage devices. 12. The method of claim 11, wherein the weight data is associated with at least one of: a priority of the message and a size of the message. 13. The method of claim 11, wherein determining an offload storage device further comprises checking whether there is a pointer in the storage device associated with the message to be offloaded before offload of the message. 14. The method of claim 13, wherein the offload storage device comprises a database. 15. A computer program product for message handling, comprising:
a computer readable medium; first program instructions to intercept a message before it is received into a storage device; second program instructions to compare a size associated with the message against a predetermined threshold; third program instructions to generate, in response to the size exceeding the predetermined threshold, a pointer associated with the message; fourth program instructions to store the pointer in the storage device; fifth program instructions to store the message in a log associated with a first messaging application; and wherein said program instructions are stored on said computer readable medium. 16. The computer program product of claim 15, wherein the storage device is accessible by the first messaging application and a second messaging application. 17. The computer program product of claim 16, wherein the first messaging application has read/write access to the log and the second messaging application has read access to the log. 18. The computer program product of claim 17, wherein the pointer in the storage device is configured for use by the second messaging application to access the message in the log. 19. The computer program product of claim 18, wherein the first messaging application comprises a catalogue having data associating the message with at least one of: the log and an offload storage device. 20. The computer program product of claim 19, wherein the storage device comprises a coupling facility operable to maintain a queue. 21. The computer program product of claim 16, further comprising:
sixth program instructions to determine an offload storage device onto which the message in the log is to be offloaded. 22. The computer program product of claim 21, wherein said sixth program instructions to determine an offload storage device further comprises:
program instructions to use weight data associated with one or more offload storage devices. 23. The computer program product of claim 22, wherein the weight data is associated with at least one of: a priority of the message and a size of the message. 24. The computer program product of claim 22, wherein the sixth program instructions to determine an offload storage device further comprises:
program instructions to check whether there is a pointer in the storage device associated with the message to be offloaded before offload of the message. 25. The computer program product of claim 24, wherein the offload storage device comprises a database. | 2,100 |
4,749 | 14,648,290 | 2,111 | A memory controller is to interface with a memory, associated with a plurality of pins, based on a codeword. The codeword is to include a plurality of n-bit symbols. An n-bit symbol of the codeword is to be formed from a plurality of n bursts over time associated with one of the pins of the memory. | 1. A system comprising:
a memory controller to interface with a memory, associated with a plurality of pins, based on a codeword including a plurality of n-bit symbols; wherein an n-bit symbol of the codeword is formed from a plurality of n bursts over time associated with one of the plurality of pins of the memory. 2. The system of claim 1, wherein the memory includes a plurality of dynamic random-access memory (DRAM) chips, and a DRAM chip is associated with a number of symbols corresponding to the number of pins of the DRAM chip. 3. The system of claim 1, wherein the memory controller is to interface with a memory corresponding to a 72-pin dual in-line memory module (DIMM), and the codeword includes 64 8-bit vertical data symbols and 8 8-bit vertical check symbols based on burst 8 data transfers. 4. The system of claim 3, wherein the memory controller is to correct up to 4 symbol errors, based on an ECC code and the 8 8-bit check symbols. 5. The system of claim 1, wherein the memory controller is to store an indication of a hard pin failure based on a previously corrected pin failure, and tolerate up to 7 pin failures based on the stored indication, a check symbol, and erasure coding. 6. The system of claim 1, wherein the memory is associated with a plurality of pins, and a pin of the plurality of pins is shared by a plurality of stacked memory dies. 7. The system of claim 1, wherein the plurality of n-bit symbols of the codeword includes an n-bit check symbol for every 8 n-bit data symbols. 8. The system of claim 1, wherein the memory is based on Double data rate (DDRx) synchronous dynamic random-access memory (SDRAM), where x is an integer corresponding to a burst data transfer rate of n bursts. 9. The system of claim 1, wherein each of the plurality of symbols is an 8-bit symbol based on an 8-burst, 1-bit transfer of the one of the plurality of pins, wherein errors in others of the plurality of pins do not affect the 8-bit symbol from the one of the plurality of pins. 10. A method, comprising:
interfacing, by a memory controller, a memory associated with a plurality of pins; forming, by the memory controller, an n-bit symbol based on a plurality of n bursts over time associated with one of the plurality of pins of the memory; and forming, by the memory controller, a codeword based on a plurality of n-bit symbols, wherein the plurality of n-bit symbols includes a plurality of data symbols and a plurality of check symbols. 11. The method of claim 10, further comprising accessing the memory based on a 72-bit wide channel, based on 64-bit data and 8-bit error-correcting code (ECC), to access a single memory module of the memory per access. 12. The method of claim 10, further comprising applying an ECC to the codeword, based on the use of the check symbols. 13. The method of claim 12, wherein the ECC is a Reed-Solomon code. 14. The method of claim 13, further comprising storing an indication of an error, and tolerating errors based on the stored indication and erasure coding. 15. A non-transitory computer readable medium having instructions stored thereon executable by a processor to cause a memory controller to:
interface a memory associated with a plurality of pins; form an n-bit symbol based on a plurality of n bursts over time associated with one of the plurality of pins of the memory; and form a codeword based on a plurality of n-bit symbols, wherein the plurality of n-bit symbols includes a plurality of data symbols and a plurality of check symbols. | A memory controller is to interface with a memory, associated with a plurality of pins, based on a codeword. The codeword is to include a plurality of n-bit symbols. An n-bit symbol of the codeword is to be formed from a plurality of n bursts over time associated with one of the pins of the memory.1. A system comprising:
a memory controller to interface with a memory, associated with a plurality of pins, based on a codeword including a plurality of n-bit symbols; wherein an n-bit symbol of the codeword is formed from a plurality of n bursts over time associated with one of the plurality of pins of the memory. 2. The system of claim 1, wherein the memory includes a plurality of dynamic random-access memory (DRAM) chips, and a DRAM chip is associated with a number of symbols corresponding to the number of pins of the DRAM chip. 3. The system of claim 1, wherein the memory controller is to interface with a memory corresponding to a 72-pin dual in-line memory module (DIMM), and the codeword includes 64 8-bit vertical data symbols and 8 8-bit vertical check symbols based on burst 8 data transfers. 4. The system of claim 3, wherein the memory controller is to correct up to 4 symbol errors, based on an ECC code and the 8 8-bit check symbols. 5. The system of claim 1, wherein the memory controller is to store an indication of a hard pin failure based on a previously corrected pin failure, and tolerate up to 7 pin failures based on the stored indication, a check symbol, and erasure coding. 6. The system of claim 1, wherein the memory is associated with a plurality of pins, and a pin of the plurality of pins is shared by a plurality of stacked memory dies. 7. The system of claim 1, wherein the plurality of n-bit symbols of the codeword includes an n-bit check symbol for every 8 n-bit data symbols. 8. The system of claim 1, wherein the memory is based on Double data rate (DDRx) synchronous dynamic random-access memory (SDRAM), where x is an integer corresponding to a burst data transfer rate of n bursts. 9. The system of claim 1, wherein each of the plurality of symbols is an 8-bit symbol based on an 8-burst, 1-bit transfer of the one of the plurality of pins, wherein errors in others of the plurality of pins do not affect the 8-bit symbol from the one of the plurality of pins. 10. A method, comprising:
interfacing, by a memory controller, a memory associated with a plurality of pins; forming, by the memory controller, an n-bit symbol based on a plurality of n bursts over time associated with one of the plurality of pins of the memory; and forming, by the memory controller, a codeword based on a plurality of n-bit symbols, wherein the plurality of n-bit symbols includes a plurality of data symbols and a plurality of check symbols. 11. The method of claim 10, further comprising accessing the memory based on a 72-bit wide channel, based on 64-bit data and 8-bit error-correcting code (ECC), to access a single memory module of the memory per access. 12. The method of claim 10, further comprising applying an ECC to the codeword, based on the use of the check symbols. 13. The method of claim 12, wherein the ECC is a Reed-Solomon code. 14. The method of claim 13, further comprising storing an indication of an error, and tolerating errors based on the stored indication and erasure coding. 15. A non-transitory computer readable medium having instructions stored thereon executable by a processor to cause a memory controller to:
interface a memory associated with a plurality of pins; form an n-bit symbol based on a plurality of n bursts over time associated with one of the plurality of pins of the memory; and form a codeword based on a plurality of n-bit symbols, wherein the plurality of n-bit symbols includes a plurality of data symbols and a plurality of check symbols. | 2,100 |
4,750 | 14,580,668 | 2,174 | An electronic device is described herein. The electronic device includes a processor, a display screen, and a computer-readable medium that includes instructions to direct the actions of a processor. The instructions are to direct the processor to display an analog clock on the display screen, receive information about a time event, and display a time event icon on the analog clock at a position that identifies a time of the time event. | 1. An electronic device, comprising:
a display unit; an event information interface to receive information about a time event; and a Graphical User Interface (GUI) to display an analog clock on the display unit and display a time event icon on the analog clock at a position that identifies a time of the time event. 2. The electronic device of claim 1, wherein the GUI is to display the time event icon on an hour scale of the analog clock. 3. The electronic device of claim 2, wherein the GUI is to switch the time event icon to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 4. The electronic device of claim 3, wherein the GUI is to change the appearance of the analog clock or the time event icon to alert the user that the time event icon is being displayed on the minute scale. 5. The electronic device of claim 1, comprising a touch screen input, wherein the GUI is to display additional information about the time event in response to touching the time event icon. 6. The electronic device of claim 1, comprising a touch screen input and a positioning system, wherein the GUI is to plot a geographical location of the time event on a map in response to touching the time event icon. 7. The electronic device of claim 1, comprising a movement sensor wherein the GUI is to temporarily remove the time event icon in response to movement of the electronic device. 8. The electronic device of claim 1, comprising a movement sensor and an event generator to generate a time event based, in part, on movement of the electronic device. 9. The electronic device of claim 1, comprising a positioning system and an event generator to generate a time event based, in part, on a location of the electronic device and a current time. 10. The electronic device of claim 9, wherein the event generator is to generate the time event by correlating the location of the electronic device and the current time with a potential time event generated based on prior user behavior. 11. A computer-readable medium, comprising instructions to direct a processor to:
display an analog clock on a display screen; receive information about a time event; and display a time event icon on the analog clock at a position that identifies a time of the time event. 12. The computer-readable medium of claim 11, wherein the instructions to direct the processor to display the time event icon direct the processor to display the time event icon on the hour scale of the analog clock. 13. The computer-readable medium of claim 12, comprising instructions to direct the processor to switch the time event icon to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 14. The computer-readable medium of claim 13, comprising instructions to direct the processor to change the appearance of the analog clock or the time event icon to alert a user that the time event icon is being displayed on the minute scale. 15. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a touch screen and plot a geographical location of the time event on a map in response to touching the time event icon in the analog clock display. 16. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a movement sensor and temporarily remove the time event icon in response to movement of the electronic device. 17. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a movement sensor and generate a time event based, in part, on detection of movement. 18. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive location data from a positioning system generate a time event based, in part, on a location and a current time. 19. A smartwatch comprising:
a touch screen display to display a graphical user interface, the graphical user interface comprising an analog clock and a time event icon positioned on the analog clock at a position that identifies a time of a corresponding time event. 20. The smartwatch of claim 19, wherein the time event icon is displayed on an hour scale of the analog clock if a time remaining until the time event is greater than a specified threshold, and the time event icon is displayed on a minute scale of the analog clock if the time remaining until the time event is less than the specified threshold. 21. The smartwatch of claim 19, wherein the time event icon is displayed on an hour scale of the analog clock if a time remaining until the time event is greater than approximately 60 minutes, and the time event icon is displayed on a minute scale of the analog clock if the time remaining until the time event is less than approximately 60 minutes. 22. The smartwatch of claim 19, wherein the graphical user interface displays a textual description of the time event if the user taps the time event icon. 23. The smartwatch of claim 19, wherein the graphical user interface displays all information and options to interact with the time event in a new screen if the user drags the time event icon toward a center of the analog clock. 24. The smartwatch of claim 19, wherein the graphical user interface deletes the time event if the user selects the time event icon and drags the time event icon toward an edge of the analog clock. 25. The smartwatch of claim 19, comprising a motion sensor, wherein shaking the smartwatch temporarily removes the time event icon from the graphical user interface. 26. A method comprising:
displaying an analog clock on a display screen; receiving information about a time event; and displaying a time event icon on the analog clock at a position that identifies a time of the time event. 27. The method of claim 26, comprising switching the time event icon from an hour scale of the analog clock to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 28. The method of claim 27, comprising alerting a user that the time event icon is being displayed on the minute scale by changing the appearance of the analog clock or the time event icon when the time event icon switches to the minute scale. 29. The method of claim 26, comprising receiving input from a touch screen associated with the analog clock and plotting a geographical location of the time event on a map in response to touching the time event icon in the analog clock display. 30. The method of claim 26, comprising generating a time event based, in part, on a location received from a positioning system. | An electronic device is described herein. The electronic device includes a processor, a display screen, and a computer-readable medium that includes instructions to direct the actions of a processor. The instructions are to direct the processor to display an analog clock on the display screen, receive information about a time event, and display a time event icon on the analog clock at a position that identifies a time of the time event.1. An electronic device, comprising:
a display unit; an event information interface to receive information about a time event; and a Graphical User Interface (GUI) to display an analog clock on the display unit and display a time event icon on the analog clock at a position that identifies a time of the time event. 2. The electronic device of claim 1, wherein the GUI is to display the time event icon on an hour scale of the analog clock. 3. The electronic device of claim 2, wherein the GUI is to switch the time event icon to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 4. The electronic device of claim 3, wherein the GUI is to change the appearance of the analog clock or the time event icon to alert the user that the time event icon is being displayed on the minute scale. 5. The electronic device of claim 1, comprising a touch screen input, wherein the GUI is to display additional information about the time event in response to touching the time event icon. 6. The electronic device of claim 1, comprising a touch screen input and a positioning system, wherein the GUI is to plot a geographical location of the time event on a map in response to touching the time event icon. 7. The electronic device of claim 1, comprising a movement sensor wherein the GUI is to temporarily remove the time event icon in response to movement of the electronic device. 8. The electronic device of claim 1, comprising a movement sensor and an event generator to generate a time event based, in part, on movement of the electronic device. 9. The electronic device of claim 1, comprising a positioning system and an event generator to generate a time event based, in part, on a location of the electronic device and a current time. 10. The electronic device of claim 9, wherein the event generator is to generate the time event by correlating the location of the electronic device and the current time with a potential time event generated based on prior user behavior. 11. A computer-readable medium, comprising instructions to direct a processor to:
display an analog clock on a display screen; receive information about a time event; and display a time event icon on the analog clock at a position that identifies a time of the time event. 12. The computer-readable medium of claim 11, wherein the instructions to direct the processor to display the time event icon direct the processor to display the time event icon on the hour scale of the analog clock. 13. The computer-readable medium of claim 12, comprising instructions to direct the processor to switch the time event icon to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 14. The computer-readable medium of claim 13, comprising instructions to direct the processor to change the appearance of the analog clock or the time event icon to alert a user that the time event icon is being displayed on the minute scale. 15. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a touch screen and plot a geographical location of the time event on a map in response to touching the time event icon in the analog clock display. 16. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a movement sensor and temporarily remove the time event icon in response to movement of the electronic device. 17. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive input from a movement sensor and generate a time event based, in part, on detection of movement. 18. The computer-readable medium of any one of claims 11, comprising instructions to direct the processor to receive location data from a positioning system generate a time event based, in part, on a location and a current time. 19. A smartwatch comprising:
a touch screen display to display a graphical user interface, the graphical user interface comprising an analog clock and a time event icon positioned on the analog clock at a position that identifies a time of a corresponding time event. 20. The smartwatch of claim 19, wherein the time event icon is displayed on an hour scale of the analog clock if a time remaining until the time event is greater than a specified threshold, and the time event icon is displayed on a minute scale of the analog clock if the time remaining until the time event is less than the specified threshold. 21. The smartwatch of claim 19, wherein the time event icon is displayed on an hour scale of the analog clock if a time remaining until the time event is greater than approximately 60 minutes, and the time event icon is displayed on a minute scale of the analog clock if the time remaining until the time event is less than approximately 60 minutes. 22. The smartwatch of claim 19, wherein the graphical user interface displays a textual description of the time event if the user taps the time event icon. 23. The smartwatch of claim 19, wherein the graphical user interface displays all information and options to interact with the time event in a new screen if the user drags the time event icon toward a center of the analog clock. 24. The smartwatch of claim 19, wherein the graphical user interface deletes the time event if the user selects the time event icon and drags the time event icon toward an edge of the analog clock. 25. The smartwatch of claim 19, comprising a motion sensor, wherein shaking the smartwatch temporarily removes the time event icon from the graphical user interface. 26. A method comprising:
displaying an analog clock on a display screen; receiving information about a time event; and displaying a time event icon on the analog clock at a position that identifies a time of the time event. 27. The method of claim 26, comprising switching the time event icon from an hour scale of the analog clock to a minute scale of the analog clock within a specified time threshold prior to the time of the time event. 28. The method of claim 27, comprising alerting a user that the time event icon is being displayed on the minute scale by changing the appearance of the analog clock or the time event icon when the time event icon switches to the minute scale. 29. The method of claim 26, comprising receiving input from a touch screen associated with the analog clock and plotting a geographical location of the time event on a map in response to touching the time event icon in the analog clock display. 30. The method of claim 26, comprising generating a time event based, in part, on a location received from a positioning system. | 2,100 |
4,751 | 14,546,907 | 2,157 | A database stores a parts list, a tools and materials list, a repair information list, and an equipment list. The parts list and the tools and materials list are associated with regulation information, which indicates that the parts, the tools, and the materials are subject to a regulation, and updated every time a new regulation is imposed. The repair information list is associated with an indicator which indicates whether a repair is compliant with the regulation, and updated every time a repair is performed. The equipment list is associated with an indicator which indicates whether equipment is compliant with the regulation, and updated every time one of the parts list, the tools and materials list, and the repair information list is updated. Those which are not compliant with the regulation are extracted from each list stored in the database, and displayed on a regulatory compliance check screen. | 1. A repair information management apparatus for managing repair information of medical equipment, comprising:
an operation screen distributor for distributing operation screens to a plurality of terminals through a network, the repair information being inputted through and displayed on the operation screen; and a database for storing regulation information related to a regulation on the medical equipment or each part constituting the medical equipment, the regulation information being stored in the database for the purpose of displaying whether the medical equipment or the part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation on the operation screen. 2. The repair information management apparatus according to claim 1, further comprising an operation screen generator for generating the operation screen, the operation screen generator generating the operation screen based on the regulation information, the operation screen displaying whether the equipment or the part constituting the equipment is the compliant product or the non-compliant product. 3. The repair information management apparatus according to claim 2, wherein the operation screen generator generates the operation screen in which additional information is added to the medical equipment or the part constituting the medical equipment displayed, and the additional information indicates whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product. 4. The repair information management apparatus according to claim 2, wherein the operation screen generator determines, based on the regulation information, whether to display the medical equipment or the part constituting the medical equipment on the operation screen, and generates the operation screen. 5. The repair information management apparatus according to claim 1, wherein the regulation information stored in the database includes regulation information related to the regulation on tools and materials used for a repair of the medical equipment, in addition to the regulation information related to the regulation on the medical equipment or the each part constituting the medical equipment. 6. The repair information management apparatus according to claim 1, wherein the operation screens include a parts selection screen for displaying selectable parts for a repair of the medical equipment and allowing selecting the part to be used for the repair from the selectable parts. 7. The repair information management apparatus according to claim 1, wherein the operation screens include a parts list display screen for displaying a list of the parts constituting the medical equipment. 8. The repair information management apparatus according to claim 1, wherein the operation screens include a medical equipment list display screen for displaying a list of the medical equipment. 9. The repair information management apparatus according to claim 1, wherein the operation screens include a repair history display screen for displaying a repair history. 10. The repair information management apparatus according to claim 1, wherein the operation screens include a time-series compliance check screen for chronologically displaying, for the medical equipment or the part constituting the medical equipment, whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product. 11. A repair information management system for managing repair information of medical equipment, comprising:
a plurality of terminals; and a repair information management apparatus comprising an operation screen distributor and a database, the operation screen distributor distributing operation screens to the terminals through a network, the repair information being inputted through and displayed on the operation screen, the database storing regulation information related to a regulation on the medical equipment or each part constituting the medical equipment, the regulation information being stored in the database for the purpose of displaying whether the medical equipment or the part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation on the operation screen. 12. A method for managing repair information of medical equipment, comprising the steps of:
distributing operation screens to a plurality of terminals through a network, the repair information being inputted through and displayed on the operation screen; consulting a database which stores regulation information related to a regulation and determining whether the medical equipment or a part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation; and displaying whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product on the operation screen. | A database stores a parts list, a tools and materials list, a repair information list, and an equipment list. The parts list and the tools and materials list are associated with regulation information, which indicates that the parts, the tools, and the materials are subject to a regulation, and updated every time a new regulation is imposed. The repair information list is associated with an indicator which indicates whether a repair is compliant with the regulation, and updated every time a repair is performed. The equipment list is associated with an indicator which indicates whether equipment is compliant with the regulation, and updated every time one of the parts list, the tools and materials list, and the repair information list is updated. Those which are not compliant with the regulation are extracted from each list stored in the database, and displayed on a regulatory compliance check screen.1. A repair information management apparatus for managing repair information of medical equipment, comprising:
an operation screen distributor for distributing operation screens to a plurality of terminals through a network, the repair information being inputted through and displayed on the operation screen; and a database for storing regulation information related to a regulation on the medical equipment or each part constituting the medical equipment, the regulation information being stored in the database for the purpose of displaying whether the medical equipment or the part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation on the operation screen. 2. The repair information management apparatus according to claim 1, further comprising an operation screen generator for generating the operation screen, the operation screen generator generating the operation screen based on the regulation information, the operation screen displaying whether the equipment or the part constituting the equipment is the compliant product or the non-compliant product. 3. The repair information management apparatus according to claim 2, wherein the operation screen generator generates the operation screen in which additional information is added to the medical equipment or the part constituting the medical equipment displayed, and the additional information indicates whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product. 4. The repair information management apparatus according to claim 2, wherein the operation screen generator determines, based on the regulation information, whether to display the medical equipment or the part constituting the medical equipment on the operation screen, and generates the operation screen. 5. The repair information management apparatus according to claim 1, wherein the regulation information stored in the database includes regulation information related to the regulation on tools and materials used for a repair of the medical equipment, in addition to the regulation information related to the regulation on the medical equipment or the each part constituting the medical equipment. 6. The repair information management apparatus according to claim 1, wherein the operation screens include a parts selection screen for displaying selectable parts for a repair of the medical equipment and allowing selecting the part to be used for the repair from the selectable parts. 7. The repair information management apparatus according to claim 1, wherein the operation screens include a parts list display screen for displaying a list of the parts constituting the medical equipment. 8. The repair information management apparatus according to claim 1, wherein the operation screens include a medical equipment list display screen for displaying a list of the medical equipment. 9. The repair information management apparatus according to claim 1, wherein the operation screens include a repair history display screen for displaying a repair history. 10. The repair information management apparatus according to claim 1, wherein the operation screens include a time-series compliance check screen for chronologically displaying, for the medical equipment or the part constituting the medical equipment, whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product. 11. A repair information management system for managing repair information of medical equipment, comprising:
a plurality of terminals; and a repair information management apparatus comprising an operation screen distributor and a database, the operation screen distributor distributing operation screens to the terminals through a network, the repair information being inputted through and displayed on the operation screen, the database storing regulation information related to a regulation on the medical equipment or each part constituting the medical equipment, the regulation information being stored in the database for the purpose of displaying whether the medical equipment or the part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation on the operation screen. 12. A method for managing repair information of medical equipment, comprising the steps of:
distributing operation screens to a plurality of terminals through a network, the repair information being inputted through and displayed on the operation screen; consulting a database which stores regulation information related to a regulation and determining whether the medical equipment or a part constituting the medical equipment is a compliant product that is compliant with the regulation or a non-compliant product that is not compliant with the regulation; and displaying whether the medical equipment or the part constituting the medical equipment is the compliant product or the non-compliant product on the operation screen. | 2,100 |
4,752 | 11,823,557 | 2,154 | A patent Examiner information accessing system access patent Examiner information from a Patent and Trademark Office, or other, database. A search system is provided so that a user can search information aggregated by the Examiner information accessing system. | 1. A data accessing system, comprising:
a data store containing a collection of patent related writings generated by at least one patent examiner; and a data search component configured to identify a subset of the collection of patent related writings, wherein the subset is a set of the patent related writings that are identified as containing a denial of patentability based on a specific type of rejection. 2. The system of claim 1, wherein the collection of patent related writings is generated by a plurality of different patent examiners. 3. The system of claim 1, wherein the subset of the collection of patent related writings contains patent related writings generated by a plurality of different patent examiners. 4. The system of claim 1, further comprising an interface component configured to facilitate a user-initiated input identifying the specific type of rejection. 5. The system of claim 1, further comprising a user interface accessible over a wide area network and configured to facilitate a user-initiated input identifying the specific type of rejection. 6. The system of claim 1, wherein the data store contains an indication of a specific type of rejection contained in a specific one of the patent related writings, wherein the indication is selected based on analysis of textual content of the specific one of the patent related writings. 7. The system of claim 1, wherein the data store contains an indication of a specific type of rejection as determined based on a classification of text contained in one or more of the patent related writings. 8. The system of claim 7, wherein the classification is an automated classification. 9. The system of claim 7, wherein the classification is a computer-implemented function. 10. A data accessing system, comprising:
a computer-implemented identifier that identifies a rejection basis associated with a patent related writing generated by a patent examiner and related to prosecution of a patent application. 11. The system of claim 10, wherein the parameter identifier identifies the rejection basis based on textual content of the patent related writing. 12. The system of claim 10, wherein the parameter identifier identifies the rejection basis based on an automatically derived text searchable version of the patent related writing. 13. The system of claim 1, wherein the rejection is a section of a legal statute. 14. The system of claim 1, wherein the rejection basis is a restriction requirement. 15. The system of claim 1, wherein the rejection basis is a rejection under 35 U.S.C. §102 or 35 U.S.C. §103. 16. A computer-implemented method of providing information, the method comprising:
obtaining a patent related writing generated by a patent examiner and related to prosecution of a patent application; identifying a rejection basis associated with the patent related writing; receiving a query that contains an indication of a target rejection basis; determining if the indication of the target rejection basis is consistent with the rejection basis associated with the patent related writing; and if it is consistent, then responding to the query by providing an indication of the patent related writing. 17. The method of claim 16, wherein identifying a rejection basis comprises analyzing textual content of the patent related writing. 18. The method of claim 16, wherein identifying a rejection basis comprises applying a classification model to textual content of the patent related writing. 19. The method of claim 16, wherein responding to the query comprises responding only if the patent related writing is identified as being created by an examiner noted in the query as being target examiner. 20. The method of claim 16, wherein receiving a query comprises receiving a query through a user interface made remotely available over a computer network. | A patent Examiner information accessing system access patent Examiner information from a Patent and Trademark Office, or other, database. A search system is provided so that a user can search information aggregated by the Examiner information accessing system.1. A data accessing system, comprising:
a data store containing a collection of patent related writings generated by at least one patent examiner; and a data search component configured to identify a subset of the collection of patent related writings, wherein the subset is a set of the patent related writings that are identified as containing a denial of patentability based on a specific type of rejection. 2. The system of claim 1, wherein the collection of patent related writings is generated by a plurality of different patent examiners. 3. The system of claim 1, wherein the subset of the collection of patent related writings contains patent related writings generated by a plurality of different patent examiners. 4. The system of claim 1, further comprising an interface component configured to facilitate a user-initiated input identifying the specific type of rejection. 5. The system of claim 1, further comprising a user interface accessible over a wide area network and configured to facilitate a user-initiated input identifying the specific type of rejection. 6. The system of claim 1, wherein the data store contains an indication of a specific type of rejection contained in a specific one of the patent related writings, wherein the indication is selected based on analysis of textual content of the specific one of the patent related writings. 7. The system of claim 1, wherein the data store contains an indication of a specific type of rejection as determined based on a classification of text contained in one or more of the patent related writings. 8. The system of claim 7, wherein the classification is an automated classification. 9. The system of claim 7, wherein the classification is a computer-implemented function. 10. A data accessing system, comprising:
a computer-implemented identifier that identifies a rejection basis associated with a patent related writing generated by a patent examiner and related to prosecution of a patent application. 11. The system of claim 10, wherein the parameter identifier identifies the rejection basis based on textual content of the patent related writing. 12. The system of claim 10, wherein the parameter identifier identifies the rejection basis based on an automatically derived text searchable version of the patent related writing. 13. The system of claim 1, wherein the rejection is a section of a legal statute. 14. The system of claim 1, wherein the rejection basis is a restriction requirement. 15. The system of claim 1, wherein the rejection basis is a rejection under 35 U.S.C. §102 or 35 U.S.C. §103. 16. A computer-implemented method of providing information, the method comprising:
obtaining a patent related writing generated by a patent examiner and related to prosecution of a patent application; identifying a rejection basis associated with the patent related writing; receiving a query that contains an indication of a target rejection basis; determining if the indication of the target rejection basis is consistent with the rejection basis associated with the patent related writing; and if it is consistent, then responding to the query by providing an indication of the patent related writing. 17. The method of claim 16, wherein identifying a rejection basis comprises analyzing textual content of the patent related writing. 18. The method of claim 16, wherein identifying a rejection basis comprises applying a classification model to textual content of the patent related writing. 19. The method of claim 16, wherein responding to the query comprises responding only if the patent related writing is identified as being created by an examiner noted in the query as being target examiner. 20. The method of claim 16, wherein receiving a query comprises receiving a query through a user interface made remotely available over a computer network. | 2,100 |
4,753 | 14,089,198 | 2,156 | Systems and methods are provided to facilitate an integrated display of information to a user. According to some embodiments, a first service and a second service may be registered with a registry. The information stored in the registry might include, for example, indications that the first and/or second services are to receive data from disparate remote sources. According to some embodiments, placement information is received from a user to lay out the first and second services within a pane of an application. Moreover, information from the remote sources may be displayed to the user within the pane. | 1. A method, comprising:
storing a first service on a non-transitory computer readable data storage of a remote display management server registry, the first service configured to receive data from a first remote data source; storing a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source; receiving, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application; storing the layout information on the data storage of the remote display management server registry; and displaying data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. 2. The method of claim 1, wherein the display application is associated with a contact information application. 3. The method of claim 2, wherein said receiving is performed via a graphical user interface tool bar component added to the contact information application, and said displaying is performed via a contact information display. 4. The method of claim 1, wherein the data storage further includes an indication that the first service is to publish data. 5. The method of claim 1, further including receiving context information input by the user and displaying data from the first remote data source and that second remote data source that is associated with the context information. 6. A remote display management server, comprising:
a communication port adapted to exchange data via a network; and a processor coupled to the communication port, wherein the processor is configured to:
store a first service on a non-transitory computer readable data storage of the remote display management server, the first service configured to receive data from a first remote data source;
store a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source;
receive, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application;
store the layout information on the data storage of the remote display management server registry; and
display data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. 7. The display management server of claim 6, wherein the processor is further configured to store both an operating system registry and user role information. 8. A non-transitory computer-readable medium having instructions adapted to be executed by a processor of a user device to perform a method, the method comprising:
storing a first service on a non-transitory computer readable data storage of a remote display management server registry, the first service configured to receive data from a first remote data source; storing a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source; receiving, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application; storing the layout information on the data storage of the remote display management server registry; and displaying data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. | Systems and methods are provided to facilitate an integrated display of information to a user. According to some embodiments, a first service and a second service may be registered with a registry. The information stored in the registry might include, for example, indications that the first and/or second services are to receive data from disparate remote sources. According to some embodiments, placement information is received from a user to lay out the first and second services within a pane of an application. Moreover, information from the remote sources may be displayed to the user within the pane.1. A method, comprising:
storing a first service on a non-transitory computer readable data storage of a remote display management server registry, the first service configured to receive data from a first remote data source; storing a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source; receiving, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application; storing the layout information on the data storage of the remote display management server registry; and displaying data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. 2. The method of claim 1, wherein the display application is associated with a contact information application. 3. The method of claim 2, wherein said receiving is performed via a graphical user interface tool bar component added to the contact information application, and said displaying is performed via a contact information display. 4. The method of claim 1, wherein the data storage further includes an indication that the first service is to publish data. 5. The method of claim 1, further including receiving context information input by the user and displaying data from the first remote data source and that second remote data source that is associated with the context information. 6. A remote display management server, comprising:
a communication port adapted to exchange data via a network; and a processor coupled to the communication port, wherein the processor is configured to:
store a first service on a non-transitory computer readable data storage of the remote display management server, the first service configured to receive data from a first remote data source;
store a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source;
receive, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application;
store the layout information on the data storage of the remote display management server registry; and
display data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. 7. The display management server of claim 6, wherein the processor is further configured to store both an operating system registry and user role information. 8. A non-transitory computer-readable medium having instructions adapted to be executed by a processor of a user device to perform a method, the method comprising:
storing a first service on a non-transitory computer readable data storage of a remote display management server registry, the first service configured to receive data from a first remote data source; storing a second service on the data storage of the remote display management server registry, the second service configured to receive data from a second remote source, the second remote source being independent of the first remote data source; receiving, from a user of a first user device, layout information relating to a default placement of a windowed display of the first service and a windowed display of a second service within a pane of a display application; storing the layout information on the data storage of the remote display management server registry; and displaying data received from the first remote data source and the second remote data source on the first user device using the layout information stored on the data storage of the remote display management registry. | 2,100 |
4,754 | 14,623,292 | 2,122 | A mechanism is provided in a data processing system for question answering using context features in closure form. The mechanism receives a function call comprising an input question and a set of non-local context evidence in closure form. The mechanism decomposes the input question into one or more queries and applies the one or more queries to a corpus of information to obtain a set of local hypothesis evidence. The mechanism generates hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. | 1. A method, in a data processing system, for question answering using context features in closure form, the method comprising:
receiving, by the data processing system, a function call comprising an input question and a set of non-local context evidence in closure form; decomposing, by the data processing system, the input question into one or more queries; applying, by the data processing system, the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generating, by the data processing system, hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 2. The method of claim 1, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on being non-local to the function call. 3. The method of claim 1, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 4. The method of claim 3, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 5. The method of claim 4, wherein the weight of the set of non-local context evidence is inversely proportional to a difference between the associated timestamp and a timestamp of receipt of the input question. 6. The method of claim 1, further comprising:
automatically generating a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identifying a set of context evidence for the deepening question; and generating a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. 7. The method of claim 6, wherein the non-local evidence for the new function call comprises a container of closed evidence with an associated timestamp. 8. The method of claim 7, wherein the container of closed evidence comprises a nested container comprising at least a subset of the set of non-local context evidence. 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
receive a function call comprising an input question and a set of non-local context evidence in closure form; decompose the input question into one or more queries; apply the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generate hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 10. The computer program product of claim 9, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on being non-local to the function call. 11. The computer program product of claim 9, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 12. The computer program product of claim 11, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 13. The computer program product of claim 12, wherein the weight of the set of non-local context evidence is inversely proportional to a difference between the associated timestamp and a timestamp of receipt of the input question. 14. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
automatically generate a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identify a set of context evidence for the deepening question; and generate a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. 15. The computer program product of claim 14, wherein the non-local evidence for the new function call comprises a container of closed evidence with an associated timestamp. 16. The computer program product of claim 15, wherein the container of closed evidence comprises a nested container comprising at least a subset of the set of non-local context evidence. 17. 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 function call comprising an input question and a set of non-local context evidence in closure form; decompose the input question into one or more queries; apply the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generate hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 18. The apparatus of claim 17, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 19. The apparatus of claim 18, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 20. The apparatus of claim 17, wherein the instructions further cause the processor to:
automatically generate a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identify a set of context evidence for the deepening question; and generate a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. | A mechanism is provided in a data processing system for question answering using context features in closure form. The mechanism receives a function call comprising an input question and a set of non-local context evidence in closure form. The mechanism decomposes the input question into one or more queries and applies the one or more queries to a corpus of information to obtain a set of local hypothesis evidence. The mechanism generates hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence.1. A method, in a data processing system, for question answering using context features in closure form, the method comprising:
receiving, by the data processing system, a function call comprising an input question and a set of non-local context evidence in closure form; decomposing, by the data processing system, the input question into one or more queries; applying, by the data processing system, the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generating, by the data processing system, hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 2. The method of claim 1, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on being non-local to the function call. 3. The method of claim 1, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 4. The method of claim 3, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 5. The method of claim 4, wherein the weight of the set of non-local context evidence is inversely proportional to a difference between the associated timestamp and a timestamp of receipt of the input question. 6. The method of claim 1, further comprising:
automatically generating a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identifying a set of context evidence for the deepening question; and generating a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. 7. The method of claim 6, wherein the non-local evidence for the new function call comprises a container of closed evidence with an associated timestamp. 8. The method of claim 7, wherein the container of closed evidence comprises a nested container comprising at least a subset of the set of non-local context evidence. 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
receive a function call comprising an input question and a set of non-local context evidence in closure form; decompose the input question into one or more queries; apply the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generate hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 10. The computer program product of claim 9, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on being non-local to the function call. 11. The computer program product of claim 9, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 12. The computer program product of claim 11, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 13. The computer program product of claim 12, wherein the weight of the set of non-local context evidence is inversely proportional to a difference between the associated timestamp and a timestamp of receipt of the input question. 14. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
automatically generate a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identify a set of context evidence for the deepening question; and generate a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. 15. The computer program product of claim 14, wherein the non-local evidence for the new function call comprises a container of closed evidence with an associated timestamp. 16. The computer program product of claim 15, wherein the container of closed evidence comprises a nested container comprising at least a subset of the set of non-local context evidence. 17. 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 function call comprising an input question and a set of non-local context evidence in closure form; decompose the input question into one or more queries; apply the one or more queries to a corpus of information to obtain a set of local hypothesis evidence; and generate hypotheses for answering the input question based on the local hypothesis evidence and the set of non-local context evidence. 18. The apparatus of claim 17, wherein the set of non-local context evidence comprises a container of closed evidence with an associated timestamp. 19. The apparatus of claim 18, wherein generating the hypotheses for answering the input question comprises weighting the set of non-local context evidence based on the associated timestamp. 20. The apparatus of claim 17, wherein the instructions further cause the processor to:
automatically generate a deepening question based on the local hypothesis evidence and the set of non-local context evidence; identify a set of context evidence for the deepening question; and generate a new function call comprising the deepening question and the set of context evidence for the deepening question as non-local evidence for the new function call. | 2,100 |
4,755 | 14,041,410 | 2,185 | A connecting device, system and method for use in an industrial installation is disclosed, which includes at least one first industrial bus interface configured to receive first industrial bus input data and transmit first industrial bus output data using a first industrial bus protocol, and a second industrial bus interface configured to receive second industrial bus input data and transmit second industrial bus output data using a second industrial bus protocol. A modulator is configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol. An energy communicator is configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. | 1. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connecting device comprising:
at least one first industrial bus interface configured to receive first industrial bus input data transmitted using a first industrial bus protocol; a second industrial bus interface configured to receive second industrial bus input data using a second industrial bus protocol; a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. 2. The connecting device as claimed in claim 1, wherein the energy communicator is configured to transmit the first and/or second energy bus output data only when a security identifier of a receiving device connected to the energy supply line is available. 3. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connection device comprising:
at least one first industrial bus interface configured to transmit first industrial bus output data using a first industrial bus protocol; a second industrial bus interface configured to transmit second industrial bus output data using a second industrial bus protocol; an energy communicator configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using a carrier frequency method and contains first and second energy bus input data; and a demodulator configured to extract the first and second industrial bus output data modulated onto an industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 4. The connecting device as claimed in claim 3, wherein the energy communicator is configured to transmit a security identifier on the energy supply line. 5. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connecting device comprising:
at least one first industrial bus interface configured to receive first industrial bus input data and transmit first industrial bus output data using a first industrial bus protocol; a second industrial bus interface configured to receive second industrial bus input data and transmit second industrial bus output data using a second industrial bus protocol; a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method and configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using the carrier frequency method and contains first and second energy bus input data; and a demodulator configured to extract the first and second industrial bus output data modulated onto the industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 6. The connecting device as claimed in claim 5, wherein the energy communicator is configured to transmit a security identifier on the energy supply line and to transmit the first and/or second energy bus output data only when a security identifier of a receiving device connected to the energy supply line is available. 7. A system for transmitting signals between a control center and at least one field device in an industrial installation, the system comprising:
an energy supply line configured to supply the at least one field device with electrical energy; a first connecting device, wherein the first connecting device comprises:
at least one first industrial bus interface configured to receive first industrial bus input data transmitted using a first industrial bus protocol;
a second industrial bus interface configured to receive second industrial bus input data using a second industrial bus protocol;
a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and
an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method, and wherein the first connecting device is configured to be connected to the energy supply line and configured to be connected to the control center via at least one first control center industrial bus; and
a second connecting device, wherein the second connecting device comprises:
at least one first industrial bus interface configured to transmit first industrial bus output data using a first industrial bus protocol;
a second industrial bus interface configured to transmit second industrial bus output data using a second industrial bus protocol;
an energy communicator configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using a carrier frequency method and contains first and second energy bus input data; and
a demodulator configured to extract the first and second industrial bus output data modulated onto an industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus, and wherein second connecting device is configured to be connected to the energy supply line and configured to be connected to the at least one field device via at least one first field device industrial bus. 8. The system as claimed in claim 7, comprising:
a second field device which is supplied with electrical energy via the energy supply line, the second connecting device being configured to be connected to the second field device via the at least first field device industrial bus and/or via at least one second field device industrial bus. 9. The system as claimed in claim 8, comprising:
a second connecting device which is configured to be connected to the energy supply line and configured to be connected to the second field device via the at least first field device industrial bus and/or via the at least one second field device industrial bus. 10. The system as claimed in claim 7, wherein the communication on the at least first control center industrial bus and the at least first field device industrial bus is configured to use a same industrial bus protocol. 11. The system as claimed in claim 7, wherein the communication on the at least first control center industrial bus and/or the at least first field device industrial bus and/or the at least one second field device industrial bus is configured to use a control bus protocol or a field bus protocol. 12. The system as claimed in claim 7, wherein the communication on the at least first field device industrial bus and/or the at least one second field device industrial bus is configured to use a device bus protocol, a sensor bus protocol, or an operating device protocol. 13. The system as claimed in claim 7, wherein the first connecting device further comprises:
a demodulator configured to extract the first and second industrial bus output data modulated onto the industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 14. The system as claimed in claim 7, wherein the second connecting device further comprises:
a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol. 15. A method for forward signal transmission between a control center and at least one field device in an industrial installation, the industrial installation comprising an energy supply line configured to supply the at least one field device with electrical energy, the method comprising:
receiving a first industrial bus input data transmitted via an associated industrial bus using a first industrial bus protocol; receiving a second industrial bus input data transmitted via an associated industrial bus using a second industrial bus protocol; producing first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol; producing second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and transmitting the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. 16. A method for reverse signal transmission between a control center and at least one field device in an industrial installation, the industrial installation comprising an energy supply line configured to supply the at least one field device with electrical energy, the method comprising:
transmitting an energy bus input signal via the energy supply line using a carrier frequency method is received and extracted, the energy bus input signal containing first and second energy bus input data; transmitting first industrial bus output data using a first industrial bus protocol obtained from the first energy bus input data by means of extraction from an industrial Ethernet protocol; transmitting second industrial bus output data using a second industrial bus protocol obtained from the second energy bus input data by means of extraction from the industrial Ethernet protocol; and forwarding the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 17. The method as claimed in claim 16, further comprising:
performing a method for forward signal transmission between the control center and the at least one field device in the industrial installation in parallel with the method for reverse signal transmission, and wherein the method for forward signal transmission comprises:
receiving a first industrial bus input data transmitted via an associated industrial bus using a first industrial bus protocol;
receiving a second industrial bus input data transmitted via an associated industrial bus using a second industrial bus protocol;
producing first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol;
producing second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and
transmitting the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. | A connecting device, system and method for use in an industrial installation is disclosed, which includes at least one first industrial bus interface configured to receive first industrial bus input data and transmit first industrial bus output data using a first industrial bus protocol, and a second industrial bus interface configured to receive second industrial bus input data and transmit second industrial bus output data using a second industrial bus protocol. A modulator is configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol. An energy communicator is configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method.1. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connecting device comprising:
at least one first industrial bus interface configured to receive first industrial bus input data transmitted using a first industrial bus protocol; a second industrial bus interface configured to receive second industrial bus input data using a second industrial bus protocol; a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. 2. The connecting device as claimed in claim 1, wherein the energy communicator is configured to transmit the first and/or second energy bus output data only when a security identifier of a receiving device connected to the energy supply line is available. 3. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connection device comprising:
at least one first industrial bus interface configured to transmit first industrial bus output data using a first industrial bus protocol; a second industrial bus interface configured to transmit second industrial bus output data using a second industrial bus protocol; an energy communicator configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using a carrier frequency method and contains first and second energy bus input data; and a demodulator configured to extract the first and second industrial bus output data modulated onto an industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 4. The connecting device as claimed in claim 3, wherein the energy communicator is configured to transmit a security identifier on the energy supply line. 5. A connecting device for use in an industrial installation, which device can be connected to an energy supply line, the connecting device comprising:
at least one first industrial bus interface configured to receive first industrial bus input data and transmit first industrial bus output data using a first industrial bus protocol; a second industrial bus interface configured to receive second industrial bus input data and transmit second industrial bus output data using a second industrial bus protocol; a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method and configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using the carrier frequency method and contains first and second energy bus input data; and a demodulator configured to extract the first and second industrial bus output data modulated onto the industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 6. The connecting device as claimed in claim 5, wherein the energy communicator is configured to transmit a security identifier on the energy supply line and to transmit the first and/or second energy bus output data only when a security identifier of a receiving device connected to the energy supply line is available. 7. A system for transmitting signals between a control center and at least one field device in an industrial installation, the system comprising:
an energy supply line configured to supply the at least one field device with electrical energy; a first connecting device, wherein the first connecting device comprises:
at least one first industrial bus interface configured to receive first industrial bus input data transmitted using a first industrial bus protocol;
a second industrial bus interface configured to receive second industrial bus input data using a second industrial bus protocol;
a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and
an energy communicator configured to transmit the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method, and wherein the first connecting device is configured to be connected to the energy supply line and configured to be connected to the control center via at least one first control center industrial bus; and
a second connecting device, wherein the second connecting device comprises:
at least one first industrial bus interface configured to transmit first industrial bus output data using a first industrial bus protocol;
a second industrial bus interface configured to transmit second industrial bus output data using a second industrial bus protocol;
an energy communicator configured to receive and extract an energy bus input signal which is transmitted via the energy supply line using a carrier frequency method and contains first and second energy bus input data; and
a demodulator configured to extract the first and second industrial bus output data modulated onto an industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus, and wherein second connecting device is configured to be connected to the energy supply line and configured to be connected to the at least one field device via at least one first field device industrial bus. 8. The system as claimed in claim 7, comprising:
a second field device which is supplied with electrical energy via the energy supply line, the second connecting device being configured to be connected to the second field device via the at least first field device industrial bus and/or via at least one second field device industrial bus. 9. The system as claimed in claim 8, comprising:
a second connecting device which is configured to be connected to the energy supply line and configured to be connected to the second field device via the at least first field device industrial bus and/or via the at least one second field device industrial bus. 10. The system as claimed in claim 7, wherein the communication on the at least first control center industrial bus and the at least first field device industrial bus is configured to use a same industrial bus protocol. 11. The system as claimed in claim 7, wherein the communication on the at least first control center industrial bus and/or the at least first field device industrial bus and/or the at least one second field device industrial bus is configured to use a control bus protocol or a field bus protocol. 12. The system as claimed in claim 7, wherein the communication on the at least first field device industrial bus and/or the at least one second field device industrial bus is configured to use a device bus protocol, a sensor bus protocol, or an operating device protocol. 13. The system as claimed in claim 7, wherein the first connecting device further comprises:
a demodulator configured to extract the first and second industrial bus output data modulated onto the industrial Ethernet protocol from the first and second energy bus input data and configured to forward the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 14. The system as claimed in claim 7, wherein the second connecting device further comprises:
a modulator configured to produce first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol and configured to produce second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol. 15. A method for forward signal transmission between a control center and at least one field device in an industrial installation, the industrial installation comprising an energy supply line configured to supply the at least one field device with electrical energy, the method comprising:
receiving a first industrial bus input data transmitted via an associated industrial bus using a first industrial bus protocol; receiving a second industrial bus input data transmitted via an associated industrial bus using a second industrial bus protocol; producing first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol; producing second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and transmitting the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. 16. A method for reverse signal transmission between a control center and at least one field device in an industrial installation, the industrial installation comprising an energy supply line configured to supply the at least one field device with electrical energy, the method comprising:
transmitting an energy bus input signal via the energy supply line using a carrier frequency method is received and extracted, the energy bus input signal containing first and second energy bus input data; transmitting first industrial bus output data using a first industrial bus protocol obtained from the first energy bus input data by means of extraction from an industrial Ethernet protocol; transmitting second industrial bus output data using a second industrial bus protocol obtained from the second energy bus input data by means of extraction from the industrial Ethernet protocol; and forwarding the industrial bus output data to the first and second industrial bus interfaces for output on a respectively associated industrial bus. 17. The method as claimed in claim 16, further comprising:
performing a method for forward signal transmission between the control center and the at least one field device in the industrial installation in parallel with the method for reverse signal transmission, and wherein the method for forward signal transmission comprises:
receiving a first industrial bus input data transmitted via an associated industrial bus using a first industrial bus protocol;
receiving a second industrial bus input data transmitted via an associated industrial bus using a second industrial bus protocol;
producing first energy bus output data by modulating the first industrial bus input data onto an industrial Ethernet protocol;
producing second energy bus output data by modulating the second industrial bus input data onto the industrial Ethernet protocol; and
transmitting the first and second energy bus output data together as an energy bus output signal on the energy supply line using a carrier frequency method. | 2,100 |
4,756 | 13,862,314 | 2,135 | A storage control system, and a method of operation thereof, including: a recycle write queue for providing a recycle write; a host write queue for providing a host write; and a scheduler, coupled to the recycle write queue and the host write queue, for scheduling the recycle write and the host write for writing to a memory device. | 1. A method of operation of a storage control system comprising:
receiving a recycle write from a recycle write queue; receiving a host write from a host write queue; and scheduling the recycle write and the host write for writing to a memory device. 2. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a recycle ratio as a function of a write amplification. 3. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write by dynamically determining a recycle ratio. 4. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio. 5. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a smoothing feedback loop by comparing a current recycle ratio to a target recycle ratio. 6. A method of operation of a storage control system comprising:
receiving a recycle write from a recycle write queue; receiving a host write from a host write queue; scheduling the recycle write and the host write for writing to a memory device; and storing the recycle write and the host write to a memory write operation queue in an order by which the recycle write and the host write are scheduled. 7. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a recycle ratio as a function of a reciprocal of a write amplification. 8. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write by dynamically determining a recycle ratio based on a spare pool size. 9. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio with a subtraction module, a multiplication module, and an addition module. 10. The method as claimed in claim 6 wherein scheduling the recycle write includes scheduling the recycle write based on a smoothing feedback loop when the host write is not scheduled and a current recycle ratio is greater than a target recycle ratio. 11. A storage control system comprising:
a recycle write queue for providing a recycle write; a host write queue for providing a host write; and a scheduler, coupled to the recycle write queue and the host write queue, for scheduling the recycle write and the host write for writing to a memory device. 12. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on a recycle ratio as a function of a write amplification. 13. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write by dynamically determining a recycle ratio. 14. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio. 15. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on a smoothing feedback loop by comparing a current recycle ratio to a target recycle ratio. 16. The system as claimed in claim 11 further comprising a memory write operation queue, coupled to the scheduler, for storing the recycle write and the host write in an order in which the recycle write and the host write are scheduled. 17. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write based on a recycle ratio as a function of a reciprocal of a write amplification. 18. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write by dynamically determining a recycle ratio based on a spare pool size. 19. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio with a subtraction module, a multiplication module, and an addition module. 20. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write based on a smoothing feedback loop when the host write is not scheduled and a current recycle ratio is greater than a target recycle ratio. | A storage control system, and a method of operation thereof, including: a recycle write queue for providing a recycle write; a host write queue for providing a host write; and a scheduler, coupled to the recycle write queue and the host write queue, for scheduling the recycle write and the host write for writing to a memory device.1. A method of operation of a storage control system comprising:
receiving a recycle write from a recycle write queue; receiving a host write from a host write queue; and scheduling the recycle write and the host write for writing to a memory device. 2. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a recycle ratio as a function of a write amplification. 3. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write by dynamically determining a recycle ratio. 4. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio. 5. The method as claimed in claim 1 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a smoothing feedback loop by comparing a current recycle ratio to a target recycle ratio. 6. A method of operation of a storage control system comprising:
receiving a recycle write from a recycle write queue; receiving a host write from a host write queue; scheduling the recycle write and the host write for writing to a memory device; and storing the recycle write and the host write to a memory write operation queue in an order by which the recycle write and the host write are scheduled. 7. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on a recycle ratio as a function of a reciprocal of a write amplification. 8. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write by dynamically determining a recycle ratio based on a spare pool size. 9. The method as claimed in claim 6 wherein scheduling the recycle write and the host write includes scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio with a subtraction module, a multiplication module, and an addition module. 10. The method as claimed in claim 6 wherein scheduling the recycle write includes scheduling the recycle write based on a smoothing feedback loop when the host write is not scheduled and a current recycle ratio is greater than a target recycle ratio. 11. A storage control system comprising:
a recycle write queue for providing a recycle write; a host write queue for providing a host write; and a scheduler, coupled to the recycle write queue and the host write queue, for scheduling the recycle write and the host write for writing to a memory device. 12. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on a recycle ratio as a function of a write amplification. 13. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write by dynamically determining a recycle ratio. 14. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio. 15. The system as claimed in claim 11 wherein the scheduler is for scheduling the recycle write and the host write based on a smoothing feedback loop by comparing a current recycle ratio to a target recycle ratio. 16. The system as claimed in claim 11 further comprising a memory write operation queue, coupled to the scheduler, for storing the recycle write and the host write in an order in which the recycle write and the host write are scheduled. 17. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write based on a recycle ratio as a function of a reciprocal of a write amplification. 18. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write by dynamically determining a recycle ratio based on a spare pool size. 19. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write and the host write based on an exponential moving average smoothing function by tracking a current recycle ratio with a subtraction module, a multiplication module, and an addition module. 20. The system as claimed in claim 16 wherein the scheduler is for scheduling the recycle write based on a smoothing feedback loop when the host write is not scheduled and a current recycle ratio is greater than a target recycle ratio. | 2,100 |
4,757 | 13,547,420 | 2,124 | Endpoint device, central data collection point, and associated methods for collecting data over a communication network between endpoints and the central collection point. Actual measurements from a sensor are obtained by the endpoint device at a relatively fine time granularity. The endpoint device generates reports for receipt by a central data collection point. The reports include regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity, and exception reports, containing information representing one or more of the actual measurements that differ in frequency or granularity of regular report measurements. Each of the exception reports is generated in response to a determination that at least one of the actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit. | 1. A method for operating a sensor data collection system for collecting data from a plurality of endpoint devices, the method comprising:
receiving, at a central data collection point, sensor data generated at each of the plurality of endpoint devices, the sensor data representing a series of actual measured values; maintaining, at the central data collection point, a database containing records corresponding to the individual endpoint devices and including historic values of sensor data for those endpoint devices; computing, at the central data collection point, predicted values representing presumed sensor data for at least one endpoint device, wherein the predicted values are computed based on the historic values of sensor data corresponding to the at least one endpoint device; receiving, at the central data collection point, exception data generated by the at least one endpoint device, the exception data representing a discrepancy between at least one of the predicted values and a corresponding at least one actual measured sensor data value; and in response to receiving the exception data, superseding, at the central data collection point, the at least one of the predicted values based on the exception data. 2. The method of claim 1, wherein the sensor data represents utility consumption. 3. The method of claim 1, wherein the series of actual measured values of the sensor data is measured at a first time granularity and the predicted values representing the presumed sensor data represent sensor data measured at a second time granularity, the second time granularity being a finer granularity than the first time granularity. 4. The method of claim 1, further comprising:
storing, at the central data collection point, actual measured values of sensor data received from a first endpoint device and predicted values corresponding to the first endpoint device in a common database record associated with the first endpoint device. 5. The method of claim 1, wherein computing the predicted values is performed in response to a call for instantaneous measurement. 6. The method of claim 1, wherein computing the predicted values is regularly performed at a condensed time interval that is shorter than a reporting interval at which the sensor data is regularly reported by each of the plurality of endpoint devices. 7. The method of claim 1, wherein the central data collection point computes the predicted values using a first computation algorithm; and
wherein in receiving the exception data, the central data collection point obtains information about the discrepancy based on a prediction computed by the at least one endpoint device using a second computation algorithm that produces a substantially same result as the first computation algorithm and is performed based on the same historic values of sensor data corresponding to each of the at least one endpoint device. 8. The method of claim 1, wherein the central data collection point computes the predicted values using a first computation algorithm; and further comprising:
updating, at the central data collection point, the first computation algorithm to a new computation algorithm and transmitting instructions to the at least one endpoint device to apply the new computation algorithm. 9. The method of claim 1, wherein computing the predicted values is performed for a large plurality of endpoint devices within a time window that is smaller than a regular reporting period of any one of the endpoint devices. 10. The method of claim 1, wherein in receiving the exception data, the central data collection point obtains information about the discrepancy only in response to a result of a comparison performed remotely from the central data collection point between predicted values and actual measured values exceeding limits of pre-established comparison criteria. 11. The method of claim 1, wherein in receiving the exception data, the central data collection point obtains information about the discrepancy based on a comparison between predicted values computed by the at least one endpoint device and actual measured values as measured by that at least one endpoint device exceeding limits of pre-established comparison criteria. 12. The method of claim 1, wherein receiving the exception data includes receiving a report containing the one or more actual measured sensor data values based upon which the discrepancy was determined by the at least one endpoint device. 13. The method of claim 1, wherein superseding the at least one of the predicted values includes replacing that at least one predicted value with actual measured sensor data. 14. The method of claim 1, wherein the sensor data represents utility consumption and further comprising:
generating, at the central data collection point, a determination of a current system-wide instantaneous consumption based on the actual measured values and on the predicted values for the plurality of endpoint devices. 15. A central data collection point for use in a sensor data collection system for collecting data from a plurality of endpoint devices, comprising:
a collection engine module configured to receive sensor data generated at each of the plurality of endpoint devices, the sensor data representing a series of actual measured values; a database containing records corresponding to the individual endpoint devices and including historic values of sensor data for those endpoint devices; a prediction module configured to compute predicted values representing presumed sensor data for at least one endpoint device, wherein the predicted values are computed based on the historic values of sensor data corresponding to the at least one endpoint device; a data selector module configured to process received exception data generated by the at least one endpoint device, the exception data representing a discrepancy between at least one of the predicted values and a corresponding at least one actual measured sensor data value;
wherein the data selector module is further configured such that, in response to receiving the exception data, the data selector module supersedes the at least one of the predicted values based on the exception data. 16. The central data collection point of claim 15, wherein the sensor data represents utility consumption. 17. The central data collection point of claim 15, wherein the series of actual measured values of the sensor data is measured at a first time granularity and the predicted values representing the presumed sensor data represent sensor data measured at a second time granularity, the second time granularity being a finer granularity than the first time granularity. 18. The central data collection point of claim 15, wherein the database is configured to store actual measured values of sensor data received from a first endpoint device and predicted values corresponding to the first endpoint device in a common database record associated with the first endpoint device. 19. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values in response to a call for instantaneous measurement. 20. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values at a condensed time interval that is shorter than a reporting interval at which the sensor data is regularly reported by each of the plurality of endpoint devices. 21. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values using a first computation algorithm; and further comprising:
a re-configuration module configured to update the first computation algorithm to a new computation algorithm and generate instructions to the at least one endpoint device to apply the new computation algorithm. 22. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values for a large plurality of endpoint devices within a time window that is smaller than a regular reporting period of any one of the endpoint devices. 23. An endpoint device for use with a sensor data collection system for collecting data from a large plurality of sensors, the endpoint device comprising:
a sensor data input module configured to obtain actual measurements from a sensor at a relatively fine time granularity; a reporting module operatively coupled to the sensor data input module and configured to generate reports for receipt by a central data collection point, the reports including:
regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity; and
exception reports, each exception report containing information representing one or more of the actual measurements that differ in time granularity from the coarse granularity of the regular reports, each of the exception reports being generated in response to a determination that at least one of the one or more actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit. 24. The endpoint device of claim 23, further comprising:
a prediction module operatively coupled to the reporting module and configured to compute predicted values representing presumed sensor data at a relatively fine time granularity, the predicted values being computed based on previously-reported actual measurements. 25. The endpoint device of claim 24, wherein the prediction module is configured to compute the predicted values using a computation algorithm that corresponds to a computation algorithm for predicting the same value at the central data collection point. 26. The endpoint device of claim 23, further comprising:
a comparator module operatively coupled to the sensor data input module and to the reporting module, and configured to compare the at least one of the one or more actual measurements with a predicted value for that at least one actual measurement, and to perform the determination of whether a difference between the at least one actual measurement and predicted value corresponding to that actual measurement exceeds the pre-established limit. 27. The endpoint device of claim 23, further comprising:
a data store operatively coupled to the sensor data input module and configured to maintain a historical record of at least a portion of the actual measurement data. 28. The endpoint device of claim 27, wherein the data store is configured to store primarily information relating to actual measurement data to be used in computing a next predicted value. 29. The endpoint device of claim 23, further comprising:
a utility meter interface operatively coupled to the sensor data input and wherein the sensor comprises a utility meter. 30. The endpoint device of claim 23, wherein the reporting module is configured to generate exception reports containing a series of measurements at a time granularity that is finer than the relatively coarse time granularity. 31. A method for operating an endpoint device in a sensor data collection system for collecting data from a large plurality of sensors, the method comprising:
obtaining actual measurements from a sensor at a relatively fine time granularity; and generating reports for receipt by a central data collection point, the reports including:
regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity; and
exception reports, each exception report containing information representing one or more of the actual measurements that differ in time granularity from the coarse granularity of the regular reports, each of the exception reports being generated in response to a determination that at least one of the one or more actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit. 32. The method of claim 31, further comprising:
computing predicted values representing presumed sensor data at a relatively fine time granularity, the predicted values being computed based on previously-reported actual measurements. 33. The method of claim 32, wherein in computing the predicted values, a computation algorithm that corresponds to a computation algorithm for predicting the same value at the central data collection point is used. 34. The method of claim 31, further comprising:
comparing, by the endpoint device, the at least one of the one or more actual measurements with a predicted value for that at least one actual measurement; and performing, by the endpoint device, the determination of whether a difference between the at least one actual measurement and predicted value corresponding to that actual measurement exceeds the pre-established limit. 35. The method of claim 31, further comprising:
maintaining a historical record of at least a portion of the actual measurement data. 36. The method of claim 35, wherein in maintaining the historical record, storing primarily information relating to actual measurement data to be used in computing a next predicted value. 37. The method of claim 31, wherein in generating the exception reports, providing in each of the exception reports a series of measurements at a time granularity that is finer than the relatively coarse time granularity. | Endpoint device, central data collection point, and associated methods for collecting data over a communication network between endpoints and the central collection point. Actual measurements from a sensor are obtained by the endpoint device at a relatively fine time granularity. The endpoint device generates reports for receipt by a central data collection point. The reports include regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity, and exception reports, containing information representing one or more of the actual measurements that differ in frequency or granularity of regular report measurements. Each of the exception reports is generated in response to a determination that at least one of the actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit.1. A method for operating a sensor data collection system for collecting data from a plurality of endpoint devices, the method comprising:
receiving, at a central data collection point, sensor data generated at each of the plurality of endpoint devices, the sensor data representing a series of actual measured values; maintaining, at the central data collection point, a database containing records corresponding to the individual endpoint devices and including historic values of sensor data for those endpoint devices; computing, at the central data collection point, predicted values representing presumed sensor data for at least one endpoint device, wherein the predicted values are computed based on the historic values of sensor data corresponding to the at least one endpoint device; receiving, at the central data collection point, exception data generated by the at least one endpoint device, the exception data representing a discrepancy between at least one of the predicted values and a corresponding at least one actual measured sensor data value; and in response to receiving the exception data, superseding, at the central data collection point, the at least one of the predicted values based on the exception data. 2. The method of claim 1, wherein the sensor data represents utility consumption. 3. The method of claim 1, wherein the series of actual measured values of the sensor data is measured at a first time granularity and the predicted values representing the presumed sensor data represent sensor data measured at a second time granularity, the second time granularity being a finer granularity than the first time granularity. 4. The method of claim 1, further comprising:
storing, at the central data collection point, actual measured values of sensor data received from a first endpoint device and predicted values corresponding to the first endpoint device in a common database record associated with the first endpoint device. 5. The method of claim 1, wherein computing the predicted values is performed in response to a call for instantaneous measurement. 6. The method of claim 1, wherein computing the predicted values is regularly performed at a condensed time interval that is shorter than a reporting interval at which the sensor data is regularly reported by each of the plurality of endpoint devices. 7. The method of claim 1, wherein the central data collection point computes the predicted values using a first computation algorithm; and
wherein in receiving the exception data, the central data collection point obtains information about the discrepancy based on a prediction computed by the at least one endpoint device using a second computation algorithm that produces a substantially same result as the first computation algorithm and is performed based on the same historic values of sensor data corresponding to each of the at least one endpoint device. 8. The method of claim 1, wherein the central data collection point computes the predicted values using a first computation algorithm; and further comprising:
updating, at the central data collection point, the first computation algorithm to a new computation algorithm and transmitting instructions to the at least one endpoint device to apply the new computation algorithm. 9. The method of claim 1, wherein computing the predicted values is performed for a large plurality of endpoint devices within a time window that is smaller than a regular reporting period of any one of the endpoint devices. 10. The method of claim 1, wherein in receiving the exception data, the central data collection point obtains information about the discrepancy only in response to a result of a comparison performed remotely from the central data collection point between predicted values and actual measured values exceeding limits of pre-established comparison criteria. 11. The method of claim 1, wherein in receiving the exception data, the central data collection point obtains information about the discrepancy based on a comparison between predicted values computed by the at least one endpoint device and actual measured values as measured by that at least one endpoint device exceeding limits of pre-established comparison criteria. 12. The method of claim 1, wherein receiving the exception data includes receiving a report containing the one or more actual measured sensor data values based upon which the discrepancy was determined by the at least one endpoint device. 13. The method of claim 1, wherein superseding the at least one of the predicted values includes replacing that at least one predicted value with actual measured sensor data. 14. The method of claim 1, wherein the sensor data represents utility consumption and further comprising:
generating, at the central data collection point, a determination of a current system-wide instantaneous consumption based on the actual measured values and on the predicted values for the plurality of endpoint devices. 15. A central data collection point for use in a sensor data collection system for collecting data from a plurality of endpoint devices, comprising:
a collection engine module configured to receive sensor data generated at each of the plurality of endpoint devices, the sensor data representing a series of actual measured values; a database containing records corresponding to the individual endpoint devices and including historic values of sensor data for those endpoint devices; a prediction module configured to compute predicted values representing presumed sensor data for at least one endpoint device, wherein the predicted values are computed based on the historic values of sensor data corresponding to the at least one endpoint device; a data selector module configured to process received exception data generated by the at least one endpoint device, the exception data representing a discrepancy between at least one of the predicted values and a corresponding at least one actual measured sensor data value;
wherein the data selector module is further configured such that, in response to receiving the exception data, the data selector module supersedes the at least one of the predicted values based on the exception data. 16. The central data collection point of claim 15, wherein the sensor data represents utility consumption. 17. The central data collection point of claim 15, wherein the series of actual measured values of the sensor data is measured at a first time granularity and the predicted values representing the presumed sensor data represent sensor data measured at a second time granularity, the second time granularity being a finer granularity than the first time granularity. 18. The central data collection point of claim 15, wherein the database is configured to store actual measured values of sensor data received from a first endpoint device and predicted values corresponding to the first endpoint device in a common database record associated with the first endpoint device. 19. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values in response to a call for instantaneous measurement. 20. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values at a condensed time interval that is shorter than a reporting interval at which the sensor data is regularly reported by each of the plurality of endpoint devices. 21. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values using a first computation algorithm; and further comprising:
a re-configuration module configured to update the first computation algorithm to a new computation algorithm and generate instructions to the at least one endpoint device to apply the new computation algorithm. 22. The central data collection point of claim 15, wherein the prediction module is configured to compute the predicted values for a large plurality of endpoint devices within a time window that is smaller than a regular reporting period of any one of the endpoint devices. 23. An endpoint device for use with a sensor data collection system for collecting data from a large plurality of sensors, the endpoint device comprising:
a sensor data input module configured to obtain actual measurements from a sensor at a relatively fine time granularity; a reporting module operatively coupled to the sensor data input module and configured to generate reports for receipt by a central data collection point, the reports including:
regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity; and
exception reports, each exception report containing information representing one or more of the actual measurements that differ in time granularity from the coarse granularity of the regular reports, each of the exception reports being generated in response to a determination that at least one of the one or more actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit. 24. The endpoint device of claim 23, further comprising:
a prediction module operatively coupled to the reporting module and configured to compute predicted values representing presumed sensor data at a relatively fine time granularity, the predicted values being computed based on previously-reported actual measurements. 25. The endpoint device of claim 24, wherein the prediction module is configured to compute the predicted values using a computation algorithm that corresponds to a computation algorithm for predicting the same value at the central data collection point. 26. The endpoint device of claim 23, further comprising:
a comparator module operatively coupled to the sensor data input module and to the reporting module, and configured to compare the at least one of the one or more actual measurements with a predicted value for that at least one actual measurement, and to perform the determination of whether a difference between the at least one actual measurement and predicted value corresponding to that actual measurement exceeds the pre-established limit. 27. The endpoint device of claim 23, further comprising:
a data store operatively coupled to the sensor data input module and configured to maintain a historical record of at least a portion of the actual measurement data. 28. The endpoint device of claim 27, wherein the data store is configured to store primarily information relating to actual measurement data to be used in computing a next predicted value. 29. The endpoint device of claim 23, further comprising:
a utility meter interface operatively coupled to the sensor data input and wherein the sensor comprises a utility meter. 30. The endpoint device of claim 23, wherein the reporting module is configured to generate exception reports containing a series of measurements at a time granularity that is finer than the relatively coarse time granularity. 31. A method for operating an endpoint device in a sensor data collection system for collecting data from a large plurality of sensors, the method comprising:
obtaining actual measurements from a sensor at a relatively fine time granularity; and generating reports for receipt by a central data collection point, the reports including:
regular reports containing a portion of the actual measurements representing sensor measurements at a relatively coarse time granularity; and
exception reports, each exception report containing information representing one or more of the actual measurements that differ in time granularity from the coarse granularity of the regular reports, each of the exception reports being generated in response to a determination that at least one of the one or more actual measurements differs from a predicted value for that at least one of the one or more actual measurements by an amount that exceeds a pre-established limit. 32. The method of claim 31, further comprising:
computing predicted values representing presumed sensor data at a relatively fine time granularity, the predicted values being computed based on previously-reported actual measurements. 33. The method of claim 32, wherein in computing the predicted values, a computation algorithm that corresponds to a computation algorithm for predicting the same value at the central data collection point is used. 34. The method of claim 31, further comprising:
comparing, by the endpoint device, the at least one of the one or more actual measurements with a predicted value for that at least one actual measurement; and performing, by the endpoint device, the determination of whether a difference between the at least one actual measurement and predicted value corresponding to that actual measurement exceeds the pre-established limit. 35. The method of claim 31, further comprising:
maintaining a historical record of at least a portion of the actual measurement data. 36. The method of claim 35, wherein in maintaining the historical record, storing primarily information relating to actual measurement data to be used in computing a next predicted value. 37. The method of claim 31, wherein in generating the exception reports, providing in each of the exception reports a series of measurements at a time granularity that is finer than the relatively coarse time granularity. | 2,100 |
4,758 | 14,588,520 | 2,164 | Mechanisms, in a Question and Answer (QA) system comprising a processor and a memory are provided for generating an answer to a question. A question is received for which an answer is sought as part of a communication exchange. The question is processed to generate candidate answers and corresponding confidence scores and perform a context based selection of a final answer from the candidate answers. The selected final answer is output as a final answer to the question via a computing device. The context based selection involves determining a context of the input question and selecting a final answer from the one or more candidate answers based on the context of the input question. The selected final answer is an answer previously provided in association with the context of the question. | 1. A method, in a Question and Answer (QA) system comprising a processor and a memory, the method comprising:
receiving, by the QA system, an input question for which an answer is sought as part of a communication exchange; processing, by the QA system, the input question to generate one or more candidate answers and corresponding confidence scores; performing, by the QA system, a context based selection of a final answer from the one or more candidate answers; and outputting the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining, by the QA system, a context of the input question; and
selecting, by the QA system, a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. 2. The method of claim 1, wherein the context represents one or more of a party in the communication exchange or a concept that is a focus of the communication exchange, and wherein the selected final answer is an answer that is at least one of previously provided by the party to a same or similar question to that of the input question or an answer provided by the party or another party associated with the concept. 3. The method of claim 1, further comprising:
determining, by the QA system, whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores; and in response to determining to not perform context based selection of the final answer, outputting, by the QA system, the final answer from the one or more candidate answers based on a ranking of the corresponding confidence scores and outputting the final answer, wherein the context based selection is performed in response to a determination to perform context based selection of the final answer. 4. The method of claim 3, wherein determining whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores comprises:
determining whether at least one confidence score of at least one candidate answer in the one or more candidate answers meets or exceeds a predetermined threshold; in response to determining that at least one confidence score of at least one candidate answer meets or exceeds the predetermined threshold, determining to not perform context based selection of the final answer; and in response to determining that none of the corresponding confidence scores meet or exceed the predetermined threshold, determining to perform context based selection of the final answer. 5. The method of claim 1, wherein the context of the input question represents a party in the communication exchange, and wherein outputting the selected final answer further comprises tailoring the output of the selected final answer based on a personality trait of the party. 6. The method of claim 5, further comprising:
retrieving a profile for the party, wherein the profile comprises personal information associated with the party; determining a personality trait of the party based on the personal information associated with the party in the profile; and modifying the output of the selected final answer based on the personality trait of the party. 7. The method of claim 5, wherein the context of the input question representing the party in the communication exchange comprises a historical set of questions and answers previously answered by the party during previous communication exchanges. 8. The method of claim 5, wherein tailoring the output of the selected final answer based on a personality trait of the party comprises:
retrieving, from configuration information, a mapping of personality traits to corresponding types of information to be output with the selected final answer; and outputting information from supporting evidence associated with the selected final answer that corresponds to the types of information mapped to the personality trait of the party. 9. The method of claim 5, wherein tailoring the output of the selected final answer based on the personality trait of the party further comprises augmenting the output with basis information for the selected final answer. 10. The method of claim 6, wherein tailoring the output of the selected final answer based on the personality trait of the party further comprises retrieving, from the profile, statistical information regarding user feedback indicating user indications of usability of the selected final answer and information about types of users providing the user feedback. 11. The method of claim 1, wherein the communication exchange is an instant messaging exchange between at least two parties, and wherein the input question is received via background monitoring of the communication exchange by the QA system. 12. 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 system implementing a Question and Answer (QA) system, causes the computing device to:
receive, by the QA system, an input question for which an answer is sought as part of a communication exchange; process, by the QA system, the input question to generate one or more candidate answers and corresponding confidence scores; perform, by the QA system, a context based selection of a final answer from the one or more candidate answers; and output the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining, by the QA system, a context of the input question; and
selecting, by the QA system, a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. 13. The computer program product of claim 12, wherein the context represents one or more of a party in the communication exchange or a concept that is a focus of the communication exchange, and wherein the selected final answer is an answer that is at least one of previously provided by the party to a same or similar question to that of the input question or an answer provided by the party or another party associated with the concept. 14. The computer program product of claim 12, wherein the computer readable program further causes the computing system to:
determine, by the QA system, whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores; and in response to determining to not perform context based selection of the final answer, output, by the QA system, the final answer from the one or more candidate answers based on a ranking of the corresponding confidence scores and outputting the final answer, wherein the context based selection is performed in response to a determination to perform context based selection of the final answer. 15. The computer program product of claim 14, wherein the computer readable program further causes the computing system to determine whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores at least by:
determining whether at least one confidence score of at least one candidate answer in the one or more candidate answers meets or exceeds a predetermined threshold; in response to determining that at least one confidence score of at least one candidate answer meets or exceeds the predetermined threshold, determining to not perform context based selection of the final answer; and in response to determining that none of the corresponding confidence scores meet or exceed the predetermined threshold, determining to perform context based selection of the final answer. 16. The computer program product of claim 12, wherein the context of the input question represents a party in the communication exchange, and wherein the computer readable program further causes the computing system to output the selected final answer further at least by tailoring the output of the selected final answer based on a personality trait of the party. 17. The computer program product of claim 16, wherein the computer readable program further causes the computing system to:
retrieve a profile for the party, wherein the profile comprises personal information associated with the party; determine a personality trait of the party based on the personal information associated with the party in the profile; and modify the output of the selected final answer based on the personality trait of the party. 18. The computer program product of claim 16, wherein the context of the input question representing the party in the communication exchange comprises a historical set of questions and answers previously answered by the party during previous communication exchanges. 19. The computer program product of claim 16, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on a personality trait of the party at least by:
retrieving, from configuration information, a mapping of personality traits to corresponding types of information to be output with the selected final answer; and outputting information from supporting evidence associated with the selected final answer that corresponds to the types of information mapped to the personality trait of the party. 20. The computer program product of claim 16, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on the personality trait of the party further at least by augmenting the output with basis information for the selected final answer. 21. The computer program product of claim 17, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on the personality trait of the party further at least by retrieving, from the profile, statistical information regarding user feedback indicating user indications of usability of the selected final answer and information about types of users providing the user feedback. 22. The computer program product of claim 12, wherein the communication exchange is an instant messaging exchange between at least two parties, and wherein the input question is received via background monitoring of the communication exchange by the QA system. 23. 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 an input question for which an answer is sought as part of a communication exchange; process the input question to generate one or more candidate answers and corresponding confidence scores; perform a context based selection of a final answer from the one or more candidate answers; and output the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining a context of the input question; and
selecting a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. | Mechanisms, in a Question and Answer (QA) system comprising a processor and a memory are provided for generating an answer to a question. A question is received for which an answer is sought as part of a communication exchange. The question is processed to generate candidate answers and corresponding confidence scores and perform a context based selection of a final answer from the candidate answers. The selected final answer is output as a final answer to the question via a computing device. The context based selection involves determining a context of the input question and selecting a final answer from the one or more candidate answers based on the context of the input question. The selected final answer is an answer previously provided in association with the context of the question.1. A method, in a Question and Answer (QA) system comprising a processor and a memory, the method comprising:
receiving, by the QA system, an input question for which an answer is sought as part of a communication exchange; processing, by the QA system, the input question to generate one or more candidate answers and corresponding confidence scores; performing, by the QA system, a context based selection of a final answer from the one or more candidate answers; and outputting the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining, by the QA system, a context of the input question; and
selecting, by the QA system, a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. 2. The method of claim 1, wherein the context represents one or more of a party in the communication exchange or a concept that is a focus of the communication exchange, and wherein the selected final answer is an answer that is at least one of previously provided by the party to a same or similar question to that of the input question or an answer provided by the party or another party associated with the concept. 3. The method of claim 1, further comprising:
determining, by the QA system, whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores; and in response to determining to not perform context based selection of the final answer, outputting, by the QA system, the final answer from the one or more candidate answers based on a ranking of the corresponding confidence scores and outputting the final answer, wherein the context based selection is performed in response to a determination to perform context based selection of the final answer. 4. The method of claim 3, wherein determining whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores comprises:
determining whether at least one confidence score of at least one candidate answer in the one or more candidate answers meets or exceeds a predetermined threshold; in response to determining that at least one confidence score of at least one candidate answer meets or exceeds the predetermined threshold, determining to not perform context based selection of the final answer; and in response to determining that none of the corresponding confidence scores meet or exceed the predetermined threshold, determining to perform context based selection of the final answer. 5. The method of claim 1, wherein the context of the input question represents a party in the communication exchange, and wherein outputting the selected final answer further comprises tailoring the output of the selected final answer based on a personality trait of the party. 6. The method of claim 5, further comprising:
retrieving a profile for the party, wherein the profile comprises personal information associated with the party; determining a personality trait of the party based on the personal information associated with the party in the profile; and modifying the output of the selected final answer based on the personality trait of the party. 7. The method of claim 5, wherein the context of the input question representing the party in the communication exchange comprises a historical set of questions and answers previously answered by the party during previous communication exchanges. 8. The method of claim 5, wherein tailoring the output of the selected final answer based on a personality trait of the party comprises:
retrieving, from configuration information, a mapping of personality traits to corresponding types of information to be output with the selected final answer; and outputting information from supporting evidence associated with the selected final answer that corresponds to the types of information mapped to the personality trait of the party. 9. The method of claim 5, wherein tailoring the output of the selected final answer based on the personality trait of the party further comprises augmenting the output with basis information for the selected final answer. 10. The method of claim 6, wherein tailoring the output of the selected final answer based on the personality trait of the party further comprises retrieving, from the profile, statistical information regarding user feedback indicating user indications of usability of the selected final answer and information about types of users providing the user feedback. 11. The method of claim 1, wherein the communication exchange is an instant messaging exchange between at least two parties, and wherein the input question is received via background monitoring of the communication exchange by the QA system. 12. 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 system implementing a Question and Answer (QA) system, causes the computing device to:
receive, by the QA system, an input question for which an answer is sought as part of a communication exchange; process, by the QA system, the input question to generate one or more candidate answers and corresponding confidence scores; perform, by the QA system, a context based selection of a final answer from the one or more candidate answers; and output the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining, by the QA system, a context of the input question; and
selecting, by the QA system, a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. 13. The computer program product of claim 12, wherein the context represents one or more of a party in the communication exchange or a concept that is a focus of the communication exchange, and wherein the selected final answer is an answer that is at least one of previously provided by the party to a same or similar question to that of the input question or an answer provided by the party or another party associated with the concept. 14. The computer program product of claim 12, wherein the computer readable program further causes the computing system to:
determine, by the QA system, whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores; and in response to determining to not perform context based selection of the final answer, output, by the QA system, the final answer from the one or more candidate answers based on a ranking of the corresponding confidence scores and outputting the final answer, wherein the context based selection is performed in response to a determination to perform context based selection of the final answer. 15. The computer program product of claim 14, wherein the computer readable program further causes the computing system to determine whether to perform the context based selection of the final answer from the one or more candidate answers based on the corresponding confidence scores at least by:
determining whether at least one confidence score of at least one candidate answer in the one or more candidate answers meets or exceeds a predetermined threshold; in response to determining that at least one confidence score of at least one candidate answer meets or exceeds the predetermined threshold, determining to not perform context based selection of the final answer; and in response to determining that none of the corresponding confidence scores meet or exceed the predetermined threshold, determining to perform context based selection of the final answer. 16. The computer program product of claim 12, wherein the context of the input question represents a party in the communication exchange, and wherein the computer readable program further causes the computing system to output the selected final answer further at least by tailoring the output of the selected final answer based on a personality trait of the party. 17. The computer program product of claim 16, wherein the computer readable program further causes the computing system to:
retrieve a profile for the party, wherein the profile comprises personal information associated with the party; determine a personality trait of the party based on the personal information associated with the party in the profile; and modify the output of the selected final answer based on the personality trait of the party. 18. The computer program product of claim 16, wherein the context of the input question representing the party in the communication exchange comprises a historical set of questions and answers previously answered by the party during previous communication exchanges. 19. The computer program product of claim 16, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on a personality trait of the party at least by:
retrieving, from configuration information, a mapping of personality traits to corresponding types of information to be output with the selected final answer; and outputting information from supporting evidence associated with the selected final answer that corresponds to the types of information mapped to the personality trait of the party. 20. The computer program product of claim 16, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on the personality trait of the party further at least by augmenting the output with basis information for the selected final answer. 21. The computer program product of claim 17, wherein the computer readable program further causes the computing system to tailor the output of the selected final answer based on the personality trait of the party further at least by retrieving, from the profile, statistical information regarding user feedback indicating user indications of usability of the selected final answer and information about types of users providing the user feedback. 22. The computer program product of claim 12, wherein the communication exchange is an instant messaging exchange between at least two parties, and wherein the input question is received via background monitoring of the communication exchange by the QA system. 23. 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 an input question for which an answer is sought as part of a communication exchange; process the input question to generate one or more candidate answers and corresponding confidence scores; perform a context based selection of a final answer from the one or more candidate answers; and output the selected final answer as a final answer to the input question via a computing device, wherein the context based selection comprises:
determining a context of the input question; and
selecting a final answer from the one or more candidate answers based on the context of the input question, wherein the selected final answer is an answer previously provided in association with the context of the input question. | 2,100 |
4,759 | 13,628,901 | 2,143 | A method and apparatus are disclosed of providing a user application with a notification message. One example method may include receiving a notification message and identifying a predetermined category of a notification bar portion of the user application to display the notification message. The method may also include associating the notification message with the identified predetermined category and determining a level of importance of the notification message. The method may also provide displaying a notification indicator on the notification bar according to the predetermined category and to the notification type that corresponds to the level of importance. | 1. A method of providing a user application with a notification message, the method comprising:
receiving a notification message; identifying a predetermined category of a notification bar portion of the user application to display the notification message; associating the notification message with the identified predetermined category; determining a level of importance of the notification message; and displaying a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 2. The method of claim 1, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 3. The method of claim 2, wherein the category name and display icon are related to content of the notification message. 4. The method of claim 1, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 5. The method of claim 4, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 6. The method of claim 1, further comprising:
displaying a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time. 7. The method of claim 1, further comprising:
parsing at least one word from the notification message and using the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. 8. An apparatus configured to provide a user application with a notification message, the apparatus comprising:
a memory configured to store predetermined categories of a notification bar; a receiver configured to receive a notification message; a processor configured to
identify a predetermined category of the notification bar portion of the user application to display the notification message based on the predetermined categories of the notification bar,
associate the notification message with the identified predetermined category,
determine a level of importance of the notification message, and
display a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 9. The apparatus of claim 8, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 10. The apparatus of claim 9, wherein the category name and display icon are related to content of the notification message. 11. The apparatus of claim 8, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 12. The apparatus of claim 11, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 13. The apparatus of claim 8, wherein the processor is further configured to display a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time. 14. The method of claim 8, wherein the processor is further configured to parse at least one word from the notification message and use the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. 15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform providing a user application with a notification message, the processor being further configured to perform:
receiving a notification message; identifying a predetermined category of a notification bar portion of the user application to display the notification message; associating the notification message with the identified predetermined category; determining a level of importance of the notification message; and displaying a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 16. The non-transitory computer readable storage medium of claim 15, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 17. The non-transitory computer readable storage medium of claim 16, wherein the category name and display icon are related to content of the notification message. 18. The non-transitory computer readable storage medium of claim 15, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 19. The non-transitory computer readable storage medium of claim 18, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 20. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
displaying a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time; and parsing at least one word from the notification message and using the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. | A method and apparatus are disclosed of providing a user application with a notification message. One example method may include receiving a notification message and identifying a predetermined category of a notification bar portion of the user application to display the notification message. The method may also include associating the notification message with the identified predetermined category and determining a level of importance of the notification message. The method may also provide displaying a notification indicator on the notification bar according to the predetermined category and to the notification type that corresponds to the level of importance.1. A method of providing a user application with a notification message, the method comprising:
receiving a notification message; identifying a predetermined category of a notification bar portion of the user application to display the notification message; associating the notification message with the identified predetermined category; determining a level of importance of the notification message; and displaying a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 2. The method of claim 1, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 3. The method of claim 2, wherein the category name and display icon are related to content of the notification message. 4. The method of claim 1, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 5. The method of claim 4, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 6. The method of claim 1, further comprising:
displaying a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time. 7. The method of claim 1, further comprising:
parsing at least one word from the notification message and using the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. 8. An apparatus configured to provide a user application with a notification message, the apparatus comprising:
a memory configured to store predetermined categories of a notification bar; a receiver configured to receive a notification message; a processor configured to
identify a predetermined category of the notification bar portion of the user application to display the notification message based on the predetermined categories of the notification bar,
associate the notification message with the identified predetermined category,
determine a level of importance of the notification message, and
display a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 9. The apparatus of claim 8, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 10. The apparatus of claim 9, wherein the category name and display icon are related to content of the notification message. 11. The apparatus of claim 8, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 12. The apparatus of claim 11, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 13. The apparatus of claim 8, wherein the processor is further configured to display a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time. 14. The method of claim 8, wherein the processor is further configured to parse at least one word from the notification message and use the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. 15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform providing a user application with a notification message, the processor being further configured to perform:
receiving a notification message; identifying a predetermined category of a notification bar portion of the user application to display the notification message; associating the notification message with the identified predetermined category; determining a level of importance of the notification message; and displaying a notification indicator on the notification bar according to the predetermined category and to at least one notification type that corresponds to the level of importance. 16. The non-transitory computer readable storage medium of claim 15, wherein the predetermined category corresponds to a category name and display icon of the notification bar. 17. The non-transitory computer readable storage medium of claim 16, wherein the category name and display icon are related to content of the notification message. 18. The non-transitory computer readable storage medium of claim 15, wherein the notification type comprises at least one of a silent notification, a subtle notification and a flyout notification. 19. The non-transitory computer readable storage medium of claim 18, wherein the silent notification does not produce any sounds and the subtle notification does produce at least one sound based on a user defined parameter. 20. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
displaying a flyout notification via a new window based on the notification indicator, the new window maintaining an alert message for a predetermined period of time; and parsing at least one word from the notification message and using the parsed at least one word to select the predetermined category of the notification bar and the at least one notification type used to display the notification message on the notification bar portion of the user application. | 2,100 |
4,760 | 14,515,516 | 2,194 | Technologies for a contract platform versioned according to the set of API contracts provided. API contracts are both development-time and run-time executable components. Each such contract defines a particular set of APIs that are fully supported at run-time by a corresponding implementation module. Contract applications are written to API contracts as opposed to the monolithic APIs of a legacy platform. Such applications are “platform agnostic”. | 1. A method performed on a computing device that includes at least one processor and memory, the method for programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the method comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 2. The method of claim 1 where the API contract is discoverable at run-time. 3. The method of claim 1 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 4. The method of claim 1 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 5. The method of claim 1 where the version information includes a current version of the API contract. 6. The method of claim 5 where the current version is equal to or greater than all versions indicated by any type version attributes included in the definition information. 7. The method of claim 1 where any types defined in the definition information are immutable or additively versioned. 8. A system comprising a computing device and at least one program module that are together configured for performing actions for programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the computing device including at least one processor and memory, the actions comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the contract application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 9. The system of claim 8 where the API contract is discoverable at run-time. 10. The system of claim 8 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 11. The system of claim 8 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 12. The system of claim 8 where the version information includes a current version of the API contract. 13. The system of claim 12 where the current version is equal to or greater than all versions indicated by any type version attributes included in the definition information. 14. The system of claim 8 where any types defined in the definition information are immutable or additively versioned. 15. At least one computer-readable medium storing computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to perform actions programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the computing device including at least one memory, the actions comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 16. The method of claim 15 where the API contract is discoverable at run-time. 17. The method of claim 15 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 18. The method of claim 15 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 19. The method of claim 15 where the version information includes a current version of the API contract that is equal to or greater than all versions indicated by any type version attributes included in the definition information. 20. The method of claim 15 where any types defined in the definition information are immutable or additively versioned. 21. A method performed on a computing device that includes at least one processor and memory, the method for programmatically providing features of a contract platform to a contract application via at least one set of application programming interface (“API”) contracts, the method comprising: hosting, by the computing device, the at least one set of API contracts that are each configured for programmatically providing one of the features to the contract application, where the each API contract comprises identification information for the each API contract, version information for the each API contract and its provided feature, definition information that defines aspects of its provided feature, and executable code configured for responding to queries about the each API contract. 22. A method performed on a computing device that includes at least one processor and memory, the method for programmatically accessing, by a contract application, a feature provided via an application programming interface (“API”) contract, the method comprising: executing, by the computing device, the contract application that is configured for programmatically accessing, via the API contract, the feature, identification information of the API contract, version information of the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 23. A method performed on a computing device that includes at least one processor and memory, the method for programmatically accessing, by tooling of a development environment, a feature provided via an application programming interface (“API”) contract, the method comprising: executing, by the computing device, the tooling that is configured for programmatically accessing, via the API contract, the feature, identification information of the API contract, version information of the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. | Technologies for a contract platform versioned according to the set of API contracts provided. API contracts are both development-time and run-time executable components. Each such contract defines a particular set of APIs that are fully supported at run-time by a corresponding implementation module. Contract applications are written to API contracts as opposed to the monolithic APIs of a legacy platform. Such applications are “platform agnostic”.1. A method performed on a computing device that includes at least one processor and memory, the method for programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the method comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 2. The method of claim 1 where the API contract is discoverable at run-time. 3. The method of claim 1 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 4. The method of claim 1 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 5. The method of claim 1 where the version information includes a current version of the API contract. 6. The method of claim 5 where the current version is equal to or greater than all versions indicated by any type version attributes included in the definition information. 7. The method of claim 1 where any types defined in the definition information are immutable or additively versioned. 8. A system comprising a computing device and at least one program module that are together configured for performing actions for programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the computing device including at least one processor and memory, the actions comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the contract application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 9. The system of claim 8 where the API contract is discoverable at run-time. 10. The system of claim 8 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 11. The system of claim 8 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 12. The system of claim 8 where the version information includes a current version of the API contract. 13. The system of claim 12 where the current version is equal to or greater than all versions indicated by any type version attributes included in the definition information. 14. The system of claim 8 where any types defined in the definition information are immutable or additively versioned. 15. At least one computer-readable medium storing computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to perform actions programmatically providing a feature to a contract application via an application programming interface (“API”) contract, the computing device including at least one memory, the actions comprising: hosting, by the computing device, the API contract that is configured for programmatically providing the feature to the application, where the API contract comprises identification information for the API contract, version information for the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 16. The method of claim 15 where the API contract is discoverable at run-time. 17. The method of claim 15 where the API contract is associated with a corresponding executable module that implements at least a portion of the feature. 18. The method of claim 15 where a type defined by the API contract includes a type version attribute that indicates the version of the contract at which the type was added to the contract. 19. The method of claim 15 where the version information includes a current version of the API contract that is equal to or greater than all versions indicated by any type version attributes included in the definition information. 20. The method of claim 15 where any types defined in the definition information are immutable or additively versioned. 21. A method performed on a computing device that includes at least one processor and memory, the method for programmatically providing features of a contract platform to a contract application via at least one set of application programming interface (“API”) contracts, the method comprising: hosting, by the computing device, the at least one set of API contracts that are each configured for programmatically providing one of the features to the contract application, where the each API contract comprises identification information for the each API contract, version information for the each API contract and its provided feature, definition information that defines aspects of its provided feature, and executable code configured for responding to queries about the each API contract. 22. A method performed on a computing device that includes at least one processor and memory, the method for programmatically accessing, by a contract application, a feature provided via an application programming interface (“API”) contract, the method comprising: executing, by the computing device, the contract application that is configured for programmatically accessing, via the API contract, the feature, identification information of the API contract, version information of the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. 23. A method performed on a computing device that includes at least one processor and memory, the method for programmatically accessing, by tooling of a development environment, a feature provided via an application programming interface (“API”) contract, the method comprising: executing, by the computing device, the tooling that is configured for programmatically accessing, via the API contract, the feature, identification information of the API contract, version information of the API contract and the feature, definition information that defines aspects of the feature, and executable code configured for responding to queries about the API contract. | 2,100 |
4,761 | 14,670,895 | 2,196 | The subject disclosure is directed towards a technology for efficiently emulating program code that is protected by one or more various code virtualization techniques to detect the presence of malware. An emulation engine emulates a program containing a mix of native code, custom (e.g., virtualized obfuscated) code, and at least one emulator and/or interpreter that understands the custom code, by building a custom emulation component that is built by detecting and analyzing the internal emulator or interpreter. The custom emulation component may access a translation table built from the analysis, and also may simplify a plurality of instructions in the program into a lesser number of instructions in an intermediate language used for emulation. | 1. In a computing environment, a system comprising:
an emulation engine configured to emulate a program, the emulation engine comprising:
an emulator component;
a custom emulation component processing a custom instruction block from program code of the program into an intermediate language for emulation by the emulator component;
a native component processing a native instruction block from the program code of the program and outputting instructions corresponding to the native instruction block to the emulator component; and
mixed code processing logic dynamically switching between the custom emulation component and the native component as the emulation engine processes the program code. 2. The system of claim 1 wherein the emulator component comprises a virtual machine instance, and wherein the emulation component comprises a plurality of front-ends, including one front end configured to decode or translate, or both decode and translate from executable code, and at least one other front-end each configured to translate a supported computer language into a platform-independent intermediate language (IL). 3. The system of claim 1 wherein the custom emulation component translates from at least one of an alternate language or bytecode into the intermediate language that is common with an intermediate language produced by the native component. 4. The system of claim 1 further comprising:
a scanner module configured to detect an emulator or interpreter in the program; and
a code parser and analyzer configured to analyze the detected emulator or interpreter to dynamically build the custom emulation component. 5. The system of claim 4 wherein the scanner module detects the emulator or interpreter in the program via one or more signatures. 6. The system of claim 4 wherein the code parser and analyzer are configured to determine a custom binary format for each instruction that is used in the custom instruction block. 7. The system of claim 4 wherein the code parser and analyzer are configured to determine a decryption algorithm and one or more decryption keys used in conjunction with the decryption algorithm. 8. The system of claim 4 wherein the code parser and analyzer are configured to determine a de-obfuscation algorithm and one or associated parameters used to obfuscate at least one instruction in the program. 9. The system of claim 1 wherein the custom emulation component simplifies a plurality of instructions in the program code by generating a lesser number of intermediate language instructions relative to translating original instructions one-by-one in a repetitive process. 10. In a computing environment, a method performed at least in part on at least one processor, comprising:
receiving a program, including program code that comprises native code and custom code; processing, by a custom emulation component, at least one custom instruction block of the custom code into an intermediate language; processing, by a native code emulator component, at least one native instruction block of the native code into the intermediate language; and outputting the custom instruction block in the intermediate language and the native instruction block in the intermediate language to an emulator component for emulation of the program. 11. The method of claim 10 further comprising:
emulating the program code of the program by dynamically switching between the native code emulator component when a program code instruction is part of the native code and the custom emulation component when a program code instruction is part of the custom code. 12. The method of claim 11 further comprising:
determining a custom binary format for each program code instruction that is used in the custom code. 13. The method of claim 11 further comprising:
determining a decryption algorithm and one or more decryption keys used in conjunction with the decryption algorithm to encrypt the custom code; and
using at least one of the decryption keys and the decryption algorithm for decrypting the custom code. 14. The method of claim 11 further comprising:
determining a de-obfuscation algorithm and one or associated parameters used to obfuscate the custom code; and
using the de-obfuscation algorithm to de-obfuscate the custom code. 15. The method of claim 10 further comprising:
determining at least one range of addresses in the program code of the program containing target language instructions. 16. One or more computer-readable storage devices having computer-executable instructions, which when executed by a computer processor perform operations of a process, comprising:
processing program code containing native code and custom code; translating, by a custom emulator component, at least one custom instruction block of the custom code into an intermediate language; translating, by a native component, at least one native instruction block of the native code into the intermediate language; and emulating the program code using the translated at least one custom instruction block and the translated at least one native instruction block. 17. The one or more computer-readable storage devices of claim 16 wherein the custom emulator component translates the custom instruction block into the intermediate language by translating the custom code to a known bytecode language. 18. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
scanning the program code to detect an emulator or interpreter for the custom code in the program code; and
analyzing the detected emulator or interpreter to dynamically build the custom emulator component. 19. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
generating a lesser number of intermediate language instructions relative to a number of instructions received in the program code prior to translation to simplify a plurality of instructions in the program code. 20. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
detecting at least one execution control transfer in the emulated program code. | The subject disclosure is directed towards a technology for efficiently emulating program code that is protected by one or more various code virtualization techniques to detect the presence of malware. An emulation engine emulates a program containing a mix of native code, custom (e.g., virtualized obfuscated) code, and at least one emulator and/or interpreter that understands the custom code, by building a custom emulation component that is built by detecting and analyzing the internal emulator or interpreter. The custom emulation component may access a translation table built from the analysis, and also may simplify a plurality of instructions in the program into a lesser number of instructions in an intermediate language used for emulation.1. In a computing environment, a system comprising:
an emulation engine configured to emulate a program, the emulation engine comprising:
an emulator component;
a custom emulation component processing a custom instruction block from program code of the program into an intermediate language for emulation by the emulator component;
a native component processing a native instruction block from the program code of the program and outputting instructions corresponding to the native instruction block to the emulator component; and
mixed code processing logic dynamically switching between the custom emulation component and the native component as the emulation engine processes the program code. 2. The system of claim 1 wherein the emulator component comprises a virtual machine instance, and wherein the emulation component comprises a plurality of front-ends, including one front end configured to decode or translate, or both decode and translate from executable code, and at least one other front-end each configured to translate a supported computer language into a platform-independent intermediate language (IL). 3. The system of claim 1 wherein the custom emulation component translates from at least one of an alternate language or bytecode into the intermediate language that is common with an intermediate language produced by the native component. 4. The system of claim 1 further comprising:
a scanner module configured to detect an emulator or interpreter in the program; and
a code parser and analyzer configured to analyze the detected emulator or interpreter to dynamically build the custom emulation component. 5. The system of claim 4 wherein the scanner module detects the emulator or interpreter in the program via one or more signatures. 6. The system of claim 4 wherein the code parser and analyzer are configured to determine a custom binary format for each instruction that is used in the custom instruction block. 7. The system of claim 4 wherein the code parser and analyzer are configured to determine a decryption algorithm and one or more decryption keys used in conjunction with the decryption algorithm. 8. The system of claim 4 wherein the code parser and analyzer are configured to determine a de-obfuscation algorithm and one or associated parameters used to obfuscate at least one instruction in the program. 9. The system of claim 1 wherein the custom emulation component simplifies a plurality of instructions in the program code by generating a lesser number of intermediate language instructions relative to translating original instructions one-by-one in a repetitive process. 10. In a computing environment, a method performed at least in part on at least one processor, comprising:
receiving a program, including program code that comprises native code and custom code; processing, by a custom emulation component, at least one custom instruction block of the custom code into an intermediate language; processing, by a native code emulator component, at least one native instruction block of the native code into the intermediate language; and outputting the custom instruction block in the intermediate language and the native instruction block in the intermediate language to an emulator component for emulation of the program. 11. The method of claim 10 further comprising:
emulating the program code of the program by dynamically switching between the native code emulator component when a program code instruction is part of the native code and the custom emulation component when a program code instruction is part of the custom code. 12. The method of claim 11 further comprising:
determining a custom binary format for each program code instruction that is used in the custom code. 13. The method of claim 11 further comprising:
determining a decryption algorithm and one or more decryption keys used in conjunction with the decryption algorithm to encrypt the custom code; and
using at least one of the decryption keys and the decryption algorithm for decrypting the custom code. 14. The method of claim 11 further comprising:
determining a de-obfuscation algorithm and one or associated parameters used to obfuscate the custom code; and
using the de-obfuscation algorithm to de-obfuscate the custom code. 15. The method of claim 10 further comprising:
determining at least one range of addresses in the program code of the program containing target language instructions. 16. One or more computer-readable storage devices having computer-executable instructions, which when executed by a computer processor perform operations of a process, comprising:
processing program code containing native code and custom code; translating, by a custom emulator component, at least one custom instruction block of the custom code into an intermediate language; translating, by a native component, at least one native instruction block of the native code into the intermediate language; and emulating the program code using the translated at least one custom instruction block and the translated at least one native instruction block. 17. The one or more computer-readable storage devices of claim 16 wherein the custom emulator component translates the custom instruction block into the intermediate language by translating the custom code to a known bytecode language. 18. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
scanning the program code to detect an emulator or interpreter for the custom code in the program code; and
analyzing the detected emulator or interpreter to dynamically build the custom emulator component. 19. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
generating a lesser number of intermediate language instructions relative to a number of instructions received in the program code prior to translation to simplify a plurality of instructions in the program code. 20. The one or more computer-readable storage devices of claim 16 further executed to perform operations of a process, comprising:
detecting at least one execution control transfer in the emulated program code. | 2,100 |
4,762 | 13,782,653 | 2,163 | A system and method for generating search results includes: receiving a search query with a search term; parsing the search term; determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query; retrieving an intended search term according to a current time of day from a data store when it is determined that at least a portion of the parsed search term is an ambiguous, time-sensitive query; and preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on the search results page. | 1. A method for generating search results, comprising:
using a processor device performing steps of:
receiving a search query comprising a search term;
parsing the search term;
determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query;
retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and
preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page. 2. The method of claim 1 further comprising serving the search results page. 3. The method of claim 1 wherein the determining comprises:
accessing the data store; and
finding the at least a portion of the parsed search term in the data store. 4. The method of claim 3 wherein accessing the data store comprises accessing a look-up table. 5. The method of claim 3 wherein retrieving the intended search term comprises:
matching the current time of day with an appropriate time of day selection for the search term in the data store; and
selecting the intended search term that matches the appropriate time of day selection. 6. The method of claim 1 further comprising determining that the at least a portion of the parsed search term is location-sensitive. 7. The method of claim 1 wherein placing the search results in the most prominent position on the search results page comprises placing said search results at a beginning of a listing. 8. The method of claim 3 further comprising:
identifying ambiguous, time-sensitive queries and their temporal dependencies from web search logs based on search result click-through behaviors. 9. The method of claim 8 further comprising:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. 10. An information processing system for generating search results, said information processing system comprising:
a memory with computer-executable instructions stored therein, said computer-executable instructions comprising:
receiving a search query comprising a search term;
parsing the search term;
determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query;
retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and
preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page; and
a processor device operably coupled with the memory and executing the computer-executable instructions. 11. The information processing system of claim 10 wherein the computer-executable instructions further comprise serving the search results page. 12. The information processing system of claim 10 wherein the computer-executable instructions for determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query comprises:
accessing the data store; and
finding the at least a portion of the parsed search term in the data store. 13. The information processing system of claim 12 wherein accessing the data store comprises accessing a look-up table. 14. The information processing system of claim 12 wherein retrieving the intended search term comprises:
matching the current time of day with an appropriate time of day selection for the search term in the data store; and
selecting the intended search term that matches the appropriate time of day selection. 15. The information processing system of claim 10 further comprising determining that the at least a portion of the parsed search term is location-sensitive. 16. The information processing system of claim 10 wherein placing the search results in the most prominent position on the search results page comprises placing said search results at a beginning of a listing. 17. The information processing system of claim 13 further comprising:
identifying ambiguous, time-sensitive queries and their temporal dependencies from web search logs based on search result click-through behaviors. 18. The information processing system of claim 17 further comprising:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. 19. A computer program product comprising a non-transitory computer readable storage medium with computer-executable instructions stored therein, said computer-executable instructions comprising:
receiving a search query comprising a search term; parsing the search term; determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query; retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page. 20. The computer program product of claim 19 wherein the computer-executable instructions further comprise:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. | A system and method for generating search results includes: receiving a search query with a search term; parsing the search term; determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query; retrieving an intended search term according to a current time of day from a data store when it is determined that at least a portion of the parsed search term is an ambiguous, time-sensitive query; and preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on the search results page.1. A method for generating search results, comprising:
using a processor device performing steps of:
receiving a search query comprising a search term;
parsing the search term;
determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query;
retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and
preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page. 2. The method of claim 1 further comprising serving the search results page. 3. The method of claim 1 wherein the determining comprises:
accessing the data store; and
finding the at least a portion of the parsed search term in the data store. 4. The method of claim 3 wherein accessing the data store comprises accessing a look-up table. 5. The method of claim 3 wherein retrieving the intended search term comprises:
matching the current time of day with an appropriate time of day selection for the search term in the data store; and
selecting the intended search term that matches the appropriate time of day selection. 6. The method of claim 1 further comprising determining that the at least a portion of the parsed search term is location-sensitive. 7. The method of claim 1 wherein placing the search results in the most prominent position on the search results page comprises placing said search results at a beginning of a listing. 8. The method of claim 3 further comprising:
identifying ambiguous, time-sensitive queries and their temporal dependencies from web search logs based on search result click-through behaviors. 9. The method of claim 8 further comprising:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. 10. An information processing system for generating search results, said information processing system comprising:
a memory with computer-executable instructions stored therein, said computer-executable instructions comprising:
receiving a search query comprising a search term;
parsing the search term;
determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query;
retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and
preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page; and
a processor device operably coupled with the memory and executing the computer-executable instructions. 11. The information processing system of claim 10 wherein the computer-executable instructions further comprise serving the search results page. 12. The information processing system of claim 10 wherein the computer-executable instructions for determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query comprises:
accessing the data store; and
finding the at least a portion of the parsed search term in the data store. 13. The information processing system of claim 12 wherein accessing the data store comprises accessing a look-up table. 14. The information processing system of claim 12 wherein retrieving the intended search term comprises:
matching the current time of day with an appropriate time of day selection for the search term in the data store; and
selecting the intended search term that matches the appropriate time of day selection. 15. The information processing system of claim 10 further comprising determining that the at least a portion of the parsed search term is location-sensitive. 16. The information processing system of claim 10 wherein placing the search results in the most prominent position on the search results page comprises placing said search results at a beginning of a listing. 17. The information processing system of claim 13 further comprising:
identifying ambiguous, time-sensitive queries and their temporal dependencies from web search logs based on search result click-through behaviors. 18. The information processing system of claim 17 further comprising:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. 19. A computer program product comprising a non-transitory computer readable storage medium with computer-executable instructions stored therein, said computer-executable instructions comprising:
receiving a search query comprising a search term; parsing the search term; determining that at least a portion of the parsed search term is an ambiguous, time-sensitive query; retrieving an intended search term according to a current time of day from a data store when it is determined that the at least a portion of the parsed search term is an ambiguous, time-sensitive query; and preparing a search results page such that search results more closely matching the derived intended search term are placed in a most prominent position on said search results page. 20. The computer program product of claim 19 wherein the computer-executable instructions further comprise:
determining a Jaccard Distance score and a Kullback-Leibler divergence score for pairs of URLs to identify the ambiguous, time-sensitive queries. | 2,100 |
4,763 | 14,986,953 | 2,192 | According to one embodiment of the present invention, a computer system updates a system including a plurality of sever instances, and includes at least one processor. The computer system determines a level of configuration for each operating server instance. One or more sets of operational features are added to the system based on a comparison between the determined levels of configuration of the operating server instances and minimum levels of configuration associated with the one or more sets of operational features. Server operations are performed and one or more corresponding sets of operational features are applied to the server operations in response to the addition of those corresponding sets of operational features to the system. Embodiments of the present invention further include a method and computer program product for updating a system including a plurality of server instances in substantially the same manner described above. | 1. A computer-implemented method of updating a system including a plurality of sever instances comprising:
determining a level of revision for each operating server instance; adding one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of the one or more sets of operational features; and performing server operations of the operating server instances and applying the added one or more sets of operational features to the server operations. 2. The computer-implemented method of claim 1, wherein each set of operational features includes a portion of a system update to incrementally update the system. 3. The computer-implemented method of claim 1, wherein the one or more sets of operational features pertain to a system update, and determining the level of revision further includes:
maintaining one or more server instances operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 4. The computer-implemented method of claim 1, further comprising:
registering each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 5. The computer-implemented method of claim 1, further comprising:
initiating a server instance within the system to perform an initial sequence of operations; determining a minimum revision level for each of the added sets of operational features; comparing a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminating the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 6. The computer-implemented method of claim 1, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 7. The computer-implemented method of claim 1, further comprising:
acquiring a lock mechanism to prevent initiation of additional server instances within the system. 8. The computer-implemented method of claim 1, wherein the server operations include conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and performing server operations includes:
determining the presence of the specified set of operational features within the system; bypassing server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and performing server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. 9. A computer system for updating a system including a plurality of sever instances comprising:
at least one processor configured to:
determine a level of revision for each operating server instance;
add one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of associated with the one or more sets of operational features; and
perform server operations and apply the added one or more sets of operational features to the server operations. 10. The computer system of claim 9, wherein each set of operational features includes a portion of a system update to incrementally update the system. 11. The computer system of claim 9, wherein the one or more sets of operational features pertain to a system update, and one or more server instances are maintained to be operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 12. The computer system of claim 9, wherein the at least one processor is further configured to:
register each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 13. The computer system of claim 9, wherein the at least one processor is further configured to:
initiate a server instance within the system to perform an initial sequence of operations; determine a minimum revision level for each of the added sets of operational features; compare a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminate the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 14. The computer system of claim 9, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 15. The computer system of claim 9, wherein the at least one processor is further configured to:
acquire a lock mechanism to prevent initiation of additional server instances within the system. 16. The computer system of claim 9, wherein the server operations include conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and performing server operations includes:
determining the presence of the specified set of operational features within the system; bypassing server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and performing server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. 17. A computer program product for updating a system including a plurality of sever instances comprising:
a computer readable storage medium having computer readable program code stored thereon, the computer readable program code comprising computer readable program code configured to:
determine a level of revision for each operating server instance;
add one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of the one or more sets of operational features; and
perform server operations and apply the added one or more sets of operational features to the server operations. 18. The computer program product of claim 17, wherein each set of operational features includes a portion of a system update to incrementally update the system. 19. The computer program product of claim 17, wherein the one or more sets of operational features pertain to a system update, and one or more server instances are maintained to be operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 20. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
register each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 21. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
initiate a server instance within the system to perform an initial sequence of operations; determine a minimum revision level for each of the added sets of operational features; compare a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminate the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 22. The computer program product of claim 17, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 23. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
acquire a lock mechanism to prevent initiation of additional server instances within the system. 24. The computer program product of claim 17, wherein the computer readable program code configured to perform server operations includes conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and the computer readable program code configured to perform server operations includes computer readable program code configured to:
determine the presence of the specified set of operational features within the system; bypass server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and perform server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. | According to one embodiment of the present invention, a computer system updates a system including a plurality of sever instances, and includes at least one processor. The computer system determines a level of configuration for each operating server instance. One or more sets of operational features are added to the system based on a comparison between the determined levels of configuration of the operating server instances and minimum levels of configuration associated with the one or more sets of operational features. Server operations are performed and one or more corresponding sets of operational features are applied to the server operations in response to the addition of those corresponding sets of operational features to the system. Embodiments of the present invention further include a method and computer program product for updating a system including a plurality of server instances in substantially the same manner described above.1. A computer-implemented method of updating a system including a plurality of sever instances comprising:
determining a level of revision for each operating server instance; adding one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of the one or more sets of operational features; and performing server operations of the operating server instances and applying the added one or more sets of operational features to the server operations. 2. The computer-implemented method of claim 1, wherein each set of operational features includes a portion of a system update to incrementally update the system. 3. The computer-implemented method of claim 1, wherein the one or more sets of operational features pertain to a system update, and determining the level of revision further includes:
maintaining one or more server instances operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 4. The computer-implemented method of claim 1, further comprising:
registering each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 5. The computer-implemented method of claim 1, further comprising:
initiating a server instance within the system to perform an initial sequence of operations; determining a minimum revision level for each of the added sets of operational features; comparing a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminating the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 6. The computer-implemented method of claim 1, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 7. The computer-implemented method of claim 1, further comprising:
acquiring a lock mechanism to prevent initiation of additional server instances within the system. 8. The computer-implemented method of claim 1, wherein the server operations include conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and performing server operations includes:
determining the presence of the specified set of operational features within the system; bypassing server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and performing server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. 9. A computer system for updating a system including a plurality of sever instances comprising:
at least one processor configured to:
determine a level of revision for each operating server instance;
add one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of associated with the one or more sets of operational features; and
perform server operations and apply the added one or more sets of operational features to the server operations. 10. The computer system of claim 9, wherein each set of operational features includes a portion of a system update to incrementally update the system. 11. The computer system of claim 9, wherein the one or more sets of operational features pertain to a system update, and one or more server instances are maintained to be operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 12. The computer system of claim 9, wherein the at least one processor is further configured to:
register each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 13. The computer system of claim 9, wherein the at least one processor is further configured to:
initiate a server instance within the system to perform an initial sequence of operations; determine a minimum revision level for each of the added sets of operational features; compare a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminate the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 14. The computer system of claim 9, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 15. The computer system of claim 9, wherein the at least one processor is further configured to:
acquire a lock mechanism to prevent initiation of additional server instances within the system. 16. The computer system of claim 9, wherein the server operations include conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and performing server operations includes:
determining the presence of the specified set of operational features within the system; bypassing server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and performing server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. 17. A computer program product for updating a system including a plurality of sever instances comprising:
a computer readable storage medium having computer readable program code stored thereon, the computer readable program code comprising computer readable program code configured to:
determine a level of revision for each operating server instance;
add one or more sets of operational features to the system based on a comparison indicating that the determined levels of revision of each of the operating server instances satisfy levels of revision required by each of the one or more sets of operational features; and
perform server operations and apply the added one or more sets of operational features to the server operations. 18. The computer program product of claim 17, wherein each set of operational features includes a portion of a system update to incrementally update the system. 19. The computer program product of claim 17, wherein the one or more sets of operational features pertain to a system update, and one or more server instances are maintained to be operational to enable incremental application of the system update across the plurality of server instances without disabling the entire system. 20. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
register each server instance and added set of operational features with the system to provide information pertaining to associated revision levels. 21. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
initiate a server instance within the system to perform an initial sequence of operations; determine a minimum revision level for each of the added sets of operational features; compare a level of revision of the initiated server instance with the determined minimum levels of revision associated with each of the added sets of operational features; and terminate the initial sequence of operations in response to the level of revision of the initiated server instance being insufficient for one or more sets of added operational features. 22. The computer program product of claim 17, wherein adding one or more sets of operational features to the system includes:
adding one or more sets of operational features to the system in response to the determined levels of revision of each of the operating server instances being sufficient for minimum levels of revision of each of the one or more sets of operational features. 23. The computer program product of claim 17, wherein the computer readable program code further comprises computer readable program code configured to:
acquire a lock mechanism to prevent initiation of additional server instances within the system. 24. The computer program product of claim 17, wherein the computer readable program code configured to perform server operations includes conditional logic to control performance of server operations based on the presence of a specified set of operational features within the system, and the computer readable program code configured to perform server operations includes computer readable program code configured to:
determine the presence of the specified set of operational features within the system; bypass server operations utilizing the specified set of operational features based on the conditional logic and in response to the absence of the specified set of operational features within the system; and perform server operations utilizing the specified set of operational features based on the conditional logic and in response to the presence of the specified set of operational features within the system. | 2,100 |
4,764 | 14,456,373 | 2,161 | An automatic resource ownership assignment system, the system including resource ownership indicators definition functionality operative to allow an operator of the system to define resource ownership indicators, automatic resource ownership recommendation functionality operative to provide, to at least one user of the system, a recommendation to assign ownership of at least one resource to a potential owner, based on the resource ownership indicators, and automatic resource ownership assignment functionality which, responsive to predetermined at least partial approval of the at least one recommendation by the at least one user and approval of said at least one recommendation by the potential owner, is operative to automatically assign ownership of the at least one resource to the potential owner. | 1. An automatic resource ownership assignment system, said system comprising:
resource ownership indicators definition functionality operative to allow an operator of said system to define resource ownership indicators; automatic resource ownership recommendation functionality operative to provide, to at least one user of said system, a recommendation to assign ownership of at least one resource to a potential owner, based on said resource ownership indicators; and automatic resource ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to automatically assign ownership of said at least one resource to said potential owner. 2. An automatic resource ownership assignment system according to claim 1 and wherein said ownership of at least one resource comprises responsibility for managing access permissions to said resource. 3. An automatic folder ownership assignment system, said system comprising:
folder ownership indicators definition functionality operative to allow an administrator of said system to define folder ownership indicators; automatic folder ownership recommendation functionality operative to provide, to at least one user of said system, a recommendation to assign ownership of at least one folder to a potential owner, based on said folder ownership indicators; and automatic folder ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to assign ownership of said at least one folder to said potential owner. 4. An automatic folder ownership assignment system according to claim 3 and wherein said ownership of at least one folder comprises responsibility for managing access permissions to said folder. 5. An automatic folder ownership assignment system according to claim 4 and wherein said access permissions comprise at least one of:
read permissions to at least one file within said folder;
write permissions to at least one file within said folder;
permissions to create at least one file in said folder; and
permissions to delete at least one file in said folder. 6. An automatic folder ownership assignment system according to claim 4 and wherein said managing access permissions to said folder is achieved by at least one of manually setting user access permissions to said folder, and configuring automatic rules for setting user access permissions to said folder. 7. An automatic folder ownership assignment system according to claim 3 and wherein said system resides on a computer server. 8. An automatic folder ownership assignment system according to claim 7 and wherein said computer server is connected to an enterprise level network. 9. An automatic folder ownership assignment system according to claim 8 and wherein said system includes a database. 10. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises access permissions information for at least some of the folders in said network. 11. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises actual access history information for at least some of the folders in said network. 12. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises metadata relating to at least some of the folders in said network. 13. An automatic folder ownership assignment system according to claim 9 and wherein said metadata comprises at least one of creation date and size. 14. An automatic folder ownership assignment system according to claim 10 and wherein said database also comprises folder ownership information for all folders in said network, 15. An automatic folder ownership assignment system according to claim 11 and wherein said folder ownership indicators include at least one of actual access to said at least one folder, access permissions to said at least one folder and the identity of a creator of said at least one folder. 16. An automatic folder ownership assignment system according to claim 12 and wherein said automatic folder ownership assignment functionality, responsive to rejection of said at least one recommendation by said at least one user or by said potential owner, and responsive to receiving an alternative recommendation from said at least one user or from said potential owner to assign ownership of said at least one folder to an alternative owner, is operative to automatically assign ownership of said at least one folder to said alternative owner. 17. An automatic library ownership assignment system, said system comprising:
library ownership indicators definition functionality operative to allow an operator of said system to define library ownership indicators; automatic library ownership recommendation functionality operative to provide, to at least one user of a library, a recommendation to assign ownership of said library to a potential owner, based on said library ownership indicators; and automatic library ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to automatically assign ownership of said library to said potential owner. 18-26. (canceled) | An automatic resource ownership assignment system, the system including resource ownership indicators definition functionality operative to allow an operator of the system to define resource ownership indicators, automatic resource ownership recommendation functionality operative to provide, to at least one user of the system, a recommendation to assign ownership of at least one resource to a potential owner, based on the resource ownership indicators, and automatic resource ownership assignment functionality which, responsive to predetermined at least partial approval of the at least one recommendation by the at least one user and approval of said at least one recommendation by the potential owner, is operative to automatically assign ownership of the at least one resource to the potential owner.1. An automatic resource ownership assignment system, said system comprising:
resource ownership indicators definition functionality operative to allow an operator of said system to define resource ownership indicators; automatic resource ownership recommendation functionality operative to provide, to at least one user of said system, a recommendation to assign ownership of at least one resource to a potential owner, based on said resource ownership indicators; and automatic resource ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to automatically assign ownership of said at least one resource to said potential owner. 2. An automatic resource ownership assignment system according to claim 1 and wherein said ownership of at least one resource comprises responsibility for managing access permissions to said resource. 3. An automatic folder ownership assignment system, said system comprising:
folder ownership indicators definition functionality operative to allow an administrator of said system to define folder ownership indicators; automatic folder ownership recommendation functionality operative to provide, to at least one user of said system, a recommendation to assign ownership of at least one folder to a potential owner, based on said folder ownership indicators; and automatic folder ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to assign ownership of said at least one folder to said potential owner. 4. An automatic folder ownership assignment system according to claim 3 and wherein said ownership of at least one folder comprises responsibility for managing access permissions to said folder. 5. An automatic folder ownership assignment system according to claim 4 and wherein said access permissions comprise at least one of:
read permissions to at least one file within said folder;
write permissions to at least one file within said folder;
permissions to create at least one file in said folder; and
permissions to delete at least one file in said folder. 6. An automatic folder ownership assignment system according to claim 4 and wherein said managing access permissions to said folder is achieved by at least one of manually setting user access permissions to said folder, and configuring automatic rules for setting user access permissions to said folder. 7. An automatic folder ownership assignment system according to claim 3 and wherein said system resides on a computer server. 8. An automatic folder ownership assignment system according to claim 7 and wherein said computer server is connected to an enterprise level network. 9. An automatic folder ownership assignment system according to claim 8 and wherein said system includes a database. 10. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises access permissions information for at least some of the folders in said network. 11. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises actual access history information for at least some of the folders in said network. 12. An automatic folder ownership assignment system according to claim 9 and wherein said database comprises metadata relating to at least some of the folders in said network. 13. An automatic folder ownership assignment system according to claim 9 and wherein said metadata comprises at least one of creation date and size. 14. An automatic folder ownership assignment system according to claim 10 and wherein said database also comprises folder ownership information for all folders in said network, 15. An automatic folder ownership assignment system according to claim 11 and wherein said folder ownership indicators include at least one of actual access to said at least one folder, access permissions to said at least one folder and the identity of a creator of said at least one folder. 16. An automatic folder ownership assignment system according to claim 12 and wherein said automatic folder ownership assignment functionality, responsive to rejection of said at least one recommendation by said at least one user or by said potential owner, and responsive to receiving an alternative recommendation from said at least one user or from said potential owner to assign ownership of said at least one folder to an alternative owner, is operative to automatically assign ownership of said at least one folder to said alternative owner. 17. An automatic library ownership assignment system, said system comprising:
library ownership indicators definition functionality operative to allow an operator of said system to define library ownership indicators; automatic library ownership recommendation functionality operative to provide, to at least one user of a library, a recommendation to assign ownership of said library to a potential owner, based on said library ownership indicators; and automatic library ownership assignment functionality which, responsive to predetermined at least partial approval of said at least one recommendation by said at least one user and approval of said at least one recommendation by said potential owner, is operative to automatically assign ownership of said library to said potential owner. 18-26. (canceled) | 2,100 |
4,765 | 12,826,077 | 2,127 | Systems and associated methods for highly parallel processing of parameterized simulations are described. Embodiments permit processing of stochastic data-intensive simulations in a highly parallel fashion in order to distribute the intensive workload. Embodiments utilize methods of seeding records in a database with a source of pseudo-random numbers, such as a compressed seed for a pseudo-random number generator, such that seeded records may be processed independently in a highly parallel fashion. Thus, embodiments provide systems and associated methods facilitating quicker data-intensive simulation by enabling highly parallel asynchronous simulations. | 1. A method comprising:
assigning records of a database for seeding; seeding each record, said seeding further comprising adding a unique source of pseudo-random numbers to each record; and providing seeded records to a plurality of processing nodes for parallel asynchronous simulations. 2. The method according to claim 1, wherein assigning records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 3. The method according to claim 1, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 4. The method according to claim 1, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 5. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 6. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 7. The method according to claim 6, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 8. The method according to claim 1, wherein providing a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 9. The method according to claim 1, further comprising receiving simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records and recording the simulation results. 10. A 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 assign records of a database for seeding; computer readable program code configured to seed each record, wherein to seed each record further comprises adding a unique source of pseudo-random numbers to each record; and computer readable program code configured to provide seeded records to a plurality of processing nodes for parallel asynchronous simulations. 11. The computer program product according to claim 10, wherein to assign records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 12. The computer program product according to claim 10, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 13. The computer program product according to claim 10, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 14. The computer program product according to claim 10, wherein to add a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 15. The computer program product according to claim 10, wherein to add a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 16. The computer program product according to claim 15, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 17. The computer program product according to claim 10, wherein to provide a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 18. The computer program product according to claim 10, further comprising computer readable program code configured to record simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records. 19. A system comprising:
one or more processors; and a memory operatively connected to the one or more processors; wherein, responsive to execution of computer readable program code accessible to the one or more processors, the one or more processors are configured to: assign records of a database for seeding; seed each record, wherein to seed each record further comprises adding a unique source of pseudo-random numbers to each record; and provide seeded records to a plurality of processing nodes for parallel asynchronous simulations. 20. The system according to claim 19, wherein to assign records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. | Systems and associated methods for highly parallel processing of parameterized simulations are described. Embodiments permit processing of stochastic data-intensive simulations in a highly parallel fashion in order to distribute the intensive workload. Embodiments utilize methods of seeding records in a database with a source of pseudo-random numbers, such as a compressed seed for a pseudo-random number generator, such that seeded records may be processed independently in a highly parallel fashion. Thus, embodiments provide systems and associated methods facilitating quicker data-intensive simulation by enabling highly parallel asynchronous simulations.1. A method comprising:
assigning records of a database for seeding; seeding each record, said seeding further comprising adding a unique source of pseudo-random numbers to each record; and providing seeded records to a plurality of processing nodes for parallel asynchronous simulations. 2. The method according to claim 1, wherein assigning records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 3. The method according to claim 1, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 4. The method according to claim 1, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 5. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 6. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 7. The method according to claim 6, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 8. The method according to claim 1, wherein providing a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 9. The method according to claim 1, further comprising receiving simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records and recording the simulation results. 10. A 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 assign records of a database for seeding; computer readable program code configured to seed each record, wherein to seed each record further comprises adding a unique source of pseudo-random numbers to each record; and computer readable program code configured to provide seeded records to a plurality of processing nodes for parallel asynchronous simulations. 11. The computer program product according to claim 10, wherein to assign records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 12. The computer program product according to claim 10, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 13. The computer program product according to claim 10, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 14. The computer program product according to claim 10, wherein to add a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 15. The computer program product according to claim 10, wherein to add a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 16. The computer program product according to claim 15, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 17. The computer program product according to claim 10, wherein to provide a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 18. The computer program product according to claim 10, further comprising computer readable program code configured to record simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records. 19. A system comprising:
one or more processors; and a memory operatively connected to the one or more processors; wherein, responsive to execution of computer readable program code accessible to the one or more processors, the one or more processors are configured to: assign records of a database for seeding; seed each record, wherein to seed each record further comprises adding a unique source of pseudo-random numbers to each record; and provide seeded records to a plurality of processing nodes for parallel asynchronous simulations. 20. The system according to claim 19, wherein to assign records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. | 2,100 |
4,766 | 13,595,446 | 2,127 | Systems and associated methods for highly parallel processing of parameterized simulations are described. Embodiments permit processing of stochastic data-intensive simulations in a highly parallel fashion in order to distribute the intensive workload. Embodiments utilize methods of seeding records in a database with a source of pseudo-random numbers, such as a compressed seed for a pseudo-random number generator, such that seeded records may be processed independently in a highly parallel fashion. Thus, embodiments provide systems and associated methods facilitating quicker data-intensive simulation by enabling highly parallel asynchronous simulations. | 1. A method comprising:
assigning records of a database for seeding; seeding each record, said seeding further comprising adding a unique source of pseudo-random numbers to each record; and providing seeded records to a plurality of processing nodes for parallel asynchronous simulations. 2. The method according to claim 1, wherein assigning records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 3. The method according to claim 1, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 4. The method according to claim 1, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 5. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 6. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 7. The method according to claim 6, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 8. The method according to claim 1, wherein providing a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 9. The method according to claim 1, further comprising receiving simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records and recording the simulation results. | Systems and associated methods for highly parallel processing of parameterized simulations are described. Embodiments permit processing of stochastic data-intensive simulations in a highly parallel fashion in order to distribute the intensive workload. Embodiments utilize methods of seeding records in a database with a source of pseudo-random numbers, such as a compressed seed for a pseudo-random number generator, such that seeded records may be processed independently in a highly parallel fashion. Thus, embodiments provide systems and associated methods facilitating quicker data-intensive simulation by enabling highly parallel asynchronous simulations.1. A method comprising:
assigning records of a database for seeding; seeding each record, said seeding further comprising adding a unique source of pseudo-random numbers to each record; and providing seeded records to a plurality of processing nodes for parallel asynchronous simulations. 2. The method according to claim 1, wherein assigning records of a database for seeding further comprises assigning records to a plurality of processing nodes for seeding independently and asynchronously. 3. The method according to claim 1, wherein the unique source of pseudo-random numbers further comprises a compressed seed for a pseudo-random number generator. 4. The method according to claim 1, wherein the parallel asynchronous simulations further comprise, a plurality of simulations, each executed in accordance with a given seeded record by at least one of the plurality of processing nodes. 5. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises adding a source of pseudo-random numbers to each record enabling each of the plurality of processing nodes to generate pseudo-random numbers locally for a simulation. 6. The method according to claim 1, wherein adding a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to generate a disjoint sequence of pseudo-random numbers for the record using a skip-ahead technique for a single pseudo-random number generator locally. 7. The method according to claim 6, wherein using a skip-ahead technique further comprises pre-computation of a set of skip parameters whose size is a logarithmic function of the cycle length of the pseudo-random number generator. 8. The method according to claim 1, wherein providing a unique source of pseudo-random numbers to each record further comprises providing a compressed seed to each record enabling each of the plurality of processing nodes to locally generate a sequence of pseudo-random numbers for the record that, with high probability, is disjoint from a sequence for all other records, using a technique based on multiple pseudo-random number generators. 9. The method according to claim 1, further comprising receiving simulation results from parallel asynchronous simulations executed with the plurality processing nodes using the seeded records and recording the simulation results. | 2,100 |
4,767 | 14,642,898 | 2,194 | A computing system environment executes platform-independent instructions to combine object data of a plurality of objects into a platform-independent object. Such objects of the plurality of objects may, for example, include form, entity and schema objects. Platform-dependent instructions comprising a set of one or more platform-specific instructions to display and operate on the platform-independent object are executed on a specific platform type associated with the platform-dependent instructions. By decoupling the hardcoded functionality from easily created and edited object portions of the application design, rapid deployment and execution of customized functionality across multiple distinct platforms is thereby enabled. | 1. A system for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
a database coupled to a network, the database having stored therein object data of a plurality of objects; a set of platform-independent instructions comprising instructions to combine at least a portion of the object data of the plurality of objects into a platform-independent object; a set of platform-dependent instructions comprising a set of one or more platform-specific instructions to convert and otherwise perform operations on the platform-independent object using a specific platform type associated with the platform-dependent instructions; at least one computing processor, the computing processor configured to communicate with the database over the network; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, the object data of the plurality of objects into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 2. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more objects of the plurality of objects associated with the user input. 3. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 2 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 4. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, wherein a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 5. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 4 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 6. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects; and
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 7. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of schema objects and one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 8. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 9. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the platform-dependent instructions are executed on the first platform and the platform-independent instructions are executed on a second platform. 10. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the first platform. 11. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 further comprising:
wherein the plurality of objects includes at least one entity object having object information;
further wherein the plurality of objects includes at least one entity object having object information, further wherein the process further comprises:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of the at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. 12. A computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
at least one computing processor, the computing processor configured to communicate with a database over the network, the database having stored therein object data of a plurality of objects; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, object information of a plurality of objects into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 13. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more objects of the plurality of objects. 14. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 13 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 15. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 16. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 15 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 17. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects;
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 18. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of schema objects and one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 19. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 20. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the platform-independent instructions are executed on a first platform and the platform-dependent instructions are executed on a second platform. 21. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the same platform. 22. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 further comprising:
wherein the plurality of objects includes at least one entity object having object information;
further wherein the plurality of objects includes at least one entity object having object information, further wherein the process further comprises:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. 23. A system for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
a database coupled to a network, the database having stored therein a plurality of entity objects each including specific data describing a distinct entity object, a plurality of schema objects each defining a type of entity object and what each type of entity object is allowed to contain, and a plurality of form objects each defining a form, each form object including one or more fields; a set of platform-independent instructions comprising instructions to combine form object data of one or more form objects, schema object data of one or more schema objects and entity object data of one or more entities into a platform-independent object; a set of platform-dependent instructions comprising a set of one or more platform-specific instructions to display and operate on the platform-independent object using a specific platform type associated with the platform-dependent instructions; at least one computing processor, the computing processor configured to communicate with the database over the network; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, object information of at least one schema object, object information of at least one entity object, and object information of at least one form object into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 24. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input. 25. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 26. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein
one or more form objects of the plurality of form objects includes a pathname, wherein a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 27. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 26 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 28. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 27 wherein
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects; and
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 29. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein
one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 30. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 31. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein the platform-dependent instructions are executed on the first platform and the platform-independent instructions are executed on a second platform. 32. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the first platform. 33. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 further comprising:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. | A computing system environment executes platform-independent instructions to combine object data of a plurality of objects into a platform-independent object. Such objects of the plurality of objects may, for example, include form, entity and schema objects. Platform-dependent instructions comprising a set of one or more platform-specific instructions to display and operate on the platform-independent object are executed on a specific platform type associated with the platform-dependent instructions. By decoupling the hardcoded functionality from easily created and edited object portions of the application design, rapid deployment and execution of customized functionality across multiple distinct platforms is thereby enabled.1. A system for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
a database coupled to a network, the database having stored therein object data of a plurality of objects; a set of platform-independent instructions comprising instructions to combine at least a portion of the object data of the plurality of objects into a platform-independent object; a set of platform-dependent instructions comprising a set of one or more platform-specific instructions to convert and otherwise perform operations on the platform-independent object using a specific platform type associated with the platform-dependent instructions; at least one computing processor, the computing processor configured to communicate with the database over the network; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, the object data of the plurality of objects into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 2. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more objects of the plurality of objects associated with the user input. 3. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 2 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 4. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, wherein a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 5. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 4 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 6. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects; and
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 7. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein
the plurality of objects includes a plurality of schema objects and one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 8. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 9. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the platform-dependent instructions are executed on the first platform and the platform-independent instructions are executed on a second platform. 10. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the first platform. 11. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 1 further comprising:
wherein the plurality of objects includes at least one entity object having object information;
further wherein the plurality of objects includes at least one entity object having object information, further wherein the process further comprises:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of the at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. 12. A computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
at least one computing processor, the computing processor configured to communicate with a database over the network, the database having stored therein object data of a plurality of objects; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, object information of a plurality of objects into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 13. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more objects of the plurality of objects. 14. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 13 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 15. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 16. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 15 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 17. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of form objects; and
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects;
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 18. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein
the plurality of objects includes a plurality of schema objects and one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 19. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the plurality of objects includes a plurality of form objects and one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 20. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the platform-independent instructions are executed on a first platform and the platform-dependent instructions are executed on a second platform. 21. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the same platform. 22. The computing system implemented method for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 12 further comprising:
wherein the plurality of objects includes at least one entity object having object information;
further wherein the plurality of objects includes at least one entity object having object information, further wherein the process further comprises:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. 23. A system for rapid deployment and execution of customized functionality across multiple distinct platforms comprising:
a database coupled to a network, the database having stored therein a plurality of entity objects each including specific data describing a distinct entity object, a plurality of schema objects each defining a type of entity object and what each type of entity object is allowed to contain, and a plurality of form objects each defining a form, each form object including one or more fields; a set of platform-independent instructions comprising instructions to combine form object data of one or more form objects, schema object data of one or more schema objects and entity object data of one or more entities into a platform-independent object; a set of platform-dependent instructions comprising a set of one or more platform-specific instructions to display and operate on the platform-independent object using a specific platform type associated with the platform-dependent instructions; at least one computing processor, the computing processor configured to communicate with the database over the network; and at least one memory coupled to the at least one computing processor, the at least one memory having stored therein instructions which when executed by the at least one computing processor perform a process for rapid deployment and execution of customized functionality across multiple distinct platforms including: combining, using at least a portion of the set of platform-independent instructions, object information of at least one schema object, object information of at least one entity object, and object information of at least one form object into a platform-independent object; deploying the platform-specific set of instructions to a first platform of the specific platform type of the set of platform-specific instructions; converting, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-independent object into a platform-dependent object; and displaying at least a portion of the platform-dependent object by the first platform. 24. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 further comprising:
receiving user input from a user of the first platform changing the platform-dependent object by changing already existing data or adding new data that was not previously associated with the platform-dependent object;
integrating, by performing at least a portion of the set of platform-dependent instructions by the first platform, at least a portion of the platform-dependent object into the platform-independent object; and
transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input. 25. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein transferring at least one or more changed or new portions of the platform-independent object to one or more entity objects associated with the changed or added user input comprises:
determining one or more schema objects associated with one or more entity objects associated with the changed or new portions of the platform-independent object;
transferring, for each property of the schema associated with the changed or new portions of the platform-independent object, the changed or new portions of the platform-independent object into the associated entity object; and
storing the changed or new portions of the associated entity object. 26. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein
one or more form objects of the plurality of form objects includes a pathname, wherein a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects. 27. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 26 wherein
the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects. 28. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 27 wherein
one or more form objects of the plurality of form objects includes a pathname, where a pathname includes a schema designator, the schema designator being data identifying a specific schema object of the plurality of schema objects,
further wherein the pathname further includes a property, where the property includes a property designator, the property designator being data identifying a specific property object of the specific schema object of the plurality of schema objects; and
further wherein one or more property objects further includes characteristic data including one or more of a characteristic title and a characteristic type. 29. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein
one or more schema objects of the plurality of schema objects further include one or more default properties and/or one or more required properties; and
one or more form objects of the plurality of form objects includes a property object having property object data directly corresponding to and overriding one or more of the associated default and/or required properties. 30. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein one or more form objects of the plurality of form objects includes a form field type property designating a form field type selected from a group of form field types consisting of:
a drop down field type;
an entity select field type;
a currency field type;
a text area field type;
a barcode field type;
a date picker field type;
a time picker field type;
a multi-select field type;
a number field type;
a switch field type;
a date field type;
a geolocation field type;
a text input field type;
a stepper field type;
a signature field type;
a picture field type;
a text display field type
a checkbox field type;
a yes/no field type; and
a bullet button field type. 31. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein the platform-dependent instructions are executed on the first platform and the platform-independent instructions are executed on a second platform. 32. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 wherein the platform-independent instructions and the platform-dependent instructions are both executed on the first platform. 33. The system for rapid deployment and execution of customized functionality across multiple distinct platforms of claim 23 further comprising:
receiving user input including login data;
validating the login data as being of an authorized user;
retrieving authorized user data from the database, the authorized user data including a predetermined form object and a predetermined entity object;
wherein the object information of at least one entity object includes object information from the predetermined entity object; and
wherein the object information of at least one form object includes object information from the predetermined form object. | 2,100 |
4,768 | 14,461,587 | 2,162 | Collecting and distributing information related to recent content publication activity of an instant messaging (IM) user provides other users in a network with timely, relevant information about people known to the user or within the same social network. A user participating in a social network can quickly and efficiently perceive new information related to other users (referred to as co-users) in a social network by reviewing the co-users' recent content publication activity. A user may be made able to do so without requiring the co-user to send a communication directly to the user regarding the new facts or new content, and also without requiring the user to actively browse or request information about the co-user. | 1. A method, comprising:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher; selecting an identifier of a particular co-user from the list; and modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. 2. The method of claim 1, wherein the determination is based on whether the publication preference includes an indication that the online publisher desires to share recent content publication activity with a particular class of online identities to which the particular co-user belongs. 3. The method of claim 1 wherein the determination is based on whether the publication preference includes an indication of a type of content publication activity that the online publisher desires to share and whether the type of the indication is the same as a type of the recent content publication activity. 4. The method of claim 1, wherein the determination is based on a comparison of content associated with recent content publication activity with content stored in the publication preference. 5. The method of claim 1, further comprising receiving an indication that the online publisher has engaged in recent content publication activity, the indication including an indication that the online publisher has engaged in creation of at least one of a digital asset, a communication tool, and a community-related asset. 6. The method of claim 1, further comprising receiving an indication that the online publisher has engaged in recent content publication activity, the indication including at least one of
a change to a digital asset, a communication tool, and a community-related asset; and an indication that the online publisher has engaged in creation of, or an update to, a third party service provider account owned by the online publisher. 7. The method of claim 1, further comprising enabling at least one of the plurality of co-users to search for recent content publication activity associated with the online publisher by providing at least one of a desired type of recent content publication activity, an identifier associated with recent content publication activity, and a keyword associated with the recent content publication activity. 8. The method of claim 1, further comprising transmitting, to the particular co-user a display representation of the activity type, including at least one of
an image, an animation, a sound, a pop-up, text, scrolling text, and a scrolling image. 9. The method of claim 1, further comprising:
receiving information that indicates an activity type associated with recent content publication activity; and selecting a display representation of the activity type for display to the particular co-user. 10. The method of claim 9, wherein the activity type associated with the recent content publication activity includes creation of at least one of
a user profile, an online journal, a blog, a playlist, a photograph album, and an account associated with a third party service provider. 11. The method of claim 9, wherein the activity type associated with the recent content publication activity includes an update to at least one of
a user profile, an online journal entry, a blog entry, a playlist, a photograph album, and an account associated with a third party service provider. 12. A system for indicating recent content publication activity, the system comprising:
at least one processor; and a memory storing instructions that, when executed by the at least one processor, causes the at least one processor to perform a method including:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher;
selecting an identifier of a particular co-user from the list; and
modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. 13. A computer-readable storage device storing instructions that, when executed by at least one processor, cause the execution of a method of indicating recent content publication activity, the method comprising:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher; selecting an identifier of a particular co-user from the list; and modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. | Collecting and distributing information related to recent content publication activity of an instant messaging (IM) user provides other users in a network with timely, relevant information about people known to the user or within the same social network. A user participating in a social network can quickly and efficiently perceive new information related to other users (referred to as co-users) in a social network by reviewing the co-users' recent content publication activity. A user may be made able to do so without requiring the co-user to send a communication directly to the user regarding the new facts or new content, and also without requiring the user to actively browse or request information about the co-user.1. A method, comprising:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher; selecting an identifier of a particular co-user from the list; and modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. 2. The method of claim 1, wherein the determination is based on whether the publication preference includes an indication that the online publisher desires to share recent content publication activity with a particular class of online identities to which the particular co-user belongs. 3. The method of claim 1 wherein the determination is based on whether the publication preference includes an indication of a type of content publication activity that the online publisher desires to share and whether the type of the indication is the same as a type of the recent content publication activity. 4. The method of claim 1, wherein the determination is based on a comparison of content associated with recent content publication activity with content stored in the publication preference. 5. The method of claim 1, further comprising receiving an indication that the online publisher has engaged in recent content publication activity, the indication including an indication that the online publisher has engaged in creation of at least one of a digital asset, a communication tool, and a community-related asset. 6. The method of claim 1, further comprising receiving an indication that the online publisher has engaged in recent content publication activity, the indication including at least one of
a change to a digital asset, a communication tool, and a community-related asset; and an indication that the online publisher has engaged in creation of, or an update to, a third party service provider account owned by the online publisher. 7. The method of claim 1, further comprising enabling at least one of the plurality of co-users to search for recent content publication activity associated with the online publisher by providing at least one of a desired type of recent content publication activity, an identifier associated with recent content publication activity, and a keyword associated with the recent content publication activity. 8. The method of claim 1, further comprising transmitting, to the particular co-user a display representation of the activity type, including at least one of
an image, an animation, a sound, a pop-up, text, scrolling text, and a scrolling image. 9. The method of claim 1, further comprising:
receiving information that indicates an activity type associated with recent content publication activity; and selecting a display representation of the activity type for display to the particular co-user. 10. The method of claim 9, wherein the activity type associated with the recent content publication activity includes creation of at least one of
a user profile, an online journal, a blog, a playlist, a photograph album, and an account associated with a third party service provider. 11. The method of claim 9, wherein the activity type associated with the recent content publication activity includes an update to at least one of
a user profile, an online journal entry, a blog entry, a playlist, a photograph album, and an account associated with a third party service provider. 12. A system for indicating recent content publication activity, the system comprising:
at least one processor; and a memory storing instructions that, when executed by the at least one processor, causes the at least one processor to perform a method including:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher;
selecting an identifier of a particular co-user from the list; and
modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. 13. A computer-readable storage device storing instructions that, when executed by at least one processor, cause the execution of a method of indicating recent content publication activity, the method comprising:
accessing an online identifier for each of a plurality of co-users who populate a list, inclusion in which is directed by an online publisher; selecting an identifier of a particular co-user from the list; and modifying the selected identifier so as to indicate that the online publisher has recently engaged in content publication activity when
a determination is made that the online publisher wants to share with the particular co-user recent content publication activity, based at least in part on a publication preference of the online publisher, and
the particular co-user views either a profile of the online publisher or a feed of recent content publication activity of co-users associated with the particular co-user. | 2,100 |
4,769 | 14,506,931 | 2,156 | A data warehouse system comprising a warehouse database and a data warehouse manager communicatively coupled to the database. The warehouse manager is to store data to and retrieve data from the warehouse database and perform metadata reconciliation to update metadata of objects in the data warehouse to reflect a change in metadata of a first object in the warehouse by identifying a first set of objects impacted by the change to the metadata of the first object, identifying a second set of objects on which the first object depends, identifying at least one task that has to be completed to propagate the impact of the change in the metadata of the first object to objects in the first and second sets of objects, performing the task, and dynamically computing additional tasks based on whether or not definitions of objects in the first or second sets of objects changes based upon completion of the at least one task. | 1. A method comprising:
receiving, at one or more computer systems, a change in a definition of a first object describing a first portion of data stored in a data warehouse; determining, with one or more processors associated with the one or more computer systems, at least one task to propagate the change in the definition of the first object to metadata of the first object; reconciling, with one or more processors associated with one or more computer systems, lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data; determining, with the one or more processors associated with the one or more computer systems, at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and rendering, with the one or more processors associated with the one or more computer systems, a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. 2. The method of claim 1 further comprising generating a script of all tasks needed to propagate the impact of the change to the metadata of the one or more objects. 3. The method of claim 2 further comprising executing the script in response to a command provided by a user via the user interface. 4. The method of claim 2 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object comprises generating a graph based on relationships between the first object and each object in the set of objects. 5. The method of claim 4 wherein rendering, with the one or more processors associated with the one or more computer systems, the visual representation of the impact of the change to the metadata of the one or more objects within the graphical user interface comprises rendering the graph depicting the relationships between the first object and each object in the set of objects. 6. The method of claim 1 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object comprises performing a lineage analysis within an impact analysis. 7. The method of claim 1 further comprising generating updated versions of the first object and each object in the set of objects based upon completion of a set of tasks. 8. The method of claim 1 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object to identify the set of objects comprises managing hierarchical dependencies among objects based on dependency documents that conform to a common dependency format. 9. The method of claim 1 further comprising rendering a visual representation of any determined tasks within the graphical user interface. 10. The method of claim 1 further comprising rendering one or more suggestions within the graphical user interface based on any determined tasks. 11. A non-transitory computer-readable medium storing a computer program product which when executed by a processor of a computer system cause the processor to:
receive a change in a definition of a first object describing a first portion of data stored in a data warehouse; determine at least one task to propagate the change in the definition of the first object to metadata of the first object; reconcile lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data; determine at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and render a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. 12. The non-transitory computer-readable medium of claim 11 wherein the computer program product further causes the processor to generate a script of all tasks needed to propagate the impact of the change to the metadata of the one or more objects. 13. The non-transitory computer-readable medium of claim 12 wherein the computer program product further causes the processor to execute the script in response to a command provided by a user via the user interface. 14. The non-transitory computer-readable medium of claim 12 wherein to reconcile the lineage of the first object the computer program product further causes the processor to generate a graph based on relationships between the first object and each object in the set of objects. 15. The non-transitory computer-readable medium of claim 14 wherein to render the visual representation of the impact of the change to the metadata of the one or more objects within the graphical user interface the computer program product further causes the processor to render the graph depicting the relationships between the first object and each object in the set of objects. 16. The non-transitory computer-readable medium of claim 11 wherein to reconcile the lineage of the first object the computer program product causes the processor to performing a lineage analysis within an impact analysis. 17. The non-transitory computer-readable medium of claim 11 wherein the computer program product further causes the processor to generate updated versions of the first object and each object in the set of objects based upon completion of a set of tasks. 18. The non-transitory computer-readable medium of claim 11 wherein to reconcile the lineage of the first object to identify the set of objects the computer program product causes the processor to managing hierarchical dependencies among objects based on dependency documents that conform to a common dependency format. 19. The method of claim 1 further comprising rendering one or more suggestions within the graphical user interface based on any determined tasks. 20. A system comprising:
a hardware processor; and a memory storing a set of instructions which when executed by the processor cause the processor to:
receive a change in a definition of a first object describing a first portion of data stored in a data warehouse;
determine at least one task to propagate the change in the definition of the first object to metadata of the first object;
reconcile lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data;
determine at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and
render a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. | A data warehouse system comprising a warehouse database and a data warehouse manager communicatively coupled to the database. The warehouse manager is to store data to and retrieve data from the warehouse database and perform metadata reconciliation to update metadata of objects in the data warehouse to reflect a change in metadata of a first object in the warehouse by identifying a first set of objects impacted by the change to the metadata of the first object, identifying a second set of objects on which the first object depends, identifying at least one task that has to be completed to propagate the impact of the change in the metadata of the first object to objects in the first and second sets of objects, performing the task, and dynamically computing additional tasks based on whether or not definitions of objects in the first or second sets of objects changes based upon completion of the at least one task.1. A method comprising:
receiving, at one or more computer systems, a change in a definition of a first object describing a first portion of data stored in a data warehouse; determining, with one or more processors associated with the one or more computer systems, at least one task to propagate the change in the definition of the first object to metadata of the first object; reconciling, with one or more processors associated with one or more computer systems, lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data; determining, with the one or more processors associated with the one or more computer systems, at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and rendering, with the one or more processors associated with the one or more computer systems, a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. 2. The method of claim 1 further comprising generating a script of all tasks needed to propagate the impact of the change to the metadata of the one or more objects. 3. The method of claim 2 further comprising executing the script in response to a command provided by a user via the user interface. 4. The method of claim 2 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object comprises generating a graph based on relationships between the first object and each object in the set of objects. 5. The method of claim 4 wherein rendering, with the one or more processors associated with the one or more computer systems, the visual representation of the impact of the change to the metadata of the one or more objects within the graphical user interface comprises rendering the graph depicting the relationships between the first object and each object in the set of objects. 6. The method of claim 1 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object comprises performing a lineage analysis within an impact analysis. 7. The method of claim 1 further comprising generating updated versions of the first object and each object in the set of objects based upon completion of a set of tasks. 8. The method of claim 1 wherein reconciling, with the one or more processors associated with one or more computer systems, the lineage of the first object to identify the set of objects comprises managing hierarchical dependencies among objects based on dependency documents that conform to a common dependency format. 9. The method of claim 1 further comprising rendering a visual representation of any determined tasks within the graphical user interface. 10. The method of claim 1 further comprising rendering one or more suggestions within the graphical user interface based on any determined tasks. 11. A non-transitory computer-readable medium storing a computer program product which when executed by a processor of a computer system cause the processor to:
receive a change in a definition of a first object describing a first portion of data stored in a data warehouse; determine at least one task to propagate the change in the definition of the first object to metadata of the first object; reconcile lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data; determine at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and render a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. 12. The non-transitory computer-readable medium of claim 11 wherein the computer program product further causes the processor to generate a script of all tasks needed to propagate the impact of the change to the metadata of the one or more objects. 13. The non-transitory computer-readable medium of claim 12 wherein the computer program product further causes the processor to execute the script in response to a command provided by a user via the user interface. 14. The non-transitory computer-readable medium of claim 12 wherein to reconcile the lineage of the first object the computer program product further causes the processor to generate a graph based on relationships between the first object and each object in the set of objects. 15. The non-transitory computer-readable medium of claim 14 wherein to render the visual representation of the impact of the change to the metadata of the one or more objects within the graphical user interface the computer program product further causes the processor to render the graph depicting the relationships between the first object and each object in the set of objects. 16. The non-transitory computer-readable medium of claim 11 wherein to reconcile the lineage of the first object the computer program product causes the processor to performing a lineage analysis within an impact analysis. 17. The non-transitory computer-readable medium of claim 11 wherein the computer program product further causes the processor to generate updated versions of the first object and each object in the set of objects based upon completion of a set of tasks. 18. The non-transitory computer-readable medium of claim 11 wherein to reconcile the lineage of the first object to identify the set of objects the computer program product causes the processor to managing hierarchical dependencies among objects based on dependency documents that conform to a common dependency format. 19. The method of claim 1 further comprising rendering one or more suggestions within the graphical user interface based on any determined tasks. 20. A system comprising:
a hardware processor; and a memory storing a set of instructions which when executed by the processor cause the processor to:
receive a change in a definition of a first object describing a first portion of data stored in a data warehouse;
determine at least one task to propagate the change in the definition of the first object to metadata of the first object;
reconcile lineage of the first object to identify a set of objects that are impacted by the change to the definition of the first object, each object in the second set of objects describing a second portion of the data stored in the data warehouse different from the first portion of the data;
determine at least one additional task to propagate an impact of the change to metadata of one or more objects in the set of objects that are impacted by the change to the definition of the first object; and
render a visual representation of the impact of the change to the metadata of the one or more objects within a graphical user interface. | 2,100 |
4,770 | 14,336,299 | 2,169 | An information processing system includes a processor configured to create, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identify based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data. | 1. An information processing system comprising
a processor configured to:
create, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and
identify based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data. 2. The information processing system according to claim 1, wherein
the processor creates and adds to the compressed object data, classification data that indicates a type of each word, and the processor identifies based on the count data and the classification data, the second character string that corresponds to a classification and the first character string defined as search conditions for the object data. 3. The information processing system according to claim 1, wherein
the processor is configured to count a number of records that include the identified second character, in the object data. 4. The information processing system according to claim 3, wherein
the processor creates and adds to the compressed object data, code data that indicates a compression result of each word, and the processor counts based on the code data, the number of records in which the identified second character string appears within a predetermined number of words from the first character string, in the object data. 5. The information processing system according to claim 3, wherein
the processor counts based on the count data, the number of records in which the identified second character string appears a predetermined number of times or more in the object data. 6. The information processing system according to claim 1, wherein
the processor is configured to extract from the object data, a word that is identical to a word included in a predetermined word group, and the processor, when the object data is compressed for each word in units of records, creates and adds to the compressed object data, the count data that indicates for each record of the object data, the appearance count of each extracted word. 7. The information processing system according to claim 1, wherein
the processor is configured to calculate a significance of the second character string, based on the count data. 8. An information processing method comprising:
creating, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identifying based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data, the information processing method being executed by a computer. 9. A non-transitory, computer-readable recording medium storing an information processing program that causes a computer to execute a process comprising:
creating, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identifying based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data. | An information processing system includes a processor configured to create, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identify based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data.1. An information processing system comprising
a processor configured to:
create, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and
identify based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data. 2. The information processing system according to claim 1, wherein
the processor creates and adds to the compressed object data, classification data that indicates a type of each word, and the processor identifies based on the count data and the classification data, the second character string that corresponds to a classification and the first character string defined as search conditions for the object data. 3. The information processing system according to claim 1, wherein
the processor is configured to count a number of records that include the identified second character, in the object data. 4. The information processing system according to claim 3, wherein
the processor creates and adds to the compressed object data, code data that indicates a compression result of each word, and the processor counts based on the code data, the number of records in which the identified second character string appears within a predetermined number of words from the first character string, in the object data. 5. The information processing system according to claim 3, wherein
the processor counts based on the count data, the number of records in which the identified second character string appears a predetermined number of times or more in the object data. 6. The information processing system according to claim 1, wherein
the processor is configured to extract from the object data, a word that is identical to a word included in a predetermined word group, and the processor, when the object data is compressed for each word in units of records, creates and adds to the compressed object data, the count data that indicates for each record of the object data, the appearance count of each extracted word. 7. The information processing system according to claim 1, wherein
the processor is configured to calculate a significance of the second character string, based on the count data. 8. An information processing method comprising:
creating, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identifying based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data, the information processing method being executed by a computer. 9. A non-transitory, computer-readable recording medium storing an information processing program that causes a computer to execute a process comprising:
creating, when object data is compressed for each word in units of records, count data that indicates for each record of the object data, an appearance count of each word, the count data being added to the object data that has been compressed; and identifying based on the count data, a second character string that corresponds to a first character string defined as a search condition for the object data. | 2,100 |
4,771 | 13,827,553 | 2,158 | Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results. | 1. A method of presenting information to a user, the method comprising:
presenting terms within a document to visually distinguish selectable candidate search terms that are included within the document from other terms that are included within the document; enabling selection of one or more of the selectable candidate search terms from within the document; generating a query string that includes the selected candidate search terms; applying the query string to a search interface; receiving query results based on the applied query string; and presenting the query results. 2. The method of claim 1 wherein presenting the query results includes:
retaining the arrangement of the document on a visual display when visually distinguishing selectable candidate search terms from other terms within the document; and
enabling selection of one or more of the selectable candidate search terms from within the document by detecting selection of a portion of the screen real estate dedicated to presenting the document and corresponding to the selected candidate search terms. 3. The method of claim 1 wherein generating a query string includes generating a query string that expressly excludes or disfavors candidate search terms selected from within the document. 4. The method of claim 1 wherein generating the query string includes generating a query string that expressly includes or favors candidate search terms selected from within the document. 5. The method of claim 1 wherein generating the query string includes generating a compilation of candidate search terms from multiple documents. 6. The method of claim 5 wherein generating the compilation of candidate search terms from multiple documents includes revising the query string as a user progresses through the multiple documents and selects the candidate search terms from at least two different documents in the multiple documents. 7. The method of claim 1 wherein presenting the query results includes presenting resultant pages in association with the document so that the user may perceive an effect of selecting the candidate search term on the query results. 8. The method of claim 1 wherein enabling selection of the one or more terms with the arrangement of candidate search terms includes presenting a search control enabling a user to specify an input mode. 9. The method of claim 8 wherein presenting the search control includes presenting an additive control configured to add the selected candidate search terms to the search query in response to selecting a candidate search term in the document. 10. The method of claim 8 wherein presenting the search control includes presenting a subtractive control configured to add the selected candidate search terms to the search query as terms that should not appear in the query results. 11. The method of claim 1 further comprising:
enabling the user to continue to select one or more additional candidate search terms as the query results are being presented;
using the additional candidate search terms to modify the query string;
applying the modified query string to the search interface;
receiving updated results based on the applied query string; and
presenting the updated results so that the user may perceive an effect of modifying the query string in differences between the query results and the updated results. 12. The method of claim 1 further comprising:
presenting one or more topics responsive to the query string;
enabling the user to modify the query string with inclusion or exclusion of at least one of the topics;
applying the query string to the search interface;
receiving the query results based on the applied query string; and
presenting the query results so that the user may perceive an effect of modifying the query string based on modifying the query string with inclusion or exclusion of the at least one topic. 13. The method of claim 1 wherein enabling selection of the candidate search terms includes:
enabling the user to specify interest in a portion of the query results or interest in avoiding the portion of the query results; and
generating the first results responsive to the user specifying interest in the first results related to the selected candidate search terms or interest in avoiding the query results related to the selected candidate search terms. 14. The method of claim 1 further comprising:
transparent to the user, automatically analyzing the document to generate contextual information; and
using the contextual information as the query string is applied to the search interface. 15. The method of claim 1 further comprising:
transparent to the user, automatically accessing non-selected terms appearing in the document related to the selected candidate search terms; and
using the non-selected terms as the query string is applied to the search interface. 16. The method of claim 1 further comprising:
monitoring user manipulation of the query results;
determining that the user investigated a portion of the query results;
determining that the portion was not responsive;
modifying the query string to reflect that the portion was not responsive to the user's predicted interest. 17. The method of claim 16 wherein determining that the portion was not responsive includes prompting the user to confirm that the portion was not responsive. 18. The method of claim 16 wherein determining that the portion was not responsive includes specifying that the portion was not responsive without confirmation from the user. 19. The method of claim 1 further comprising:
maintaining the query string as the user changes the document; and
enabling the user to modify the query string with the candidate search terms after changing the document. 20. The method of claim 1 further comprising enabling the user to specify that query results associated with less viewership should be rendered before query results associated with more viewership. | Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results.1. A method of presenting information to a user, the method comprising:
presenting terms within a document to visually distinguish selectable candidate search terms that are included within the document from other terms that are included within the document; enabling selection of one or more of the selectable candidate search terms from within the document; generating a query string that includes the selected candidate search terms; applying the query string to a search interface; receiving query results based on the applied query string; and presenting the query results. 2. The method of claim 1 wherein presenting the query results includes:
retaining the arrangement of the document on a visual display when visually distinguishing selectable candidate search terms from other terms within the document; and
enabling selection of one or more of the selectable candidate search terms from within the document by detecting selection of a portion of the screen real estate dedicated to presenting the document and corresponding to the selected candidate search terms. 3. The method of claim 1 wherein generating a query string includes generating a query string that expressly excludes or disfavors candidate search terms selected from within the document. 4. The method of claim 1 wherein generating the query string includes generating a query string that expressly includes or favors candidate search terms selected from within the document. 5. The method of claim 1 wherein generating the query string includes generating a compilation of candidate search terms from multiple documents. 6. The method of claim 5 wherein generating the compilation of candidate search terms from multiple documents includes revising the query string as a user progresses through the multiple documents and selects the candidate search terms from at least two different documents in the multiple documents. 7. The method of claim 1 wherein presenting the query results includes presenting resultant pages in association with the document so that the user may perceive an effect of selecting the candidate search term on the query results. 8. The method of claim 1 wherein enabling selection of the one or more terms with the arrangement of candidate search terms includes presenting a search control enabling a user to specify an input mode. 9. The method of claim 8 wherein presenting the search control includes presenting an additive control configured to add the selected candidate search terms to the search query in response to selecting a candidate search term in the document. 10. The method of claim 8 wherein presenting the search control includes presenting a subtractive control configured to add the selected candidate search terms to the search query as terms that should not appear in the query results. 11. The method of claim 1 further comprising:
enabling the user to continue to select one or more additional candidate search terms as the query results are being presented;
using the additional candidate search terms to modify the query string;
applying the modified query string to the search interface;
receiving updated results based on the applied query string; and
presenting the updated results so that the user may perceive an effect of modifying the query string in differences between the query results and the updated results. 12. The method of claim 1 further comprising:
presenting one or more topics responsive to the query string;
enabling the user to modify the query string with inclusion or exclusion of at least one of the topics;
applying the query string to the search interface;
receiving the query results based on the applied query string; and
presenting the query results so that the user may perceive an effect of modifying the query string based on modifying the query string with inclusion or exclusion of the at least one topic. 13. The method of claim 1 wherein enabling selection of the candidate search terms includes:
enabling the user to specify interest in a portion of the query results or interest in avoiding the portion of the query results; and
generating the first results responsive to the user specifying interest in the first results related to the selected candidate search terms or interest in avoiding the query results related to the selected candidate search terms. 14. The method of claim 1 further comprising:
transparent to the user, automatically analyzing the document to generate contextual information; and
using the contextual information as the query string is applied to the search interface. 15. The method of claim 1 further comprising:
transparent to the user, automatically accessing non-selected terms appearing in the document related to the selected candidate search terms; and
using the non-selected terms as the query string is applied to the search interface. 16. The method of claim 1 further comprising:
monitoring user manipulation of the query results;
determining that the user investigated a portion of the query results;
determining that the portion was not responsive;
modifying the query string to reflect that the portion was not responsive to the user's predicted interest. 17. The method of claim 16 wherein determining that the portion was not responsive includes prompting the user to confirm that the portion was not responsive. 18. The method of claim 16 wherein determining that the portion was not responsive includes specifying that the portion was not responsive without confirmation from the user. 19. The method of claim 1 further comprising:
maintaining the query string as the user changes the document; and
enabling the user to modify the query string with the candidate search terms after changing the document. 20. The method of claim 1 further comprising enabling the user to specify that query results associated with less viewership should be rendered before query results associated with more viewership. | 2,100 |
4,772 | 14,254,929 | 2,191 | According to an example embodiment of the present invention there is provided an apparatus comprising at least one processing core, at least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processing core, cause the apparatus at least to cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices, obtain a fitness value associated with the first parameter value set in the first set of devices, determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices | 1. An apparatus comprising at least one processing core, at least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processing core, cause the apparatus at least to:
cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtain a fitness value associated with the first parameter value set in the first set of devices; determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices. 2. The apparatus according to claim 1, wherein the fitness value indicates at least one of a user retention rate, a measure of fuel consumption and an industrial process yield. 3. The apparatus according to claim 1, wherein the optimization algorithm comprises at least one of an adaptive simulated annealing algorithm, a simulated annealing algorithm and an iterated local search algorithm. 4. The apparatus according to claim 1, wherein the apparatus is further configured to select the optimization algorithm at least in part based on a number of devices comprised in the second set of devices. 5. The apparatus according to claim 1, wherein the apparatus is further configured to determine the second set of devices based at least in part on at least one of the following: a geographic area, a device type, a number of parameters comprised in the second parameter value set and a type of at least one parameter value comprised in the second parameter value set. 6. The apparatus according to claim 1, wherein the apparatus is configured to cause the first parameter value set to be provided to the first set of devices by causing transmission of the first parameter value set to at least one device of the first set of devices responsive to at least one request from the at least one device. 7. The apparatus according to claim 1, wherein the apparatus is, responsive to determining, using the optimization algorithm, a preferred parameter value set, configured to cause the preferred parameter value set to be provided to a third set of devices. 8. The apparatus according to claim 7, wherein the third set of devices comprises at least one of the first set and second set of devices. 9. The apparatus according to claim 1, wherein the apparatus is configured to cause the first parameter value set to be provided to the first set of devices at least in part via a wireless data interface. 10. A method comprising:
causing a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtaining a fitness value associated with the first parameter value set in the first set of devices; determining, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and causing the at least one second parameter value set to be provided to the first set or a second set of devices. 11. The method according to claim 10, wherein the fitness value indicates at least one of a user retention rate, a measure of fuel consumption and an industrial process yield. 12. The method according to claim 10, wherein the optimization algorithm comprises at least one of an adaptive simulated annealing algorithm, a simulated annealing algorithm and an iterated local search algorithm. 13. The method according to claim 10, further comprising selecting the optimization algorithm at least in part based on a number of devices comprised in the second set of devices. 14. The method according claim 10, further comprising determining the second set of devices based at least in part on at least one of the following: a geographic area, a device type, a number of parameters comprised in the second parameter value set and a type of at least one parameter value comprised in the second parameter value set. 15. The method according to claim 10, wherein causing the first parameter value set to be provided to the first set of devices comprises causing transmission of the first parameter value set to at least one device of the first set of devices responsive to at least one request from the at least one device. 16. The method according to claim 10, comprising causing a preferred parameter value set to be provided to a third set of devices responsive to determining, using the optimization algorithm, the preferred parameter value set. 17. The method according to claim 16, wherein the third set of devices comprises at least one of the first set and second set of devices. 18. The method according claim 10, comprising causing the first parameter value set to be provided to the first set of devices at least in part via a wireless data interface. 19. (canceled) 20. (canceled) 21. A non-transitory computer readable medium having stored thereon a set of computer readable instructions that, when executed by at least one processor, cause an apparatus to at least:
cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtain a fitness value associated with the first parameter value set in the first set of devices; determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices. | According to an example embodiment of the present invention there is provided an apparatus comprising at least one processing core, at least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processing core, cause the apparatus at least to cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices, obtain a fitness value associated with the first parameter value set in the first set of devices, determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices1. An apparatus comprising at least one processing core, at least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processing core, cause the apparatus at least to:
cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtain a fitness value associated with the first parameter value set in the first set of devices; determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices. 2. The apparatus according to claim 1, wherein the fitness value indicates at least one of a user retention rate, a measure of fuel consumption and an industrial process yield. 3. The apparatus according to claim 1, wherein the optimization algorithm comprises at least one of an adaptive simulated annealing algorithm, a simulated annealing algorithm and an iterated local search algorithm. 4. The apparatus according to claim 1, wherein the apparatus is further configured to select the optimization algorithm at least in part based on a number of devices comprised in the second set of devices. 5. The apparatus according to claim 1, wherein the apparatus is further configured to determine the second set of devices based at least in part on at least one of the following: a geographic area, a device type, a number of parameters comprised in the second parameter value set and a type of at least one parameter value comprised in the second parameter value set. 6. The apparatus according to claim 1, wherein the apparatus is configured to cause the first parameter value set to be provided to the first set of devices by causing transmission of the first parameter value set to at least one device of the first set of devices responsive to at least one request from the at least one device. 7. The apparatus according to claim 1, wherein the apparatus is, responsive to determining, using the optimization algorithm, a preferred parameter value set, configured to cause the preferred parameter value set to be provided to a third set of devices. 8. The apparatus according to claim 7, wherein the third set of devices comprises at least one of the first set and second set of devices. 9. The apparatus according to claim 1, wherein the apparatus is configured to cause the first parameter value set to be provided to the first set of devices at least in part via a wireless data interface. 10. A method comprising:
causing a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtaining a fitness value associated with the first parameter value set in the first set of devices; determining, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and causing the at least one second parameter value set to be provided to the first set or a second set of devices. 11. The method according to claim 10, wherein the fitness value indicates at least one of a user retention rate, a measure of fuel consumption and an industrial process yield. 12. The method according to claim 10, wherein the optimization algorithm comprises at least one of an adaptive simulated annealing algorithm, a simulated annealing algorithm and an iterated local search algorithm. 13. The method according to claim 10, further comprising selecting the optimization algorithm at least in part based on a number of devices comprised in the second set of devices. 14. The method according claim 10, further comprising determining the second set of devices based at least in part on at least one of the following: a geographic area, a device type, a number of parameters comprised in the second parameter value set and a type of at least one parameter value comprised in the second parameter value set. 15. The method according to claim 10, wherein causing the first parameter value set to be provided to the first set of devices comprises causing transmission of the first parameter value set to at least one device of the first set of devices responsive to at least one request from the at least one device. 16. The method according to claim 10, comprising causing a preferred parameter value set to be provided to a third set of devices responsive to determining, using the optimization algorithm, the preferred parameter value set. 17. The method according to claim 16, wherein the third set of devices comprises at least one of the first set and second set of devices. 18. The method according claim 10, comprising causing the first parameter value set to be provided to the first set of devices at least in part via a wireless data interface. 19. (canceled) 20. (canceled) 21. A non-transitory computer readable medium having stored thereon a set of computer readable instructions that, when executed by at least one processor, cause an apparatus to at least:
cause a first parameter value set comprising at least one first parameter value to be provided to a first set of devices; obtain a fitness value associated with the first parameter value set in the first set of devices; determine, based at least in part on the fitness value and an optimization algorithm, at least one second parameter value set comprising at least one second parameter value, and cause the at least one second parameter value set to be provided to the first set or a second set of devices. | 2,100 |
4,773 | 13,665,489 | 2,118 | An automation control and monitoring system is provided that includes a common framework for components of the control and monitoring system through a resource oriented architecture (ROA). The ROA may enable enhanced scalability and distribution within the control and monitoring system. Further, the framework may provide a base set of functionalities to be implemented across components of the control and monitoring system, creating vertical scalability. | 1. A resource oriented industrial automation architecture comprising:
a common service framework configured to be stored in each of a plurality of different industrial automation devices; a plurality of service modules configured to be stored in selected ones of the plurality of different industrial automation devices depending upon the functionality of the selected device, the service modules in operation interacting with the common service framework for performing industrial automation tasks. 2. The architecture of claim 1, wherein the common service framework comprises a container within which the selected service modules stored in any particular device are instantiated to perform the industrial automation tasks. 3. The architecture of claim 1, comprising a common application framework and a plurality of applications, the common application framework and selected applications being configured to be stored and function on selected devices. 4. The architecture of claim 3, wherein the application framework comprises a container within which the selected applications stored on the selected devices are instantiated to perform industrial automation tasks. 5. The architecture of claim 4, wherein the industrial automation tasks performed by at least one of the applications comprises a user interface task or an interface for an application. 6. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices during manufacture and initial configuration of the automation devices. 7. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices by field modification of the automation devices. 8. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices dynamically during operation in an industrial automation process. 9. The architecture of claim 1, wherein the common service framework is configured to use delta scripts to communicate change across an automation control and monitoring system. 10. The architecture of claim 1, wherein the service modules are configured to interact with a distributed data model of an automation control and monitoring system. 11. The architecture of claim 1, configured to be executed on: a runtime client, a runtime server, a designer client, a designer server, and a controller component, each storing the common service framework. 12. The architecture of claim 11, wherein the plurality of service modules are configured to operate on the runtime client, the runtime server, the designer client, the designer server, the controller component, or any combination thereof. 13. The architecture of claim 1, wherein vertical scalability is achieved by distributing operations of the plurality of service modules between run-time servers and clients, design-time servers and clients, a controller, or any combination thereof. 14. An industrial automation device comprising:
processing circuitry configured to perform industrial automation tasks during operation; and memory circuitry cooperative with the processing circuitry and storing a service framework common to each of a plurality of different industrial automation devices, and a plurality of service modules that in operation interact with the common service framework for performing the industrial automation tasks. 15. The device of claim 14, wherein the service modules are selected from a library of service modules, the particular service modules stored and operative on the device being selected based upon the functionality of the device. 16. The device of claim 14, wherein the plurality of service modules are configured to interact with the common service framework regardless of an operating system associated with the device. 17. The device of claim 14, wherein at least one of the plurality of service modules are configured to interact with at least one distributed execution engine that enables distributed command handling. 18. The device of claim 14, wherein at least one of the plurality of service modules are configured to transmit, receive, or transmit and receive data in a distributed model. 19. The device of claim 14, wherein at least one of the plurality of service modules are configured to access metadata relating to data in an automation control and monitoring system. 20. A family of industrial automation devices comprising:
a plurality of different industrial automation devices each having different functionalities in operation for performing different industrial automation tasks; wherein each of the different industrial automation devices comprises a common service framework that is the same across the family of industrial automation devices, and a plurality of service modules selected from a library of service modules depending upon the functionality of the particular device of the family, the service modules in operation interacting with the common service framework for performing industrial automation tasks of the particular device of the family. 21. The family of industrial automation devices of claim 20, wherein the different industrial automation devices include an automation controller device and a human machine interface device. 22. The family of industrial automation devices of claim 20, wherein the plurality of different industrial automation devices comprise: a runtime client, a runtime server, a designer client, a designer server, a controller component, or any combination thereof. 23. The family of industrial automation devices of claim 22, wherein horizontal scalability may be achieved by adding additional industrial automation devices that perform similar tasks as at least one of the plurality of different industrial automation devices. 24. A method of making an industrial automation device comprising:
storing on the industrial automation device a common service framework that is the same across a family of industrial automation devices to which the industrial automation device belongs, and a plurality of service modules selected from a library of service modules depending upon the functionality of the industrial automation device, the service modules in operation interacting with the common service framework for performing industrial automation tasks of the industrial automation device. 25. The method of claim 24, wherein the common service framework and the service modules are stored on the industrial automation device during initial configuration of the industrial automation device. 26. The method of claim 24, wherein at least one service module is stored on the industrial automation device by field modification of the industrial automation device. 27. The method of claim 24, wherein at least one service module is stored on the industrial automation device dynamically during operation in an industrial automation process. 28. An industrial automation device made by the method of claim 24. 29. A method for making a family of industrial automation devices comprising:
configuring a common service framework configured to be stored in each of a plurality of different industrial automation devices of the family; and configuring a library of service modules configured to be stored in selected ones of the plurality of different industrial automation devices of the family depending upon the functionality of the selected device, the service modules in operation interacting with the common service framework for performing industrial automation tasks. 30. An industrial automation device comprising the common service module and selected ones of the library of service modules as set forth in claim 29. | An automation control and monitoring system is provided that includes a common framework for components of the control and monitoring system through a resource oriented architecture (ROA). The ROA may enable enhanced scalability and distribution within the control and monitoring system. Further, the framework may provide a base set of functionalities to be implemented across components of the control and monitoring system, creating vertical scalability.1. A resource oriented industrial automation architecture comprising:
a common service framework configured to be stored in each of a plurality of different industrial automation devices; a plurality of service modules configured to be stored in selected ones of the plurality of different industrial automation devices depending upon the functionality of the selected device, the service modules in operation interacting with the common service framework for performing industrial automation tasks. 2. The architecture of claim 1, wherein the common service framework comprises a container within which the selected service modules stored in any particular device are instantiated to perform the industrial automation tasks. 3. The architecture of claim 1, comprising a common application framework and a plurality of applications, the common application framework and selected applications being configured to be stored and function on selected devices. 4. The architecture of claim 3, wherein the application framework comprises a container within which the selected applications stored on the selected devices are instantiated to perform industrial automation tasks. 5. The architecture of claim 4, wherein the industrial automation tasks performed by at least one of the applications comprises a user interface task or an interface for an application. 6. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices during manufacture and initial configuration of the automation devices. 7. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices by field modification of the automation devices. 8. The architecture of claim 1, wherein at least one selected service module is configured to be stored in automation devices dynamically during operation in an industrial automation process. 9. The architecture of claim 1, wherein the common service framework is configured to use delta scripts to communicate change across an automation control and monitoring system. 10. The architecture of claim 1, wherein the service modules are configured to interact with a distributed data model of an automation control and monitoring system. 11. The architecture of claim 1, configured to be executed on: a runtime client, a runtime server, a designer client, a designer server, and a controller component, each storing the common service framework. 12. The architecture of claim 11, wherein the plurality of service modules are configured to operate on the runtime client, the runtime server, the designer client, the designer server, the controller component, or any combination thereof. 13. The architecture of claim 1, wherein vertical scalability is achieved by distributing operations of the plurality of service modules between run-time servers and clients, design-time servers and clients, a controller, or any combination thereof. 14. An industrial automation device comprising:
processing circuitry configured to perform industrial automation tasks during operation; and memory circuitry cooperative with the processing circuitry and storing a service framework common to each of a plurality of different industrial automation devices, and a plurality of service modules that in operation interact with the common service framework for performing the industrial automation tasks. 15. The device of claim 14, wherein the service modules are selected from a library of service modules, the particular service modules stored and operative on the device being selected based upon the functionality of the device. 16. The device of claim 14, wherein the plurality of service modules are configured to interact with the common service framework regardless of an operating system associated with the device. 17. The device of claim 14, wherein at least one of the plurality of service modules are configured to interact with at least one distributed execution engine that enables distributed command handling. 18. The device of claim 14, wherein at least one of the plurality of service modules are configured to transmit, receive, or transmit and receive data in a distributed model. 19. The device of claim 14, wherein at least one of the plurality of service modules are configured to access metadata relating to data in an automation control and monitoring system. 20. A family of industrial automation devices comprising:
a plurality of different industrial automation devices each having different functionalities in operation for performing different industrial automation tasks; wherein each of the different industrial automation devices comprises a common service framework that is the same across the family of industrial automation devices, and a plurality of service modules selected from a library of service modules depending upon the functionality of the particular device of the family, the service modules in operation interacting with the common service framework for performing industrial automation tasks of the particular device of the family. 21. The family of industrial automation devices of claim 20, wherein the different industrial automation devices include an automation controller device and a human machine interface device. 22. The family of industrial automation devices of claim 20, wherein the plurality of different industrial automation devices comprise: a runtime client, a runtime server, a designer client, a designer server, a controller component, or any combination thereof. 23. The family of industrial automation devices of claim 22, wherein horizontal scalability may be achieved by adding additional industrial automation devices that perform similar tasks as at least one of the plurality of different industrial automation devices. 24. A method of making an industrial automation device comprising:
storing on the industrial automation device a common service framework that is the same across a family of industrial automation devices to which the industrial automation device belongs, and a plurality of service modules selected from a library of service modules depending upon the functionality of the industrial automation device, the service modules in operation interacting with the common service framework for performing industrial automation tasks of the industrial automation device. 25. The method of claim 24, wherein the common service framework and the service modules are stored on the industrial automation device during initial configuration of the industrial automation device. 26. The method of claim 24, wherein at least one service module is stored on the industrial automation device by field modification of the industrial automation device. 27. The method of claim 24, wherein at least one service module is stored on the industrial automation device dynamically during operation in an industrial automation process. 28. An industrial automation device made by the method of claim 24. 29. A method for making a family of industrial automation devices comprising:
configuring a common service framework configured to be stored in each of a plurality of different industrial automation devices of the family; and configuring a library of service modules configured to be stored in selected ones of the plurality of different industrial automation devices of the family depending upon the functionality of the selected device, the service modules in operation interacting with the common service framework for performing industrial automation tasks. 30. An industrial automation device comprising the common service module and selected ones of the library of service modules as set forth in claim 29. | 2,100 |
4,774 | 13,795,087 | 2,123 | A knowledge interface is provided that interacts with a user to identify a solution to a customer problem or issue with respect to a particular product or service. The knowledge interface includes data processing functionality configured to dynamically generate a number of components that are presented in at least one display window for display to the user. The components include first data identifying a set of predetermined symptoms linked to the problem or issue and related interface elements for classification of the set of predetermined symptoms, second data identifying a set of predetermined root causes linked to the set of predetermined symptoms and related interface elements for classification of the set of predetermined root causes, and third data identifying a set of solutions linked to the set of predetermined root causes. The third data identifies a best solution based upon the predetermined root causes and their associated class designations. | 1. A knowledge interface that interacts with a user-operated data processing system via networked communication to identify a solution to problem or issue experienced by a customer with respect to a particular product or service, the knowledge interface comprising:
data processing functionality that supplies information to the user-operated data processing system, the information representing a number of components that are presented in at least one display window displayed by the user-operated data processing system, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 2. A knowledge interface according to claim 1, further comprising:
a user input mechanism that is configured to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and an interface to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. 3. A knowledge interface according to claim 2, wherein:
the statistical analysis implements a naive Bayes classification methodology. 4. A knowledge interface according to claim 2, wherein:
the statistical analysis associates a confidence level with the link between a given predetermined symptom and the natural language textual description of the problem or issue experienced by the customer with respect to a particular product or service. 5. A knowledge interface according to claim 4, wherein:
confidence levels associated with the set of predetermined symptoms are used by the knowledge interface to order display of the set of predetermined symptoms in the at least one display window. 6. A knowledge interface according to claim 1, wherein:
context that identifies the particular product or service is supplied to the knowledge interface. 7. A knowledge interface according to claim 6, wherein:
the context is derived from interaction between a call center representative and the customer. 8. A knowledge interface according to claim 6, wherein:
the context is supplied by input from the customer. 9. A knowledge interface according to claim 1, wherein:
the components further include a user input mechanism to select a best solution and trigger the display of additional information regarding the best solution to the user. 10. A knowledge interface according to claim 9, wherein:
the additional information is selected from the group including i) a document or other web content, ii) an external link, iii) an OTA flow for mobile device configuration and programming, iv) device attributes, and v) a simulation that guides the call center representative through steps to fix a particular problem or issue. 11. A knowledge interface according to claim 9, wherein:
the components include a user input mechanism to indicate whether or not the best solution was successful in solving the problem or issue. 12. A knowledge interface according to claim 1, further comprising:
a database that stores collected data derived from interaction with the user and associated with the problem or issue. 13. A knowledge interface according to claim 12, wherein:
the collected data is used to train the analysis engine for subsequent operations. 14. A knowledge interface according to claim 1, wherein:
the user of the knowledge interface is a call center representative. 15. A knowledge interface according to claim 1, wherein:
the user of the knowledge interface is the customer. 16. A knowledge interface according to claim 1, wherein:
the first data, the second data and the third data are displayed in a plurality of distinct regions of a display window, wherein the plurality of regions are laid out adjacent one another across the horizontal extent of the display window. 17. A knowledge interface according to claim 16, wherein:
the plurality of regions include a region that displays the first data and second data after being classified in accordance with user input. 18. A method for identifying a solution to problem or issue experienced by a customer with respect to a particular product or service, the method comprising:
supplying information to a user-operated data processing system via networked communication, the information representing a number of components that are presented in at least one display window displayed by the user-operated data processing system, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 19. A method according to claim 18, further comprising:
interacting with the user to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and interfacing to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. 20. A method according to claim 19, wherein:
the statistical analysis implements a naive Bayes classification methodology. 21. A method according to claim 19, wherein:
the statistical analysis associates a confidence level with the link between a given predetermined symptom and the natural language textual description of the problem or issue experienced by the customer with respect to a particular product or service. 22. A method according to claim 21, wherein:
utilizing the confidence levels associated with the set of predetermined symptoms to order display of the set of predetermined symptoms in the at least one display window. 23. A method according to claim 18, further comprising:
deriving context that identifies the particular product or service. 24. A method according to claim 23, wherein:
the context is derived from interaction between a call center representative and the customer. 25. A method according to claim 23, wherein:
the context is supplied by input from the customer. 26. A method according to claim 18, further comprising:
interacting with the user to select a best solution and triggering the display of additional information regarding the best solution to the user. 27. A method according to claim 26, wherein:
the additional information is selected from the group including i) a document or other web content, ii) an external link, iii) an OTA flow for mobile device configuration and programming, iv) device attributes, and v) a simulation that guides the call center representative through steps to fix a particular problem or issue. 28. A method according to claim 26, further comprising:
interacting with the user to indicate whether or not the best solution was successful in solving the problem or issue. 29. A method according to claim 18, further comprising:
storing in a database collected data derived from interaction with the user and associated with the problem or issue. 30. A method according to claim 29, further comprising:
using the collected data to train the analysis engine for subsequent operations. 31. A method according to claim 18, wherein:
the user of the knowledge interface is a call center representative. 32. A method according to claim 18, wherein:
the user of the knowledge interface is the customer. 33. A method according to claim 18, wherein:
the first data, the second data and the third data are displayed in a plurality of distinct regions of a display window, wherein the plurality of regions are laid out adjacent one another across the horizontal extent of the display window. 34. A method according to claim 33, wherein:
the plurality of regions include a region that displays the first data and second data after being classified in accordance with user input. 35. A knowledge interface that interacts with a user to identify a solution to problem or issue experienced by a customer with respect to a particular product or service, the knowledge interface comprising:
data processing functionality that presents a number of components in at least one display window displayed to the user, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 36. A knowledge interface according to claim 35, further comprising:
a user input mechanism that is configured to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and an interface to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. | A knowledge interface is provided that interacts with a user to identify a solution to a customer problem or issue with respect to a particular product or service. The knowledge interface includes data processing functionality configured to dynamically generate a number of components that are presented in at least one display window for display to the user. The components include first data identifying a set of predetermined symptoms linked to the problem or issue and related interface elements for classification of the set of predetermined symptoms, second data identifying a set of predetermined root causes linked to the set of predetermined symptoms and related interface elements for classification of the set of predetermined root causes, and third data identifying a set of solutions linked to the set of predetermined root causes. The third data identifies a best solution based upon the predetermined root causes and their associated class designations.1. A knowledge interface that interacts with a user-operated data processing system via networked communication to identify a solution to problem or issue experienced by a customer with respect to a particular product or service, the knowledge interface comprising:
data processing functionality that supplies information to the user-operated data processing system, the information representing a number of components that are presented in at least one display window displayed by the user-operated data processing system, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 2. A knowledge interface according to claim 1, further comprising:
a user input mechanism that is configured to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and an interface to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. 3. A knowledge interface according to claim 2, wherein:
the statistical analysis implements a naive Bayes classification methodology. 4. A knowledge interface according to claim 2, wherein:
the statistical analysis associates a confidence level with the link between a given predetermined symptom and the natural language textual description of the problem or issue experienced by the customer with respect to a particular product or service. 5. A knowledge interface according to claim 4, wherein:
confidence levels associated with the set of predetermined symptoms are used by the knowledge interface to order display of the set of predetermined symptoms in the at least one display window. 6. A knowledge interface according to claim 1, wherein:
context that identifies the particular product or service is supplied to the knowledge interface. 7. A knowledge interface according to claim 6, wherein:
the context is derived from interaction between a call center representative and the customer. 8. A knowledge interface according to claim 6, wherein:
the context is supplied by input from the customer. 9. A knowledge interface according to claim 1, wherein:
the components further include a user input mechanism to select a best solution and trigger the display of additional information regarding the best solution to the user. 10. A knowledge interface according to claim 9, wherein:
the additional information is selected from the group including i) a document or other web content, ii) an external link, iii) an OTA flow for mobile device configuration and programming, iv) device attributes, and v) a simulation that guides the call center representative through steps to fix a particular problem or issue. 11. A knowledge interface according to claim 9, wherein:
the components include a user input mechanism to indicate whether or not the best solution was successful in solving the problem or issue. 12. A knowledge interface according to claim 1, further comprising:
a database that stores collected data derived from interaction with the user and associated with the problem or issue. 13. A knowledge interface according to claim 12, wherein:
the collected data is used to train the analysis engine for subsequent operations. 14. A knowledge interface according to claim 1, wherein:
the user of the knowledge interface is a call center representative. 15. A knowledge interface according to claim 1, wherein:
the user of the knowledge interface is the customer. 16. A knowledge interface according to claim 1, wherein:
the first data, the second data and the third data are displayed in a plurality of distinct regions of a display window, wherein the plurality of regions are laid out adjacent one another across the horizontal extent of the display window. 17. A knowledge interface according to claim 16, wherein:
the plurality of regions include a region that displays the first data and second data after being classified in accordance with user input. 18. A method for identifying a solution to problem or issue experienced by a customer with respect to a particular product or service, the method comprising:
supplying information to a user-operated data processing system via networked communication, the information representing a number of components that are presented in at least one display window displayed by the user-operated data processing system, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 19. A method according to claim 18, further comprising:
interacting with the user to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and interfacing to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. 20. A method according to claim 19, wherein:
the statistical analysis implements a naive Bayes classification methodology. 21. A method according to claim 19, wherein:
the statistical analysis associates a confidence level with the link between a given predetermined symptom and the natural language textual description of the problem or issue experienced by the customer with respect to a particular product or service. 22. A method according to claim 21, wherein:
utilizing the confidence levels associated with the set of predetermined symptoms to order display of the set of predetermined symptoms in the at least one display window. 23. A method according to claim 18, further comprising:
deriving context that identifies the particular product or service. 24. A method according to claim 23, wherein:
the context is derived from interaction between a call center representative and the customer. 25. A method according to claim 23, wherein:
the context is supplied by input from the customer. 26. A method according to claim 18, further comprising:
interacting with the user to select a best solution and triggering the display of additional information regarding the best solution to the user. 27. A method according to claim 26, wherein:
the additional information is selected from the group including i) a document or other web content, ii) an external link, iii) an OTA flow for mobile device configuration and programming, iv) device attributes, and v) a simulation that guides the call center representative through steps to fix a particular problem or issue. 28. A method according to claim 26, further comprising:
interacting with the user to indicate whether or not the best solution was successful in solving the problem or issue. 29. A method according to claim 18, further comprising:
storing in a database collected data derived from interaction with the user and associated with the problem or issue. 30. A method according to claim 29, further comprising:
using the collected data to train the analysis engine for subsequent operations. 31. A method according to claim 18, wherein:
the user of the knowledge interface is a call center representative. 32. A method according to claim 18, wherein:
the user of the knowledge interface is the customer. 33. A method according to claim 18, wherein:
the first data, the second data and the third data are displayed in a plurality of distinct regions of a display window, wherein the plurality of regions are laid out adjacent one another across the horizontal extent of the display window. 34. A method according to claim 33, wherein:
the plurality of regions include a region that displays the first data and second data after being classified in accordance with user input. 35. A knowledge interface that interacts with a user to identify a solution to problem or issue experienced by a customer with respect to a particular product or service, the knowledge interface comprising:
data processing functionality that presents a number of components in at least one display window displayed to the user, wherein the components include
i) first data identifying a set of predetermined symptoms linked to the problem or issue experienced by the customer,
ii) first interface elements that are configured to allow the user to classify the set of predetermined symptoms of i) into two classes including a first class of symptoms representing symptoms most likely experienced by the customer and a second class of symptoms representing symptoms most likely not experienced by the customer,
iii) second data identifying a set of predetermined root causes linked to the set of predetermined symptoms of i),
iv) second interface elements that are configured to allow the user to classify the set of predetermined root causes of iii) into two classes including a first class of root causes representing root causes most likely experienced by the customer and a second class of root causes representing root causes most likely not experienced by the customer, and
v) third data identifying a set of solutions linked to the set of predetermined root causes of iii), wherein the third data identifies a best solution based upon the predetermined root causes of iii) and their associated class designations as dictated by user input with the second interface elements. 36. A knowledge interface according to claim 35, further comprising:
a user input mechanism that is configured to enable the user to specify a natural text description of at least one symptom of the problem or issue experienced by the customer with respect to a particular product or service; and an interface to an analysis engine that is configured to identify the set of predetermined symptoms, wherein the set of predetermined symptoms are linked by statistical analysis to the natural text description specified by user operation of the user input mechanism. | 2,100 |
4,775 | 11,844,148 | 2,158 | Systems and methods are provided for linking time-based metadata to media content so that as the metadata changes in synchronicity with media content during play, information associated with the media content can be outreached in the context of the media presentation. More particularly, according to one embodiment of the present invention, a media player device is provided that renders media content and retrieves and displays appropriate metadata information associated with the media content at an appropriate time to an ancillary metadata viewer device during play of a media resource. | 1. A system for providing metadata information at a selected time during play of a media resource, comprising:
a player device, the player device being capable of rendering content associated with the media resource and retrieving the metadata information when the selected time is reached during the play of the media resource, wherein the metadata information is associated with a segment of the content, and wherein retrieving the metadata information occurs in substantially synchronicity with the play of the media resource; and an ancillary viewer device in communication with the player device, the ancillary viewer device being capable of receiving the metadata information from the player device and displaying the metadata information. 2. The system as recited in claim 1, wherein the metadata information is stored in the media resource. 3. The system as recited in claim 2, wherein the player device is configured to retrieve the metadata information from the media resource. 4. The system as recited in claim 1, further comprising a repository coupled to the player device, wherein the metadata information is stored in the repository. 5. The system as recited in claim 4, wherein the player device is configured to retrieve the metadata information from the repository. 6. The system as recited in claim 4, further comprising a network system, the network system including one or more local networks coupled to the Internet. 7. The system as recited in claim 6, wherein the repository is coupled to the player device via the network system. 8. The system as recited in claim 6, wherein the ancillary viewer device is coupled to the player device via the network system, and wherein receiving the metadata information from the player device includes receiving the metadata information via the network system. 9. The system as recited in claim 6, wherein at least one of the one or more local networks is a cellular phone network. 10. The system as recited in claim 6, wherein a display of the ancillary viewer device includes at least one selectable launch point corresponding to the metadata information displayed at the ancillary device, and wherein selection of the at least one selectable launch point by the user causes the ancillary viewer device to retrieve supplemental information from the network system. 11. The system as recited in claim 1, wherein the ancillary viewer device is coupled to the player device via a local link, and wherein receiving the metadata information from the player device includes receiving the metadata information on the local link. 12. The system as recited in claim 1, wherein retrieving the metadata information when the selected time is reached during the play of the media resource includes correlating the time stamp associated with the segment of the content to a time stamp associated with the metadata information, wherein the metadata information is tagged with the time stamp associated with the metadata information. 13. The system as recited in claim 1, wherein the metadata information is tagged with one or more of a metadata type, and metadata category. 14. The system as recited in claim 13, wherein the metadata type includes one of text, audio, video, graphical image, web page, or combinations thereof. 15. The system as recited in claim 13, wherein the metadata category includes one of consumer products, related movies, related songs, clothing, points of interest, restaurants, geographic locations, actors, artists, people of interest, animals, or combinations thereof. 16. The system as recited in claim 1, wherein the ancillary device has a user interface. 17. The system as recited in claim 16, wherein the user interface is configured to allow selection of categories and types of the metadata information displayed at the ancillary viewer device. 18. The system as recited in claim 17, wherein the user interface is configured to allow the user to select whether the metadata information received at the ancillary viewer device is bundled, wherein the bundled metadata information is sent to a destination designated by the user. 19. The system as recited in claim 17, wherein the user interface is configured to allow selection of whether the metadata information received at the ancillary viewer device is displayed at the ancillary viewer device during the play of the media resource. 20. The system as recited in claim 17, wherein the user interface is configured to allow the user to select whether the metadata information received at the ancillary viewer device is displayed at the ancillary viewer device at the end of the play of the media resource. 21. A computer-implemented method for presenting metadata information for presentation in conjunction with presentation of content rendered from a media source, comprising:
presenting the content from the media source on a main display, the content including images on the main display, and certain images or parts of images on the main display being associated with metadata information; receiving preference settings defining which of the metadata information should be obtained during the presentation of the content on the main display; retrieving the metadata information based on the preference settings; forwarding the retrieved metadata information to an ancillary device for presentation, the presentation on the ancillary device being processed during the presenting of the content on the main display; wherein the presentation of the retrieved metadata information, as related to the images or parts of images augments the presentation of the content from the media source on the main display. 22. A computer-implemented method as recited in claim 21, wherein the ancillary device includes a secondary display for presenting the retrieved metadata information during the presentation of the content on the main display. 23. A computer-implemented method as recited in claim 21, wherein the media source includes one of a broadcast presentation, a recorded presentation, or a time-shifted presentation. 24. A computer-implemented method as recited in claim 21, wherein the metadata information is associated with a segment of the content, such that when the segment of the content containing the metadata information based on the preference settings is presented, the metadata information is retrieved. 25. A computer-implemented method as recited in claim 21, wherein the metadata information is time coded, and the retrieved metadata information is tagged with one or more of a metadata type, and metadata category, and the metadata type includes one of text, audio, video, graphical image, web page, or combinations thereof. | Systems and methods are provided for linking time-based metadata to media content so that as the metadata changes in synchronicity with media content during play, information associated with the media content can be outreached in the context of the media presentation. More particularly, according to one embodiment of the present invention, a media player device is provided that renders media content and retrieves and displays appropriate metadata information associated with the media content at an appropriate time to an ancillary metadata viewer device during play of a media resource.1. A system for providing metadata information at a selected time during play of a media resource, comprising:
a player device, the player device being capable of rendering content associated with the media resource and retrieving the metadata information when the selected time is reached during the play of the media resource, wherein the metadata information is associated with a segment of the content, and wherein retrieving the metadata information occurs in substantially synchronicity with the play of the media resource; and an ancillary viewer device in communication with the player device, the ancillary viewer device being capable of receiving the metadata information from the player device and displaying the metadata information. 2. The system as recited in claim 1, wherein the metadata information is stored in the media resource. 3. The system as recited in claim 2, wherein the player device is configured to retrieve the metadata information from the media resource. 4. The system as recited in claim 1, further comprising a repository coupled to the player device, wherein the metadata information is stored in the repository. 5. The system as recited in claim 4, wherein the player device is configured to retrieve the metadata information from the repository. 6. The system as recited in claim 4, further comprising a network system, the network system including one or more local networks coupled to the Internet. 7. The system as recited in claim 6, wherein the repository is coupled to the player device via the network system. 8. The system as recited in claim 6, wherein the ancillary viewer device is coupled to the player device via the network system, and wherein receiving the metadata information from the player device includes receiving the metadata information via the network system. 9. The system as recited in claim 6, wherein at least one of the one or more local networks is a cellular phone network. 10. The system as recited in claim 6, wherein a display of the ancillary viewer device includes at least one selectable launch point corresponding to the metadata information displayed at the ancillary device, and wherein selection of the at least one selectable launch point by the user causes the ancillary viewer device to retrieve supplemental information from the network system. 11. The system as recited in claim 1, wherein the ancillary viewer device is coupled to the player device via a local link, and wherein receiving the metadata information from the player device includes receiving the metadata information on the local link. 12. The system as recited in claim 1, wherein retrieving the metadata information when the selected time is reached during the play of the media resource includes correlating the time stamp associated with the segment of the content to a time stamp associated with the metadata information, wherein the metadata information is tagged with the time stamp associated with the metadata information. 13. The system as recited in claim 1, wherein the metadata information is tagged with one or more of a metadata type, and metadata category. 14. The system as recited in claim 13, wherein the metadata type includes one of text, audio, video, graphical image, web page, or combinations thereof. 15. The system as recited in claim 13, wherein the metadata category includes one of consumer products, related movies, related songs, clothing, points of interest, restaurants, geographic locations, actors, artists, people of interest, animals, or combinations thereof. 16. The system as recited in claim 1, wherein the ancillary device has a user interface. 17. The system as recited in claim 16, wherein the user interface is configured to allow selection of categories and types of the metadata information displayed at the ancillary viewer device. 18. The system as recited in claim 17, wherein the user interface is configured to allow the user to select whether the metadata information received at the ancillary viewer device is bundled, wherein the bundled metadata information is sent to a destination designated by the user. 19. The system as recited in claim 17, wherein the user interface is configured to allow selection of whether the metadata information received at the ancillary viewer device is displayed at the ancillary viewer device during the play of the media resource. 20. The system as recited in claim 17, wherein the user interface is configured to allow the user to select whether the metadata information received at the ancillary viewer device is displayed at the ancillary viewer device at the end of the play of the media resource. 21. A computer-implemented method for presenting metadata information for presentation in conjunction with presentation of content rendered from a media source, comprising:
presenting the content from the media source on a main display, the content including images on the main display, and certain images or parts of images on the main display being associated with metadata information; receiving preference settings defining which of the metadata information should be obtained during the presentation of the content on the main display; retrieving the metadata information based on the preference settings; forwarding the retrieved metadata information to an ancillary device for presentation, the presentation on the ancillary device being processed during the presenting of the content on the main display; wherein the presentation of the retrieved metadata information, as related to the images or parts of images augments the presentation of the content from the media source on the main display. 22. A computer-implemented method as recited in claim 21, wherein the ancillary device includes a secondary display for presenting the retrieved metadata information during the presentation of the content on the main display. 23. A computer-implemented method as recited in claim 21, wherein the media source includes one of a broadcast presentation, a recorded presentation, or a time-shifted presentation. 24. A computer-implemented method as recited in claim 21, wherein the metadata information is associated with a segment of the content, such that when the segment of the content containing the metadata information based on the preference settings is presented, the metadata information is retrieved. 25. A computer-implemented method as recited in claim 21, wherein the metadata information is time coded, and the retrieved metadata information is tagged with one or more of a metadata type, and metadata category, and the metadata type includes one of text, audio, video, graphical image, web page, or combinations thereof. | 2,100 |
4,776 | 14,284,304 | 2,173 | Particular embodiments provide for asynchronous execution of instructions using a multi-threaded approach to outsource low-level input/output-handling tasks. Particular embodiments may use (1) a main thread to handle execution of instructions to generate a hierarchy of layers representing a GUI, wherein each layer represents a logical grouping of components of the GUI, (2) an input thread to handle asynchronous execution of instructions to process user input based on interactions with the GUI, and (3) a graphics thread to handle asynchronous execution of instructions to generate and/or update display output in relation to one or more layers of the GUI hierarchy. The input thread may send information about received input directly to the graphics thread and the main thread at the same time, thereby enabling the graphics thread to begin refreshing the display output while the main thread performs any necessary processing of the user input. | 1. A method comprising:
by a computing device, executing, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread; by the computing device, asynchronously executing, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy; by the computing device, asynchronously executing, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and by the computing device, asynchronously executing, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 2. The method of claim 1, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 3. The method of claim 1, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 4. The method of claim 3, wherein the location for the user input indicates a static location and a short duration associated with the user input, and wherein the identified type for the user input comprises a tap gesture. 5. The method of claim 3, wherein the location for the user input indicates a static location and a long duration, and wherein the identified type for the user input comprises a long hold gesture. 6. The method of claim 3, wherein the location for the user input indicates a path of user input, and wherein the identified type for the user input comprises a scrolling gesture. 7. The method of claim 3, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer. 8. The method of claim 7, wherein the instructions executed by the input thread further comprise instructions to:
determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 9. The method of claim 8, wherein the instructions executed by the main thread further comprise instructions to:
process the information received from the input thread; update the canonical version of the GUI hierarchy; provide an updated copy, based on the canonical version, to the input thread; and provide an updated copy, based on the canonical version, to the graphics thread. 10. The method of claim 9, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. 11. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
execute, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread; asynchronously execute, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy; asynchronously execute, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and asynchronously execute, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 12. The media of claim 11, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 13. The media of claim 11, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 14. The media of claim 13, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer; determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 15. The media of claim 14, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. 16. A computing device comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
execute, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread;
asynchronously execute, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy;
asynchronously execute, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and
asynchronously execute, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 17. The computing device of claim 16, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 18. The computing device of claim 16, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 19. The computing device of claim 18, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer; determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 20. The computing device of claim 19, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. | Particular embodiments provide for asynchronous execution of instructions using a multi-threaded approach to outsource low-level input/output-handling tasks. Particular embodiments may use (1) a main thread to handle execution of instructions to generate a hierarchy of layers representing a GUI, wherein each layer represents a logical grouping of components of the GUI, (2) an input thread to handle asynchronous execution of instructions to process user input based on interactions with the GUI, and (3) a graphics thread to handle asynchronous execution of instructions to generate and/or update display output in relation to one or more layers of the GUI hierarchy. The input thread may send information about received input directly to the graphics thread and the main thread at the same time, thereby enabling the graphics thread to begin refreshing the display output while the main thread performs any necessary processing of the user input.1. A method comprising:
by a computing device, executing, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread; by the computing device, asynchronously executing, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy; by the computing device, asynchronously executing, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and by the computing device, asynchronously executing, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 2. The method of claim 1, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 3. The method of claim 1, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 4. The method of claim 3, wherein the location for the user input indicates a static location and a short duration associated with the user input, and wherein the identified type for the user input comprises a tap gesture. 5. The method of claim 3, wherein the location for the user input indicates a static location and a long duration, and wherein the identified type for the user input comprises a long hold gesture. 6. The method of claim 3, wherein the location for the user input indicates a path of user input, and wherein the identified type for the user input comprises a scrolling gesture. 7. The method of claim 3, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer. 8. The method of claim 7, wherein the instructions executed by the input thread further comprise instructions to:
determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 9. The method of claim 8, wherein the instructions executed by the main thread further comprise instructions to:
process the information received from the input thread; update the canonical version of the GUI hierarchy; provide an updated copy, based on the canonical version, to the input thread; and provide an updated copy, based on the canonical version, to the graphics thread. 10. The method of claim 9, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. 11. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
execute, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread; asynchronously execute, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy; asynchronously execute, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and asynchronously execute, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 12. The media of claim 11, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 13. The media of claim 11, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 14. The media of claim 13, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer; determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 15. The media of claim 14, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. 16. A computing device comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
execute, by a main thread, instructions to generate a GUI hierarchy comprising a representation of a graphical user interface (GUI), the GUI hierarchy comprising a hierarchical organization of layers, wherein each layer represents a logical grouping of components of the GUI and provide copies of the GUI hierarchy to an input thread and a graphics thread;
asynchronously execute, by the graphics thread, instructions to render, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy;
asynchronously execute, by the input thread, instructions to process user input to determine a gesture based on data received from input devices, wherein the data indicates user interactions with at least one identified layer of the GUI hierarchy and provide information about the user input to the main thread and to the graphics thread; and
asynchronously execute, by the graphics thread, instructions to update, based on the information about the user input received from the input thread, the GUI in relation to one or more layers of the GUI hierarchy. 17. The computing device of claim 16, wherein the instructions executed by the main thread further comprise instructions to:
maintain a canonical version of the GUI hierarchy in memory reserved for use by the main thread; store a first copy of the GUI hierarchy into memory reserved for use by the input thread, wherein the input thread executes the instructions to process the user input using the first copy of the GUI hierarchy, and wherein the first copy is a copy of the canonical version; and store a second copy of the GUI hierarchy into memory reserved for use by the graphics thread, wherein the graphics thread executes the instructions to render display output using the second copy of the GUI hierarchy, and wherein the second copy is a copy of the canonical version. 18. The computing device of claim 16, wherein the instructions executed by the input thread further comprise instructions to:
compute a location for the user input based on the received data, wherein the location is a single location associated with a pair of coordinates or a path associated with multiple pairs of coordinates; compute a duration of time associated with the user input based on the received data; and identify a type for the user input based on the location and the duration of time. 19. The computing device of claim 18, wherein the instructions executed by the input thread further comprise instructions to:
identify, based on the computed location and the identified type for the user input, the identified layer of the GUI hierarchy, wherein each layer of the GUI hierarchy is associated with a set of coordinate pairs defining a perimeter for the layer, wherein the location for the user input is substantially within the perimeter for the identified layer, wherein each layer of the GUI hierarchy is associated with one or more types of user input, and wherein the identified type for the user input matches one of the types of user input associated with the identified layer; determine a gesture based on the user input, the type of the user input, and the identified layer; and pass information about the gesture to the main thread and the graphics thread. 20. The computing device of claim 19, wherein the instructions executed by the graphics thread to update the GUI further comprise instructions to:
execute instructions to re-render the GUI, based on the information received from the input thread, in relation to one or more layers of the GUI hierarchy. | 2,100 |
4,777 | 13,794,464 | 2,177 | An improved approach is described to implement a new type of widget that obtains its context information from another widget. For example, when a contextual widget is dropped into a drop zone, that contextual widget would obtain its context data from its parent drop zone widget. Also described is an improved for visually implementing a web page layout, where the web page layout includes a nested drop zone. | 1. A computer implemented method implemented with a processor for implementing a contextual widget, comprising:
identifying a widget to render; determining that the widget is a contextual widget; and retrieving content from a second widget as context data for the widget. 2. The method of claim 1, in which the second widget comprises a drop zone. 3. The method of claim 2, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 4. The method of claim 1, in which the second widget is a parent to the widget. 5. The method of claim 1, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 6. The method of claim 1, in which the widget is configured to identify a context data element to retrieve from the second widget. 7. The method of claim 1, in which error checking is performed to check whether the second widget is able to provide the content. 8. A computer program product embodied on a computer usable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method for implementing a contextual widget, the method comprising:
identifying a widget to render; determining that the widget is a contextual widget; and retrieving content from a second widget as context data for the widget. 9. The computer program product of claim 8, in which the second widget comprises a drop zone. 10. The computer program product of claim 9, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 11. The computer program product of claim 8, in which the second widget is a parent to the widget. 12. The computer program product of claim 8, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 13. The computer program product of claim 8, in which the widget is configured to identify a context data element to retrieve from the second widget. 14. The computer program product of claim 8, in which error checking is performed to check whether the second widget is able to provide the content. 15. A system for implementing a contextual widget, comprising:
a processor; a memory comprising computer code executed using the processor, in which the computer code implements identifying a widget to render, determining that the widget is a contextual widget, and retrieving content from a second widget as context data for the widget. 16. The system of claim 15, in which the second widget comprises a drop zone. 17. The system of claim 16, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 18. The system of claim 15, in which the second widget is a parent to the widget. 19. The system of claim 15, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 20. The system of claim 15, in which the widget is configured to identify a context data element to retrieve from the second widget. 21. The system of claim 15, in which error checking is performed to check whether the second widget is able to provide the content. | An improved approach is described to implement a new type of widget that obtains its context information from another widget. For example, when a contextual widget is dropped into a drop zone, that contextual widget would obtain its context data from its parent drop zone widget. Also described is an improved for visually implementing a web page layout, where the web page layout includes a nested drop zone.1. A computer implemented method implemented with a processor for implementing a contextual widget, comprising:
identifying a widget to render; determining that the widget is a contextual widget; and retrieving content from a second widget as context data for the widget. 2. The method of claim 1, in which the second widget comprises a drop zone. 3. The method of claim 2, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 4. The method of claim 1, in which the second widget is a parent to the widget. 5. The method of claim 1, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 6. The method of claim 1, in which the widget is configured to identify a context data element to retrieve from the second widget. 7. The method of claim 1, in which error checking is performed to check whether the second widget is able to provide the content. 8. A computer program product embodied on a computer usable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method for implementing a contextual widget, the method comprising:
identifying a widget to render; determining that the widget is a contextual widget; and retrieving content from a second widget as context data for the widget. 9. The computer program product of claim 8, in which the second widget comprises a drop zone. 10. The computer program product of claim 9, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 11. The computer program product of claim 8, in which the second widget is a parent to the widget. 12. The computer program product of claim 8, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 13. The computer program product of claim 8, in which the widget is configured to identify a context data element to retrieve from the second widget. 14. The computer program product of claim 8, in which error checking is performed to check whether the second widget is able to provide the content. 15. A system for implementing a contextual widget, comprising:
a processor; a memory comprising computer code executed using the processor, in which the computer code implements identifying a widget to render, determining that the widget is a contextual widget, and retrieving content from a second widget as context data for the widget. 16. The system of claim 15, in which the second widget comprises a drop zone. 17. The system of claim 16, in which the widget has been dropped into the drop zone of the second widget to form a page layout. 18. The system of claim 15, in which the second widget is a parent to the widget. 19. The system of claim 15, the second widget is configured to identify context data for any other contextual widgets to be associated with the second widget. 20. The system of claim 15, in which the widget is configured to identify a context data element to retrieve from the second widget. 21. The system of claim 15, in which error checking is performed to check whether the second widget is able to provide the content. | 2,100 |
4,778 | 13,309,824 | 2,166 | An online social network is managed using one server for database management tasks and another server, preferably in a distributed configuration, for CPU-intensive computational tasks, such as finding a shortest path between two members or a degree of separation between two members. The additional server has a memory device containing relationship information between members of the online social network and carries out the CPU-intensive computational tasks using this memory device. With this configuration, the number of database lookups is decreased and processing speed is thereby increased. | 1. A computer-implemented method comprising:
receiving, at one or more computing systems, a query associated with a first user of a social network; retrieving, using one or more processors associated with the one or more computing systems, information based on the query, the information representing a user profile associated with a second user of the social network; determining, using the one or more processors, a profile format for the user profile based on a visibility preference of the second user; and transmitting information, based on the profile format, representing the user profile associated with the second user. 2. The method of claim 1, wherein the query comprises an identifier for the second user. 3. The method of claim 1, wherein the visibility preference is 1, 2, 3, or All. 4. The method of claim 1, wherein determining the profile format comprises retrieving a visibility preference of the second user from a database. 5. The method of claim 4, wherein the visibility preference is set to All, further comprising setting the profile format to full profile. 6. The method of claim 4, wherein the visibility preference is set to some value other than “All”, further comprising:
determining, using the one or more processors, a degree of separation between the first user and the second user; and
comparing the degree of separation to the visibility preference of the second user. 7. The method of claim 6, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 8. The method of claim 6, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 9. The method of claim 6, wherein the determining the degree of separation between the first user and the second user is based on a social graph stored in a dedicated memory device. 10. One or more machine-readable non-transitory storage media embodying software that is operable when executed by one or more processors associated with one or more computer systems to:
receive, at the one or more computing systems, a query associated with a first user of a social network, wherein the query requests a user profile associated with a second user of the social network; retrieve, from a database, information representing the user profile of the second user based on the query; retrieve a degree of separation between the first user and the second user by accessing a social graph stored in a dedicated memory device; determine, using the one or more processors, a profile format for the user profile based on a visibility preference of the second user and the degree of separation between the first user and the second user; and transmit information, based on the profile format, representing the user profile associated with the second user. 11. The media of claim 10, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 12. The media of claim 10, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 13. A system comprising:
a database; a graph server comprising:
a dedicated memory device;
a processor; and
one or more non-transitory machine-readable storage media comprising software for causing the processor to execute instructions to:
receive information identifying a first user of a social network and a second user of a social network;
access a social graph stored on the dedicated memory device; and
determine a degree of separation between the first user and the second user based on the social graph; and
an application server comprising:
a processor; and
one or more non-transitory machine-readable storage media comprising software for causing the processor to execute instructions to:
receive a query associated with a first user of a social network, wherein the query requests a user profile associated with a second user of the social network;
retrieve, from the database, based on the query, information representing the user profile of the second user and information representing a visibility preference of the second user;
retrieve, from the graph server, a degree of separation between the first user and the second user;
determine a profile format for the user profile based on the visibility preference of the second user and the degree of separation between the first user and the second user; and
transmit information, based on the profile format, representing the user profile associated with the second user. 14. The system of claim 13, wherein the query comprises an identifier for the second user. 15. The system of claim 13, wherein the visibility preference is 1, 2, 3, or All. 16. The system of claim 13, wherein the visibility preference is set to All, further comprising setting the profile format to full profile. 17. The system of claim 13, wherein the visibility preference is not set to “All”, wherein the storage media of the application server further comprises instructions to:
determine, using the one or more processors, a degree of separation between the first user and the second user; and
compare the degree of separation to the visibility preference of the second user. 18. The system of claim 17, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 19. The system of claim 17, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 20. The system of claim 13, wherein the storage media of the graph server further comprises instructions to:
retrieve updates to relationship information from the database; and update the social graph based on the updates to relationship information. | An online social network is managed using one server for database management tasks and another server, preferably in a distributed configuration, for CPU-intensive computational tasks, such as finding a shortest path between two members or a degree of separation between two members. The additional server has a memory device containing relationship information between members of the online social network and carries out the CPU-intensive computational tasks using this memory device. With this configuration, the number of database lookups is decreased and processing speed is thereby increased.1. A computer-implemented method comprising:
receiving, at one or more computing systems, a query associated with a first user of a social network; retrieving, using one or more processors associated with the one or more computing systems, information based on the query, the information representing a user profile associated with a second user of the social network; determining, using the one or more processors, a profile format for the user profile based on a visibility preference of the second user; and transmitting information, based on the profile format, representing the user profile associated with the second user. 2. The method of claim 1, wherein the query comprises an identifier for the second user. 3. The method of claim 1, wherein the visibility preference is 1, 2, 3, or All. 4. The method of claim 1, wherein determining the profile format comprises retrieving a visibility preference of the second user from a database. 5. The method of claim 4, wherein the visibility preference is set to All, further comprising setting the profile format to full profile. 6. The method of claim 4, wherein the visibility preference is set to some value other than “All”, further comprising:
determining, using the one or more processors, a degree of separation between the first user and the second user; and
comparing the degree of separation to the visibility preference of the second user. 7. The method of claim 6, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 8. The method of claim 6, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 9. The method of claim 6, wherein the determining the degree of separation between the first user and the second user is based on a social graph stored in a dedicated memory device. 10. One or more machine-readable non-transitory storage media embodying software that is operable when executed by one or more processors associated with one or more computer systems to:
receive, at the one or more computing systems, a query associated with a first user of a social network, wherein the query requests a user profile associated with a second user of the social network; retrieve, from a database, information representing the user profile of the second user based on the query; retrieve a degree of separation between the first user and the second user by accessing a social graph stored in a dedicated memory device; determine, using the one or more processors, a profile format for the user profile based on a visibility preference of the second user and the degree of separation between the first user and the second user; and transmit information, based on the profile format, representing the user profile associated with the second user. 11. The media of claim 10, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 12. The media of claim 10, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 13. A system comprising:
a database; a graph server comprising:
a dedicated memory device;
a processor; and
one or more non-transitory machine-readable storage media comprising software for causing the processor to execute instructions to:
receive information identifying a first user of a social network and a second user of a social network;
access a social graph stored on the dedicated memory device; and
determine a degree of separation between the first user and the second user based on the social graph; and
an application server comprising:
a processor; and
one or more non-transitory machine-readable storage media comprising software for causing the processor to execute instructions to:
receive a query associated with a first user of a social network, wherein the query requests a user profile associated with a second user of the social network;
retrieve, from the database, based on the query, information representing the user profile of the second user and information representing a visibility preference of the second user;
retrieve, from the graph server, a degree of separation between the first user and the second user;
determine a profile format for the user profile based on the visibility preference of the second user and the degree of separation between the first user and the second user; and
transmit information, based on the profile format, representing the user profile associated with the second user. 14. The system of claim 13, wherein the query comprises an identifier for the second user. 15. The system of claim 13, wherein the visibility preference is 1, 2, 3, or All. 16. The system of claim 13, wherein the visibility preference is set to All, further comprising setting the profile format to full profile. 17. The system of claim 13, wherein the visibility preference is not set to “All”, wherein the storage media of the application server further comprises instructions to:
determine, using the one or more processors, a degree of separation between the first user and the second user; and
compare the degree of separation to the visibility preference of the second user. 18. The system of claim 17, wherein the degree of separation is greater than the visibility preference, further comprising setting the profile format to mini-profile. 19. The system of claim 17, wherein the degree of separation is less than or equal to the visibility preference, further comprising setting the profile format to full profile. 20. The system of claim 13, wherein the storage media of the graph server further comprises instructions to:
retrieve updates to relationship information from the database; and update the social graph based on the updates to relationship information. | 2,100 |
4,779 | 14,221,573 | 2,143 | An email message system comprises a user interface adapted to display, in a first area on a screen, a collection of at least one email message, the user interface adapted to enable user input to select a particular email message from the collection, and the user interface adapted to enable user input to associate at least one information element with the selected email message. | 1. An email message system comprising:
a user interface adapted to display, in a first area on a screen, a collection of at least one email message; the user interface adapted to enable user input to select a particular email message from the collection; and the user interface adapted to enable user input to associate at least one information element with the selected email message. 2. The email message system of claim 1, wherein the information element is selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element. 3. The email message system of claim 2, wherein the web-based information element is selected from the group consisting of a LinkedIn profile, a Facebook post, a Twitter feed, a Pinterest pin, an Instagram photo, an RSS feed, a Podcast, and a web page. 4. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, a content of the linked information element associated with the selected email message. 5. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, a link to the linked information element associated with the selected email message. 6. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, an address to the linked information element associated with the selected email message. 7. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored on a computer on which the email message system resides. 8. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored in a computer wirelessly coupled to a computer running the email message system. 9. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored in a computer that is part of the Internet. 10. The email message system of claim 1, wherein the user interface is adapt to display the selected email message and the at least one linked information element. 11. The email message system of claim 1, wherein the user interface is adapt to print the selected email message and the at least one linked information element. 12. The email message system of claim 1, wherein the user interface is adapt to forward to another user the selected email message and the at least one linked information element. 13. An email message method comprising:
displaying, in a first area on a screen, a collection of at least one email message; receiving a user selection of a particular email message from the collection; receiving user input to associate at least one information element with the selected email message; and displaying, in a second area on the screen, the at least one information element. 14. The email message method of claim 13, wherein receiving user input to associate at least one information element with the selected email message comprises receiving an information element selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element. 15. The email message method of claim 14, wherein receiving user input to associate at least one information element with the selected email message comprises receiving a web-based information element selected from the group consisting of a LinkedIn profile, a Facebook post, a Twitter feed, a Pinterest pin, an Instagram photo, an RSS feed, a Podcast, and a web page. 16. The email message method of claim 13, wherein displaying the at least one information element comprises displaying a content of the linked information element associated with the selected email message. 17. The email message method of claim 13, further comprising displaying the at least one information element comprises displaying a link to the linked information element associated with the selected email message. 18. The email message method of claim 13, further comprising displaying the at least one information element comprises displaying an address to the linked information element associated with the selected email message. 19. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored on a computer on which the email message system resides. 20. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored in a computer wirelessly coupled to a computer running the email message system. 21. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored in a computer that is part of the Internet. 22. The email message method of claim 13, further comprising:
displaying a list of link options in response to receiving the user selection of the particular email message; and receiving user input of the information item. 23. The email message method of claim 22, wherein receiving user input of the information item comprises displaying a window adapted to receive user input. 24. The email message method of claim 22, wherein receiving user input of the information item comprises displaying a browse file dialog. 25. An email message method comprising:
displaying, in a first area on a screen, a collection of a plurality of email messages; receiving a user selection of a particular email message from the collection; receiving user input to associate at least one information element with the selected email message, the at least one information element selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element; and displaying, in a second area on the screen separate from the first area, the at least one information element. | An email message system comprises a user interface adapted to display, in a first area on a screen, a collection of at least one email message, the user interface adapted to enable user input to select a particular email message from the collection, and the user interface adapted to enable user input to associate at least one information element with the selected email message.1. An email message system comprising:
a user interface adapted to display, in a first area on a screen, a collection of at least one email message; the user interface adapted to enable user input to select a particular email message from the collection; and the user interface adapted to enable user input to associate at least one information element with the selected email message. 2. The email message system of claim 1, wherein the information element is selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element. 3. The email message system of claim 2, wherein the web-based information element is selected from the group consisting of a LinkedIn profile, a Facebook post, a Twitter feed, a Pinterest pin, an Instagram photo, an RSS feed, a Podcast, and a web page. 4. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, a content of the linked information element associated with the selected email message. 5. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, a link to the linked information element associated with the selected email message. 6. The email message system of claim 1, wherein the user interface is further adapted to receive a user selection of a particular email message and to display, in a second area on the screen, an address to the linked information element associated with the selected email message. 7. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored on a computer on which the email message system resides. 8. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored in a computer wirelessly coupled to a computer running the email message system. 9. The email message system of claim 1, wherein the user interface is adapted to associate with the selected email message at least one information element stored in a computer that is part of the Internet. 10. The email message system of claim 1, wherein the user interface is adapt to display the selected email message and the at least one linked information element. 11. The email message system of claim 1, wherein the user interface is adapt to print the selected email message and the at least one linked information element. 12. The email message system of claim 1, wherein the user interface is adapt to forward to another user the selected email message and the at least one linked information element. 13. An email message method comprising:
displaying, in a first area on a screen, a collection of at least one email message; receiving a user selection of a particular email message from the collection; receiving user input to associate at least one information element with the selected email message; and displaying, in a second area on the screen, the at least one information element. 14. The email message method of claim 13, wherein receiving user input to associate at least one information element with the selected email message comprises receiving an information element selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element. 15. The email message method of claim 14, wherein receiving user input to associate at least one information element with the selected email message comprises receiving a web-based information element selected from the group consisting of a LinkedIn profile, a Facebook post, a Twitter feed, a Pinterest pin, an Instagram photo, an RSS feed, a Podcast, and a web page. 16. The email message method of claim 13, wherein displaying the at least one information element comprises displaying a content of the linked information element associated with the selected email message. 17. The email message method of claim 13, further comprising displaying the at least one information element comprises displaying a link to the linked information element associated with the selected email message. 18. The email message method of claim 13, further comprising displaying the at least one information element comprises displaying an address to the linked information element associated with the selected email message. 19. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored on a computer on which the email message system resides. 20. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored in a computer wirelessly coupled to a computer running the email message system. 21. The email message method of claim 13, further comprising associating with the selected email message at least one information element stored in a computer that is part of the Internet. 22. The email message method of claim 13, further comprising:
displaying a list of link options in response to receiving the user selection of the particular email message; and receiving user input of the information item. 23. The email message method of claim 22, wherein receiving user input of the information item comprises displaying a window adapted to receive user input. 24. The email message method of claim 22, wherein receiving user input of the information item comprises displaying a browse file dialog. 25. An email message method comprising:
displaying, in a first area on a screen, a collection of a plurality of email messages; receiving a user selection of a particular email message from the collection; receiving user input to associate at least one information element with the selected email message, the at least one information element selected from the group consisting of a note, a file, a task, a contact, an email message, a calendar item, a picture, and a web-based information element; and displaying, in a second area on the screen separate from the first area, the at least one information element. | 2,100 |
4,780 | 14,141,803 | 2,122 | A computer-implemented method can include receiving training data that includes a set of non-matching pairs and a set of matching pairs. The method can further include calculating a non-matching collision probability for each non-matching pair of the set of non-matching pairs and a matching collision probability for each matching pair of the set of matching pairs. The method can also include generating a machine learning model that includes a first threshold and a second threshold. An unknown item and a particular known item are classified as not matching when their collision probability is less than the first threshold, and as matching when their collision probability is greater than the second threshold. The first threshold and the second threshold can be selected based on a minimization of errors in classification of matching and non-matching pairs in the training data, and a maximization of a retrieval efficiency metric. | 1. A computer-implemented method, comprising:
receiving, at a computing device having one or more processors, training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2); calculating, at the computing device, a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs; calculating, at the computing device, a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs; and generating, at the computing device, a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2), wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 2. The computer-implemented method of claim 1, wherein calculating the collision probability is based on a plurality of hash functions. 3. The computer-implemented method of claim 2, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 4. The computer-implemented method of claim 3, wherein the embedding function is selected based on: (i) a minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 5. The computer-implemented method of claim 1, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs; determining potential values for the second threshold (T2) based on the minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs; calculating In(1/T1)/In(1/T2) for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) minimizing the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) minimizing the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) maximizing In(1/T1)/In(1/T2). 6. The computer-implemented method of claim 1, further comprising:
receiving, at the computing device, a query; determining, at the computing device, an approximate nearest neighbor to the query based on the machine learning model; and outputting, from the computing device, the approximate nearest neighbor. 7. A computer-implemented method, comprising:
receiving, at a computing device having one or more processors, training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2); calculating, at the computing device, a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs; calculating, at the computing device, a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs; and generating, at the computing device, a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2), wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of errors in classification of non-matching pairs in the training data, (ii) a minimization of errors in classification of matching pairs in the training data, and (iii) a maximization of a retrieval efficiency metric related to an expected time for retrieving an approximate nearest neighbor to a query based on the machine learning model. 8. The computer-implemented method of claim 7, wherein calculating the collision probability is based on a plurality of hash functions. 9. The computer-implemented method of claim 8, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 10. The computer-implemented method of claim 9, further comprising:
selecting, at the computing device, the embedding function from a plurality of potential embedding functions based on: (i) a minimization of errors in classification of non-matching pairs in the training data, (ii) a minimization of errors in classification of matching pairs in the training data, and (iii) a maximization of the retrieval efficiency metric. 11. The computer-implemented method of claim 7, wherein the retrieval efficiency metric comprises In(1/T1)/In(1/T2). 12. The computer-implemented method of claim 7, wherein the minimization of errors in classification of non-matching pairs in the training data comprises minimizing a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs. 13. The computer-implemented method of claim 7, wherein the minimization of errors in classification of matching pairs in the training data comprises minimizing a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs. 14. The computer-implemented method of claim 7, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of errors in classification of non-matching pairs in the training data; determining potential values for the second threshold (T2) based on the minimization of errors in classification of matching pairs in the training data; calculating a potential retrieval efficiency metric for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) the minimization of errors in classification of non-matching pairs in the training data, (ii) minimization of errors in classification of matching pairs in the training data, and (iii) maximizing the retrieval efficiency metric. 15. A computer system, comprising:
one or more processors; and a non-transitory, computer readable medium storing instructions that, when executed by the one or more processors, cause the computer system to perform operations comprising:
receiving training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2),
calculating a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs,
calculating a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs, and
generating a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2),
wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 16. The computer system of claim 15, wherein calculating the collision probability is based on a plurality of hash functions. 17. The computer system of claim 16, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 18. The computer system of claim 17, wherein the embedding function is selected based on: (i) a minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 19. The computer system of claim 15, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs; determining potential values for the second threshold (T2) based on the minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs; calculating In(1/T1)/In(1/T2) for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) minimizing the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) minimizing the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) maximizing In(1/T)/In(1/T2). 20. The computer system of claim 15, wherein the operations further comprise:
receiving a query; and determining an approximate nearest neighbor to the query based on the machine learning model; and outputting, from the computing device, the approximate nearest neighbor. | A computer-implemented method can include receiving training data that includes a set of non-matching pairs and a set of matching pairs. The method can further include calculating a non-matching collision probability for each non-matching pair of the set of non-matching pairs and a matching collision probability for each matching pair of the set of matching pairs. The method can also include generating a machine learning model that includes a first threshold and a second threshold. An unknown item and a particular known item are classified as not matching when their collision probability is less than the first threshold, and as matching when their collision probability is greater than the second threshold. The first threshold and the second threshold can be selected based on a minimization of errors in classification of matching and non-matching pairs in the training data, and a maximization of a retrieval efficiency metric.1. A computer-implemented method, comprising:
receiving, at a computing device having one or more processors, training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2); calculating, at the computing device, a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs; calculating, at the computing device, a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs; and generating, at the computing device, a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2), wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 2. The computer-implemented method of claim 1, wherein calculating the collision probability is based on a plurality of hash functions. 3. The computer-implemented method of claim 2, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 4. The computer-implemented method of claim 3, wherein the embedding function is selected based on: (i) a minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 5. The computer-implemented method of claim 1, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs; determining potential values for the second threshold (T2) based on the minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs; calculating In(1/T1)/In(1/T2) for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) minimizing the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) minimizing the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) maximizing In(1/T1)/In(1/T2). 6. The computer-implemented method of claim 1, further comprising:
receiving, at the computing device, a query; determining, at the computing device, an approximate nearest neighbor to the query based on the machine learning model; and outputting, from the computing device, the approximate nearest neighbor. 7. A computer-implemented method, comprising:
receiving, at a computing device having one or more processors, training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2); calculating, at the computing device, a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs; calculating, at the computing device, a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs; and generating, at the computing device, a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2), wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of errors in classification of non-matching pairs in the training data, (ii) a minimization of errors in classification of matching pairs in the training data, and (iii) a maximization of a retrieval efficiency metric related to an expected time for retrieving an approximate nearest neighbor to a query based on the machine learning model. 8. The computer-implemented method of claim 7, wherein calculating the collision probability is based on a plurality of hash functions. 9. The computer-implemented method of claim 8, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 10. The computer-implemented method of claim 9, further comprising:
selecting, at the computing device, the embedding function from a plurality of potential embedding functions based on: (i) a minimization of errors in classification of non-matching pairs in the training data, (ii) a minimization of errors in classification of matching pairs in the training data, and (iii) a maximization of the retrieval efficiency metric. 11. The computer-implemented method of claim 7, wherein the retrieval efficiency metric comprises In(1/T1)/In(1/T2). 12. The computer-implemented method of claim 7, wherein the minimization of errors in classification of non-matching pairs in the training data comprises minimizing a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs. 13. The computer-implemented method of claim 7, wherein the minimization of errors in classification of matching pairs in the training data comprises minimizing a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs. 14. The computer-implemented method of claim 7, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of errors in classification of non-matching pairs in the training data; determining potential values for the second threshold (T2) based on the minimization of errors in classification of matching pairs in the training data; calculating a potential retrieval efficiency metric for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) the minimization of errors in classification of non-matching pairs in the training data, (ii) minimization of errors in classification of matching pairs in the training data, and (iii) maximizing the retrieval efficiency metric. 15. A computer system, comprising:
one or more processors; and a non-transitory, computer readable medium storing instructions that, when executed by the one or more processors, cause the computer system to perform operations comprising:
receiving training data that includes a set of non-matching pairs (x1, y1) and a set of matching pairs (x2, y2),
calculating a non-matching collision probability p1(x1, y1) for each non-matching pair of the set of non-matching pairs,
calculating a matching collision probability p2(x2, y2) for each matching pair of the set of matching pairs, and
generating a machine learning model that includes a first threshold (T1) and a second threshold (T2), the machine learning model being configured to classify an unknown item as not matching a particular known item when a collision probability between the unknown item and the particular known item is less than the first threshold (T1), and to classify the unknown item as matching the particular known item when the collision probability between the unknown item and the particular known item is greater than the second threshold (T2),
wherein the first threshold (T1) and the second threshold (T2) are selected based on: (i) a minimization of a sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of a sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 16. The computer system of claim 15, wherein calculating the collision probability is based on a plurality of hash functions. 17. The computer system of claim 16, wherein calculating the collision probability is further based on an embedding function of the machine learning model, the embedding function mapping an input in a first metric space to an output in a second metric space. 18. The computer system of claim 17, wherein the embedding function is selected based on: (i) a minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) a minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) a maximization of In(1/T1)/In(1/T2). 19. The computer system of claim 15, wherein the first threshold (T1) and the second threshold (T2) are selected by:
determining potential values for the first threshold (T1) based on the minimization of the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs; determining potential values for the second threshold (T2) based on the minimization of the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs; calculating In(1/T1)/In(1/T2) for each of the potential values for the first threshold (T1) and the second threshold (T2); and selecting the first threshold (T1) and the second threshold (T2) based on a balancing of objectives of: (i) minimizing the sum of max(0, p1(x1, y1)−T1) over the set of non-matching pairs, (ii) minimizing the sum of max(0, T2−p2(x2, y2)) over the set of matching pairs, and (iii) maximizing In(1/T)/In(1/T2). 20. The computer system of claim 15, wherein the operations further comprise:
receiving a query; and determining an approximate nearest neighbor to the query based on the machine learning model; and outputting, from the computing device, the approximate nearest neighbor. | 2,100 |
4,781 | 14,991,938 | 2,196 | Dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize physical the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies. | 1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; on optimizer for optimizing placement of virtual machines on a plurality of physical hosts; and an ordering policy mechanism residing in the memory and executed by the at least one processor that provides an ordered list of physical hosts to the optimizer with an order for optimizing the physical hosts determined by at least one ordering policy wherein the at least one ordering policy is defined by a system administrator and when evaluated in conjunction with current conditions indicates a priority for optimizing the plurality of physical hosts. 2. The apparatus of claim 1 wherein the ordering policy mechanism is part of a management layer of a cloud computing environment and wherein the physical hosts are part of the cloud computing environment. 3. (canceled) 4. The apparatus of claim 1 wherein the at least one ordering policy is a fixed host priority sequence. 5. The apparatus of claim 1 wherein the at least one ordering policy is a fixed host priority level that indicates a level of priority associated with each physical host. 6. The apparatus of claim 1 wherein the at least one ordering policy is a dynamic ordering policy that indicates a host priority based on at least one host condition. 7. The apparatus of claim 6 wherein the dynamic ordering policy is an expression that indicates the host priority based the at least one host condition. 8. The apparatus of claim 1 wherein the ordering policy mechanism provides the ordered list of physical hosts to the optimizer according to a dynamic ordering policy and a fixed ordering policy. 9. The apparatus of claim 1 wherein the ordering policy mechanism provides the ordered list to the optimizer and the optimizer optimizes physical hosts that have violated an optimization policy in the order of the ordered list. 10. The apparatus of claim 1 wherein the optimizer optimizes the system by moving a virtual machine from a first physical host computer to a second physical host computer. 11. An article of manufacture comprising software residing on a computer readable storage medium, the software comprising:
an ordering policy mechanism that gets current conditions of a computer system, gets a plurality of ordering policies defined by a system administrator, and evaluates the plurality of ordering policies using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts, and provides to an optimizer the ordered list of physical hosts that indicates the order for optimizing the plurality of physical hosts, wherein the optimizer optimizes the physical hosts in the order of the ordered list. 12. The article of manufacture of claim 11 wherein the ordering policy mechanism is in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 13. The article of manufacture of claim 11 wherein the ordering policy mechanism allows a system administrator to define the plurality of ordering policies with a user interface. 14. The article of manufacture of claim 11 wherein the plurality of ordering policies includes a fixed host priority sequence. 15. The article of manufacture of claim 11 wherein the plurality of ordering policies includes a dynamic ordering policy that indicates a host priority based on at least one host condition. 16. The article of manufacture of claim 15 wherein the dynamic ordering policy is an expression that indicates the host priority based on the at least one host condition. 17. The article of manufacture of claim 11 wherein the optimizer optimizes hosts that have violated an optimization policy in the order of the ordered list. 18. The article of manufacture of claim 11 wherein the optimizer optimizes the physical hosts with the ordered list by moving a virtual machine from a first physical host to a second physical host. 19. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; on optimizer for optimizing placement of virtual machines on a plurality of physical hosts; an ordering policy mechanism residing in the memory and executed by the at least one processor that provides an ordered list of physical hosts to the optimizer with an order for optimizing the physical hosts determined by a plurality of ordering policies, wherein the plurality of ordering policies are defined by a system administrator and when evaluated in conjunction with current conditions indicate a priority for optimizing the plurality of physical hosts; and wherein the plurality of ordering policies include a dynamic ordering policy that is an expression that indicates a host priority based on at least one host condition | Dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize physical the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies.1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; on optimizer for optimizing placement of virtual machines on a plurality of physical hosts; and an ordering policy mechanism residing in the memory and executed by the at least one processor that provides an ordered list of physical hosts to the optimizer with an order for optimizing the physical hosts determined by at least one ordering policy wherein the at least one ordering policy is defined by a system administrator and when evaluated in conjunction with current conditions indicates a priority for optimizing the plurality of physical hosts. 2. The apparatus of claim 1 wherein the ordering policy mechanism is part of a management layer of a cloud computing environment and wherein the physical hosts are part of the cloud computing environment. 3. (canceled) 4. The apparatus of claim 1 wherein the at least one ordering policy is a fixed host priority sequence. 5. The apparatus of claim 1 wherein the at least one ordering policy is a fixed host priority level that indicates a level of priority associated with each physical host. 6. The apparatus of claim 1 wherein the at least one ordering policy is a dynamic ordering policy that indicates a host priority based on at least one host condition. 7. The apparatus of claim 6 wherein the dynamic ordering policy is an expression that indicates the host priority based the at least one host condition. 8. The apparatus of claim 1 wherein the ordering policy mechanism provides the ordered list of physical hosts to the optimizer according to a dynamic ordering policy and a fixed ordering policy. 9. The apparatus of claim 1 wherein the ordering policy mechanism provides the ordered list to the optimizer and the optimizer optimizes physical hosts that have violated an optimization policy in the order of the ordered list. 10. The apparatus of claim 1 wherein the optimizer optimizes the system by moving a virtual machine from a first physical host computer to a second physical host computer. 11. An article of manufacture comprising software residing on a computer readable storage medium, the software comprising:
an ordering policy mechanism that gets current conditions of a computer system, gets a plurality of ordering policies defined by a system administrator, and evaluates the plurality of ordering policies using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts, and provides to an optimizer the ordered list of physical hosts that indicates the order for optimizing the plurality of physical hosts, wherein the optimizer optimizes the physical hosts in the order of the ordered list. 12. The article of manufacture of claim 11 wherein the ordering policy mechanism is in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 13. The article of manufacture of claim 11 wherein the ordering policy mechanism allows a system administrator to define the plurality of ordering policies with a user interface. 14. The article of manufacture of claim 11 wherein the plurality of ordering policies includes a fixed host priority sequence. 15. The article of manufacture of claim 11 wherein the plurality of ordering policies includes a dynamic ordering policy that indicates a host priority based on at least one host condition. 16. The article of manufacture of claim 15 wherein the dynamic ordering policy is an expression that indicates the host priority based on the at least one host condition. 17. The article of manufacture of claim 11 wherein the optimizer optimizes hosts that have violated an optimization policy in the order of the ordered list. 18. The article of manufacture of claim 11 wherein the optimizer optimizes the physical hosts with the ordered list by moving a virtual machine from a first physical host to a second physical host. 19. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; on optimizer for optimizing placement of virtual machines on a plurality of physical hosts; an ordering policy mechanism residing in the memory and executed by the at least one processor that provides an ordered list of physical hosts to the optimizer with an order for optimizing the physical hosts determined by a plurality of ordering policies, wherein the plurality of ordering policies are defined by a system administrator and when evaluated in conjunction with current conditions indicate a priority for optimizing the plurality of physical hosts; and wherein the plurality of ordering policies include a dynamic ordering policy that is an expression that indicates a host priority based on at least one host condition | 2,100 |
4,782 | 14,312,813 | 2,124 | This document describes techniques ( 400, 500, 600 ) and apparatuses ( 100, 700 ) for implementing sensor-based near-field communication (NFC) authentication. These techniques ( 400, 500, 600 ) and apparatuses ( 100, 700 ) enable a computing device ( 102 ) to detect, in a low-power state, environmental variances indicating proximity with an NFC-enabled device ( 104 ) with which to authenticate. In some embodiments, various components of a computing device ( 102 ) in a sleep state are activated to process environmental variance(s), perform authentication operations, and/or an indicate initiation of authentication operations to a user. | 1. A method comprising:
sensing, via a lower-power processor of a device that is in a sleep state, an environmental variance indicating proximity with a near-field communication-enabled (NFC-enabled) entity, the lower-power processor not capable of authenticating the NFC-enabled entity; activating, responsive to detecting the environmental variance via the lower-power processor, a higher-power processor of the device that is capable of authenticating the NFC-enabled entity, the higher-power processor different than the lower-power processor; receiving, via a near-field communication (NFC) interface of the device, authentication information from the NFC-enabled entity; and authenticating, via the higher-power processor and based on authentication information, the NFC-enabled entity effective to wake the device from the sleep state. 2. The method as recited in claim 1, wherein the environmental variance is one of motion, light, sound, or a change in magnetic field strength. 3. The method as recited in claim 1, wherein the lower-power processor is not capable of communicating via the NFC interface of the device. 4. The method as recited in claim 1 wherein, prior to detecting the environmental variance, the NFC interface is in a sleep state, and further comprising, prior to receiving the authentication information, activating the NFC interface to enable communication with the NFC-enabled entity. 5. The method as recited in claim 1 further comprising, responsive to detecting the environmental variance, indicating an initiation of the acts of activating, receiving, or authenticating to a user of the device. 6. The method as recited in claim 4, wherein the device includes a display that is powered-down while in the sleep state, and indicating the initiation of the acts of activating, receiving, or authenticating includes powering the display of the device. 7. The method as recited in claim 4, wherein the device includes a light-emitting diode (LED) indicator, speaker, or vibrator, and indicating the initiation of the acts of activating, receiving, or authenticating includes altering a state of the LED indicator, emitting an audio alert via the speaker, or causing actuation of the vibrator. 8. The method as recited in claim 1, wherein the device is locked while in the sleep state, and further comprising, responsive to authenticating the NFC-enabled entity, unlocking the device. 9. The method as recited in claim 1, wherein the environmental variance is detected via a motion sensor, light sensor, acoustic sensor, or magnetic sensor monitored by the low-power processor when the device is in a sleep state. 10. A device comprising:
a near-field communication (NFC) transceiver configured to enable wireless communication of data; a sensor configured to detect environmental variances; a low-power processor unable to perform authentication operations and configured to monitor the sensor for a particular environmental variance indicative of prospective proximity with an NFC-enabled entity; and an application processor having a sleep state in which power of the device is conserved, an active state in which authentication operations and other functionalities of the device are implemented, and configured to:
receive, while in the sleep state, a signal from the low-power processor indicating the prospective proximity with an NFC-enabled entity;
wake, responsive to the signal, from the sleep state to the active state to implement the authentication operations;
receive, via the NFC transceiver, authentication information from the NFC-enabled entity;
attempt to authenticate with the NFC-enabled entity based on the authentication information received via the NFC transceiver; and
enable access to the other functionalities of the device responsive to successfully authenticating with the NFC-enabled entity. 11. The device as recited in claim 10, wherein the environmental variance is one of motion, light, sound, or a change in magnetic field strength. 12. The method as recited in claim 11, wherein:
the motion is associated with a gesture performable the user of the device; the light is associated with a light-emitting accessory associated with the user; the sound is a voice-command received from the user of the device; or the change is magnetic field strength is caused by a magnetic accessory associated with the user or the NFC-enabled entity. 13. The device as recited in claim 10, wherein the device includes a locked state and an unlocked state, the application processor resides in the sleep state when the device is in the locked state, and enabling access to the other functionalities of the device is effective to transition the device from the locked state to the unlocked state. 14. The device as recited in claim 13, further comprising a display and wherein the application processor is further configured to indicate, via the display, an initiation of the authentication operations, the locked state of the device, or the unlocked state of the device. 15. A method, comprising:
monitoring, via a low-power processor of a device in a locked state, a sensor configured to sense variances in an environment of a device; detecting, responsive to a particular environmental variance, a near-field communication-enabled (NFC-enabled) entity with which to authenticate; waking, responsive to the proximity of the NFC-enabled entity, another processor of the device from a sleep state to authenticate with the NFC-enabled entity; receiving, via a near-field communication (NFC) interface of the device, authentication information from the NFC-enabled entity; attempting, via the other processor and based on the authentication information, to authenticate with the NFC-enabled entity; and
unlocking the device responsive to authenticating with the NFC-enabled entity; or
returning the other processor to the sleep state responsive to not authenticating with the NFC-enabled entity. 16. The method as recited in claim 15, further comprising activating, while the device is in the locked state, a display of the device to indicate an initiation of the attempt to authenticate with the NFC-enabled entity. 17. The method as recited in claim 15, further comprising indicating, via the display of the device, the unlocking of the device in response to authenticating with the NFC-enabled entity. 18. The method as recited in claim 15, wherein the sensor configured to sense variances in the environment is a motion sensor, light sensor, acoustic sensor, or magnetic sensor. 19. The method as recited in claim 15, further comprising indicating, via a light-emitting diode (LED) indicator, speaker, or vibrator of the device, an initiation of the attempt to authenticate with the NFC-enabled entity. 20. The method as recited in claim 15, wherein the other processor is an application processor or a digital-signal processor of the device. | This document describes techniques ( 400, 500, 600 ) and apparatuses ( 100, 700 ) for implementing sensor-based near-field communication (NFC) authentication. These techniques ( 400, 500, 600 ) and apparatuses ( 100, 700 ) enable a computing device ( 102 ) to detect, in a low-power state, environmental variances indicating proximity with an NFC-enabled device ( 104 ) with which to authenticate. In some embodiments, various components of a computing device ( 102 ) in a sleep state are activated to process environmental variance(s), perform authentication operations, and/or an indicate initiation of authentication operations to a user.1. A method comprising:
sensing, via a lower-power processor of a device that is in a sleep state, an environmental variance indicating proximity with a near-field communication-enabled (NFC-enabled) entity, the lower-power processor not capable of authenticating the NFC-enabled entity; activating, responsive to detecting the environmental variance via the lower-power processor, a higher-power processor of the device that is capable of authenticating the NFC-enabled entity, the higher-power processor different than the lower-power processor; receiving, via a near-field communication (NFC) interface of the device, authentication information from the NFC-enabled entity; and authenticating, via the higher-power processor and based on authentication information, the NFC-enabled entity effective to wake the device from the sleep state. 2. The method as recited in claim 1, wherein the environmental variance is one of motion, light, sound, or a change in magnetic field strength. 3. The method as recited in claim 1, wherein the lower-power processor is not capable of communicating via the NFC interface of the device. 4. The method as recited in claim 1 wherein, prior to detecting the environmental variance, the NFC interface is in a sleep state, and further comprising, prior to receiving the authentication information, activating the NFC interface to enable communication with the NFC-enabled entity. 5. The method as recited in claim 1 further comprising, responsive to detecting the environmental variance, indicating an initiation of the acts of activating, receiving, or authenticating to a user of the device. 6. The method as recited in claim 4, wherein the device includes a display that is powered-down while in the sleep state, and indicating the initiation of the acts of activating, receiving, or authenticating includes powering the display of the device. 7. The method as recited in claim 4, wherein the device includes a light-emitting diode (LED) indicator, speaker, or vibrator, and indicating the initiation of the acts of activating, receiving, or authenticating includes altering a state of the LED indicator, emitting an audio alert via the speaker, or causing actuation of the vibrator. 8. The method as recited in claim 1, wherein the device is locked while in the sleep state, and further comprising, responsive to authenticating the NFC-enabled entity, unlocking the device. 9. The method as recited in claim 1, wherein the environmental variance is detected via a motion sensor, light sensor, acoustic sensor, or magnetic sensor monitored by the low-power processor when the device is in a sleep state. 10. A device comprising:
a near-field communication (NFC) transceiver configured to enable wireless communication of data; a sensor configured to detect environmental variances; a low-power processor unable to perform authentication operations and configured to monitor the sensor for a particular environmental variance indicative of prospective proximity with an NFC-enabled entity; and an application processor having a sleep state in which power of the device is conserved, an active state in which authentication operations and other functionalities of the device are implemented, and configured to:
receive, while in the sleep state, a signal from the low-power processor indicating the prospective proximity with an NFC-enabled entity;
wake, responsive to the signal, from the sleep state to the active state to implement the authentication operations;
receive, via the NFC transceiver, authentication information from the NFC-enabled entity;
attempt to authenticate with the NFC-enabled entity based on the authentication information received via the NFC transceiver; and
enable access to the other functionalities of the device responsive to successfully authenticating with the NFC-enabled entity. 11. The device as recited in claim 10, wherein the environmental variance is one of motion, light, sound, or a change in magnetic field strength. 12. The method as recited in claim 11, wherein:
the motion is associated with a gesture performable the user of the device; the light is associated with a light-emitting accessory associated with the user; the sound is a voice-command received from the user of the device; or the change is magnetic field strength is caused by a magnetic accessory associated with the user or the NFC-enabled entity. 13. The device as recited in claim 10, wherein the device includes a locked state and an unlocked state, the application processor resides in the sleep state when the device is in the locked state, and enabling access to the other functionalities of the device is effective to transition the device from the locked state to the unlocked state. 14. The device as recited in claim 13, further comprising a display and wherein the application processor is further configured to indicate, via the display, an initiation of the authentication operations, the locked state of the device, or the unlocked state of the device. 15. A method, comprising:
monitoring, via a low-power processor of a device in a locked state, a sensor configured to sense variances in an environment of a device; detecting, responsive to a particular environmental variance, a near-field communication-enabled (NFC-enabled) entity with which to authenticate; waking, responsive to the proximity of the NFC-enabled entity, another processor of the device from a sleep state to authenticate with the NFC-enabled entity; receiving, via a near-field communication (NFC) interface of the device, authentication information from the NFC-enabled entity; attempting, via the other processor and based on the authentication information, to authenticate with the NFC-enabled entity; and
unlocking the device responsive to authenticating with the NFC-enabled entity; or
returning the other processor to the sleep state responsive to not authenticating with the NFC-enabled entity. 16. The method as recited in claim 15, further comprising activating, while the device is in the locked state, a display of the device to indicate an initiation of the attempt to authenticate with the NFC-enabled entity. 17. The method as recited in claim 15, further comprising indicating, via the display of the device, the unlocking of the device in response to authenticating with the NFC-enabled entity. 18. The method as recited in claim 15, wherein the sensor configured to sense variances in the environment is a motion sensor, light sensor, acoustic sensor, or magnetic sensor. 19. The method as recited in claim 15, further comprising indicating, via a light-emitting diode (LED) indicator, speaker, or vibrator of the device, an initiation of the attempt to authenticate with the NFC-enabled entity. 20. The method as recited in claim 15, wherein the other processor is an application processor or a digital-signal processor of the device. | 2,100 |
4,783 | 14,919,257 | 2,196 | Dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize physical the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies. | 1-10. (canceled) 11. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy defined by the system administrator using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts; and optimizing the physical hosts in the order of the ordered list. 12. The method of claim 11 wherein providing to the optimizer the ordered list of physical hosts further comprises:
creating a list of the physical hosts using the current conditions and the at least one ordering policy;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of physical hosts. 13. The method of claim 11 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 14. (canceled) 15. The method of claim 11 wherein the at least one ordering policy is a fixed host priority sequence. 16. The method of claim 11 wherein the at least one ordering policy is a dynamic ordering policy that indicates a host priority based on at least one host condition. 17. The method of claim 16 wherein the dynamic ordering policy is an expression that indicates a host priority based on the at least one host condition. 18. The method of claim 11 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list. 19. The method of claim 11 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host. 20. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts comprising:
creating a list of the physical hosts using the current conditions and the ordering policies;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of hosts;
optimizing the physical hosts with the ordered list by moving a virtual machine from a first physical host to a second physical host; and wherein the at least one ordering policy is a fixed host priority sequence. 21. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting a plurality of ordering policies defined by a system administrator; evaluating the plurality of ordering policies using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; and optimizing the physical hosts with the ordered list. 22. The method of claim 21 further comprising providing to an optimizer the ordered list of physical hosts that indicates the order for optimizing the plurality of physical hosts comprising:
creating a list of the physical hosts using the current conditions and the plurality of ordering policies;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of physical hosts. 23. The method of claim 21 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 24. The method of claim 21 further comprising allowing a system administrator to define the plurality of ordering policies with a user interface. 25. The method of claim 21 wherein the plurality of ordering policies includes a fixed host priority sequence. 26. The method of claim 21 wherein the plurality of ordering policies includes a dynamic ordering policy that indicates a host priority based on at least one host condition. 27. The method of claim 26 wherein the dynamic ordering policy is an expression that indicates the host priority based on the at least one host condition. 28. The method of claim 21 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list. 29. The method of claim 21 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host. | Dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize physical the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies.1-10. (canceled) 11. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy defined by the system administrator using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts; and optimizing the physical hosts in the order of the ordered list. 12. The method of claim 11 wherein providing to the optimizer the ordered list of physical hosts further comprises:
creating a list of the physical hosts using the current conditions and the at least one ordering policy;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of physical hosts. 13. The method of claim 11 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 14. (canceled) 15. The method of claim 11 wherein the at least one ordering policy is a fixed host priority sequence. 16. The method of claim 11 wherein the at least one ordering policy is a dynamic ordering policy that indicates a host priority based on at least one host condition. 17. The method of claim 16 wherein the dynamic ordering policy is an expression that indicates a host priority based on the at least one host condition. 18. The method of claim 11 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list. 19. The method of claim 11 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host. 20. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts comprising:
creating a list of the physical hosts using the current conditions and the ordering policies;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of hosts;
optimizing the physical hosts with the ordered list by moving a virtual machine from a first physical host to a second physical host; and wherein the at least one ordering policy is a fixed host priority sequence. 21. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising:
getting current conditions of the computer system; getting a plurality of ordering policies defined by a system administrator; evaluating the plurality of ordering policies using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; and optimizing the physical hosts with the ordered list. 22. The method of claim 21 further comprising providing to an optimizer the ordered list of physical hosts that indicates the order for optimizing the plurality of physical hosts comprising:
creating a list of the physical hosts using the current conditions and the plurality of ordering policies;
further ordering the list of hosts based on a static ordering policy; and
returning the ordered list of physical hosts. 23. The method of claim 21 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment. 24. The method of claim 21 further comprising allowing a system administrator to define the plurality of ordering policies with a user interface. 25. The method of claim 21 wherein the plurality of ordering policies includes a fixed host priority sequence. 26. The method of claim 21 wherein the plurality of ordering policies includes a dynamic ordering policy that indicates a host priority based on at least one host condition. 27. The method of claim 26 wherein the dynamic ordering policy is an expression that indicates the host priority based on the at least one host condition. 28. The method of claim 21 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list. 29. The method of claim 21 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host. | 2,100 |
4,784 | 13,659,767 | 2,171 | A system and method for employing a user interface to facilitate user access to books. The example method includes displaying a band of plural adjacent tiles, wherein each tile represents a book or collection of books, and wherein the band is scrollable in response to a specific user input; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile according to a recency of use of a book associated with each tile. In a more specific embodiment, the method further includes displaying content associated with a book in response to user selection of a tile associated therewith, wherein the content pertains to a most recently viewed portion of the book. A menu activatable via the band may enable access to recommendations of content based on content present in the band of plural adjacent tiles; access a library of books, and so on. | 1. A method for accessing books, the method comprising the following acts performed by an electronic computing device:
displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. 2. The method of claim 1, further including displaying content associated with a book in response to user selection of a tile associated therewith, wherein the content pertains to a most recently viewed portion of the book. 3. The method of claim 1, further including presenting a first menu pertaining to the band in response to a first user input applied to a header or other region about the band. 4. The method of claim 3, wherein the first menu includes one or more user options for performing one or more actions applicable to one or more of the tiles of the band and one or more books associated therewith. 5. The method of claim 4, wherein the one or more user options include a user option to access one or more recommendations of content based on content present in the band of plural adjacent tiles. 6. The method of claim 4, wherein the menu includes a transparent background such that the menu appears to be overlaid upon a background wallpaper of the user interface. 7. The method of claim 4, wherein the one or more user options include an option to access a library of books. 8. The method of claim 1, further including providing a user option to select a tile of the band, resulting in a display of content associated with the tile in response thereto. (this selection may be performed by tapping on the books header of the global menu—immediately transfers user to the most recently read content) 9. The method of claim 8, wherein the content associated with the tile includes a page of an electronic book corresponding to a most recently user accessed page of the book. 10. The method of claim 8, further including, in response to the selection of a tile of the band, displaying an enlarged representation of the selected tile when a book associated with selected tile has not yet been accessed. 11. The method of claim 10, wherein the enlarged representation of the selected tile includes a display of cover art pertaining to the book or content accessible via the enlarged tile. 12. The method of claim 11, further including providing a user option to select the enlarged tile, resulting in display of most recently viewed content of the book corresponding to the enlarged tile. 13. The method of claim 8, further including providing a user option to navigate pages in the electronic book via one or more user interface controls positioned adjacent to a display of content of the book. 14. The method of claim 13, further including providing a user option to trigger audio recitation of text in the book. 15. The method of claim 8, further including, in response to selection of the tile, displaying an indication of a position in the book at which the reader is being returned to and displaying book content corresponding to the indicated position. 16. The method of claim 15, wherein the indication of a position includes an indication of a page number. 17. The method of claim 15, wherein the indication of a position includes an indication of a chapter. 18. The method of claim 1, wherein one or more tiles of the band of plural adjacent tiles represents a group of user readable content. 19. An apparatus comprising:
a digital processor coupled to a display and to a processor-readable storage device, wherein the processor-readable storage device includes one or more instructions executable by the digital processor to perform the following acts: displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. 20. A processor-readable storage device including instructions executable by a digital processor, the processor-readable storage device including one or more instructions for:
displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. | A system and method for employing a user interface to facilitate user access to books. The example method includes displaying a band of plural adjacent tiles, wherein each tile represents a book or collection of books, and wherein the band is scrollable in response to a specific user input; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile according to a recency of use of a book associated with each tile. In a more specific embodiment, the method further includes displaying content associated with a book in response to user selection of a tile associated therewith, wherein the content pertains to a most recently viewed portion of the book. A menu activatable via the band may enable access to recommendations of content based on content present in the band of plural adjacent tiles; access a library of books, and so on.1. A method for accessing books, the method comprising the following acts performed by an electronic computing device:
displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. 2. The method of claim 1, further including displaying content associated with a book in response to user selection of a tile associated therewith, wherein the content pertains to a most recently viewed portion of the book. 3. The method of claim 1, further including presenting a first menu pertaining to the band in response to a first user input applied to a header or other region about the band. 4. The method of claim 3, wherein the first menu includes one or more user options for performing one or more actions applicable to one or more of the tiles of the band and one or more books associated therewith. 5. The method of claim 4, wherein the one or more user options include a user option to access one or more recommendations of content based on content present in the band of plural adjacent tiles. 6. The method of claim 4, wherein the menu includes a transparent background such that the menu appears to be overlaid upon a background wallpaper of the user interface. 7. The method of claim 4, wherein the one or more user options include an option to access a library of books. 8. The method of claim 1, further including providing a user option to select a tile of the band, resulting in a display of content associated with the tile in response thereto. (this selection may be performed by tapping on the books header of the global menu—immediately transfers user to the most recently read content) 9. The method of claim 8, wherein the content associated with the tile includes a page of an electronic book corresponding to a most recently user accessed page of the book. 10. The method of claim 8, further including, in response to the selection of a tile of the band, displaying an enlarged representation of the selected tile when a book associated with selected tile has not yet been accessed. 11. The method of claim 10, wherein the enlarged representation of the selected tile includes a display of cover art pertaining to the book or content accessible via the enlarged tile. 12. The method of claim 11, further including providing a user option to select the enlarged tile, resulting in display of most recently viewed content of the book corresponding to the enlarged tile. 13. The method of claim 8, further including providing a user option to navigate pages in the electronic book via one or more user interface controls positioned adjacent to a display of content of the book. 14. The method of claim 13, further including providing a user option to trigger audio recitation of text in the book. 15. The method of claim 8, further including, in response to selection of the tile, displaying an indication of a position in the book at which the reader is being returned to and displaying book content corresponding to the indicated position. 16. The method of claim 15, wherein the indication of a position includes an indication of a page number. 17. The method of claim 15, wherein the indication of a position includes an indication of a chapter. 18. The method of claim 1, wherein one or more tiles of the band of plural adjacent tiles represents a group of user readable content. 19. An apparatus comprising:
a digital processor coupled to a display and to a processor-readable storage device, wherein the processor-readable storage device includes one or more instructions executable by the digital processor to perform the following acts: displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. 20. A processor-readable storage device including instructions executable by a digital processor, the processor-readable storage device including one or more instructions for:
displaying a band of plural adjacent tiles, wherein each tile represents one or more books; accepting a signal from a user input device to scroll the band in a direction; and arranging adjacent tiles based on a sorting rule, wherein the sorting rule includes arranging each tile in the band in accordance with a time of downloading and a time of use of a book associated with each tile in the band. | 2,100 |
4,785 | 14,565,112 | 2,159 | This disclosure relates to systems and methods that include an electronic database related to members in a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time. A processor, coupled to the electronic database and the network interface, is configured to obtain an optimization criterion based on at least two constraints related to interaction of members in the social network, determine proposed interaction values based on the data, each proposed interaction value corresponding to pairs of members, the proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member, modify the new member proposed interaction value based on an adjustment factor, and provide proposed interactions based the interaction values. | 1. A method, comprising:
obtaining, with a processor, an optimization criterion based on at least two constraints related to interaction of members of a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time; determining, with the processor, a plurality of proposed interaction values based on data stored in an electronic database, the data being indicative of at least some of profile data of members of a social network, a social graph indicative of connections between the members, and of activities of the members in the social network, each individual one of the plurality of proposed interaction values corresponding to between one of a plurality of pairs of members, the plurality of proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member; modifying, with the processor, the new member proposed interaction value based on an adjustment factor; and providing, with the processor, to at least some of the user devices via the network interface, proposed interactions based on the new member proposed interaction value as modified and the proposed interaction value. 2. The method of claim 1, wherein one of the at least two constraints is a connection in the social network between the established member and the new member. 3. The method of claim 2, wherein another one of the at least two constraints is a connection between any of the members of the social network. 4. The method of claim 3, wherein the optimization criterion is to increase new connections between new members of the social network and all members of the social network. 5. The method of claim 4, wherein the optimization criterion is measured over a predetermined period of time. 6. The method of claim 1, wherein providing the proposed interactions includes providing the proposed interactions in an order according to the proposed interaction value as modified and the proposed interaction value. 7. The method of claim 1, the providing includes providing a predetermined number of proposed interactions and further comprising selecting the predetermined number of proposed interactions based, at least in part, on the new member proposed interaction value and the proposed interaction values. 8. The method of claim 7, wherein selecting the predetermined number of proposed interactions includes selecting the highest predetermined number of the new member proposed interaction value and the proposed interaction values. 9. The method of claim 1, wherein the adjustment factor includes a constant selectable by the processor to at least partially provide the operating condition. 10. The method of claim 9, wherein the adjustment factor further includes an adjustment score based, at least in part, on a degree of separation between the new member and the established member. 11. A computer readable medium comprising instructions that, when executed on a processor, cause the processor to implement operations comprising:
obtaining, with a processor, an optimization criterion based on at least two constraints related to interaction of members of a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time; determining, with the processor, a plurality of proposed interaction values based on data stored in an electronic database, the data being indicative of at least some of profile data of members of a social network, a social graph indicative of connections between the members, and of activities of the members in the social network, each individual one of the plurality of proposed interaction values corresponding to between one of a plurality of pairs of members, the plurality of proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member; modifying, with the processor, the new member proposed interaction value based on an adjustment factor; and providing, with the processor, to at least some of the user devices via the network interface, proposed interactions based on the new member proposed interaction value as modified and the proposed interaction value. 12. The computer readable medium of claim 11, wherein one of the at least two constraints is a connection in the social network between the established member and the new member. 13. The computer readable medium of claim 12, wherein another one of the at least two constraints is a connection between any of the members of the social network. 14. The computer readable medium of claim 13, wherein the optimization criterion is to increase new connections between new members of the social network and all members of the social network. 15. The computer readable medium of claim 14, wherein the optimization criterion is measured over a predetermined period of time. 16. The computer readable medium of claim 11, wherein providing the proposed interactions includes providing the proposed interactions in an order according to the proposed interaction value as modified and the proposed interaction value. 17. The computer readable medium of claim 11, the providing includes providing a predetermined number of proposed interactions and further comprising selecting the predetermined number of proposed interactions based, at least in part, on the new member proposed interaction value and the proposed interaction values. 18. The computer readable medium of claim 17, wherein selecting the predetermined number of proposed interactions includes selecting the highest predetermined number of the new member proposed interaction value and the proposed interaction values. 19. The computer readable medium of claim 11, wherein the adjustment factor includes a constant selectable by the processor to at least partially provide the operating condition. 20. The computer readable medium of claim 19, wherein the adjustment factor further includes an adjustment score based, at least in part, on a degree of separation between the new member and the established member. | This disclosure relates to systems and methods that include an electronic database related to members in a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time. A processor, coupled to the electronic database and the network interface, is configured to obtain an optimization criterion based on at least two constraints related to interaction of members in the social network, determine proposed interaction values based on the data, each proposed interaction value corresponding to pairs of members, the proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member, modify the new member proposed interaction value based on an adjustment factor, and provide proposed interactions based the interaction values.1. A method, comprising:
obtaining, with a processor, an optimization criterion based on at least two constraints related to interaction of members of a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time; determining, with the processor, a plurality of proposed interaction values based on data stored in an electronic database, the data being indicative of at least some of profile data of members of a social network, a social graph indicative of connections between the members, and of activities of the members in the social network, each individual one of the plurality of proposed interaction values corresponding to between one of a plurality of pairs of members, the plurality of proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member; modifying, with the processor, the new member proposed interaction value based on an adjustment factor; and providing, with the processor, to at least some of the user devices via the network interface, proposed interactions based on the new member proposed interaction value as modified and the proposed interaction value. 2. The method of claim 1, wherein one of the at least two constraints is a connection in the social network between the established member and the new member. 3. The method of claim 2, wherein another one of the at least two constraints is a connection between any of the members of the social network. 4. The method of claim 3, wherein the optimization criterion is to increase new connections between new members of the social network and all members of the social network. 5. The method of claim 4, wherein the optimization criterion is measured over a predetermined period of time. 6. The method of claim 1, wherein providing the proposed interactions includes providing the proposed interactions in an order according to the proposed interaction value as modified and the proposed interaction value. 7. The method of claim 1, the providing includes providing a predetermined number of proposed interactions and further comprising selecting the predetermined number of proposed interactions based, at least in part, on the new member proposed interaction value and the proposed interaction values. 8. The method of claim 7, wherein selecting the predetermined number of proposed interactions includes selecting the highest predetermined number of the new member proposed interaction value and the proposed interaction values. 9. The method of claim 1, wherein the adjustment factor includes a constant selectable by the processor to at least partially provide the operating condition. 10. The method of claim 9, wherein the adjustment factor further includes an adjustment score based, at least in part, on a degree of separation between the new member and the established member. 11. A computer readable medium comprising instructions that, when executed on a processor, cause the processor to implement operations comprising:
obtaining, with a processor, an optimization criterion based on at least two constraints related to interaction of members of a social network, the members including new members who have been members of the social network less than a predetermined time and established members who have been members of the social network greater than the predetermined time; determining, with the processor, a plurality of proposed interaction values based on data stored in an electronic database, the data being indicative of at least some of profile data of members of a social network, a social graph indicative of connections between the members, and of activities of the members in the social network, each individual one of the plurality of proposed interaction values corresponding to between one of a plurality of pairs of members, the plurality of proposed interaction values including a new member proposed interaction value between at least one established member and at least one new member; modifying, with the processor, the new member proposed interaction value based on an adjustment factor; and providing, with the processor, to at least some of the user devices via the network interface, proposed interactions based on the new member proposed interaction value as modified and the proposed interaction value. 12. The computer readable medium of claim 11, wherein one of the at least two constraints is a connection in the social network between the established member and the new member. 13. The computer readable medium of claim 12, wherein another one of the at least two constraints is a connection between any of the members of the social network. 14. The computer readable medium of claim 13, wherein the optimization criterion is to increase new connections between new members of the social network and all members of the social network. 15. The computer readable medium of claim 14, wherein the optimization criterion is measured over a predetermined period of time. 16. The computer readable medium of claim 11, wherein providing the proposed interactions includes providing the proposed interactions in an order according to the proposed interaction value as modified and the proposed interaction value. 17. The computer readable medium of claim 11, the providing includes providing a predetermined number of proposed interactions and further comprising selecting the predetermined number of proposed interactions based, at least in part, on the new member proposed interaction value and the proposed interaction values. 18. The computer readable medium of claim 17, wherein selecting the predetermined number of proposed interactions includes selecting the highest predetermined number of the new member proposed interaction value and the proposed interaction values. 19. The computer readable medium of claim 11, wherein the adjustment factor includes a constant selectable by the processor to at least partially provide the operating condition. 20. The computer readable medium of claim 19, wherein the adjustment factor further includes an adjustment score based, at least in part, on a degree of separation between the new member and the established member. | 2,100 |
4,786 | 13,566,690 | 2,177 | Techniques are provided that generated interactive and dynamic multimedia objects (MMOs) with HIP capabilities which may be used in online advertising, brand engagement, online promotions, surveys, security, and user-defined security. Techniques combining interactive multimedia objects with HIP capabilities assist advertisers and websites by creating an effective impression of any multimedia object on a user as well as providing security for a website by providing a more natural user interaction and ease of use while maintaining security. A wide variety of workflows and features by which users engage with such multimedia objects are provided. | 1. An apparatus for generating and serving a multimedia object with human interaction proof capabilities on a webpage, comprising:
a widget embedded in a webpage, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; software that is sending the request, when the request is sent; interactivity type requested comprising any of click, drag, draw, and type; interactivity style requested comprising two multimedia objects in one widget wherein interactivity is provide on one but not on the other; the size of widget; the size of the image or multimedia object that is to be served; additional publisher or webpage related information comprising any of: information context, language of the webpage, industry category of the webpage, and gps location for gps enabled devices; and a theme of the multimedia object;
a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website on which the webpage resides or the webpage is legitimate;
when the user on the website or the webpage is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises any of: a bundled advertisement, personal images, corporate internal branding images/video/texts, house advertisement, promotion information, and associated challenges wherein the challenge involves any part of said multimedia object;
send the matched multimedia object along with the challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how long the multimedia object was on active screen, how many times the interaction was performed, how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; device and software from where the response and informational data arrived; and duration of any interaction;
when human interactive proof is enabled in the response, compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; when human interactive proof is not enabled, validation is performed but validation notification is not sent; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object. 2. The apparatus of claim 1, wherein said stored multimedia objects are on and served by at least one external ad network owned or controlled by a third party multimedia object provider. 3. The apparatus of claim 2, wherein the generated analytics are sent to said ad network or third party analytics collector. 4. The apparatus of claim 1, wherein said multimedia object is configured to be turned on and off for the challenge in a user workflow. 5. The apparatus of claim 1, wherein said challenge is part of a financial transaction involving coupon codes or rewards points of a vendor or common reward points for multiple vendors and wherein when said response is successful, said multimedia object server is configured to send related informational data to a financial system of said vendor. 6. The apparatus of claim 1, wherein said challenge is user-defined. 7. The apparatus of claim 1, wherein said multimedia object server comprises and uses methods to detect misuse of said multimedia object. 8. The apparatus of claim 1, wherein said multimedia object server is configured to automatically and dynamically generate said bundled advertisement and challenge by applying methods which are random and independent of said multimedia object. 9. The apparatus of claim 1, wherein said bundled advertisement and challenge is any of: motion-based; gravity-based; geo-location-based; and direction-based. 10. The apparatus of claim 1, wherein said serving of said multimedia object is based on Artificial Intelligence (AI) based HIP delivery including based on suspicious or friendly HIP service caller zones and wherein the level of toughness of challenges are managed respectively. 11. The apparatus of claim 1, wherein user interactivity on said multimedia object is shared via social networks. 12. The apparatus of claim 1, wherein said multimedia object is bookmarked for future reference. 13. The apparatus of claim 1, wherein said multimedia object or said challenge is voice based. 14. The apparatus of claim 1, wherein said challenge is subscription based. 15. The apparatus of claim 1, wherein the multimedia object is configured to allow redirection to the advertisement webpage or website and analytics collected of this action. 16. The apparatus of claim 1, wherein said multimedia object is configured for near field communications (NFC) and radio-frequency identification (RFID)-based devices for HIP capabilities. 17. The apparatus of claim 1, wherein said multimedia object server causes any of:
said challenge and response to be presented outside said multimedia object for HIP; said challenge to be presented inside the multimedia object and said response to be presented outside the multimedia object; and said challenge and a particular message to be inside said multimedia object and said response outside the MMO. 18. A computer-implemented method for generating and serving a multimedia object with human interaction proof capabilities on a webpage or any other applications capable of accessing information using internet, comprising:
providing a widget embedded in a webpage or other applications capable of accessing information using internet, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; when the request is sent; any interactivity requested; the size of widget; the size of the image or multimedia object that is to be served; and a theme of the multimedia object; and
providing a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website or application on which the webpage/application resides or the webpage/application is legitimate;
when the website or the webpage or application is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises a bundled advertisement or marketing promotions/surveys and challenge wherein the challenge involves the advertisement;
send the matched multimedia object along with the bundled advertisement and challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; and duration of any interaction;
compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object;
wherein at least one step is performed by a processor. 19. A non-transitory computer readable medium having stored thereon a computer program for generating and serving a multimedia object with human interaction proof capabilities on a webpage, said computer program comprising a program code which, when executed by a processor, performs the steps of:
providing a widget embedded in a webpage, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; software that is sending the request, when the request is sent; interactivity type requested comprising any of click, drag, draw, and type; interactivity style requested comprising two multimedia objects in one widget wherein interactivity is provide on one but not on the other; the size of widget; the size of the image or multimedia object that is to be served; additional publisher or webpage related information comprising any of: information context, language of the webpage, industry category of the webpage, and gps location for gps enabled devices; and a theme of the multimedia object;
providing a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website on which the webpage resides or the webpage is legitimate;
when the user on the website or the webpage is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises any of: a bundled advertisement, personal images, corporate internal branding images/video/texts, house advertisement, promotion information, and associated challenges wherein the challenge involves any part of said multimedia object;
send the matched multimedia object along with the challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how long the multimedia object was on active screen, how many times the interaction was performed, how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; device and software from where the response and informational data arrived; and duration of any interaction;
when human interactive proof is enabled in the response, compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; when human interactive proof is not enabled, validation is performed but validation notification is not sent; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object. | Techniques are provided that generated interactive and dynamic multimedia objects (MMOs) with HIP capabilities which may be used in online advertising, brand engagement, online promotions, surveys, security, and user-defined security. Techniques combining interactive multimedia objects with HIP capabilities assist advertisers and websites by creating an effective impression of any multimedia object on a user as well as providing security for a website by providing a more natural user interaction and ease of use while maintaining security. A wide variety of workflows and features by which users engage with such multimedia objects are provided.1. An apparatus for generating and serving a multimedia object with human interaction proof capabilities on a webpage, comprising:
a widget embedded in a webpage, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; software that is sending the request, when the request is sent; interactivity type requested comprising any of click, drag, draw, and type; interactivity style requested comprising two multimedia objects in one widget wherein interactivity is provide on one but not on the other; the size of widget; the size of the image or multimedia object that is to be served; additional publisher or webpage related information comprising any of: information context, language of the webpage, industry category of the webpage, and gps location for gps enabled devices; and a theme of the multimedia object;
a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website on which the webpage resides or the webpage is legitimate;
when the user on the website or the webpage is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises any of: a bundled advertisement, personal images, corporate internal branding images/video/texts, house advertisement, promotion information, and associated challenges wherein the challenge involves any part of said multimedia object;
send the matched multimedia object along with the challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how long the multimedia object was on active screen, how many times the interaction was performed, how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; device and software from where the response and informational data arrived; and duration of any interaction;
when human interactive proof is enabled in the response, compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; when human interactive proof is not enabled, validation is performed but validation notification is not sent; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object. 2. The apparatus of claim 1, wherein said stored multimedia objects are on and served by at least one external ad network owned or controlled by a third party multimedia object provider. 3. The apparatus of claim 2, wherein the generated analytics are sent to said ad network or third party analytics collector. 4. The apparatus of claim 1, wherein said multimedia object is configured to be turned on and off for the challenge in a user workflow. 5. The apparatus of claim 1, wherein said challenge is part of a financial transaction involving coupon codes or rewards points of a vendor or common reward points for multiple vendors and wherein when said response is successful, said multimedia object server is configured to send related informational data to a financial system of said vendor. 6. The apparatus of claim 1, wherein said challenge is user-defined. 7. The apparatus of claim 1, wherein said multimedia object server comprises and uses methods to detect misuse of said multimedia object. 8. The apparatus of claim 1, wherein said multimedia object server is configured to automatically and dynamically generate said bundled advertisement and challenge by applying methods which are random and independent of said multimedia object. 9. The apparatus of claim 1, wherein said bundled advertisement and challenge is any of: motion-based; gravity-based; geo-location-based; and direction-based. 10. The apparatus of claim 1, wherein said serving of said multimedia object is based on Artificial Intelligence (AI) based HIP delivery including based on suspicious or friendly HIP service caller zones and wherein the level of toughness of challenges are managed respectively. 11. The apparatus of claim 1, wherein user interactivity on said multimedia object is shared via social networks. 12. The apparatus of claim 1, wherein said multimedia object is bookmarked for future reference. 13. The apparatus of claim 1, wherein said multimedia object or said challenge is voice based. 14. The apparatus of claim 1, wherein said challenge is subscription based. 15. The apparatus of claim 1, wherein the multimedia object is configured to allow redirection to the advertisement webpage or website and analytics collected of this action. 16. The apparatus of claim 1, wherein said multimedia object is configured for near field communications (NFC) and radio-frequency identification (RFID)-based devices for HIP capabilities. 17. The apparatus of claim 1, wherein said multimedia object server causes any of:
said challenge and response to be presented outside said multimedia object for HIP; said challenge to be presented inside the multimedia object and said response to be presented outside the multimedia object; and said challenge and a particular message to be inside said multimedia object and said response outside the MMO. 18. A computer-implemented method for generating and serving a multimedia object with human interaction proof capabilities on a webpage or any other applications capable of accessing information using internet, comprising:
providing a widget embedded in a webpage or other applications capable of accessing information using internet, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; when the request is sent; any interactivity requested; the size of widget; the size of the image or multimedia object that is to be served; and a theme of the multimedia object; and
providing a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website or application on which the webpage/application resides or the webpage/application is legitimate;
when the website or the webpage or application is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises a bundled advertisement or marketing promotions/surveys and challenge wherein the challenge involves the advertisement;
send the matched multimedia object along with the bundled advertisement and challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; and duration of any interaction;
compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object;
wherein at least one step is performed by a processor. 19. A non-transitory computer readable medium having stored thereon a computer program for generating and serving a multimedia object with human interaction proof capabilities on a webpage, said computer program comprising a program code which, when executed by a processor, performs the steps of:
providing a widget embedded in a webpage, said widget configured to:
send a request for a multimedia object and send parameters along with said request, wherein said parameters comprise any of: data about the device that is sending the request; software that is sending the request, when the request is sent; interactivity type requested comprising any of click, drag, draw, and type; interactivity style requested comprising two multimedia objects in one widget wherein interactivity is provide on one but not on the other; the size of widget; the size of the image or multimedia object that is to be served; additional publisher or webpage related information comprising any of: information context, language of the webpage, industry category of the webpage, and gps location for gps enabled devices; and a theme of the multimedia object;
providing a multimedia object server configured to:
receive the request and the parameters from the widget;
determine whether the website on which the webpage resides or the webpage is legitimate;
when the user on the website or the webpage is determined to be legitimate:
parse the received parameters and based on said parsed parameters use a matching algorithm to compare the parsed parameters with parameters of stored multimedia objects to determine a matching multimedia object, wherein each stored multimedia object comprises any of: a bundled advertisement, personal images, corporate internal branding images/video/texts, house advertisement, promotion information, and associated challenges wherein the challenge involves any part of said multimedia object;
send the matched multimedia object along with the challenge;
receive a response to the challenge and response-related informational data, said response-related informational data comprising any of: what was clicked on; how long the multimedia object was on active screen, how many times the interaction was performed, how the multimedia object was interacted with; the question of the challenge; the current time; the IP from where the response and informational data arrived; device and software from where the response and informational data arrived; and duration of any interaction;
when human interactive proof is enabled in the response, compare the received response against validated responses and send a success notification or a failure notification to said webpage based on the comparison; when human interactive proof is not enabled, validation is performed but validation notification is not sent; and
use said response-related informational data to generate analytics about any of: the multimedia object, the challenge, the webpage or website, and the interaction with the multimedia object. | 2,100 |
4,787 | 11,856,109 | 2,123 | A method and system for object detection using a probabilistic boosting cascade tree (PBCT) is disclosed. A PBCT is a machine learning based classifier having a structure that is driven by training data and determined during the training process without user input. In a PBCT training method, for each node in the PBCT, a classifier is trained for the node based on training data received at the node. The performance of the classifier trained for the node is then evaluated based on the training data. Based on the performance of the classifier, the node is set to either a cascade node or a tree node. If the performance indicates that the data is relatively easy to classify, the node can be set as a cascade node. If the performance indicates that the data is relatively difficult to classify, the node can be set as a tree node. The trained PBCT can then be used to detect objects or classify data. For example, a trained PBCT can be used to detect lymph nodes in CT volume data. | 1. A method for training a probabilistic boosting cascade tree having a plurality of nodes, comprising:
(a) receiving training data at a node; (b) training a classifier for the node based on said training data; (c) evaluating a performance of the classifier for the node based on the training data; (d) setting the node as one of a cascade node and a tree node based the performance of the classifier for the node. 2. The method of claim 1, wherein step (b) comprises:
training a strong classifier for the node based on said training data. 3. The method of claim 1, wherein step (c) comprises:
calculating a detection rate and a false positive rate of the classifier for the node based on the training data. 4. The method of claim 3, wherein step (d) comprises:
if the detection rate is greater than or equal to a first threshold and the false positive rate is less than or equal to a second threshold, setting the node as a cascade node; and if the detection rate is less than the first threshold or the false positive rate is greater than the second threshold, setting the node as a tree node. 5. The method of claim 1, further comprising:
if the node is set as a cascade node, generating one child node for the node, said one child node for further classifying training data classified as positive by said classifier; and if the node is set as a tree node, generating first and second child nodes for the node, said first child node for further classifying training data classified as positive by said classifier and said second child node for further classifying training data classified as negative by said classifier. 6. The method of claim 1, wherein said training data comprises CT volume data including a plurality of annotated positive samples and a plurality of annotated negative samples, wherein said positive samples are voxels in the CT volume corresponding to anatomical objects and said negative samples are voxels in the CT volume not corresponding to said anatomical objects. 7. The method of claim 6, wherein said anatomical objects are lymph nodes. 8. The method of claim 1, further comprising:
(e) repeating steps (a)-(d) for each node is said probabilistic boosting cascade tree. 9. The method of claim 8, further comprising:
processing an input CT volume through each node in said probabilistic boosting cascade tree to detect anatomical objects in said input CT volume. 10. A method for detecting objects in CT volume data using a probabilistic boosting cascade tree (PBCT), comprising:
receiving an input CT volume; processing said input CT volume using a PBCT having a plurality of nodes to detect one or more objects in said input CT volume, wherein said PBCT comprises at least one tree node and at least one cascade node. 11. The method of claim 10, wherein said PBCT comprises at least one cascade node that is a child node to a tree node. 12. The method of claim 10, wherein said step of processing said input CT volume using a PBCT comprises:
determining for each of a plurality of voxels in said input CT volume, whether that voxel is part of said one or more objects. 13. The method of claim 10, wherein said objects are lymph nodes. 14. The method of claim 10, further comprising:
removing voxels not within a certain intensity range corresponding to said objects from said input CT volume prior to said processing step. 15. A probabilistic boosting cascade tree stored in a computer readable medium for detecting an object in a set of data, comprising:
a plurality of cascade nodes, each comprising a classifier for classifying data received at the node as positive or negative, and each having one child node for further classifying the positively classified data; and a plurality of tree nodes, each comprising a classifier for classifying data received at the node as positive or negative, and each having a first child node for further classifying the positively classified data and a second child node for further classifying the negatively classified data. 16. The probabilistic boosting cascade tree of claim 15, wherein at least one of said plurality of cascade nodes is a child node to one of said plurality of tree nodes. 17. The probabilistic boosting cascade tree of claim 15, wherein a number of the plurality of cascade nodes and the plurality of tree nodes and relative locations of the plurality of cascade nodes and the plurality of tree nodes are determined based on training data used to train the classifiers of the cascade node and the tree nodes. 18. The probabilistic boosting cascade tree of claim 17, wherein the number of the plurality of cascade nodes and the plurality of tree nodes and the relative locations of the plurality of cascade nodes and the plurality of tree nodes are determined automatically based on the training data without user input. 19. An apparatus for training a probabilistic boosting cascade tree having a plurality of nodes, comprising:
means for receiving training data at a node; means for training a classifier for the node based on said training data, means for evaluating a performance of the classifier for the node based on the training data; means for setting the node as one of a cascade node and a tree node based the performance of the classifier for the node. 20. The apparatus of claim 28, wherein said means for evaluating a performance of the classifier comprises:
means for calculating a detection rate and a false positive rate of the classifier for the node based on the training data. 21. The apparatus of claim 20, wherein said means for setting the node as one of a cascade node and a tree node comprises:
means for setting the node as a cascade node if the detection rate is greater than or equal to a first threshold and the false positive rate is less than or equal to a second threshold; and means for setting the node as a tree node if the detection rate is less than the first threshold or the false positive rate is greater than the second threshold. 22. The apparatus of claim 19, further comprising:
means for generating one child node for the node if the node is set as a cascade node; and means for generating first and second child nodes for the node if the node is set as a tree node. 23. The apparatus of claim 19, further comprising:
means for processing an input CT volume through each node in said probabilistic boosting cascade tree to detect anatomical objects in said input CT volume. 24. An apparatus for detecting objects in CT volume data using a probabilistic boosting cascade tree (PBCT), comprising:
means for receiving an input CT volume; means for processing said input CT volume using a PBCT having a plurality of nodes to detect one or more objects in said input CT volume, wherein said PBCT comprises at least one tree node and at least one cascade node. 25. The apparatus of claim 24, wherein said PBCT comprises at least one cascade node that is a child node to a tree node. | A method and system for object detection using a probabilistic boosting cascade tree (PBCT) is disclosed. A PBCT is a machine learning based classifier having a structure that is driven by training data and determined during the training process without user input. In a PBCT training method, for each node in the PBCT, a classifier is trained for the node based on training data received at the node. The performance of the classifier trained for the node is then evaluated based on the training data. Based on the performance of the classifier, the node is set to either a cascade node or a tree node. If the performance indicates that the data is relatively easy to classify, the node can be set as a cascade node. If the performance indicates that the data is relatively difficult to classify, the node can be set as a tree node. The trained PBCT can then be used to detect objects or classify data. For example, a trained PBCT can be used to detect lymph nodes in CT volume data.1. A method for training a probabilistic boosting cascade tree having a plurality of nodes, comprising:
(a) receiving training data at a node; (b) training a classifier for the node based on said training data; (c) evaluating a performance of the classifier for the node based on the training data; (d) setting the node as one of a cascade node and a tree node based the performance of the classifier for the node. 2. The method of claim 1, wherein step (b) comprises:
training a strong classifier for the node based on said training data. 3. The method of claim 1, wherein step (c) comprises:
calculating a detection rate and a false positive rate of the classifier for the node based on the training data. 4. The method of claim 3, wherein step (d) comprises:
if the detection rate is greater than or equal to a first threshold and the false positive rate is less than or equal to a second threshold, setting the node as a cascade node; and if the detection rate is less than the first threshold or the false positive rate is greater than the second threshold, setting the node as a tree node. 5. The method of claim 1, further comprising:
if the node is set as a cascade node, generating one child node for the node, said one child node for further classifying training data classified as positive by said classifier; and if the node is set as a tree node, generating first and second child nodes for the node, said first child node for further classifying training data classified as positive by said classifier and said second child node for further classifying training data classified as negative by said classifier. 6. The method of claim 1, wherein said training data comprises CT volume data including a plurality of annotated positive samples and a plurality of annotated negative samples, wherein said positive samples are voxels in the CT volume corresponding to anatomical objects and said negative samples are voxels in the CT volume not corresponding to said anatomical objects. 7. The method of claim 6, wherein said anatomical objects are lymph nodes. 8. The method of claim 1, further comprising:
(e) repeating steps (a)-(d) for each node is said probabilistic boosting cascade tree. 9. The method of claim 8, further comprising:
processing an input CT volume through each node in said probabilistic boosting cascade tree to detect anatomical objects in said input CT volume. 10. A method for detecting objects in CT volume data using a probabilistic boosting cascade tree (PBCT), comprising:
receiving an input CT volume; processing said input CT volume using a PBCT having a plurality of nodes to detect one or more objects in said input CT volume, wherein said PBCT comprises at least one tree node and at least one cascade node. 11. The method of claim 10, wherein said PBCT comprises at least one cascade node that is a child node to a tree node. 12. The method of claim 10, wherein said step of processing said input CT volume using a PBCT comprises:
determining for each of a plurality of voxels in said input CT volume, whether that voxel is part of said one or more objects. 13. The method of claim 10, wherein said objects are lymph nodes. 14. The method of claim 10, further comprising:
removing voxels not within a certain intensity range corresponding to said objects from said input CT volume prior to said processing step. 15. A probabilistic boosting cascade tree stored in a computer readable medium for detecting an object in a set of data, comprising:
a plurality of cascade nodes, each comprising a classifier for classifying data received at the node as positive or negative, and each having one child node for further classifying the positively classified data; and a plurality of tree nodes, each comprising a classifier for classifying data received at the node as positive or negative, and each having a first child node for further classifying the positively classified data and a second child node for further classifying the negatively classified data. 16. The probabilistic boosting cascade tree of claim 15, wherein at least one of said plurality of cascade nodes is a child node to one of said plurality of tree nodes. 17. The probabilistic boosting cascade tree of claim 15, wherein a number of the plurality of cascade nodes and the plurality of tree nodes and relative locations of the plurality of cascade nodes and the plurality of tree nodes are determined based on training data used to train the classifiers of the cascade node and the tree nodes. 18. The probabilistic boosting cascade tree of claim 17, wherein the number of the plurality of cascade nodes and the plurality of tree nodes and the relative locations of the plurality of cascade nodes and the plurality of tree nodes are determined automatically based on the training data without user input. 19. An apparatus for training a probabilistic boosting cascade tree having a plurality of nodes, comprising:
means for receiving training data at a node; means for training a classifier for the node based on said training data, means for evaluating a performance of the classifier for the node based on the training data; means for setting the node as one of a cascade node and a tree node based the performance of the classifier for the node. 20. The apparatus of claim 28, wherein said means for evaluating a performance of the classifier comprises:
means for calculating a detection rate and a false positive rate of the classifier for the node based on the training data. 21. The apparatus of claim 20, wherein said means for setting the node as one of a cascade node and a tree node comprises:
means for setting the node as a cascade node if the detection rate is greater than or equal to a first threshold and the false positive rate is less than or equal to a second threshold; and means for setting the node as a tree node if the detection rate is less than the first threshold or the false positive rate is greater than the second threshold. 22. The apparatus of claim 19, further comprising:
means for generating one child node for the node if the node is set as a cascade node; and means for generating first and second child nodes for the node if the node is set as a tree node. 23. The apparatus of claim 19, further comprising:
means for processing an input CT volume through each node in said probabilistic boosting cascade tree to detect anatomical objects in said input CT volume. 24. An apparatus for detecting objects in CT volume data using a probabilistic boosting cascade tree (PBCT), comprising:
means for receiving an input CT volume; means for processing said input CT volume using a PBCT having a plurality of nodes to detect one or more objects in said input CT volume, wherein said PBCT comprises at least one tree node and at least one cascade node. 25. The apparatus of claim 24, wherein said PBCT comprises at least one cascade node that is a child node to a tree node. | 2,100 |
4,788 | 13,690,034 | 2,182 | This invention is for how to define two self-weights for continuous random variable based on sampling, how to SAC-normalize a skewed sampling distribution of a continuous random variable without changing the structure of the original measurement scale of the continuous random variable, how to infer representativeness of mathematical mean, and how to take the advantage of the two self-weights to do t-tests in a two-population comparison. | 1. The measurements of the two self-weights, convex self-weight (denoted by C{ci}) and concave self-weight (denoted by R{ri}), defined for each random sample point xi of an original continuous random variable X to describe central tendency and dispersive tendency of the point xi in a sampling distribution, as shown in the computation framework in Table 1 based on the formulas from (7) to (19). 2. The measurement of the convex self-weight (denoted by Z{zi}) defined for the convex self-weight C{ci} and the concave self-weight R{ri} of the original continuous random variable X{xi}, as shown in the computation framework in Table 2 modifies from the formulas from (7) to (19) in the claim 1. 3. The estimates of expectations defined for the original random variable X{xi} and the convex self-weight C{ci} respectively in the formulas (20) and (21) with all the self-weights defined only in the claim 1. 4. The measurements of deviations defined in the formulas (25) and (27) with all the self-weights defined only in the claim 1 for the whole distribution of the original random variable X{xi}. 5. The measurements of sampling errors defined in the formulas (28) and (30) with all the self-weights for the expectation estimate x c of the whole distribution of the original X{xi}. 6. The measurements of deviations based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and claim 11 and defined in the formulas (31), (33), (34) and (36) with all the self-weights defined only in the claim 1 for the two half-distributions of the original random variable X{xi}. 7. The measurement of an asymmetrical normal range based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (37) and (38) for the whole distribution of the original X{xi} with all the self-weights defined only in the claim 1 for the expectation estimate x c in the two half-distributions of the original random variable X{xi}. 8. The measurements of sampling errors based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (39), (41), (42) and (44) with all the self-weights defined only in the claim 1 for the expectation estimate x c in the two half-distributions of the original random variable X{xi}. 9. The measurement of an asymmetrical confidence interval based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (45) and (46) for the whole distribution of the original X{xi} with the self-weights defined only in the claim 1. 10. The SAC normalization based on the segmentation-and-combination for data manipulation with the formulas from (47) to (54), and (56) and (57) as it has been described from the sub-section 5 to the sub-section 8 in the section DETAILED DESCRIPTION and as shown in the FIG. 7, to construct two symmetrically distributed pseudo samples and a size-doubled symmetrically distributed pseudo sample based only on the expectation estimate x c with the convex self-weights claimed in the claim 1 for the original random variable X{xi}. 11. The SAC normalization based on the segmentation-and-combination” with the formulas from (47) to (53) and formula (56) as it has been described from the sub-section 5 to the sub-section 8 in the section DETAILED DESCRIPTION and as shown in the FIG. 7, to construct two symmetrically distributed pseudo samples and a size-doubled symmetrically distributed pseudo sample based on the expectation estimated in the arithmetical mean x to replace the x c in the formulas only mentioned in this claim for the original random variable X{xi}. 12. The statistical measurements for sample defined in formulas (24), (26), (29), (32), (35), (40), (43), (55) and (58) based on the claim 1 and claim 2. 13. The inference of representativeness of arithmetical mean proposed in the sub-section 9 in the section DETAILED DESCRIPTION and as shown in the FIG. 9 with the convex self-weights defined in the claim 1, comprising:
(1) A symmetry test with convex self-weighted mean and concave self-weighted mean in the formulas from (59) to (62);
(2) A symmetry test with convex self-weighted deviations of two half-distributions in the formulas from (63) to (65);
(3) A probabilistic inference for representativeness of arithmetical mean in the formula (66) with the formulas from (60) and (62) for the degree of freedom calculation;
(4) A comprehensive Chi-square test for symmetry, normality and representativeness of arithmetical mean in the formulas from (67) to (70);
(5) A linear correlation description between the convex self-weight C for the convex self-weighted mean and the convex self-weight Cm to the arithmetical mean for the original random variable X{xi}, and the convex self-weight Cm is defined in the formulas from (71) to (74). 14. The methods of plotting the statistical figures and graphics that are only related to the convex self-weights claimed in the claim 1 for the original random variable X{xi}, comprising
(1) A two-dimensional scatter plot of the original random variable X{xi} and its convex self-weight and concave self-weight in a two-dimensional space as shown in the FIG. 5 for normal distributions and in the FIG. 6 for skewed distributions;
(2) A set of two-dimensional scatter plots for describing a process of the SAC normalization based on the approach of segmentation-and-combination for data manipulation as shown in the FIG. 7;
(3) A two-dimensional scatter plot of the convex self-weight C{ci} and the convex self-weight Cm{cm,i} of the original random variable X{xi} as shown in the FIG. 8. 15. The reconstructed t-test in the four options, as described in the sub-section 10 of the section DETAILED DESCRIPTION and as shown in the FIG. 10, for comparing two populations based on sampling with the convex self-weight and the SAC normalization, comprising:
(1) The reconstructed formulas from (78) to (90) if and only if they are used in a complete t-test with any randomly variable weight obtained in any method and with/without the SAC normalization, including the self-weights defined in the claim 1 as well as in the claim 2 if the claim 2 is necessarily involved. (2) The reconstructed formulas from (91) to (93) if and only if they are used in a complete t-test without the SAC normalization and with the self-weights defined in the claim 1 as well as in the claim 2 if the claim 2 is necessarily involved. 16. Any equivalent transformation in a mathematical deduction that may lead to the same computation result(s) of any formula that is claimed in the above claims from 1 to 14 for the same real sample. | This invention is for how to define two self-weights for continuous random variable based on sampling, how to SAC-normalize a skewed sampling distribution of a continuous random variable without changing the structure of the original measurement scale of the continuous random variable, how to infer representativeness of mathematical mean, and how to take the advantage of the two self-weights to do t-tests in a two-population comparison.1. The measurements of the two self-weights, convex self-weight (denoted by C{ci}) and concave self-weight (denoted by R{ri}), defined for each random sample point xi of an original continuous random variable X to describe central tendency and dispersive tendency of the point xi in a sampling distribution, as shown in the computation framework in Table 1 based on the formulas from (7) to (19). 2. The measurement of the convex self-weight (denoted by Z{zi}) defined for the convex self-weight C{ci} and the concave self-weight R{ri} of the original continuous random variable X{xi}, as shown in the computation framework in Table 2 modifies from the formulas from (7) to (19) in the claim 1. 3. The estimates of expectations defined for the original random variable X{xi} and the convex self-weight C{ci} respectively in the formulas (20) and (21) with all the self-weights defined only in the claim 1. 4. The measurements of deviations defined in the formulas (25) and (27) with all the self-weights defined only in the claim 1 for the whole distribution of the original random variable X{xi}. 5. The measurements of sampling errors defined in the formulas (28) and (30) with all the self-weights for the expectation estimate x c of the whole distribution of the original X{xi}. 6. The measurements of deviations based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and claim 11 and defined in the formulas (31), (33), (34) and (36) with all the self-weights defined only in the claim 1 for the two half-distributions of the original random variable X{xi}. 7. The measurement of an asymmetrical normal range based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (37) and (38) for the whole distribution of the original X{xi} with all the self-weights defined only in the claim 1 for the expectation estimate x c in the two half-distributions of the original random variable X{xi}. 8. The measurements of sampling errors based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (39), (41), (42) and (44) with all the self-weights defined only in the claim 1 for the expectation estimate x c in the two half-distributions of the original random variable X{xi}. 9. The measurement of an asymmetrical confidence interval based on the approach of “segmentation-and-combination” for data manipulation that will be claimed in the following claim 10 and defined in the formulas (45) and (46) for the whole distribution of the original X{xi} with the self-weights defined only in the claim 1. 10. The SAC normalization based on the segmentation-and-combination for data manipulation with the formulas from (47) to (54), and (56) and (57) as it has been described from the sub-section 5 to the sub-section 8 in the section DETAILED DESCRIPTION and as shown in the FIG. 7, to construct two symmetrically distributed pseudo samples and a size-doubled symmetrically distributed pseudo sample based only on the expectation estimate x c with the convex self-weights claimed in the claim 1 for the original random variable X{xi}. 11. The SAC normalization based on the segmentation-and-combination” with the formulas from (47) to (53) and formula (56) as it has been described from the sub-section 5 to the sub-section 8 in the section DETAILED DESCRIPTION and as shown in the FIG. 7, to construct two symmetrically distributed pseudo samples and a size-doubled symmetrically distributed pseudo sample based on the expectation estimated in the arithmetical mean x to replace the x c in the formulas only mentioned in this claim for the original random variable X{xi}. 12. The statistical measurements for sample defined in formulas (24), (26), (29), (32), (35), (40), (43), (55) and (58) based on the claim 1 and claim 2. 13. The inference of representativeness of arithmetical mean proposed in the sub-section 9 in the section DETAILED DESCRIPTION and as shown in the FIG. 9 with the convex self-weights defined in the claim 1, comprising:
(1) A symmetry test with convex self-weighted mean and concave self-weighted mean in the formulas from (59) to (62);
(2) A symmetry test with convex self-weighted deviations of two half-distributions in the formulas from (63) to (65);
(3) A probabilistic inference for representativeness of arithmetical mean in the formula (66) with the formulas from (60) and (62) for the degree of freedom calculation;
(4) A comprehensive Chi-square test for symmetry, normality and representativeness of arithmetical mean in the formulas from (67) to (70);
(5) A linear correlation description between the convex self-weight C for the convex self-weighted mean and the convex self-weight Cm to the arithmetical mean for the original random variable X{xi}, and the convex self-weight Cm is defined in the formulas from (71) to (74). 14. The methods of plotting the statistical figures and graphics that are only related to the convex self-weights claimed in the claim 1 for the original random variable X{xi}, comprising
(1) A two-dimensional scatter plot of the original random variable X{xi} and its convex self-weight and concave self-weight in a two-dimensional space as shown in the FIG. 5 for normal distributions and in the FIG. 6 for skewed distributions;
(2) A set of two-dimensional scatter plots for describing a process of the SAC normalization based on the approach of segmentation-and-combination for data manipulation as shown in the FIG. 7;
(3) A two-dimensional scatter plot of the convex self-weight C{ci} and the convex self-weight Cm{cm,i} of the original random variable X{xi} as shown in the FIG. 8. 15. The reconstructed t-test in the four options, as described in the sub-section 10 of the section DETAILED DESCRIPTION and as shown in the FIG. 10, for comparing two populations based on sampling with the convex self-weight and the SAC normalization, comprising:
(1) The reconstructed formulas from (78) to (90) if and only if they are used in a complete t-test with any randomly variable weight obtained in any method and with/without the SAC normalization, including the self-weights defined in the claim 1 as well as in the claim 2 if the claim 2 is necessarily involved. (2) The reconstructed formulas from (91) to (93) if and only if they are used in a complete t-test without the SAC normalization and with the self-weights defined in the claim 1 as well as in the claim 2 if the claim 2 is necessarily involved. 16. Any equivalent transformation in a mathematical deduction that may lead to the same computation result(s) of any formula that is claimed in the above claims from 1 to 14 for the same real sample. | 2,100 |
4,789 | 14,695,377 | 2,154 | Disclosed are various embodiments for reducing locking in a distributed data store that includes a primary data store and one or more secondary data stores. An update to a data item that is to be applied to the distributed data store is obtained in one or more computing devices. The update is applied to a cached version of the data item when a lock is held. The update is replicated to the one or more data stores after the lock is released. A replication confirmation is obtained from each of at least a predetermined number of the secondary data stores. | 1. A non-transitory computer-readable medium embodying a program executable in at least one computing device, comprising:
code configured to receive an update to a data item that is to be applied to a first data store and at least one second data store; code configured to apply the update to a cached version of the data item when a lock is held; code configured to replicate the update to the second data store after the lock is released; and code configured to receive a replication confirmation from each of at least a predetermined number of the at least one second data store. 2. The non-transitory computer-readable medium of claim 1, further comprising code configured to determine that the update is durably persisted in both the first data store and the at least one second data store in response to the replication confirmation from each of the at least the predetermined number of the at least one second data store. 3. The non-transitory computer-readable medium of claim 1, further comprising code configured to verify that a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 4. The non-transitory computer-readable medium of claim 3, further comprising code configured to abandon the update when the condition is not met. 5. The non-transitory computer-readable medium of claim 1, wherein the first data store and the at least one second data store correspond to a distributed data store. 6. The non-transitory computer-readable medium of claim 1, wherein the at least one second data store replicates the first data store using single-master replication. 7. The non-transitory computer-readable medium of claim 1, further comprising code configured to generate a log entry that describes the update to the data item based at least in part on a current state of the cached version of the data item. 8. A system, comprising:
at least one computing device; and at least one application executed in the at least one computing device, the at least one application comprising:
logic configured to receive an update to a data item that is to be applied to a first data store and at least one second data store;
logic configured to load the data item from the first data store into a cache when a lock is held, thereby producing a cached version of the data item;
logic configured to apply the update to the cached version of the data item when the lock is held and then releases the lock;
logic configured to replicate the update to the at least one second data store when the lock is released; and
logic configured to receive a replication confirmation for the update from at least one of the at least one second data store. 9. The system of claim 8, wherein the at least one second data store replicates the first data store. 10. The system of claim 8, wherein the at least one application further comprises logic configured to determine that the update has been durably persisted in the first data store and the at least one second data store in response to receiving the replication confirmation for the update from the at least one of the at least one second data store. 11. The system of claim 8, wherein the at least one application further comprises logic configured to verify that a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 12. The system of claim 8, wherein the first data store and the at least one second data store correspond to a distributed data store that employs single-master replication. 13. The system of claim 8, wherein the at least one application further comprises logic configured to commit the update to the first data store. 14. The system of claim 8, wherein the at least one application further comprises logic configured to maintain a reference count associated with the cached version of the data item such that the reference count is increased relative to the update being applied to the cached version of the data item and the reference count is decreased based at least in part on receiving the replication confirmation. 15. The system of claim 8, wherein the at least one application further comprises logic configured to receive a request embodying the update from a client computing device. 16. A method, comprising:
receiving, in at least one computing device, an update to a data item that is to be applied to a first data store and at least one second data store; establishing, in the at least one computing device, a lock relative to the data item; applying, in the at least one computing device, the update to a cached version of the data item when the lock is held and then releasing the lock; replicating, in the least one computing device, the update to the at least one second data store when the lock is released; and receiving, in the at least one computing device, a replication confirmation from at least a predetermined number of the at least one second data store. 17. The method of claim 16, further comprising verifying, in the at least one computing device, whether a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 18. The method of claim 16, further comprising confirming, in the at least one computing device, that the update is durably persisted in the first data store and the at least one second data store in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. 19. The method of claim 16, further comprising committing, in the at least one computing device, the update to the data item to the first data store in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. 20. The method of claim 16, further comprising discarding, in the at least one computing device, the cached version of the data item from the cache in response to in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. | Disclosed are various embodiments for reducing locking in a distributed data store that includes a primary data store and one or more secondary data stores. An update to a data item that is to be applied to the distributed data store is obtained in one or more computing devices. The update is applied to a cached version of the data item when a lock is held. The update is replicated to the one or more data stores after the lock is released. A replication confirmation is obtained from each of at least a predetermined number of the secondary data stores.1. A non-transitory computer-readable medium embodying a program executable in at least one computing device, comprising:
code configured to receive an update to a data item that is to be applied to a first data store and at least one second data store; code configured to apply the update to a cached version of the data item when a lock is held; code configured to replicate the update to the second data store after the lock is released; and code configured to receive a replication confirmation from each of at least a predetermined number of the at least one second data store. 2. The non-transitory computer-readable medium of claim 1, further comprising code configured to determine that the update is durably persisted in both the first data store and the at least one second data store in response to the replication confirmation from each of the at least the predetermined number of the at least one second data store. 3. The non-transitory computer-readable medium of claim 1, further comprising code configured to verify that a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 4. The non-transitory computer-readable medium of claim 3, further comprising code configured to abandon the update when the condition is not met. 5. The non-transitory computer-readable medium of claim 1, wherein the first data store and the at least one second data store correspond to a distributed data store. 6. The non-transitory computer-readable medium of claim 1, wherein the at least one second data store replicates the first data store using single-master replication. 7. The non-transitory computer-readable medium of claim 1, further comprising code configured to generate a log entry that describes the update to the data item based at least in part on a current state of the cached version of the data item. 8. A system, comprising:
at least one computing device; and at least one application executed in the at least one computing device, the at least one application comprising:
logic configured to receive an update to a data item that is to be applied to a first data store and at least one second data store;
logic configured to load the data item from the first data store into a cache when a lock is held, thereby producing a cached version of the data item;
logic configured to apply the update to the cached version of the data item when the lock is held and then releases the lock;
logic configured to replicate the update to the at least one second data store when the lock is released; and
logic configured to receive a replication confirmation for the update from at least one of the at least one second data store. 9. The system of claim 8, wherein the at least one second data store replicates the first data store. 10. The system of claim 8, wherein the at least one application further comprises logic configured to determine that the update has been durably persisted in the first data store and the at least one second data store in response to receiving the replication confirmation for the update from the at least one of the at least one second data store. 11. The system of claim 8, wherein the at least one application further comprises logic configured to verify that a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 12. The system of claim 8, wherein the first data store and the at least one second data store correspond to a distributed data store that employs single-master replication. 13. The system of claim 8, wherein the at least one application further comprises logic configured to commit the update to the first data store. 14. The system of claim 8, wherein the at least one application further comprises logic configured to maintain a reference count associated with the cached version of the data item such that the reference count is increased relative to the update being applied to the cached version of the data item and the reference count is decreased based at least in part on receiving the replication confirmation. 15. The system of claim 8, wherein the at least one application further comprises logic configured to receive a request embodying the update from a client computing device. 16. A method, comprising:
receiving, in at least one computing device, an update to a data item that is to be applied to a first data store and at least one second data store; establishing, in the at least one computing device, a lock relative to the data item; applying, in the at least one computing device, the update to a cached version of the data item when the lock is held and then releasing the lock; replicating, in the least one computing device, the update to the at least one second data store when the lock is released; and receiving, in the at least one computing device, a replication confirmation from at least a predetermined number of the at least one second data store. 17. The method of claim 16, further comprising verifying, in the at least one computing device, whether a condition associated with the update is met based at least in part on the cached version of the data item when the lock is held. 18. The method of claim 16, further comprising confirming, in the at least one computing device, that the update is durably persisted in the first data store and the at least one second data store in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. 19. The method of claim 16, further comprising committing, in the at least one computing device, the update to the data item to the first data store in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. 20. The method of claim 16, further comprising discarding, in the at least one computing device, the cached version of the data item from the cache in response to in response to receiving the replication confirmation from the at least the predetermined number of the at least one second data store. | 2,100 |
4,790 | 14,982,857 | 2,114 | A flap detector can detect significant flapping with magnitudes of state deltas (i.e., differences between values representing events or states). The flap detector aggregates monotonic state deltas. Aggregating monotonic state deltas yields a magnitude of monotonic state deltas. A magnitude of a series of same direction state deltas can be considered the magnitude of flap because the end of the series corresponds to a beginning of a state delta series in a different direction. When directional transition occurs (i.e., flapping occurs), the flap detector generates multiple monotonic state delta magnitudes. The determined magnitudes can be used to filter out insignificant flapping that could be considered noise. | 1. A method comprising:
determining a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determining a sum of each series of differences in a same direction; determining whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicating that flapping of a resource has occurred in the time window, wherein the resource corresponds to the resource measurements. 2. The method of claim 1 further comprising indicating a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 3. The method of claim 1 further comprising counting the sums that have a magnitude that satisfies the first threshold and determining whether the count satisfies a second threshold, wherein indicating that flapping has occurred in the time window is dependent upon the second threshold being satisfied as well as the first threshold. 4. The method of claim 1, wherein the resource measurements relate to performance or quality of service. 5. The method of claim 4 further comprising obtaining the resource measurements, wherein determining the series of differences is in response to obtaining the resource measurements. 6. The method of claim 4 further comprising successively obtaining the resource measurements, wherein determining the series of differences is in response to each successive obtaining. 7. The method of claim 1, further comprising detecting a recent resource measurement at a time instance t, wherein the successive resource measurements include the recent resource measurement, wherein determining the series of differences between successive resource measurements comprises:
determining, from a time ordered data structure of resource measurement differences, previously computed differences between successive resource measurements at time instants which precede the time instant t in the time window; computing a most recent resource measurement difference as a difference between the recent resource measurement and a preceding resource measurement which corresponds to a time instant t−1; and storing the most recent resource measurement difference in the time ordered data structure of resource measurement differences. 8. The method of claim 7, wherein determining the sum each series of differences in a same direction comprises:
traversing the time ordered data structure from oldest to newest and summing the resource measurement differences encountered while traversing until a change in direction of the resource measurement differences. 9. The method of claim 1 further comprising determining magnitudes of the sums. 10. One or more machine readable storage media comprising program code for flap detection, the program code comprising instructions to:
determine a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determine a sum of each series of differences in a same direction; determine whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicate that flapping has occurred in the time window and indicate a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 11. The machine-readable media of claim 10, further comprising instructions to determine, in response to determination that at least one sum satisfies the first threshold, whether a number of sums satisfying the first threshold satisfies a second threshold. 12. An apparatus comprising:
a processor; and a machine-readable medium comprising program code executable by the processor to cause the apparatus to, determine a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determine a sum of each series of differences in a same direction; determine whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicate that flapping has occurred in the time window. 13. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to indicate a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 14. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to count the sums that have a magnitude that satisfies the first threshold and determine whether the count satisfies a second threshold, wherein indication that flapping has occurred in the time window is dependent upon the second threshold being satisfied as well as the first threshold. 15. The apparatus of claim 12, wherein the resource measurements relate to performance or quality of service. 16. The apparatus of claim 15 wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to obtain the resource measurements, wherein determination of the series of differences is in response to obtaining the resource measurements. 17. The apparatus of claim 15 wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to successively obtain the resource measurements, wherein determination of the series of differences is in response to each successive obtaining. 18. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to detect a recent resource measurement at a time instance t, wherein the successive resource measurements include the recent resource measurement, wherein determination of the program code to determine the series of differences between successive resource measurements comprises program code to:
determine, from a time ordered data structure of resource measurement differences, previously computed differences between successive resource measurements at time instants which precede the time instant t in the time window; compute a most recent resource measurement difference as a difference between the recent resource measurement and a preceding resource measurement which corresponds to a time instant t−1; and store the most recent resource measurement difference in the time ordered data structure of resource measurement differences. 19. The apparatus of claim 18, wherein the program code to determine the sum of each series of differences in a same direction comprises program code to:
traverse the time ordered data structure from oldest to newest and sum the resource measurement differences encountered while traversing until a change in direction of the resource measurement differences. 20. The apparatus of claim 12, wherein the machine-readable medium further has program code executable by the processor to cause the apparatus to:
determine on an average of the sums that satisfy the first threshold; and generate a flapping notification that includes the average. | A flap detector can detect significant flapping with magnitudes of state deltas (i.e., differences between values representing events or states). The flap detector aggregates monotonic state deltas. Aggregating monotonic state deltas yields a magnitude of monotonic state deltas. A magnitude of a series of same direction state deltas can be considered the magnitude of flap because the end of the series corresponds to a beginning of a state delta series in a different direction. When directional transition occurs (i.e., flapping occurs), the flap detector generates multiple monotonic state delta magnitudes. The determined magnitudes can be used to filter out insignificant flapping that could be considered noise.1. A method comprising:
determining a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determining a sum of each series of differences in a same direction; determining whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicating that flapping of a resource has occurred in the time window, wherein the resource corresponds to the resource measurements. 2. The method of claim 1 further comprising indicating a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 3. The method of claim 1 further comprising counting the sums that have a magnitude that satisfies the first threshold and determining whether the count satisfies a second threshold, wherein indicating that flapping has occurred in the time window is dependent upon the second threshold being satisfied as well as the first threshold. 4. The method of claim 1, wherein the resource measurements relate to performance or quality of service. 5. The method of claim 4 further comprising obtaining the resource measurements, wherein determining the series of differences is in response to obtaining the resource measurements. 6. The method of claim 4 further comprising successively obtaining the resource measurements, wherein determining the series of differences is in response to each successive obtaining. 7. The method of claim 1, further comprising detecting a recent resource measurement at a time instance t, wherein the successive resource measurements include the recent resource measurement, wherein determining the series of differences between successive resource measurements comprises:
determining, from a time ordered data structure of resource measurement differences, previously computed differences between successive resource measurements at time instants which precede the time instant t in the time window; computing a most recent resource measurement difference as a difference between the recent resource measurement and a preceding resource measurement which corresponds to a time instant t−1; and storing the most recent resource measurement difference in the time ordered data structure of resource measurement differences. 8. The method of claim 7, wherein determining the sum each series of differences in a same direction comprises:
traversing the time ordered data structure from oldest to newest and summing the resource measurement differences encountered while traversing until a change in direction of the resource measurement differences. 9. The method of claim 1 further comprising determining magnitudes of the sums. 10. One or more machine readable storage media comprising program code for flap detection, the program code comprising instructions to:
determine a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determine a sum of each series of differences in a same direction; determine whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicate that flapping has occurred in the time window and indicate a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 11. The machine-readable media of claim 10, further comprising instructions to determine, in response to determination that at least one sum satisfies the first threshold, whether a number of sums satisfying the first threshold satisfies a second threshold. 12. An apparatus comprising:
a processor; and a machine-readable medium comprising program code executable by the processor to cause the apparatus to, determine a series of differences between successive resource measurements over a time window, wherein each of the resource measurements corresponds to a different time instant; determine a sum of each series of differences in a same direction; determine whether any of the sums have a magnitude that satisfies a first threshold; and in response to a determination that one or more of the sums have a magnitude that satisfies the first threshold, indicate that flapping has occurred in the time window. 13. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to indicate a magnitude of the flapping based, at least in part, on the one or more sums that have a magnitude that satisfies the first threshold. 14. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to count the sums that have a magnitude that satisfies the first threshold and determine whether the count satisfies a second threshold, wherein indication that flapping has occurred in the time window is dependent upon the second threshold being satisfied as well as the first threshold. 15. The apparatus of claim 12, wherein the resource measurements relate to performance or quality of service. 16. The apparatus of claim 15 wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to obtain the resource measurements, wherein determination of the series of differences is in response to obtaining the resource measurements. 17. The apparatus of claim 15 wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to successively obtain the resource measurements, wherein determination of the series of differences is in response to each successive obtaining. 18. The apparatus of claim 12, wherein the machine-readable medium further comprises program code executable by the processor to cause the apparatus to detect a recent resource measurement at a time instance t, wherein the successive resource measurements include the recent resource measurement, wherein determination of the program code to determine the series of differences between successive resource measurements comprises program code to:
determine, from a time ordered data structure of resource measurement differences, previously computed differences between successive resource measurements at time instants which precede the time instant t in the time window; compute a most recent resource measurement difference as a difference between the recent resource measurement and a preceding resource measurement which corresponds to a time instant t−1; and store the most recent resource measurement difference in the time ordered data structure of resource measurement differences. 19. The apparatus of claim 18, wherein the program code to determine the sum of each series of differences in a same direction comprises program code to:
traverse the time ordered data structure from oldest to newest and sum the resource measurement differences encountered while traversing until a change in direction of the resource measurement differences. 20. The apparatus of claim 12, wherein the machine-readable medium further has program code executable by the processor to cause the apparatus to:
determine on an average of the sums that satisfy the first threshold; and generate a flapping notification that includes the average. | 2,100 |
4,791 | 14,664,843 | 2,143 | A device having a display, a processor, computer readable media with stored content. The device has executable instructions on the computer readable media for receiving from a digital base work provider a digital base work and supplemental information corresponding to the digital base work, including an index or look-up table of words or names in the digital base work, and executable instructions on the computer readable media for displaying on the display the digital base work and supplemental information for any of the words or names selected by a user, including a representation of the location of the selected words or names. | 1. A device comprising:
a display; one or more processors; one or more computer-readable media; a provider interaction module maintained on the one or more computer-readable media and executed on the one or more processors to receive, from a computing device of a digital work provider, a digital work and supplemental information corresponding to the digital work, the supplemental information including an index of objects identified in the digital work and prestored content related to at least one of the objects; a digital work display module maintained on the one or more computer-readable media and executed on the one or more processors to display the digital work on the display; and a supplemental information display module maintained on the one or more computer readable media and executed on the one or more processors to display the supplemental information on the display in response to a user selection of an object in the digital work displayed on the display, the supplemental information including a visual representation of a location of one or more occurrences of the object in the digital work. 2. The device as recited in claim 1, wherein the index identifies locations of one or more occurrences of each of the objects in the digital work. 3. The device as recited in claim 1, wherein the supplemental information further includes an identification of alternate names for one or more of the objects in the digital work. 4. The device as recited in claim 1, wherein the supplemental information displayed on the display further includes the prestored content related to the object selected by the user selection, the prestored content including information on the object obtained from an external source by the digital work provider. 5. A method comprising:
under control of one or more processors of an electronic device specifically configured with executable instructions, storing, on the electronic device, a digital work and supplemental information corresponding to the digital work, the supplemental information including supplemental content and an index, wherein the index includes respective locations of occurrences of a plurality of objects designated in the digital work, and the supplemental content is related to one or more of the objects; presenting the digital work on a display; receiving a selection of a first object of the plurality of objects in the digital work; and presenting at least a portion of the supplemental information on the display in response to the selection of the first object. 6. The method as recited in claim 5, further comprising prior to storing the digital work,
accessing a digital work catalog on a digital work provider site; and receiving the digital work through a transaction with the digital work provider site. 7. The method as recited in claim 5, wherein:
the first object includes at least one word presented in text of the digital work; and receiving the selection of the first object in the digital work comprises receiving a selection of the at least one word presented in the text of the digital work. 8. The method as recited in claim 7, wherein:
receiving the selection of the first object in the digital work includes receiving a touch input to a touchscreen of the electronic device to select the first object in the digital work. 9. The method as recited in claim 7, wherein the object is at least one of:
a character in the digital work; a person mentioned in the digital work; a place mentioned in the digital work; a thing mentioned in the digital work; an interaction between characters in the digital work; an organization mentioned in the digital work; a relationship between characters in the digital work; a popular highlight in the digital work; a theme in the digital work; a scene in the digital work; an event mentioned in the digital work; a phrase used in the digital work; a topic mentioned in the digital work; a citation provided in the digital work; or a time period associated with the digital work. 10. The method as recited in claim 5, wherein presenting at least a portion of the supplemental information on the display in response to the selection of the object comprises presenting a visual representation indicating locations of occurrences of the first object in the digital work. 11. The method as recited in claim 7, wherein storing the digital work and the supplemental information corresponding to the digital work further comprises receiving the digital work and the supplemental information from a digital work provider site through one or more networks in response to a transaction for acquisition of the digital work. 12. The method as recited in claim 11, the method further comprising, prior to storing the digital work and the supplemental information corresponding to the digital work, accessing the digital work provider site to acquire the digital work by selection of the digital work from a catalog of digital works available for acquisition from the digital work provider site. 13. The method as recited in claim 5, wherein storing the digital work and supplemental information corresponding to the digital work comprises storing a plurality of digital works and a plurality of instances of supplemental information, each instance of supplemental information corresponding to a different one of the digital works. 14. The method as recited in claim 5, wherein the portion of the supplemental information presented on the display includes a link to content stored at a location on a network, the method further comprising:
receiving a selection of the link; acquiring the content from the location on the network; and presenting the content on the display. 15. A system comprising:
one or more processors; one or more computer-readable media; a supplemental information generation module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include: parsing a digital work to identify items in the digital work as candidates for designation as objects in the digital work; and generating supplemental information for the digital work, the supplemental information including an index for the objects identified in the digital work, the index including locations of one or more occurrences of the objects in the digital work; and a delivery module maintained on the one or more computer-readable media and executed on the one or more processors to deliver the digital work and the supplemental information for the digital work to an electronic device. 16. The system as recited in claim 15, the operations further comprising:
obtaining, from a network accessible resource, content related to at least one of the objects identified in the digital work; and including the content as prestored content provided with the supplemental information delivered to the electronic device. 17. The system as recited in claim 15, the operations further comprising:
identifying, from a network accessible resource, content related to at least one of the objects identified in the digital work; and including, with the supplemental information delivered to the electronic device, a reference identifier for locating, on a network, the content related to the at least one object. 18. The system as recited in claim 15, wherein the generating supplemental information for the digital work further comprises identifying alternate names for the objects by:
accessing one or more network accessible resources to obtain information on the objects; and identifying the alternate names based, at least in part, on the information on the objects obtained from the one or more network accessible resources. 19. The system as recited in claim 15, wherein the generating supplemental information for the digital work further comprises identifying alternate names for the objects, at least in part, by accessing at least one of a file or a database that maintains information on potential alternate names for the objects. 20. The system as recited in claim 15, wherein parsing the digital work to identify items in the digital work to make into objects further comprises:
identifying at least one of proper names, place names, or statistically improbable phrases in the digital work as candidate items to make into the objects; and identifying objects from the candidate items based, at least in part, on the information on the objects obtained from one or more network accessible resources. 21. The system as recited in claim 15, further comprising a digital work preparation module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include:
receiving a digital work from a source of digital works; and formatting the digital work to identify at least one of page numbers or location numbers for textual portions of the digital work for use when displaying the digital work on a device. 22. The system as recited in claim 15, further comprising a digital work store module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include:
providing a digital work catalog for access by the device, the catalog including the digital work; and receiving an acquisition request from the electronic device to acquire the digital work. | A device having a display, a processor, computer readable media with stored content. The device has executable instructions on the computer readable media for receiving from a digital base work provider a digital base work and supplemental information corresponding to the digital base work, including an index or look-up table of words or names in the digital base work, and executable instructions on the computer readable media for displaying on the display the digital base work and supplemental information for any of the words or names selected by a user, including a representation of the location of the selected words or names.1. A device comprising:
a display; one or more processors; one or more computer-readable media; a provider interaction module maintained on the one or more computer-readable media and executed on the one or more processors to receive, from a computing device of a digital work provider, a digital work and supplemental information corresponding to the digital work, the supplemental information including an index of objects identified in the digital work and prestored content related to at least one of the objects; a digital work display module maintained on the one or more computer-readable media and executed on the one or more processors to display the digital work on the display; and a supplemental information display module maintained on the one or more computer readable media and executed on the one or more processors to display the supplemental information on the display in response to a user selection of an object in the digital work displayed on the display, the supplemental information including a visual representation of a location of one or more occurrences of the object in the digital work. 2. The device as recited in claim 1, wherein the index identifies locations of one or more occurrences of each of the objects in the digital work. 3. The device as recited in claim 1, wherein the supplemental information further includes an identification of alternate names for one or more of the objects in the digital work. 4. The device as recited in claim 1, wherein the supplemental information displayed on the display further includes the prestored content related to the object selected by the user selection, the prestored content including information on the object obtained from an external source by the digital work provider. 5. A method comprising:
under control of one or more processors of an electronic device specifically configured with executable instructions, storing, on the electronic device, a digital work and supplemental information corresponding to the digital work, the supplemental information including supplemental content and an index, wherein the index includes respective locations of occurrences of a plurality of objects designated in the digital work, and the supplemental content is related to one or more of the objects; presenting the digital work on a display; receiving a selection of a first object of the plurality of objects in the digital work; and presenting at least a portion of the supplemental information on the display in response to the selection of the first object. 6. The method as recited in claim 5, further comprising prior to storing the digital work,
accessing a digital work catalog on a digital work provider site; and receiving the digital work through a transaction with the digital work provider site. 7. The method as recited in claim 5, wherein:
the first object includes at least one word presented in text of the digital work; and receiving the selection of the first object in the digital work comprises receiving a selection of the at least one word presented in the text of the digital work. 8. The method as recited in claim 7, wherein:
receiving the selection of the first object in the digital work includes receiving a touch input to a touchscreen of the electronic device to select the first object in the digital work. 9. The method as recited in claim 7, wherein the object is at least one of:
a character in the digital work; a person mentioned in the digital work; a place mentioned in the digital work; a thing mentioned in the digital work; an interaction between characters in the digital work; an organization mentioned in the digital work; a relationship between characters in the digital work; a popular highlight in the digital work; a theme in the digital work; a scene in the digital work; an event mentioned in the digital work; a phrase used in the digital work; a topic mentioned in the digital work; a citation provided in the digital work; or a time period associated with the digital work. 10. The method as recited in claim 5, wherein presenting at least a portion of the supplemental information on the display in response to the selection of the object comprises presenting a visual representation indicating locations of occurrences of the first object in the digital work. 11. The method as recited in claim 7, wherein storing the digital work and the supplemental information corresponding to the digital work further comprises receiving the digital work and the supplemental information from a digital work provider site through one or more networks in response to a transaction for acquisition of the digital work. 12. The method as recited in claim 11, the method further comprising, prior to storing the digital work and the supplemental information corresponding to the digital work, accessing the digital work provider site to acquire the digital work by selection of the digital work from a catalog of digital works available for acquisition from the digital work provider site. 13. The method as recited in claim 5, wherein storing the digital work and supplemental information corresponding to the digital work comprises storing a plurality of digital works and a plurality of instances of supplemental information, each instance of supplemental information corresponding to a different one of the digital works. 14. The method as recited in claim 5, wherein the portion of the supplemental information presented on the display includes a link to content stored at a location on a network, the method further comprising:
receiving a selection of the link; acquiring the content from the location on the network; and presenting the content on the display. 15. A system comprising:
one or more processors; one or more computer-readable media; a supplemental information generation module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include: parsing a digital work to identify items in the digital work as candidates for designation as objects in the digital work; and generating supplemental information for the digital work, the supplemental information including an index for the objects identified in the digital work, the index including locations of one or more occurrences of the objects in the digital work; and a delivery module maintained on the one or more computer-readable media and executed on the one or more processors to deliver the digital work and the supplemental information for the digital work to an electronic device. 16. The system as recited in claim 15, the operations further comprising:
obtaining, from a network accessible resource, content related to at least one of the objects identified in the digital work; and including the content as prestored content provided with the supplemental information delivered to the electronic device. 17. The system as recited in claim 15, the operations further comprising:
identifying, from a network accessible resource, content related to at least one of the objects identified in the digital work; and including, with the supplemental information delivered to the electronic device, a reference identifier for locating, on a network, the content related to the at least one object. 18. The system as recited in claim 15, wherein the generating supplemental information for the digital work further comprises identifying alternate names for the objects by:
accessing one or more network accessible resources to obtain information on the objects; and identifying the alternate names based, at least in part, on the information on the objects obtained from the one or more network accessible resources. 19. The system as recited in claim 15, wherein the generating supplemental information for the digital work further comprises identifying alternate names for the objects, at least in part, by accessing at least one of a file or a database that maintains information on potential alternate names for the objects. 20. The system as recited in claim 15, wherein parsing the digital work to identify items in the digital work to make into objects further comprises:
identifying at least one of proper names, place names, or statistically improbable phrases in the digital work as candidate items to make into the objects; and identifying objects from the candidate items based, at least in part, on the information on the objects obtained from one or more network accessible resources. 21. The system as recited in claim 15, further comprising a digital work preparation module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include:
receiving a digital work from a source of digital works; and formatting the digital work to identify at least one of page numbers or location numbers for textual portions of the digital work for use when displaying the digital work on a device. 22. The system as recited in claim 15, further comprising a digital work store module maintained on the one or more computer-readable media and executed on the one or more processors to perform operations that include:
providing a digital work catalog for access by the device, the catalog including the digital work; and receiving an acquisition request from the electronic device to acquire the digital work. | 2,100 |
4,792 | 13,411,234 | 2,159 | A novel system and computer-implemented method for quickly and efficiently finding and reporting all clones with a large corpus of text. This is achieved by tokenizing the corpus, computing a rolling hash, filtering for hashes that occur more than once, and constructing an equivalence relation over these hashes in which hashes are equated if they are part of the same instance of duplication. The equivalence relation is then used to report all detected clones. | 1. A computer-implemented method for duplicate text detection, the method comprising:
accessing a corpus of text; accessing a tokenization algorithm; producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens; calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment; identifying, from the collection of hash values, any hash values that two or more segments have in common; computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 2. The method of claim 1, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 3. The method of claim 1, where the corpus consists of files containing instructions in one or more computer programming languages. 4. The method of claim 1, where the corpus consists of files containing text representing multimedia content. 5. The method of claim 1, where the equivalence relation is produced using a union-find abstract data type. 6. The method of claim 1, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. 7. A system comprising:
memory; at least one processor communicatively coupled to the memory, and together configured for:
accessing a corpus of text;
accessing a tokenization algorithm;
producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens;
calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment;
identifying, from the collection of hash values, any hash values that two or more segments have in common;
computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and
producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 8. The system of claim 7, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 9. The system of claim 7, where the corpus consists of files containing instructions in one or more computer programming languages. 10. The system of claim 7, where the corpus consists of files containing text representing multimedia content. 11. The system of claim 7, where the equivalence relation is produced using a union-find abstract data type. 12. The system of claim 7, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. 13. A computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code configured for:
accessing a corpus of text; accessing a tokenization algorithm; producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens; calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment; identifying, from the collection of hash values, any hash values that two or more segments have in common; computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 14. The computer program product of claim 13, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 15. The computer program product of claim 13, where the corpus consists of files containing instructions in one or more computer programming languages. 16. The computer program product of claim 13, where the corpus of text consists of files containing text representing multimedia content. 17. The computer program product of claim 13, where the equivalence relation is produced using a union-find abstract data type. 18. The computer program product of claim 13, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. | A novel system and computer-implemented method for quickly and efficiently finding and reporting all clones with a large corpus of text. This is achieved by tokenizing the corpus, computing a rolling hash, filtering for hashes that occur more than once, and constructing an equivalence relation over these hashes in which hashes are equated if they are part of the same instance of duplication. The equivalence relation is then used to report all detected clones.1. A computer-implemented method for duplicate text detection, the method comprising:
accessing a corpus of text; accessing a tokenization algorithm; producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens; calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment; identifying, from the collection of hash values, any hash values that two or more segments have in common; computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 2. The method of claim 1, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 3. The method of claim 1, where the corpus consists of files containing instructions in one or more computer programming languages. 4. The method of claim 1, where the corpus consists of files containing text representing multimedia content. 5. The method of claim 1, where the equivalence relation is produced using a union-find abstract data type. 6. The method of claim 1, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. 7. A system comprising:
memory; at least one processor communicatively coupled to the memory, and together configured for:
accessing a corpus of text;
accessing a tokenization algorithm;
producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens;
calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment;
identifying, from the collection of hash values, any hash values that two or more segments have in common;
computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and
producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 8. The system of claim 7, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 9. The system of claim 7, where the corpus consists of files containing instructions in one or more computer programming languages. 10. The system of claim 7, where the corpus consists of files containing text representing multimedia content. 11. The system of claim 7, where the equivalence relation is produced using a union-find abstract data type. 12. The system of claim 7, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. 13. A computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code configured for:
accessing a corpus of text; accessing a tokenization algorithm; producing, according to the tokenization algorithm, a tokenized version of at least a portion of the corpus of text, whereby the portion of the corpus of text is broken up into a set of one or more overlapping segments, where each segment is a specified number of adjacent tokens; calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values, with one hash value per each overlapping segment; identifying, from the collection of hash values, any hash values that two or more segments have in common; computing an equivalence relation over the hash values, such that hashes in a same piece of duplicative text are equivalent; and producing, based on the equivalence relation, a report of pieces of duplicate text found in the corpus of text. 14. The computer program product of claim 13, where the producing, based on the equivalence relation, the report of pieces of duplicate text found in the corpus of text includes using the collection of hash values to map the pieces of duplicate text back to their respective locations in the corpus of text. 15. The computer program product of claim 13, where the corpus consists of files containing instructions in one or more computer programming languages. 16. The computer program product of claim 13, where the corpus of text consists of files containing text representing multimedia content. 17. The computer program product of claim 13, where the equivalence relation is produced using a union-find abstract data type. 18. The computer program product of claim 13, wherein the calculating a rolling hash over each of the overlapping segments to produce a collection of one or more hash values:
hash
(
n
,
ts
)
=
∑
i
=
0
N
-
1
h
(
ts
n
+
i
)
P
N
-
i
-
1
mod
M
where n is a number of the segment in the corpus of text, is is a list of constitute tokens, N is a segment size to use, P is a prime number, M is an integer greater than 1000. | 2,100 |
4,793 | 14,288,747 | 2,113 | Methods and systems for detecting anomalous function execution in a program, such as a video game or simulation program, are described herein. Certain methods attempt to isolate and score functions that behave in a particular manner that is deemed to be problematic within a repetitive program. Other methods can use the repetitive nature of the program to directly compare and isolate problematic functions. | 1. A system for detecting anomalous execution in a program, comprising:
a processing system having at least one processor, the processing system configured to:
monitor a running program to identify aspects of function execution;
identify one or more execution traits for one or more functions executing in the running program;
detect anomalies based on the identified traits of the one or more executing functions;
identify one or more types of anomalies from the detected anomalies; and
generate a display showing function execution over time including a graphical display of at least the detected anomalies. 2. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on a degree of periodicity of the one or more executing functions. 3. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on a degree of non-periodicity of the one or more executing functions. 4. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on behavior exhibited during one or more frames of function execution. 5. A system for detecting anomalous execution in a program, comprising:
a processing system having at least one processor, the processing system configured to:
monitor a running program to identify aspects of function execution;
detect anomalies in the aspects of function execution; and
generate a display showing function execution including at least the detected anomalies. 6. The system of claim 5, wherein the processing system is further configured to analyze the detected anomalies and assign one or more classifications to the detected anomalies. 7. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on a periodicity of function execution exhibited by the anomalies. 8. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on a non-periodicity of function execution exhibited by the anomalies. 9. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on aspects related to execution behavior occurring during one or more frames of execution. 10. The system of claim 5, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. 11. A method implemented using an information processing system having at least one processor, the method comprising:
monitoring a running program to identify aspects of function execution; detecting anomalies in the aspects of function execution; identifying one or more types of anomalies from the detected anomalies; and generating a display showing function execution including at least the identified one or more types of anomalies in the aspects of function execution. 12. The method of claim 11, wherein the one or more types of anomalies are assigned based on a periodicity of function execution exhibited by the anomalies. 13. The method of claim 11, wherein the one or more types of anomalies are assigned based on a non-periodicity of function execution exhibited by the anomalies. 14. The method of claim 11, wherein the one or more types of anomalies are assigned based on aspects related to execution behavior occurring during one or more frames of execution. 15. The method of claim 11, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. 16. A non-transitory computer readable storage medium storing a computer program having code executable by an information processing apparatus, the computer program, when executed, causing the information processing apparatus to provide execution comprising:
monitoring a running program to identify aspects of function execution;
detecting anomalies in the aspects of function execution;
identifying one or more types of anomalies from the detected anomalies; and
generating a display showing function execution including at least the identified one or more types of anomalies in the aspects of function execution. 17. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on a periodicity of function execution exhibited by the anomalies. 18. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on a non-periodicity of function execution exhibited by the anomalies. 19. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on aspects related to execution behavior occurring during one or more frames of execution. 20. The non-transitory computer readable storage medium of claim 16, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. | Methods and systems for detecting anomalous function execution in a program, such as a video game or simulation program, are described herein. Certain methods attempt to isolate and score functions that behave in a particular manner that is deemed to be problematic within a repetitive program. Other methods can use the repetitive nature of the program to directly compare and isolate problematic functions.1. A system for detecting anomalous execution in a program, comprising:
a processing system having at least one processor, the processing system configured to:
monitor a running program to identify aspects of function execution;
identify one or more execution traits for one or more functions executing in the running program;
detect anomalies based on the identified traits of the one or more executing functions;
identify one or more types of anomalies from the detected anomalies; and
generate a display showing function execution over time including a graphical display of at least the detected anomalies. 2. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on a degree of periodicity of the one or more executing functions. 3. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on a degree of non-periodicity of the one or more executing functions. 4. The system of claim 1, wherein the processing system is further configured to identify a type of detected anomaly based on behavior exhibited during one or more frames of function execution. 5. A system for detecting anomalous execution in a program, comprising:
a processing system having at least one processor, the processing system configured to:
monitor a running program to identify aspects of function execution;
detect anomalies in the aspects of function execution; and
generate a display showing function execution including at least the detected anomalies. 6. The system of claim 5, wherein the processing system is further configured to analyze the detected anomalies and assign one or more classifications to the detected anomalies. 7. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on a periodicity of function execution exhibited by the anomalies. 8. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on a non-periodicity of function execution exhibited by the anomalies. 9. The system of claim 6, wherein the one or more classifications are assigned to the detected anomalies based on aspects related to execution behavior occurring during one or more frames of execution. 10. The system of claim 5, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. 11. A method implemented using an information processing system having at least one processor, the method comprising:
monitoring a running program to identify aspects of function execution; detecting anomalies in the aspects of function execution; identifying one or more types of anomalies from the detected anomalies; and generating a display showing function execution including at least the identified one or more types of anomalies in the aspects of function execution. 12. The method of claim 11, wherein the one or more types of anomalies are assigned based on a periodicity of function execution exhibited by the anomalies. 13. The method of claim 11, wherein the one or more types of anomalies are assigned based on a non-periodicity of function execution exhibited by the anomalies. 14. The method of claim 11, wherein the one or more types of anomalies are assigned based on aspects related to execution behavior occurring during one or more frames of execution. 15. The method of claim 11, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. 16. A non-transitory computer readable storage medium storing a computer program having code executable by an information processing apparatus, the computer program, when executed, causing the information processing apparatus to provide execution comprising:
monitoring a running program to identify aspects of function execution;
detecting anomalies in the aspects of function execution;
identifying one or more types of anomalies from the detected anomalies; and
generating a display showing function execution including at least the identified one or more types of anomalies in the aspects of function execution. 17. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on a periodicity of function execution exhibited by the anomalies. 18. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on a non-periodicity of function execution exhibited by the anomalies. 19. The non-transitory computer readable storage medium of claim 16, wherein the one or more types of anomalies are assigned based on aspects related to execution behavior occurring during one or more frames of execution. 20. The non-transitory computer readable storage medium of claim 16, wherein the generated display comprising a graph showing a percentage of execution along a first axis and function execution over time along a second axis. | 2,100 |
4,794 | 15,040,265 | 2,164 | Systems, methods, apparatus, and computer program products are provided for processing claims. In various embodiments, claims can be processed in accordance with a data-driven approach that limits changes to existing claims processing rules by using exclusion tables, inclusion tables, and/or decision tables to change or execute rules in a more efficient manner. | 1. A method for processing a claim, the method comprising:
processing a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; determining, via a processor, whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; after determining, via the processor, that an entry exists in the table for the first claims processing rule, determining whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and after determining, via the processor, that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 2. The method of claim 1, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 3. The method of claim 1 further comprising processing the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 4. The method of claim 3 further comprising determining whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 5. The method of claim 4 further comprising:
after determining that an entry exists in the table for the second claims processing rule, determining whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and
after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determining how to process the current claim line based at least in part on the entry for the second claims processing rule. 6. The method of claim 1, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 7. The method of claim 1, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 8. The method of claim 1 further comprising receiving input creating the entry for the first claims processing rule in the table. 9. A computer program product for processing a claim, the computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
an executable portion configured to process a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; an executable portion configured to determine whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; an executable portion configured to, after determining that an entry exists in the table for the first claims processing rule, determine whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and an executable portion configured to, after determining that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 10. The computer program product of claim 9, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 11. The computer program product of claim 9 further comprising an executable portion configured to process the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 12. The computer program product of claim 11 further comprising an executable portion configured to determine whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 13. The computer program product of claim 12 further comprising:
an executable portion configured to, after determining that an entry exists in the table for the second claims processing rule, determine whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and
an executable portion configured to, after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determine how to process the current claim line based at least in part on the entry for the second claims processing rule. 14. The computer program product of claim 9, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 15. The computer program product of claim 9, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 16. The computer program product of claim 9 further comprising an executable portion configured to receive input creating the entry for the first claims processing rule in the table. 17. 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:
process a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; determine whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; after determining that an entry exists in the table for the first claims processing rule, determine whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and after determining that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 18. The apparatus of claim 17, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 19. The apparatus of claim 17, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to process the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 20. The apparatus of claim 19, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to determine whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 21. The apparatus of claim 20, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to:
after determining that an entry exists in the table for the second claims processing rule, determine whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determine how to process the current claim line based at least in part on the entry for the second claims processing rule. 22. The apparatus of claim 17, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 23. The apparatus of claim 17, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 24. The apparatus of claim 17, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive input creating the entry for the first claims processing rule in the table. | Systems, methods, apparatus, and computer program products are provided for processing claims. In various embodiments, claims can be processed in accordance with a data-driven approach that limits changes to existing claims processing rules by using exclusion tables, inclusion tables, and/or decision tables to change or execute rules in a more efficient manner.1. A method for processing a claim, the method comprising:
processing a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; determining, via a processor, whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; after determining, via the processor, that an entry exists in the table for the first claims processing rule, determining whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and after determining, via the processor, that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 2. The method of claim 1, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 3. The method of claim 1 further comprising processing the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 4. The method of claim 3 further comprising determining whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 5. The method of claim 4 further comprising:
after determining that an entry exists in the table for the second claims processing rule, determining whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and
after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determining how to process the current claim line based at least in part on the entry for the second claims processing rule. 6. The method of claim 1, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 7. The method of claim 1, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 8. The method of claim 1 further comprising receiving input creating the entry for the first claims processing rule in the table. 9. A computer program product for processing a claim, the computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
an executable portion configured to process a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; an executable portion configured to determine whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; an executable portion configured to, after determining that an entry exists in the table for the first claims processing rule, determine whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and an executable portion configured to, after determining that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 10. The computer program product of claim 9, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 11. The computer program product of claim 9 further comprising an executable portion configured to process the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 12. The computer program product of claim 11 further comprising an executable portion configured to determine whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 13. The computer program product of claim 12 further comprising:
an executable portion configured to, after determining that an entry exists in the table for the second claims processing rule, determine whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and
an executable portion configured to, after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determine how to process the current claim line based at least in part on the entry for the second claims processing rule. 14. The computer program product of claim 9, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 15. The computer program product of claim 9, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 16. The computer program product of claim 9 further comprising an executable portion configured to receive input creating the entry for the first claims processing rule in the table. 17. 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:
process a current claim line in accordance (a) with a first claims processing rule and (b) a first support claim line, wherein the first claims processing rule comprises (a) a rule name and (b) an indication to reference a table in addition to applying the first claims processing rule; determine whether an entry exists in the table for the first claims processing rule based at least in part on the rule name for the first claims processing rule, wherein the entry for the first claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the first claims processing rule; after determining that an entry exists in the table for the first claims processing rule, determine whether the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule; and after determining that the current claim line and the first support claim line satisfy the requirements of the entry for the first claims processing rule, determining how to process the current claim line based at least in part on the entry for the first claims processing rule irrespective of the first claims processing rule. 18. The apparatus of claim 17, wherein determining how to process the current claim line based at least in part on the entry for the first claims processing rule comprises determining whether to (a) create a case for the current claim line based at least in part on the entry for the first claims processing rule or (b) exclude a case from being created for the current claim based at least in part on the entry for the first claims processing rule. 19. The apparatus of claim 17, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to process the current claim line in accordance (a) with a second claims processing rule and (b) a second support claim line. 20. The apparatus of claim 19, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to determine whether an entry exists in the table for the second claims processing rule, wherein the entry for the second claims processing rule indicates how to process the current claim line when the current claim line and a support claim line satisfy the requirements of the entry for the second claims processing rule. 21. The apparatus of claim 20, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to:
after determining that an entry exists in the table for the second claims processing rule, determine whether the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule; and after determining that the current claim line and the second support claim line satisfy the requirements of the entry for the second claims processing rule, determine how to process the current claim line based at least in part on the entry for the second claims processing rule. 22. The apparatus of claim 17, wherein the current claim line and the first support claim line satisfy a history definition of the first claims processing rule. 23. The apparatus of claim 17, wherein the current claim line, the first support claim line, and the second support claim line are from the same claim. 24. The apparatus of claim 17, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to receive input creating the entry for the first claims processing rule in the table. | 2,100 |
4,795 | 13,698,307 | 2,133 | In order to optimize cache memory management, the invention proposes a method and corresponding apparatus that comprises application of different cache memory management policies according to data origin and possibly to data type and the use of increasing levels of exclusion from adding to cache of data the exclusion levels being increasingly restrictive with regard to adding data to cache as the cache memory fill level increases. The method and device allows among others to keep important information in cache memory and reduce time spent in swapping information in- and out of cache memory. | 1. A Method of cache memory management implemented in a user receiver device, wherein it comprises the following steps:
reception of a request for adding of data to said cache memory; stagewise exclusion of adding of data to said cache memory as cache memory fill level increases, and said stagewise exclusion of adding being determined, for each successive stage of cache memory fill level, according to rules of exclusion of adding of data to said cache memory that are increasingly restrictive. 2. The Method according to claim 1, wherein said method further comprises a step of:
exclusion of adding of said data to said cache memory if cache memory fill level is higher than a first stage of cache memory fill level that is lower than a maximum stage of cache memory fill level. 3. The Method according to claim 13, wherein said method further comprises a step of:
maintaining a list of preferred service offering providers in said user receiver device, and determination if a service provider from which said data to add originates is in said list; and if it is determined that said service offering provider is not in said list and cache memory fill level is under a second stage of cache memory fill level that is lower than said first stage of cache memory fill level, and if it is determined that a type of said data is in a list of preferred data types, said list of preferred data types being present in said receiver device, adding of said data to said cache memory. 4. The Method according to claim 3, wherein said method further comprises a step of:
if said cache memory fill level is under a third stage of cache memory fill level that is lower than said second stage of cache memory fill level, adding of said data to said cache memory. 5. The Method according to claim 3, wherein said list of preferred data types comprises an image type. 6. The Method according to claim 3, wherein said list of preferred data types comprises an executable script type. 7. The Method according to claim 3, wherein said determination if said service offering provider from which said data originates is in said list of preferred service offering providers, is based on a comparison of a Unified Resource Locator present in said request with said Unified Resource Locators of said preferred service offering providers in said list of preferred service offering providers. 8. The Method according to claim 3, wherein said determination if said service offering provider from which said data originates is in said list of preferred service offering providers, is based on a comparison of an Internet Protocol address present in said request, indicating an origin of said data, with Internet Protocol addresses of said preferred service offering providers in said list of preferred service offering providers. 9. A device for management of cache memory, wherein said device comprises the following means:
means for reception of a request for adding of data to said cache memory; a controller for stagewise exclusion of adding of data to said cache memory as cache memory fill level increases, and said stagewise exclusion of adding being determined, by said controller, for each successive stage of cache memory fill level, according to rules of exclusion of adding of data to said cache memory that are increasingly restrictive. 10. The device according to claim 9, wherein said controller further determines exclusion of adding of said data to said cache memory if cache memory fill level is higher than a first stage of cache memory fill level that is lower than a maximum stage of cache memory fill level. 11. The device according to claim 14, wherein said controller further comprises:
means to maintain a list of preferred service offering providers, and means for determining if a service provider from which said data to add originates is in said list; and means for determination if said service offering provider from which said data to add is not in said list and cache memory fill level is under a second stage of cache memory fill level that is lower than said first stage of cache memory fill level, and if it is determined by said controller that a type of said data is in a list of preferred data types, said list of preferred data types being present in said device, said controller adds said data to said cache memory. 12. The device according to claim 11, wherein said controller further comprises means to determine if said cache memory fill level is under a third stage of cache memory fill level that is lower than said second stage of cache memory fill level, said controller adds said data to said cache memory. 13. The method according to claim 1, wherein said rules of exclusion of adding of data to said cache memory are increasingly restrictive as a function of at least one of an origin of data and type of data. 14. The device according to claim 9, wherein said rules of exclusion of adding of data to said cache memory are increasingly restrictive as a function of at least one of an origin of data and type of data. | In order to optimize cache memory management, the invention proposes a method and corresponding apparatus that comprises application of different cache memory management policies according to data origin and possibly to data type and the use of increasing levels of exclusion from adding to cache of data the exclusion levels being increasingly restrictive with regard to adding data to cache as the cache memory fill level increases. The method and device allows among others to keep important information in cache memory and reduce time spent in swapping information in- and out of cache memory.1. A Method of cache memory management implemented in a user receiver device, wherein it comprises the following steps:
reception of a request for adding of data to said cache memory; stagewise exclusion of adding of data to said cache memory as cache memory fill level increases, and said stagewise exclusion of adding being determined, for each successive stage of cache memory fill level, according to rules of exclusion of adding of data to said cache memory that are increasingly restrictive. 2. The Method according to claim 1, wherein said method further comprises a step of:
exclusion of adding of said data to said cache memory if cache memory fill level is higher than a first stage of cache memory fill level that is lower than a maximum stage of cache memory fill level. 3. The Method according to claim 13, wherein said method further comprises a step of:
maintaining a list of preferred service offering providers in said user receiver device, and determination if a service provider from which said data to add originates is in said list; and if it is determined that said service offering provider is not in said list and cache memory fill level is under a second stage of cache memory fill level that is lower than said first stage of cache memory fill level, and if it is determined that a type of said data is in a list of preferred data types, said list of preferred data types being present in said receiver device, adding of said data to said cache memory. 4. The Method according to claim 3, wherein said method further comprises a step of:
if said cache memory fill level is under a third stage of cache memory fill level that is lower than said second stage of cache memory fill level, adding of said data to said cache memory. 5. The Method according to claim 3, wherein said list of preferred data types comprises an image type. 6. The Method according to claim 3, wherein said list of preferred data types comprises an executable script type. 7. The Method according to claim 3, wherein said determination if said service offering provider from which said data originates is in said list of preferred service offering providers, is based on a comparison of a Unified Resource Locator present in said request with said Unified Resource Locators of said preferred service offering providers in said list of preferred service offering providers. 8. The Method according to claim 3, wherein said determination if said service offering provider from which said data originates is in said list of preferred service offering providers, is based on a comparison of an Internet Protocol address present in said request, indicating an origin of said data, with Internet Protocol addresses of said preferred service offering providers in said list of preferred service offering providers. 9. A device for management of cache memory, wherein said device comprises the following means:
means for reception of a request for adding of data to said cache memory; a controller for stagewise exclusion of adding of data to said cache memory as cache memory fill level increases, and said stagewise exclusion of adding being determined, by said controller, for each successive stage of cache memory fill level, according to rules of exclusion of adding of data to said cache memory that are increasingly restrictive. 10. The device according to claim 9, wherein said controller further determines exclusion of adding of said data to said cache memory if cache memory fill level is higher than a first stage of cache memory fill level that is lower than a maximum stage of cache memory fill level. 11. The device according to claim 14, wherein said controller further comprises:
means to maintain a list of preferred service offering providers, and means for determining if a service provider from which said data to add originates is in said list; and means for determination if said service offering provider from which said data to add is not in said list and cache memory fill level is under a second stage of cache memory fill level that is lower than said first stage of cache memory fill level, and if it is determined by said controller that a type of said data is in a list of preferred data types, said list of preferred data types being present in said device, said controller adds said data to said cache memory. 12. The device according to claim 11, wherein said controller further comprises means to determine if said cache memory fill level is under a third stage of cache memory fill level that is lower than said second stage of cache memory fill level, said controller adds said data to said cache memory. 13. The method according to claim 1, wherein said rules of exclusion of adding of data to said cache memory are increasingly restrictive as a function of at least one of an origin of data and type of data. 14. The device according to claim 9, wherein said rules of exclusion of adding of data to said cache memory are increasingly restrictive as a function of at least one of an origin of data and type of data. | 2,100 |
4,796 | 14,446,191 | 2,139 | The failure of a storage unit in a storage array of a storage system may render the storage unit unresponsive to any requests. Any writes to the storage system that occur during the failure of the storage unit will not be reflected on the failed unit, rendering some of the failed unit's data stale. Assuming the failed unit's data is not corrupted but is just stale, a partial rebuild may be performed on the failed unit, selectively reconstructing only data that is needed to replace the stale data. Described herein are techniques for storing information that identifies the data that needs to be rebuilt. When the storage unit fails, the segment identifier associated with the last data segment written to the storage system may be stored. Upon the storage unit recovering, the storage system can rebuild only those data segments whose identifier is greater than the stored segment identifier. | 1. A method for a storage system having a plurality of storage units, the method comprising:
maintaining a segment map in a persistent storage, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers; prior to a first one of the storage units failing, processing by the storage system a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers; in response to the first storage unit failing, storing a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests; subsequent to the first storage unit failing, processing by the storage system a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and subsequent to the first storage unit being recovered, determining a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 2. The method of claim 1, wherein the persistent storage is a part of the plurality of storage units. 3. The method of claim 1, wherein the persistent storage is a part of a non-volatile random access memory (NVRAM). 4. The method of claim 1, further comprising, for each stripe identified in the set of stripe numbers, rebuilding on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 5. The method of claim 1, further comprising, in response to the first storage unit failing, storing an identifier of the first storage unit on the second storage unit. 6. The method of claim 5, further comprising, subsequent to the recovery of the first storage unit, determining that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 7. The method of claim 1, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. 8. The method of claim 1, further comprising, storing a second one of the segment identifiers from the segment map on the second storage unit, the second segment identifier being associated with the last write request that was processed from the second sequence of write requests. 9. The method of claim 1, further comprising, each time a portion of a data segment is rebuilt on the first storage unit, advancing the first segment identifier to a segment identifier in the segment map that is higher in value than the first segment identifier. 10. The method of claim 9, further comprising:
receiving a read request from a host device for data on the first storage unit while a partial rebuild process is being performed on the first storage unit; determining whether the read requested is directed at one or more stripes having stripe numbers within the set of stripe numbers; and if so, reconstructing the requested data and transmitting the reconstructed data to the host device, otherwise, transmitting the requested data from the first storage unit to the host device. 11. A storage system, comprising:
a plurality of storage units; a persistent storage, wherein the persistent storage is a part of the plurality of storage units; a main memory; a processor communicatively coupled to the plurality of storage units and the main memory; and software instructions on the main memory that, when executed by the processor, cause the processor to:
maintain a segment map in the persistent storage, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers;
prior to a first one of the storage units failing, process a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers;
in response to the first storage unit failing, store a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests;
subsequent to the first storage unit failing, process a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and
subsequent to the first storage unit being recovered, determine a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 12. The storage system of claim 11, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, for each stripe identified in the set of stripe numbers, rebuild on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 13. The storage system of claim 11, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, in response to the first storage unit failing, store an identifier of the first storage unit on the second storage unit. 14. The storage system of claim 13, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, subsequent to the recovery of the first storage unit, determine that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 15. The storage system of claim 11, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. 16. A non-transitory machine-readable storage medium for a storage system having a plurality of storage units, a main memory, and a processor communicatively coupled to the plurality of storage units and the main memory, the non-transitory machine-readable storage medium comprising software instructions that, when executed by the processor, cause the processor to:
maintain a segment map in one or more of the storage units, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers; prior to a first one of the storage units failing, process a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers; in response to the first storage unit failing, store a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests; subsequent to the first storage unit failing, process a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and subsequent to the first storage unit being recovered, determine a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 17. The storage system of claim 16, further comprising software instructions that, when executed by the processor, cause the processor to, for each stripe identified in the set of stripe numbers, rebuild on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 18. The storage system of claim 16, further comprising software instructions that, when executed by the processor, cause the processor to, in response to the first storage unit failing, store an identifier of the first storage unit on the second storage unit. 19. The storage system of claim 18, further comprising software instructions that, when executed by the processor, cause the processor to, subsequent to the recovery of the first storage unit, determine that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 20. The storage system of claim 16, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. | The failure of a storage unit in a storage array of a storage system may render the storage unit unresponsive to any requests. Any writes to the storage system that occur during the failure of the storage unit will not be reflected on the failed unit, rendering some of the failed unit's data stale. Assuming the failed unit's data is not corrupted but is just stale, a partial rebuild may be performed on the failed unit, selectively reconstructing only data that is needed to replace the stale data. Described herein are techniques for storing information that identifies the data that needs to be rebuilt. When the storage unit fails, the segment identifier associated with the last data segment written to the storage system may be stored. Upon the storage unit recovering, the storage system can rebuild only those data segments whose identifier is greater than the stored segment identifier.1. A method for a storage system having a plurality of storage units, the method comprising:
maintaining a segment map in a persistent storage, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers; prior to a first one of the storage units failing, processing by the storage system a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers; in response to the first storage unit failing, storing a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests; subsequent to the first storage unit failing, processing by the storage system a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and subsequent to the first storage unit being recovered, determining a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 2. The method of claim 1, wherein the persistent storage is a part of the plurality of storage units. 3. The method of claim 1, wherein the persistent storage is a part of a non-volatile random access memory (NVRAM). 4. The method of claim 1, further comprising, for each stripe identified in the set of stripe numbers, rebuilding on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 5. The method of claim 1, further comprising, in response to the first storage unit failing, storing an identifier of the first storage unit on the second storage unit. 6. The method of claim 5, further comprising, subsequent to the recovery of the first storage unit, determining that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 7. The method of claim 1, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. 8. The method of claim 1, further comprising, storing a second one of the segment identifiers from the segment map on the second storage unit, the second segment identifier being associated with the last write request that was processed from the second sequence of write requests. 9. The method of claim 1, further comprising, each time a portion of a data segment is rebuilt on the first storage unit, advancing the first segment identifier to a segment identifier in the segment map that is higher in value than the first segment identifier. 10. The method of claim 9, further comprising:
receiving a read request from a host device for data on the first storage unit while a partial rebuild process is being performed on the first storage unit; determining whether the read requested is directed at one or more stripes having stripe numbers within the set of stripe numbers; and if so, reconstructing the requested data and transmitting the reconstructed data to the host device, otherwise, transmitting the requested data from the first storage unit to the host device. 11. A storage system, comprising:
a plurality of storage units; a persistent storage, wherein the persistent storage is a part of the plurality of storage units; a main memory; a processor communicatively coupled to the plurality of storage units and the main memory; and software instructions on the main memory that, when executed by the processor, cause the processor to:
maintain a segment map in the persistent storage, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers;
prior to a first one of the storage units failing, process a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers;
in response to the first storage unit failing, store a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests;
subsequent to the first storage unit failing, process a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and
subsequent to the first storage unit being recovered, determine a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 12. The storage system of claim 11, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, for each stripe identified in the set of stripe numbers, rebuild on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 13. The storage system of claim 11, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, in response to the first storage unit failing, store an identifier of the first storage unit on the second storage unit. 14. The storage system of claim 13, further comprising software instructions on the main memory that, when executed by the processor, cause the processor to, subsequent to the recovery of the first storage unit, determine that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 15. The storage system of claim 11, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. 16. A non-transitory machine-readable storage medium for a storage system having a plurality of storage units, a main memory, and a processor communicatively coupled to the plurality of storage units and the main memory, the non-transitory machine-readable storage medium comprising software instructions that, when executed by the processor, cause the processor to:
maintain a segment map in one or more of the storage units, the segment map associating a plurality of segment identifiers with a plurality of stripe numbers; prior to a first one of the storage units failing, process a first sequence of write requests, the first sequence of write requests being associated with a first sequence of the segment identifiers; in response to the first storage unit failing, store a first one of the segment identifiers from the segment map on a second one of the storage units, the first segment identifier being associated with the last write request that was processed from the first sequence of write requests; subsequent to the first storage unit failing, process a second sequence of write requests, the second sequence of write requests being associated with a second sequence of the segment identifiers; and subsequent to the first storage unit being recovered, determine a set of stripe numbers associated with content to be rebuilt on the first storage unit, wherein the determination is based on the segment map and the first segment identifier. 17. The storage system of claim 16, further comprising software instructions that, when executed by the processor, cause the processor to, for each stripe identified in the set of stripe numbers, rebuild on the first storage unit a portion of the content that belongs to the stripe and the first storage unit. 18. The storage system of claim 16, further comprising software instructions that, when executed by the processor, cause the processor to, in response to the first storage unit failing, store an identifier of the first storage unit on the second storage unit. 19. The storage system of claim 18, further comprising software instructions that, when executed by the processor, cause the processor to, subsequent to the recovery of the first storage unit, determine that a partial rebuild process needs to be performed on the first storage unit based on the identifier of the first storage unit that was stored on the second storage unit. 20. The storage system of claim 16, wherein the set of stripe numbers are associated with ones of the segment identifiers that are greater than the first segment identifier. | 2,100 |
4,797 | 12,822,684 | 2,176 | Methods, systems, e.g., handheld device(s), and computer-program products are disclosed for a user selecting a control component, e.g., a control unit, of an application program. A plurality of available control components can be detected. A shortcut key can be assigned to each detected control component. The assigned shortcut key corresponding to each detected control component can be displayed. An instruction can be transmitted, responsive to one of the shortcut keys being initiated by the user, to the application program to select the corresponding control component. | 1. A method for a user to select a control component from a plurality of control components of an application program within a handheld device, the method comprising:
detecting a plurality of available control components within a handheld device; assigning a shortcut key to each detected control component; displaying, via the handheld device, the assigned shortcut key corresponding to each detected control component; and transmitting an instruction, responsive to one of the shortcut keys being initiated, to the application program to select the corresponding control component. 2. The method according to claim 1, wherein detecting a plurality of available control components within a handheld device further comprises:
re-detecting the plurality of available control components responsive to a browsing operation by the user; and updating the shortcut key assigned to each control component determined through the re-detecting. 3. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as a first effected control component; identifying at least one newly available control component that is available in consequence of the re-detecting as a second effected control component; releasing the shortcut key assigned to the first effected control component; and assigning a shortcut key to the second effected control component. 4. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component; and releasing the shortcut key assigned to the effected control component. 5. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one newly available control component that is available in consequence of the re-detecting as an effected control component; and assigning a shortcut key to the effected control component. 6. The method according to claim 2, wherein updating the shortcut key assigned to the detected control component further comprises:
releasing all assigned shortcut keys; and assigning a shortcut key to each control found in the redetection. 7. The method according to claim 1, wherein assigning a shortcut key to each detected control component further comprises:
determining whether the amount of the detected control components is more than a predetermined quantity; assigning a shortcut key for control components within the predetermined value; and generating and assigning a composite shortcut key to each control component over the predetermined quantity. 8. A handheld device, comprising:
a processor for executing program code to provide the following modules:
an operating system;
an intermediate module, within the operating system, comprising a handling module and a graphic library;
an application program, within the intermediate module, accessing a plurality of control components by calling the graphic libraries;
a display device for displaying the plurality of control components; and an input device having shortcut keys in a predetermined quantity, wherein the handling module detects a plurality of available control components and assigns a shortcut key to each detected control component, wherein the assigned shortcut keys are displayed corresponding to each detected control component on the display device, and wherein the intermediate module transmits an instruction, responsive to one of the shortcut keys being initiated, to the application program to select the corresponding control component. 9. The handheld device according to claim 8, wherein the intermediate module further re-detects the plurality of available control components responsive to a browsing operation by the user and updates the shortcut key assigned to each control component that is determined from the re-detecting. 10. The handheld device according to claim 9, wherein the intermediate module identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component and releases the shortcut key assigned to the effected control component. 11. The handheld device according to claim 9, wherein the intermediate module identifies at least one newly available control component that is available in consequence of the re-detecting as an effected control component and assigns a shortcut key to the effected control component. 12. The handheld device according to claim 9, wherein the intermediate module further identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as a first effected control component, identifies at least one newly available control component that is available in consequence of the re-detecting as a second effected control component, releases the shortcut key assigned to the first effected control component, and assigns a shortcut key to the second effected control component. 13. The handheld device according to claim 9, wherein the intermediate module releases all assigned shortcut keys and assigns a shortcut key to each control found in the re-detecting. 14. The handheld device according to claim 8, wherein the intermediate module further determines whether the amount of the detected control components is more than a predetermined quantity, assigns a shortcut key for control components within the predetermined value, and generates and assigns a composite shortcut key to each control component over the predetermined quantity. 15. A computer program product comprising:
a computer readable storage medium having stored thereon computer readable program code that, when executed by a system, implements a method for a user to select a control component from a plurality of control components of an application program within a handheld device, the computer readable storage medium comprising: computer readable program code that detects a plurality of available control components; computer readable program code that assigns a shortcut key to each detected control component; computer readable program code that displays the assigned shortcut key corresponding to each detected control component; and computer readable program code that transmits an instruction, responsive to one of the shortcut keys being initiated by the user, to the application program to select the corresponding control component. 16. The computer program product according to claim 15, wherein the computer readable program code that detects a plurality of available control components further comprises:
computer readable program code that re-detects the plurality of available control components responsive to a browsing operation by the user; and computer readable program code that updates the shortcut key assigned to each control component determined through re-detecting. 17. The computer program product according to claim 16, wherein the computer readable program code that updates the shortcut key assigned to each control component through re-detecting further comprises:
computer readable program code that identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component; and computer readable program code that releases the shortcut key assigned to the effected control component. 18. The computer program product according to claim 16, wherein the computer readable program code that updates the shortcut key assigned to each control component through re-detecting further comprises:
computer readable program code that identifies at least one newly available control component that is available in consequence of the re-detecting as an effected control component; and computer readable program code that assigns a shortcut key to the effected control component. 19. The computer program product according to claim 15, wherein the computer readable program code that detects a plurality of available control components further comprises:
computer readable program code that releases all assigned shortcut keys; and computer readable program code that assigns a shortcut key to each control found in the re-detecting. 20. The computer program product according to claim 15, wherein the computer readable program code that assigns a shortcut key to each detected control component further comprises:
computer readable program code that determines whether the amount of the detected control components is more than a predetermined quantity; computer readable program code that assigns a shortcut key for control components within the predetermined value; and computer readable program code that generates and assigns a composite shortcut key to each control component over the predetermined quantity. | Methods, systems, e.g., handheld device(s), and computer-program products are disclosed for a user selecting a control component, e.g., a control unit, of an application program. A plurality of available control components can be detected. A shortcut key can be assigned to each detected control component. The assigned shortcut key corresponding to each detected control component can be displayed. An instruction can be transmitted, responsive to one of the shortcut keys being initiated by the user, to the application program to select the corresponding control component.1. A method for a user to select a control component from a plurality of control components of an application program within a handheld device, the method comprising:
detecting a plurality of available control components within a handheld device; assigning a shortcut key to each detected control component; displaying, via the handheld device, the assigned shortcut key corresponding to each detected control component; and transmitting an instruction, responsive to one of the shortcut keys being initiated, to the application program to select the corresponding control component. 2. The method according to claim 1, wherein detecting a plurality of available control components within a handheld device further comprises:
re-detecting the plurality of available control components responsive to a browsing operation by the user; and updating the shortcut key assigned to each control component determined through the re-detecting. 3. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as a first effected control component; identifying at least one newly available control component that is available in consequence of the re-detecting as a second effected control component; releasing the shortcut key assigned to the first effected control component; and assigning a shortcut key to the second effected control component. 4. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component; and releasing the shortcut key assigned to the effected control component. 5. The method according to claim 2, wherein updating the shortcut key assigned to each control component determined through re-detecting further comprises:
identifying at least one newly available control component that is available in consequence of the re-detecting as an effected control component; and assigning a shortcut key to the effected control component. 6. The method according to claim 2, wherein updating the shortcut key assigned to the detected control component further comprises:
releasing all assigned shortcut keys; and assigning a shortcut key to each control found in the redetection. 7. The method according to claim 1, wherein assigning a shortcut key to each detected control component further comprises:
determining whether the amount of the detected control components is more than a predetermined quantity; assigning a shortcut key for control components within the predetermined value; and generating and assigning a composite shortcut key to each control component over the predetermined quantity. 8. A handheld device, comprising:
a processor for executing program code to provide the following modules:
an operating system;
an intermediate module, within the operating system, comprising a handling module and a graphic library;
an application program, within the intermediate module, accessing a plurality of control components by calling the graphic libraries;
a display device for displaying the plurality of control components; and an input device having shortcut keys in a predetermined quantity, wherein the handling module detects a plurality of available control components and assigns a shortcut key to each detected control component, wherein the assigned shortcut keys are displayed corresponding to each detected control component on the display device, and wherein the intermediate module transmits an instruction, responsive to one of the shortcut keys being initiated, to the application program to select the corresponding control component. 9. The handheld device according to claim 8, wherein the intermediate module further re-detects the plurality of available control components responsive to a browsing operation by the user and updates the shortcut key assigned to each control component that is determined from the re-detecting. 10. The handheld device according to claim 9, wherein the intermediate module identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component and releases the shortcut key assigned to the effected control component. 11. The handheld device according to claim 9, wherein the intermediate module identifies at least one newly available control component that is available in consequence of the re-detecting as an effected control component and assigns a shortcut key to the effected control component. 12. The handheld device according to claim 9, wherein the intermediate module further identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as a first effected control component, identifies at least one newly available control component that is available in consequence of the re-detecting as a second effected control component, releases the shortcut key assigned to the first effected control component, and assigns a shortcut key to the second effected control component. 13. The handheld device according to claim 9, wherein the intermediate module releases all assigned shortcut keys and assigns a shortcut key to each control found in the re-detecting. 14. The handheld device according to claim 8, wherein the intermediate module further determines whether the amount of the detected control components is more than a predetermined quantity, assigns a shortcut key for control components within the predetermined value, and generates and assigns a composite shortcut key to each control component over the predetermined quantity. 15. A computer program product comprising:
a computer readable storage medium having stored thereon computer readable program code that, when executed by a system, implements a method for a user to select a control component from a plurality of control components of an application program within a handheld device, the computer readable storage medium comprising: computer readable program code that detects a plurality of available control components; computer readable program code that assigns a shortcut key to each detected control component; computer readable program code that displays the assigned shortcut key corresponding to each detected control component; and computer readable program code that transmits an instruction, responsive to one of the shortcut keys being initiated by the user, to the application program to select the corresponding control component. 16. The computer program product according to claim 15, wherein the computer readable program code that detects a plurality of available control components further comprises:
computer readable program code that re-detects the plurality of available control components responsive to a browsing operation by the user; and computer readable program code that updates the shortcut key assigned to each control component determined through re-detecting. 17. The computer program product according to claim 16, wherein the computer readable program code that updates the shortcut key assigned to each control component through re-detecting further comprises:
computer readable program code that identifies at least one of the plurality of available control components that is no longer available in consequence of the re-detecting as an effected control component; and computer readable program code that releases the shortcut key assigned to the effected control component. 18. The computer program product according to claim 16, wherein the computer readable program code that updates the shortcut key assigned to each control component through re-detecting further comprises:
computer readable program code that identifies at least one newly available control component that is available in consequence of the re-detecting as an effected control component; and computer readable program code that assigns a shortcut key to the effected control component. 19. The computer program product according to claim 15, wherein the computer readable program code that detects a plurality of available control components further comprises:
computer readable program code that releases all assigned shortcut keys; and computer readable program code that assigns a shortcut key to each control found in the re-detecting. 20. The computer program product according to claim 15, wherein the computer readable program code that assigns a shortcut key to each detected control component further comprises:
computer readable program code that determines whether the amount of the detected control components is more than a predetermined quantity; computer readable program code that assigns a shortcut key for control components within the predetermined value; and computer readable program code that generates and assigns a composite shortcut key to each control component over the predetermined quantity. | 2,100 |
4,798 | 15,081,438 | 2,157 | Systems and computer program products for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. | 1. A computer program product for determining a relationship score between a first entity and a second entity, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
generate, by the processor, a first computer-readable representation of a first spatial region containing the first entity; generate, by the processor, a second computer-readable representation of a second spatial region containing the second entity; compare, by the processor, the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assign, by the processor, a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. 2. The computer program product of claim 1, wherein the matching condition includes one or more of:
an exact match of the first computer-readable representation and the second computer-readable representation, a partial match of the first computer-readable representation and the second computer-readable representation, and no match between the first computer-readable representation and the second computer-readable representation. 3. The computer program product of claim 1, further comprising program code executable by the processor to:
determine and take into account a temporal proximity between the first entity and the second entity when assigning the relationship score. 4. The computer program product of claim 3, wherein the program code executable by a processor to determine and take into account a temporal proximity includes program code executable by the processor to:
generate a first computer-readable representation of a first time interval associated with the first entity; generate a second computer-readable representation of a second time interval associated with the second entity; compare the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a temporal matching condition is reached; and assign a temporal relationship score to one or more of the first entity and the second entity based on the resolution at which the temporal matching condition is reached. 5. The computer program product of claim 4, further comprising program code executable by a processor to:
multiply the temporal relationship score and the relationship score to obtain a combined temporal and spatial relationship score. 6. The computer program product of claim 1, wherein the first and second computer-readable representations are bit vectors and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the bit vectors, dithering the bit vectors, applying compression algorithms to the bit vectors, generating additional bit vectors representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating, dithering, or applying compression algorithms to one or more of the additional bit vectors. 7. The computer program product of claim 1, wherein the first and second computer-readable representations are geohash values and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the geohash values, generating additional geohash values representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating one or more of the additional geohash values. 8. The computer program product of claim 4, wherein the first and second computer-readable representations reflect time intervals and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
extending the time intervals forward and backward in time, fitting the time intervals into larger quanta of a determinate size in a predefined temporal grid. 9. A system for determining a relationship score between a first entity and a second entity, comprising:
a processor; and a memory comprising instructions that when executed by the processor causes the following operations to be performed by the processor: generating a first computer-readable representation of a first spatial region containing the first entity; generating a second computer-readable representation of a second spatial region containing the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assigning a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. | Systems and computer program products for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.1. A computer program product for determining a relationship score between a first entity and a second entity, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
generate, by the processor, a first computer-readable representation of a first spatial region containing the first entity; generate, by the processor, a second computer-readable representation of a second spatial region containing the second entity; compare, by the processor, the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assign, by the processor, a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. 2. The computer program product of claim 1, wherein the matching condition includes one or more of:
an exact match of the first computer-readable representation and the second computer-readable representation, a partial match of the first computer-readable representation and the second computer-readable representation, and no match between the first computer-readable representation and the second computer-readable representation. 3. The computer program product of claim 1, further comprising program code executable by the processor to:
determine and take into account a temporal proximity between the first entity and the second entity when assigning the relationship score. 4. The computer program product of claim 3, wherein the program code executable by a processor to determine and take into account a temporal proximity includes program code executable by the processor to:
generate a first computer-readable representation of a first time interval associated with the first entity; generate a second computer-readable representation of a second time interval associated with the second entity; compare the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a temporal matching condition is reached; and assign a temporal relationship score to one or more of the first entity and the second entity based on the resolution at which the temporal matching condition is reached. 5. The computer program product of claim 4, further comprising program code executable by a processor to:
multiply the temporal relationship score and the relationship score to obtain a combined temporal and spatial relationship score. 6. The computer program product of claim 1, wherein the first and second computer-readable representations are bit vectors and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the bit vectors, dithering the bit vectors, applying compression algorithms to the bit vectors, generating additional bit vectors representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating, dithering, or applying compression algorithms to one or more of the additional bit vectors. 7. The computer program product of claim 1, wherein the first and second computer-readable representations are geohash values and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the geohash values, generating additional geohash values representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating one or more of the additional geohash values. 8. The computer program product of claim 4, wherein the first and second computer-readable representations reflect time intervals and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
extending the time intervals forward and backward in time, fitting the time intervals into larger quanta of a determinate size in a predefined temporal grid. 9. A system for determining a relationship score between a first entity and a second entity, comprising:
a processor; and a memory comprising instructions that when executed by the processor causes the following operations to be performed by the processor: generating a first computer-readable representation of a first spatial region containing the first entity; generating a second computer-readable representation of a second spatial region containing the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assigning a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. | 2,100 |
4,799 | 15,081,458 | 2,157 | Methods for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. | 1. A computer implemented method for determining a relationship score between a first entity and a second entity, comprising:
generating a first computer-readable representation of a first spatial region containing the first entity; generating a second computer-readable representation of a second spatial region containing the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assigning a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. 2. The method of claim 1, wherein the matching condition includes one or more of:
an exact match of the first computer-readable representation and the second computer-readable representation, a partial match of the first computer-readable representation and the second computer-readable representation, and no match between the first computer-readable representation and the second computer-readable representation. 3. The method of claim 1, further comprising:
determining and taking into account a temporal proximity between the first entity and the second entity when assigning the relationship score. 4. The method of claim 3, wherein determining and taking into account a temporal proximity includes:
generating a first computer-readable representation of a first time interval associated with the first entity; generating a second computer-readable representation of a second time interval associated with the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a temporal matching condition is reached; and assigning a temporal relationship score to one or more of the first entity and the second entity based on the resolution at which the temporal matching condition is reached. 5. The method of claim 4, further comprising:
multiplying the temporal relationship score and the relationship score to obtain a combined temporal and spatial relationship score. 6. The method of claim 1, wherein the first and second computer-readable representations are bit vectors and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the bit vectors, dithering the bit vectors, applying compression algorithms to the bit vectors, generating additional bit vectors representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating, dithering, or applying compression algorithms to one or more of the additional bit vectors. 7. The method of claim 1, wherein the first and second computer-readable representations are geohash values and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the geohash values, generating additional geohash values representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating one or more of the additional geohash values. 8. The method of claim 4, wherein the first and second computer-readable representations reflect time intervals and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
extending the time intervals forward and backward in time, fitting the time intervals into larger quanta of a determinate size in a predefined temporal grid. | Methods for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.1. A computer implemented method for determining a relationship score between a first entity and a second entity, comprising:
generating a first computer-readable representation of a first spatial region containing the first entity; generating a second computer-readable representation of a second spatial region containing the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and assigning a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached. 2. The method of claim 1, wherein the matching condition includes one or more of:
an exact match of the first computer-readable representation and the second computer-readable representation, a partial match of the first computer-readable representation and the second computer-readable representation, and no match between the first computer-readable representation and the second computer-readable representation. 3. The method of claim 1, further comprising:
determining and taking into account a temporal proximity between the first entity and the second entity when assigning the relationship score. 4. The method of claim 3, wherein determining and taking into account a temporal proximity includes:
generating a first computer-readable representation of a first time interval associated with the first entity; generating a second computer-readable representation of a second time interval associated with the second entity; comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a temporal matching condition is reached; and assigning a temporal relationship score to one or more of the first entity and the second entity based on the resolution at which the temporal matching condition is reached. 5. The method of claim 4, further comprising:
multiplying the temporal relationship score and the relationship score to obtain a combined temporal and spatial relationship score. 6. The method of claim 1, wherein the first and second computer-readable representations are bit vectors and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the bit vectors, dithering the bit vectors, applying compression algorithms to the bit vectors, generating additional bit vectors representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating, dithering, or applying compression algorithms to one or more of the additional bit vectors. 7. The method of claim 1, wherein the first and second computer-readable representations are geohash values and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
truncating the geohash values, generating additional geohash values representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and truncating one or more of the additional geohash values. 8. The method of claim 4, wherein the first and second computer-readable representations reflect time intervals and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
extending the time intervals forward and backward in time, fitting the time intervals into larger quanta of a determinate size in a predefined temporal grid. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.