Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
5,600 | 5,600 | 15,176,300 | 2,191 | A method for verifying that software modules have a consistent code level is disclosed. In one embodiment, such a method includes updating a software product comprising a plurality of software modules. Upon updating the software product, the method updates a code-level table that documents an expected code level for each of the software modules. When a software module is called, the method determines an actual code level of the software module and compares the actual code level with the expected code level indicated in the code-level table. If the actual code level matches the expected code level, the method allows execution of the software module. If the actual code level does not match the expected code level, the method terminates execution of the software module. A corresponding system and computer program product are also disclosed. | 1. A method for verifying that software modules have a consistent code level, the method comprising:
updating a software product comprising a plurality of software modules; creating, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly; upon calling a software module of the plurality of software modules, comparing an actual code level of the software module with the expected code level indicated in the code-level table; in the event the actual code level matches the expected code level, allowing execution of the software module; and in the event the actual code level does not match the expected code level, terminating execution of the software module. 2. The method of claim 1, wherein calling the software module comprises initially calling the software module. 3. The method of claim 2, further comprising, in the event the actual code level matches the expected code level, marking the software module as validated. 4. The method of claim 3, further comprising, prior to any future updates to the software product but after the software module has been validated, allowing execution of the software module without comparing the actual code level to the expected code level. 5. The method of claim 3, further comprising, in the event the software module is unloaded from memory, marking the software module as unvalidated. 6. The method of claim 3, further comprising, in the event the software product is once again updated, marking the software module as unvalidated. 7. The method of claim 1, wherein comparing the actual code level comprises looking for the actual code level within the software module. 8. A computer program product to verify that software modules have a consistent code level, the computer program product comprising a computer-readable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising:
computer-usable program code to update a software product comprising a plurality of software modules; computer-usable program code to create, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly; computer-usable program code to, upon calling a software module of the plurality of software modules, compare an actual code level of the software module with the expected code level indicated in the code-level table; computer-usable program code to, in the event the actual code level matches the expected code level, allow execution of the software module; and computer-usable program code to, in the event the actual code level does not match the expected code level, terminate execution of the software module. 9. The computer program product of claim 8, wherein calling the software module comprises initially calling the software module. 10. The computer program product of claim 9, further comprising computer-usable program code to, in the event the actual code level matches the expected code level, mark the software module as validated. 11. The computer program product of claim 10, further comprising computer-usable program code to, prior to any future updates to the software product but after the software module has been validated, allow execution of the software module without comparing the actual code level to the expected code level. 12. The computer program product of claim 10, further comprising computer-usable program code to, in the event the software module is unloaded from memory, mark the software module as unvalidated. 13. The computer program product of claim 10, further comprising computer-usable program code to, in the event the software product is once again updated, mark the software module as unvalidated. 14. The computer program product of claim 8, wherein comparing the actual code level comprises looking for the actual code level within the software module. 15. A system to verify that software modules have a consistent code level, the system comprising:
at least one processor; at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
update a software product comprising a plurality of software modules;
create, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly;
upon calling a software module of the plurality of software modules, compare an actual code level of the software module with the expected code level indicated in the code-level table;
in the event the actual code level matches the expected code level, allow execution of the software module; and
in the event the actual code level does not match the expected code level, terminate execution of the software module. 16. The system of claim 15, wherein calling the software module comprises initially calling the software module. 17. The system of claim 16, wherein the instructions further cause the at least one processor to, in the event the actual code level matches the expected code level, mark the software module as validated. 18. The system of claim 17, wherein the instructions further cause the at least one processor to, prior to any future updates to the software product but after the software module has been validated, allow execution of the software module without comparing the actual code level to the expected code level. 19. The system of claim 17, wherein the instructions further cause the at least one processor to, in the event the software module is unloaded from memory, mark the software module as unvalidated. 20. The system of claim 17, wherein the instructions further cause the at least one processor to, in the event the software product is once again updated, mark the software module as unvalidated. | A method for verifying that software modules have a consistent code level is disclosed. In one embodiment, such a method includes updating a software product comprising a plurality of software modules. Upon updating the software product, the method updates a code-level table that documents an expected code level for each of the software modules. When a software module is called, the method determines an actual code level of the software module and compares the actual code level with the expected code level indicated in the code-level table. If the actual code level matches the expected code level, the method allows execution of the software module. If the actual code level does not match the expected code level, the method terminates execution of the software module. A corresponding system and computer program product are also disclosed.1. A method for verifying that software modules have a consistent code level, the method comprising:
updating a software product comprising a plurality of software modules; creating, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly; upon calling a software module of the plurality of software modules, comparing an actual code level of the software module with the expected code level indicated in the code-level table; in the event the actual code level matches the expected code level, allowing execution of the software module; and in the event the actual code level does not match the expected code level, terminating execution of the software module. 2. The method of claim 1, wherein calling the software module comprises initially calling the software module. 3. The method of claim 2, further comprising, in the event the actual code level matches the expected code level, marking the software module as validated. 4. The method of claim 3, further comprising, prior to any future updates to the software product but after the software module has been validated, allowing execution of the software module without comparing the actual code level to the expected code level. 5. The method of claim 3, further comprising, in the event the software module is unloaded from memory, marking the software module as unvalidated. 6. The method of claim 3, further comprising, in the event the software product is once again updated, marking the software module as unvalidated. 7. The method of claim 1, wherein comparing the actual code level comprises looking for the actual code level within the software module. 8. A computer program product to verify that software modules have a consistent code level, the computer program product comprising a computer-readable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising:
computer-usable program code to update a software product comprising a plurality of software modules; computer-usable program code to create, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly; computer-usable program code to, upon calling a software module of the plurality of software modules, compare an actual code level of the software module with the expected code level indicated in the code-level table; computer-usable program code to, in the event the actual code level matches the expected code level, allow execution of the software module; and computer-usable program code to, in the event the actual code level does not match the expected code level, terminate execution of the software module. 9. The computer program product of claim 8, wherein calling the software module comprises initially calling the software module. 10. The computer program product of claim 9, further comprising computer-usable program code to, in the event the actual code level matches the expected code level, mark the software module as validated. 11. The computer program product of claim 10, further comprising computer-usable program code to, prior to any future updates to the software product but after the software module has been validated, allow execution of the software module without comparing the actual code level to the expected code level. 12. The computer program product of claim 10, further comprising computer-usable program code to, in the event the software module is unloaded from memory, mark the software module as unvalidated. 13. The computer program product of claim 10, further comprising computer-usable program code to, in the event the software product is once again updated, mark the software module as unvalidated. 14. The computer program product of claim 8, wherein comparing the actual code level comprises looking for the actual code level within the software module. 15. A system to verify that software modules have a consistent code level, the system comprising:
at least one processor; at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
update a software product comprising a plurality of software modules;
create, for the updated software product, a code-level table that documents an expected code level for each of the software modules to work together properly;
upon calling a software module of the plurality of software modules, compare an actual code level of the software module with the expected code level indicated in the code-level table;
in the event the actual code level matches the expected code level, allow execution of the software module; and
in the event the actual code level does not match the expected code level, terminate execution of the software module. 16. The system of claim 15, wherein calling the software module comprises initially calling the software module. 17. The system of claim 16, wherein the instructions further cause the at least one processor to, in the event the actual code level matches the expected code level, mark the software module as validated. 18. The system of claim 17, wherein the instructions further cause the at least one processor to, prior to any future updates to the software product but after the software module has been validated, allow execution of the software module without comparing the actual code level to the expected code level. 19. The system of claim 17, wherein the instructions further cause the at least one processor to, in the event the software module is unloaded from memory, mark the software module as unvalidated. 20. The system of claim 17, wherein the instructions further cause the at least one processor to, in the event the software product is once again updated, mark the software module as unvalidated. | 2,100 |
5,601 | 5,601 | 14,595,501 | 2,178 | A method of sending an integrated message using a portable device according includes executing an integrated message application supporting a plurality of channels including at least two channels having different messaging schemes. An input window permits entry of a message, and the message is displayed on a message display window. In response to a user selection for displaying icons of a hidden state that corresponds to the plurality of respective channels, displaying the icons corresponding to the plurality of respective channels in response to the user choice, and sending the message using at least one activated channel of the plurality of channels. | 1. A method for sending a message to a recipient device by using a portable device, the method comprising:
executing an integrated messaging application supporting a plurality of channels including a first channel and a second channel, wherein the first channel and the second channel are used for different types of messaging services; displaying a first Graphical User Interface (GUI) element to receive a touch input for activating the second channel; in response to the first GUI element being selected, transmitting the message via the first channel when the second channel is not owned by the recipient device; and in response the first GUI element not being selected, transmitting the message via the first channel regardless of whether the second channel is owned by the recipient device. 2. The method of claim 1, wherein the message is transmitted via the second channel, when the first GUI element is selected and the second channel is owned by the recipient device. 3. The method of claim 1, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel without attempting transmission over the second channel beforehand. 4. The method of claim 1, further comprising storing in a memory of the portable device an indication of whether the second channel is owned by the recipient device. 5. The method of claim 1, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel after a failure is generated as a result of an attempted transmission of the message over the first channel. 6. The method of claim 1, wherein, when the first GUI element is selected, the first channel is selected for transmission of the message based on the portable device lacking access to a predetermined communication network. 7. The method of claim 1, further comprising changing a characteristic of a window of the integrated messaging application based on whether the first GUI element is selected. 8. The method of claim 1, further comprising modifying a button that is part of the integrated messaging application based on whether the first GUI element is selected. 9. The method of claim 1, further comprising changing a label of a second GUI element that is part of the integrated messaging application based on whether the first GUI element is selected. 10. An electronic device for sending a message to a recipient device, the electronic device comprising a controller configured to:
execute an integrated messaging application supporting a plurality of channels including a first channel and a second channel, wherein the first channel and the second channel are used for different types of messaging services; display a first Graphical User Interface (GUI) element to receive a touch input for activating the second channel; in response to the first GUI element being selected, transmit the message via the first channel when the second channel is not owned by the recipient device; and in response the first GUI element not being selected, transmit the message via the first channel regardless of whether the second channel is owned by the recipient device. 11. The electronic device of claim 10, wherein the message is transmitted via the second channel, when the first GUI element is selected and the second channel is owned by the recipient device. 12. The electronic device of claim 10, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel without attempting transmission over the second channel beforehand. 13. The electronic device of claim 10, further comprising a memory storing an indication of whether the second channel is owned by the recipient device. 14. The electronic device of claim 10, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel after a failure is generated as a result of an attempted transmission of the message over the first channel. 15. The electronic device of claim 10, wherein, when the first GUI element is selected, the first channel is selected for transmission of the message based on the controller lacking access to a predetermined communication network. 16. The electronic device of claim 10, wherein the controller is further configured to change a characteristic of a window of the integrated messaging application based on whether the first GUI element is selected. 17. The electronic device of claim 10, wherein the controller is further configured to modify a button that is part of the integrated messaging application based on whether the first GUI element is selected. 18. The electronic device of claim 10, wherein the controller is further configured to change a label of a second GUI element that is part of the integrated messaging application based on whether the first GUI element is selected. | A method of sending an integrated message using a portable device according includes executing an integrated message application supporting a plurality of channels including at least two channels having different messaging schemes. An input window permits entry of a message, and the message is displayed on a message display window. In response to a user selection for displaying icons of a hidden state that corresponds to the plurality of respective channels, displaying the icons corresponding to the plurality of respective channels in response to the user choice, and sending the message using at least one activated channel of the plurality of channels.1. A method for sending a message to a recipient device by using a portable device, the method comprising:
executing an integrated messaging application supporting a plurality of channels including a first channel and a second channel, wherein the first channel and the second channel are used for different types of messaging services; displaying a first Graphical User Interface (GUI) element to receive a touch input for activating the second channel; in response to the first GUI element being selected, transmitting the message via the first channel when the second channel is not owned by the recipient device; and in response the first GUI element not being selected, transmitting the message via the first channel regardless of whether the second channel is owned by the recipient device. 2. The method of claim 1, wherein the message is transmitted via the second channel, when the first GUI element is selected and the second channel is owned by the recipient device. 3. The method of claim 1, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel without attempting transmission over the second channel beforehand. 4. The method of claim 1, further comprising storing in a memory of the portable device an indication of whether the second channel is owned by the recipient device. 5. The method of claim 1, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel after a failure is generated as a result of an attempted transmission of the message over the first channel. 6. The method of claim 1, wherein, when the first GUI element is selected, the first channel is selected for transmission of the message based on the portable device lacking access to a predetermined communication network. 7. The method of claim 1, further comprising changing a characteristic of a window of the integrated messaging application based on whether the first GUI element is selected. 8. The method of claim 1, further comprising modifying a button that is part of the integrated messaging application based on whether the first GUI element is selected. 9. The method of claim 1, further comprising changing a label of a second GUI element that is part of the integrated messaging application based on whether the first GUI element is selected. 10. An electronic device for sending a message to a recipient device, the electronic device comprising a controller configured to:
execute an integrated messaging application supporting a plurality of channels including a first channel and a second channel, wherein the first channel and the second channel are used for different types of messaging services; display a first Graphical User Interface (GUI) element to receive a touch input for activating the second channel; in response to the first GUI element being selected, transmit the message via the first channel when the second channel is not owned by the recipient device; and in response the first GUI element not being selected, transmit the message via the first channel regardless of whether the second channel is owned by the recipient device. 11. The electronic device of claim 10, wherein the message is transmitted via the second channel, when the first GUI element is selected and the second channel is owned by the recipient device. 12. The electronic device of claim 10, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel without attempting transmission over the second channel beforehand. 13. The electronic device of claim 10, further comprising a memory storing an indication of whether the second channel is owned by the recipient device. 14. The electronic device of claim 10, wherein, when the first GUI element is selected and the second channel is not owned by the recipient device, the message is transmitted via the first channel after a failure is generated as a result of an attempted transmission of the message over the first channel. 15. The electronic device of claim 10, wherein, when the first GUI element is selected, the first channel is selected for transmission of the message based on the controller lacking access to a predetermined communication network. 16. The electronic device of claim 10, wherein the controller is further configured to change a characteristic of a window of the integrated messaging application based on whether the first GUI element is selected. 17. The electronic device of claim 10, wherein the controller is further configured to modify a button that is part of the integrated messaging application based on whether the first GUI element is selected. 18. The electronic device of claim 10, wherein the controller is further configured to change a label of a second GUI element that is part of the integrated messaging application based on whether the first GUI element is selected. | 2,100 |
5,602 | 5,602 | 14,258,308 | 2,162 | Systems and methods are presented for generating a transition graph from check-in data for determining probabilistic transitions of a user from an origin (location) to a destination. Check-in data for a plurality of users is obtained. The check-in data is organized and analyzed to determine a set of transition tuples for each of the plurality of users. These transition tuples are aggregated and used to generate a transition graph comprising a plurality of nodes and edges. Each node corresponds to a location and each edge indicates a transition from an origin node to a destination node and is associated with a likelihood of a user transitioning from the origin node to the destination node. | 1. A computer-implemented method for generating a transition graph for determining probabilistic transitions, the method comprising each of the following as executed by a processor on a computing device:
obtaining check-in data of a plurality users, wherein each item of check-in data indicates the presence of a corresponding user at a location; sorting the check-in data according the corresponding users; determining a set of transition tuples for each of the plurality of users according to the sorted check-in data; aggregating the transition tuples according to the origin of the transition tuples; and generating a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node. 2. The computer-implemented method of claim 1, wherein each item of check-in data includes a user identifier of the corresponding user. 3. The computer-implemented method of claim 2, wherein the user identifier differentiates the corresponding user from all other users without disclosing the identity of the corresponding user. 4. The computer-implemented method of claim 3, wherein each item of check-in data further indicates a date and time of the check-in of the corresponding user at the location. 5. The computer-implemented method of claim 1, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 6. The computer-implemented method of claim 5, wherein determining a set of transition tuples for each of the plurality of users comprises, for each of the plurality of users:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 7. The computer-implemented method of claim 6, wherein determining whether the potential transition tuple meets predetermined requirements comprises determining whether the time between the check-in at the origin and the check-in at the destination is within a predetermined amount of time. 8. The computer-implemented method of claim 7, wherein determining whether the potential transition tuple meets predetermined requirements further comprises determining whether the distance between the origin and the destination is within a predetermined distance. 9. The computer-implemented method of claim 7, wherein determining whether the potential transition tuple meets predetermined requirements further comprises determining whether the origin and the destination are within the same geographic region. 10. A computer-readable medium bearing computer-executable instructions which, when executed on a computing system comprising at least a processor retrieved from the medium, carry out a method for generating a transition graph for determining probabilistic transitions, the method comprising:
obtaining check-in data of a plurality users, wherein each item of check-in data indicates the presence of a corresponding user at a location; determining a set of transition tuples for each of the plurality of users according to the sorted check-in data; aggregating the transition tuples according to the origin of the transition tuples; generating a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node; receiving a request for a probabilistic transition for a user from an origin; determining a probabilistic transition for the user from the origin to a destination and returning the transition to the user in response to the request. 11. The computer-readable medium of claim 10, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 12. The computer-readable medium of claim 11, wherein determining a set of transition tuples for each of the plurality of users comprises, for each of the plurality of users:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 13. The computer-readable medium of claim 12, wherein determining whether the potential transition tuple meets predetermined requirements comprises determining whether the time between the check-in at the origin and the check-in at the destination is within a predetermined amount of time. 14. The computer-readable medium of claim 10, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 15. The computer-readable medium of claim 10, wherein each item of check-in data indicates a date and time of the check-in of the corresponding user at the location, and further includes a user identifier of the corresponding user. 16. The computer-readable medium of claim 10, wherein determining the probabilistic transition for the user from the origin to a destination comprises:
applying a filtering to the transition graph based on the current context of the user; and identifying a destination having the highest likelihood of transition from the origin as the probabilistic transition. 17. A computer system for generating a transition graph for determining probabilistic transitions, the computer system comprising a processor and a memory, wherein the processor executes instructions stored in the memory as part of or in conjunction with additional components, the additional components comprising:
a data access component configured to access check-in data for a plurality of users; and a transition graph generator configure to:
determine a set of transition tuples for each of the plurality of users;
aggregating the transition tuples according to the origin of each of the transition tuples; and
generate a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node. 18. The computer system of claim 17, wherein the transition graph generator is further configured to generate the transition graph according to the aggregated transition tuples by:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 19. The computer system of claim 18 further comprising an itinerary generator configured to determine a probabilistic transition for a user from an origin to a destination, and return the transition to the user in response to a request on behalf of the user. 20. The computer system of claim 19, wherein each item of check-in data indicates the presence of a corresponding user at a location and includes a user identifier of the corresponding user, wherein the user identifier differentiates the corresponding user from all other users without disclosing the identity of the corresponding user. | Systems and methods are presented for generating a transition graph from check-in data for determining probabilistic transitions of a user from an origin (location) to a destination. Check-in data for a plurality of users is obtained. The check-in data is organized and analyzed to determine a set of transition tuples for each of the plurality of users. These transition tuples are aggregated and used to generate a transition graph comprising a plurality of nodes and edges. Each node corresponds to a location and each edge indicates a transition from an origin node to a destination node and is associated with a likelihood of a user transitioning from the origin node to the destination node.1. A computer-implemented method for generating a transition graph for determining probabilistic transitions, the method comprising each of the following as executed by a processor on a computing device:
obtaining check-in data of a plurality users, wherein each item of check-in data indicates the presence of a corresponding user at a location; sorting the check-in data according the corresponding users; determining a set of transition tuples for each of the plurality of users according to the sorted check-in data; aggregating the transition tuples according to the origin of the transition tuples; and generating a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node. 2. The computer-implemented method of claim 1, wherein each item of check-in data includes a user identifier of the corresponding user. 3. The computer-implemented method of claim 2, wherein the user identifier differentiates the corresponding user from all other users without disclosing the identity of the corresponding user. 4. The computer-implemented method of claim 3, wherein each item of check-in data further indicates a date and time of the check-in of the corresponding user at the location. 5. The computer-implemented method of claim 1, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 6. The computer-implemented method of claim 5, wherein determining a set of transition tuples for each of the plurality of users comprises, for each of the plurality of users:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 7. The computer-implemented method of claim 6, wherein determining whether the potential transition tuple meets predetermined requirements comprises determining whether the time between the check-in at the origin and the check-in at the destination is within a predetermined amount of time. 8. The computer-implemented method of claim 7, wherein determining whether the potential transition tuple meets predetermined requirements further comprises determining whether the distance between the origin and the destination is within a predetermined distance. 9. The computer-implemented method of claim 7, wherein determining whether the potential transition tuple meets predetermined requirements further comprises determining whether the origin and the destination are within the same geographic region. 10. A computer-readable medium bearing computer-executable instructions which, when executed on a computing system comprising at least a processor retrieved from the medium, carry out a method for generating a transition graph for determining probabilistic transitions, the method comprising:
obtaining check-in data of a plurality users, wherein each item of check-in data indicates the presence of a corresponding user at a location; determining a set of transition tuples for each of the plurality of users according to the sorted check-in data; aggregating the transition tuples according to the origin of the transition tuples; generating a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node; receiving a request for a probabilistic transition for a user from an origin; determining a probabilistic transition for the user from the origin to a destination and returning the transition to the user in response to the request. 11. The computer-readable medium of claim 10, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 12. The computer-readable medium of claim 11, wherein determining a set of transition tuples for each of the plurality of users comprises, for each of the plurality of users:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 13. The computer-readable medium of claim 12, wherein determining whether the potential transition tuple meets predetermined requirements comprises determining whether the time between the check-in at the origin and the check-in at the destination is within a predetermined amount of time. 14. The computer-readable medium of claim 10, wherein each transition tuple comprises information indicating an origin and a destination, each transition tuple indicating a transition from the origin to the destination by the corresponding user. 15. The computer-readable medium of claim 10, wherein each item of check-in data indicates a date and time of the check-in of the corresponding user at the location, and further includes a user identifier of the corresponding user. 16. The computer-readable medium of claim 10, wherein determining the probabilistic transition for the user from the origin to a destination comprises:
applying a filtering to the transition graph based on the current context of the user; and identifying a destination having the highest likelihood of transition from the origin as the probabilistic transition. 17. A computer system for generating a transition graph for determining probabilistic transitions, the computer system comprising a processor and a memory, wherein the processor executes instructions stored in the memory as part of or in conjunction with additional components, the additional components comprising:
a data access component configured to access check-in data for a plurality of users; and a transition graph generator configure to:
determine a set of transition tuples for each of the plurality of users;
aggregating the transition tuples according to the origin of each of the transition tuples; and
generate a transition graph according to the aggregated transition tuples, wherein the transition graph comprises a plurality of nodes and edges, each node corresponding to a location and each edge indicating a transition from an origin node to a destination node and associated with a likelihood of a user transitioning from the origin node to the destination node. 18. The computer system of claim 17, wherein the transition graph generator is further configured to generate the transition graph according to the aggregated transition tuples by:
chronologically ordering the check-in data corresponding to a user; iteratively pairing a first check-in point with an immediately subsequent check-in point, as chronologically ordered, as a potential transition tuple, wherein the first check-in point is the origin of the potential transition tuple and the immediately subsequent check-in point is the destination of the potential transition tuple; for each potential transition tuple, determining whether the potential transition tuple meets predetermined requirements; and retaining those potential transition tuples that meet the predetermined requirements in the set of transition tuples for the corresponding user. 19. The computer system of claim 18 further comprising an itinerary generator configured to determine a probabilistic transition for a user from an origin to a destination, and return the transition to the user in response to a request on behalf of the user. 20. The computer system of claim 19, wherein each item of check-in data indicates the presence of a corresponding user at a location and includes a user identifier of the corresponding user, wherein the user identifier differentiates the corresponding user from all other users without disclosing the identity of the corresponding user. | 2,100 |
5,603 | 5,603 | 14,929,356 | 2,159 | A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed. | 1. A method to dynamically switch between catalog sharing protocols, the method comprising:
monitoring, over a period of time, access to a catalog used to index a plurality of data sets; dividing the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval; scheduling the sharing protocols to operate during their respective intervals going forward; and switching between the sharing protocols in accordance with the schedule. 2. The method of claim 1, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 3. The method of claim 2, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 4. The method of claim 2, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 5. The method of claim 1, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 6. The method of claim 1, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol. 7. The method of claim 1, wherein the sharing protocols comprise a Record Level Sharing (RLS) sharing protocol. 8. A computer program product to dynamically switch between catalog sharing protocols, the computer program product comprising a computer-readable medium having computer-usable program code embodied therein, the computer-usable program code comprising:
computer-usable program code to monitor, over a period of time, access to a catalog used to index a plurality of data sets; computer-usable program code to divide the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval; computer-usable program code to schedule the sharing protocols to operate during their respective intervals going forward; and computer-usable program code to switch between the sharing protocols in accordance with the schedule. 9. The computer program product of claim 8, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 10. The computer program product of claim 9, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 11. The computer program product of claim 9, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 12. The computer program product of claim 8, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 13. The computer program product of claim 8, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol. 14. The computer program product of claim 8, wherein the sharing protocols comprise a Record Level Sharing (RLS) sharing protocol. 15. A system to dynamically switch between catalog sharing protocols, the system comprising:
at least one processor; at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
monitor, over a period of time, access to a catalog used to index a plurality of data sets;
divide the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval;
schedule the sharing protocols to operate during their respective intervals going forward; and
switch between the sharing protocols in accordance with the schedule. 16. The system of claim 15, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 17. The system of claim 16, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 18. The system of claim 16, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 19. The system of claim 15, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 20. The system of claim 15, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol and a Record Level Sharing (RLS) sharing protocol. | A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.1. A method to dynamically switch between catalog sharing protocols, the method comprising:
monitoring, over a period of time, access to a catalog used to index a plurality of data sets; dividing the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval; scheduling the sharing protocols to operate during their respective intervals going forward; and switching between the sharing protocols in accordance with the schedule. 2. The method of claim 1, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 3. The method of claim 2, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 4. The method of claim 2, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 5. The method of claim 1, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 6. The method of claim 1, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol. 7. The method of claim 1, wherein the sharing protocols comprise a Record Level Sharing (RLS) sharing protocol. 8. A computer program product to dynamically switch between catalog sharing protocols, the computer program product comprising a computer-readable medium having computer-usable program code embodied therein, the computer-usable program code comprising:
computer-usable program code to monitor, over a period of time, access to a catalog used to index a plurality of data sets; computer-usable program code to divide the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval; computer-usable program code to schedule the sharing protocols to operate during their respective intervals going forward; and computer-usable program code to switch between the sharing protocols in accordance with the schedule. 9. The computer program product of claim 8, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 10. The computer program product of claim 9, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 11. The computer program product of claim 9, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 12. The computer program product of claim 8, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 13. The computer program product of claim 8, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol. 14. The computer program product of claim 8, wherein the sharing protocols comprise a Record Level Sharing (RLS) sharing protocol. 15. A system to dynamically switch between catalog sharing protocols, the system comprising:
at least one processor; at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
monitor, over a period of time, access to a catalog used to index a plurality of data sets;
divide the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide most efficient performance during the respective interval;
schedule the sharing protocols to operate during their respective intervals going forward; and
switch between the sharing protocols in accordance with the schedule. 16. The system of claim 15, wherein switching between the sharing protocols comprises temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. 17. The system of claim 16, wherein temporarily operating in a hybrid mode comprises populating at least one of buffers and cache of a sharing protocol prior to completely switching to the sharing protocol. 18. The system of claim 16, wherein temporarily operating in a hybrid mode comprises completely switching to a first sharing protocol operating in the hybrid mode when the first sharing protocol is performing better than a second sharing protocol operating in the hybrid mode. 19. The system of claim 15, wherein monitoring access to a catalog comprises monitoring at least one of: a hit ratio to a local cache used in association with the catalog; purge events to a local cache used in association with the catalog; queuing of resources used to access the catalog; a workload of a sharing protocol used to access the catalog; response times to execute requests to the catalog; status of a sharing protocol used to execute requests to the catalog; and workload type for requests to the catalog. 20. The system of claim 15, wherein the sharing protocols comprise an Enhanced Catalog Sharing (ECS) sharing protocol and a Record Level Sharing (RLS) sharing protocol. | 2,100 |
5,604 | 5,604 | 13,672,401 | 2,158 | A computing apparatus and method of recalculating upon changes to data by saving changes to the data; receiving a request to recalculate a result according to the data; retrieving only active data from the data according to the saved changes to the data; and recalculating the result based upon the active data. | 1. An apparatus that recalculates upon changes to data, comprising:
a computer processor controlled to execute:
saving changes to the data;
receiving a request to recalculate a result according to the data;
retrieving only active data from the data according to the saved changes to the data; and
recalculating the result based upon the active data. 2. The apparatus according to claim 1, wherein the active data comprises changed data and data dependent on the changed data. 3. The apparatus according to claim 2, wherein the data comprises reference data and/or transaction data to which the reference data is applied. 4. The apparatus according to claim 3, further comprising updating the data with temporal attributes upon saving the changes to the data and retrieving only the active data according to the temporal attributes. 5. The apparatus according to claim 4, wherein the updating of a target reference data comprises updating temporal attributes of the target reference data and further creating a new reference data with temporal attributes. 6. The apparatus according to claim 1, wherein the retrieving of only the active data comprises retrieving data dependent on the changed data according to meta data for the data. 7. A method implemented by a computing apparatus to calculate upon changes to data, comprising:
configuring a computer to execute:
saving changes to the data;
receiving a request to recalculate a result according to the data;
retrieving only active data from the data according to the saved changes to the data; and
recalculating the result based upon the active data. 8. A non-transitory computer readable medium storing a program that causes a computer to execute the method of claim 7. | A computing apparatus and method of recalculating upon changes to data by saving changes to the data; receiving a request to recalculate a result according to the data; retrieving only active data from the data according to the saved changes to the data; and recalculating the result based upon the active data.1. An apparatus that recalculates upon changes to data, comprising:
a computer processor controlled to execute:
saving changes to the data;
receiving a request to recalculate a result according to the data;
retrieving only active data from the data according to the saved changes to the data; and
recalculating the result based upon the active data. 2. The apparatus according to claim 1, wherein the active data comprises changed data and data dependent on the changed data. 3. The apparatus according to claim 2, wherein the data comprises reference data and/or transaction data to which the reference data is applied. 4. The apparatus according to claim 3, further comprising updating the data with temporal attributes upon saving the changes to the data and retrieving only the active data according to the temporal attributes. 5. The apparatus according to claim 4, wherein the updating of a target reference data comprises updating temporal attributes of the target reference data and further creating a new reference data with temporal attributes. 6. The apparatus according to claim 1, wherein the retrieving of only the active data comprises retrieving data dependent on the changed data according to meta data for the data. 7. A method implemented by a computing apparatus to calculate upon changes to data, comprising:
configuring a computer to execute:
saving changes to the data;
receiving a request to recalculate a result according to the data;
retrieving only active data from the data according to the saved changes to the data; and
recalculating the result based upon the active data. 8. A non-transitory computer readable medium storing a program that causes a computer to execute the method of claim 7. | 2,100 |
5,605 | 5,605 | 14,420,952 | 2,176 | When a user fast-forwards pages and there arises a necessity to display pages ahead of image data generating processing by a page image generating unit 114 , a paging managing unit 112 of a viewing screen control section 110 culls pages whose image data is to be generated, and requests an image rendering unit 122 to display already generated preceding or succeeding pages as a dummy. A display region managing unit 116 requests the image rendering unit 122 to sequentially display specified display regions stored in a movement rule storage unit 118 according to advancing operation of the user. The advancing operation is started at a point in time that a finger in contact with a front touch pad 21 is removed. An advance notice operation of moving a display region by a minute amount in a direction in which a movement is intended to be performed is performed before the advancing operation. | 1. An information processing device for displaying contents formed by a plurality of pages, the information processing device comprising:
an operation receiving section receiving a paging operation of changing a page being displayed in order of the pages; and an image rendering section updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the image rendering section updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 2. The information processing device according to claim 1,
wherein the image rendering section inserts an image representing page turning according to the paging operation, and displays the same unculled page before and after the image representing the page turning at a time of the fast-forwarding operation. 3. The information processing device according to claim 1, further comprising a page image generating section generating image data of each page in the order of the pages from data of the contents, wherein when a page to be displayed is beyond a range of pages whose image data has already been generated at a time of the fast-forwarding operation, the image rendering section culls a page to be displayed. 4. The information processing device according to claim 3,
wherein when the page to be displayed is beyond the range of the pages whose image data has already been generated at the time of the fast-forwarding operation, the page image generating section culls a page whose image data is to be generated. 5. An information processing device comprising:
an operation receiving section receiving contact operations by a user on a touch pad on a display for displaying an image; and a scrolling processing section scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein as an advance notice operation for the scrolling at the point in time that the contact is ended, the scrolling processing section further scrolls the screen in the predetermined direction by a predetermined amount before the contact is ended. 6. The information processing device according to claim 5,
wherein when the contact is ended in a state in which the contact point has been moved to the outside of the predetermined range after the start of the contact, the scrolling processing section does not scroll the screen. 7. The information processing device according to claim 5, further comprising a movement rule storage section storing movement rule information related to a plurality of display regions specified for the image as a display object and order of display of the plurality of display regions,
wherein the scrolling processing section scrolls the screen to a display region to be displayed next, the display region to be displayed next being specified in the movement rule information, at the point in time that the contact is ended. 8. An information processing method performed by an information processing device for displaying contents formed by a plurality of pages, the information processing method comprising:
receiving a paging operation of changing a page being displayed on a display in order of the pages; and updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the updating updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 9. An information processing method of an information processing device changing a display image according to an operation by a user, the information processing method comprising:
receiving contact operations by a user on a touch pad on a display for displaying an image; and scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein the scrolling includes, as an advance notice operation for the scrolling at the point in time that the contact is ended, scrolling the screen in the predetermined direction by a predetermined amount before the contact is ended. 10. (canceled) 11. (canceled) 12. A computer readable recording medium storing a program for a computer that displays contents formed by a plurality pages on a display, the program comprising:
receiving a paging operation of changing a page being displayed in order of the pages; and updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the updating updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 13. A computer readable recording medium storing a program for a computer, the program comprising:
receiving contact operations by a user on a touch pad on a display for displaying an image; and scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein the scrolling includes, as an advance notice operation for the scrolling at the point in time that the contact is ended, scrolling the screen in the predetermined direction by a predetermined amount before the contact is ended. | When a user fast-forwards pages and there arises a necessity to display pages ahead of image data generating processing by a page image generating unit 114 , a paging managing unit 112 of a viewing screen control section 110 culls pages whose image data is to be generated, and requests an image rendering unit 122 to display already generated preceding or succeeding pages as a dummy. A display region managing unit 116 requests the image rendering unit 122 to sequentially display specified display regions stored in a movement rule storage unit 118 according to advancing operation of the user. The advancing operation is started at a point in time that a finger in contact with a front touch pad 21 is removed. An advance notice operation of moving a display region by a minute amount in a direction in which a movement is intended to be performed is performed before the advancing operation.1. An information processing device for displaying contents formed by a plurality of pages, the information processing device comprising:
an operation receiving section receiving a paging operation of changing a page being displayed in order of the pages; and an image rendering section updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the image rendering section updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 2. The information processing device according to claim 1,
wherein the image rendering section inserts an image representing page turning according to the paging operation, and displays the same unculled page before and after the image representing the page turning at a time of the fast-forwarding operation. 3. The information processing device according to claim 1, further comprising a page image generating section generating image data of each page in the order of the pages from data of the contents, wherein when a page to be displayed is beyond a range of pages whose image data has already been generated at a time of the fast-forwarding operation, the image rendering section culls a page to be displayed. 4. The information processing device according to claim 3,
wherein when the page to be displayed is beyond the range of the pages whose image data has already been generated at the time of the fast-forwarding operation, the page image generating section culls a page whose image data is to be generated. 5. An information processing device comprising:
an operation receiving section receiving contact operations by a user on a touch pad on a display for displaying an image; and a scrolling processing section scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein as an advance notice operation for the scrolling at the point in time that the contact is ended, the scrolling processing section further scrolls the screen in the predetermined direction by a predetermined amount before the contact is ended. 6. The information processing device according to claim 5,
wherein when the contact is ended in a state in which the contact point has been moved to the outside of the predetermined range after the start of the contact, the scrolling processing section does not scroll the screen. 7. The information processing device according to claim 5, further comprising a movement rule storage section storing movement rule information related to a plurality of display regions specified for the image as a display object and order of display of the plurality of display regions,
wherein the scrolling processing section scrolls the screen to a display region to be displayed next, the display region to be displayed next being specified in the movement rule information, at the point in time that the contact is ended. 8. An information processing method performed by an information processing device for displaying contents formed by a plurality of pages, the information processing method comprising:
receiving a paging operation of changing a page being displayed on a display in order of the pages; and updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the updating updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 9. An information processing method of an information processing device changing a display image according to an operation by a user, the information processing method comprising:
receiving contact operations by a user on a touch pad on a display for displaying an image; and scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein the scrolling includes, as an advance notice operation for the scrolling at the point in time that the contact is ended, scrolling the screen in the predetermined direction by a predetermined amount before the contact is ended. 10. (canceled) 11. (canceled) 12. A computer readable recording medium storing a program for a computer that displays contents formed by a plurality pages on a display, the program comprising:
receiving a paging operation of changing a page being displayed in order of the pages; and updating a display image in the order of the pages according to the paging operation, wherein when the paging operation is a fast-forwarding operation requesting page changes to be made consecutively in predetermined cycles, the updating updates the display image so as to cull a page to be displayed and display an unculled page in a cycle in which to display the culled page. 13. A computer readable recording medium storing a program for a computer, the program comprising:
receiving contact operations by a user on a touch pad on a display for displaying an image; and scrolling a screen in a predetermined direction according to an operation of ending contact without moving a contact point to an outside of a predetermined range from the contact point at a time of a start of the contact, among the contact operations, at a point in time that the contact is ended, wherein the scrolling includes, as an advance notice operation for the scrolling at the point in time that the contact is ended, scrolling the screen in the predetermined direction by a predetermined amount before the contact is ended. | 2,100 |
5,606 | 5,606 | 15,016,160 | 2,121 | Methods, and systems, including computer programs encoded on computer storage media for generating data items. A method includes reading a glimpse from a data item using a decoder hidden state vector of a decoder for a preceding time step, providing, as input to a encoder, the glimpse and decoder hidden state vector for the preceding time step for processing, receiving, as output from the encoder, a generated encoder hidden state vector for the time step, generating a decoder input from the generated encoder hidden state vector, providing the decoder input to the decoder for processing, receiving, as output from the decoder, a generated a decoder hidden state vector for the time step, generating a neural network output update from the decoder hidden state vector for the time step, and combining the neural network output update with a current neural network output to generate an updated neural network output. | 1. A neural network system implemented by one or more computers, the neural network system comprising:
an encoder neural network, wherein the encoder neural network is a recurrent neural network that is configured to, for each input data item processed by the encoder neural network and at each time step of a plurality steps:
receive a glimpse captured by reading from the input data item,
receive a decoder hidden state vector of a decoder neural network for the preceding time step, and
process the glimpse, the decoder hidden state vector, and an encoder hidden state vector of the encoder neural network from the preceding time step to generate an encoder hidden state vector for the time step;
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
read the glimpse from the input data item using the decoder hidden state vector for the preceding time step;
provide the glimpse as input to the encoder neural network;
generate the decoder input for the decoder neural network from the encoder hidden state vector at the time step;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 2. The neural network system of claim 1, wherein the encoder neural network and the decoder neural network are long short term memory neural networks. 3. The neural network system of claim 1, wherein the subsystem is further configured to train the encoder neural network and the decoder neural network to autoencode input data items. 4. The neural network system of claim 3, wherein training the encoder neural network and the decoder neural network to autoencode input data items comprises training the neural networks to generate a neural network output that is a reconstruction of the input data item. 5. The neural network system of claim 1, wherein the subsystem is further configured to provide the encoder hidden state vectors from each of the time steps for a particular data item as features of the particular data item. 6. The neural network system of claim 5, wherein the features of the particular data item are provided for use in processing the particular data item during a semi-supervising learning procedure. 7. The neural network system of claim 1, wherein the input data items are images. 8. The neural network system of claim 1, wherein in the input data items are videos. 9. The neural network system of claim 1, wherein the input data items are images and wherein the glimpse captured by reading from the input data item is an image patch generated by applying an array of Gaussian filters to the image. 10. The neural network system of claim 9, wherein the parameters for applying the array of Gaussian filters are generated by applying a linear transformation to the decoder hidden state vector for the preceding time step. 11. The neural network system of claim 1, wherein generating the decoder input for the decoder neural network from the encoder hidden state vector at the time step comprises:
using the encoder hidden state vector for the time step to parameterize a distribution of a latent vector; and sampling the decoder input from the distribution. 12. The neural network system of claim 1, wherein the subsystem is further configured to cause the decoder neural network to process a sequence of inputs sampled from a prior distribution to generate a new neural network output. 13. The neural network system of claim 12, wherein the data items are images, and wherein the new neural network output is a new image generated by the decoder neural network. 14. The neural network system of claim 1, wherein the data items are speech fragments or features of speech fragments. 15. A computer implemented method for processing an input data item through a recurrent encoder neural network and a recurrent decoder neural network to generate an updated neural network output, the method comprising, for each input data item and at each time step of a plurality steps:
reading a glimpse from the input data item using a decoder hidden state vector of the decoder neural network for the preceding time step; providing, as input to the encoder neural network, the (i) glimpse and (ii) decoder hidden state vector for the preceding time step for processing; receiving, as output from the encoder neural network, a generated encoder hidden state vector for the time step; generating a decoder input for the decoder neural network from the generated encoder hidden state vector at the time step; providing, as input to the decoder neural network, the decoder input for processing; receiving, as output from the decoder neural network, a generated a decoder hidden state vector for the time step; generating a neural network output update for the time step from the decoder hidden state vector for the time step; and combining the neural network output update for the time step with a current neural network output to generate an updated neural network output. 16. The method of claim 15, further comprising providing the encoder hidden state vectors from each of the time steps for a particular data item as features of the particular data item. 17. The method of claim 15, wherein generating the decoder input for the decoder neural network from the encoder hidden state vector at the time step comprises:
using the encoder hidden state vector for the time step to parameterize a distribution of a latent vector; and sampling the decoder input from the distribution. 18. The method of claim 15, further comprising causing the decoder neural network to process a sequence of inputs sampled from a prior distribution to generate a new neural network output. 19. The method of claim 18, wherein the data items are images, and wherein the new neural network output is a new image generated by the decoder neural network. 20. A computer storage medium encoded with instructions that, when executed by one or more computers, cause one or more computers to implement a neural network system, the neural network system comprising:
an encoder neural network, wherein the encoder neural network is a recurrent neural network that is configured to, for each input data item processed by the encoder neural network and at each time step of a plurality steps:
receive a glimpse captured by reading from the input data item,
receive a decoder hidden state vector of a decoder neural network for the preceding time step, and
process the glimpse, the decoder hidden state vector, and an encoder hidden state vector of the encoder neural network from the preceding time step to generate an encoder hidden state vector for the time step;
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
read the glimpse from the input data item using the decoder hidden state vector for the preceding time step;
provide the glimpse as input to the encoder neural network;
generate the decoder input for the decoder neural network from the encoder hidden state vector at the time step;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 21. A neural network system implemented by one or more computers, the neural network system comprising:
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
generate the decoder input for the decoder neural network;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 22. The neural network system of claim 21, wherein generating decoder input for the decoder neural network comprises selecting latent variable samples from a prior distribution. 23. The neural network system of claim 21, wherein the updated neural network outputs are images, and wherein the updated neural network output for a last time step in the plurality of time steps is a new image generated by the neural network system. | Methods, and systems, including computer programs encoded on computer storage media for generating data items. A method includes reading a glimpse from a data item using a decoder hidden state vector of a decoder for a preceding time step, providing, as input to a encoder, the glimpse and decoder hidden state vector for the preceding time step for processing, receiving, as output from the encoder, a generated encoder hidden state vector for the time step, generating a decoder input from the generated encoder hidden state vector, providing the decoder input to the decoder for processing, receiving, as output from the decoder, a generated a decoder hidden state vector for the time step, generating a neural network output update from the decoder hidden state vector for the time step, and combining the neural network output update with a current neural network output to generate an updated neural network output.1. A neural network system implemented by one or more computers, the neural network system comprising:
an encoder neural network, wherein the encoder neural network is a recurrent neural network that is configured to, for each input data item processed by the encoder neural network and at each time step of a plurality steps:
receive a glimpse captured by reading from the input data item,
receive a decoder hidden state vector of a decoder neural network for the preceding time step, and
process the glimpse, the decoder hidden state vector, and an encoder hidden state vector of the encoder neural network from the preceding time step to generate an encoder hidden state vector for the time step;
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
read the glimpse from the input data item using the decoder hidden state vector for the preceding time step;
provide the glimpse as input to the encoder neural network;
generate the decoder input for the decoder neural network from the encoder hidden state vector at the time step;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 2. The neural network system of claim 1, wherein the encoder neural network and the decoder neural network are long short term memory neural networks. 3. The neural network system of claim 1, wherein the subsystem is further configured to train the encoder neural network and the decoder neural network to autoencode input data items. 4. The neural network system of claim 3, wherein training the encoder neural network and the decoder neural network to autoencode input data items comprises training the neural networks to generate a neural network output that is a reconstruction of the input data item. 5. The neural network system of claim 1, wherein the subsystem is further configured to provide the encoder hidden state vectors from each of the time steps for a particular data item as features of the particular data item. 6. The neural network system of claim 5, wherein the features of the particular data item are provided for use in processing the particular data item during a semi-supervising learning procedure. 7. The neural network system of claim 1, wherein the input data items are images. 8. The neural network system of claim 1, wherein in the input data items are videos. 9. The neural network system of claim 1, wherein the input data items are images and wherein the glimpse captured by reading from the input data item is an image patch generated by applying an array of Gaussian filters to the image. 10. The neural network system of claim 9, wherein the parameters for applying the array of Gaussian filters are generated by applying a linear transformation to the decoder hidden state vector for the preceding time step. 11. The neural network system of claim 1, wherein generating the decoder input for the decoder neural network from the encoder hidden state vector at the time step comprises:
using the encoder hidden state vector for the time step to parameterize a distribution of a latent vector; and sampling the decoder input from the distribution. 12. The neural network system of claim 1, wherein the subsystem is further configured to cause the decoder neural network to process a sequence of inputs sampled from a prior distribution to generate a new neural network output. 13. The neural network system of claim 12, wherein the data items are images, and wherein the new neural network output is a new image generated by the decoder neural network. 14. The neural network system of claim 1, wherein the data items are speech fragments or features of speech fragments. 15. A computer implemented method for processing an input data item through a recurrent encoder neural network and a recurrent decoder neural network to generate an updated neural network output, the method comprising, for each input data item and at each time step of a plurality steps:
reading a glimpse from the input data item using a decoder hidden state vector of the decoder neural network for the preceding time step; providing, as input to the encoder neural network, the (i) glimpse and (ii) decoder hidden state vector for the preceding time step for processing; receiving, as output from the encoder neural network, a generated encoder hidden state vector for the time step; generating a decoder input for the decoder neural network from the generated encoder hidden state vector at the time step; providing, as input to the decoder neural network, the decoder input for processing; receiving, as output from the decoder neural network, a generated a decoder hidden state vector for the time step; generating a neural network output update for the time step from the decoder hidden state vector for the time step; and combining the neural network output update for the time step with a current neural network output to generate an updated neural network output. 16. The method of claim 15, further comprising providing the encoder hidden state vectors from each of the time steps for a particular data item as features of the particular data item. 17. The method of claim 15, wherein generating the decoder input for the decoder neural network from the encoder hidden state vector at the time step comprises:
using the encoder hidden state vector for the time step to parameterize a distribution of a latent vector; and sampling the decoder input from the distribution. 18. The method of claim 15, further comprising causing the decoder neural network to process a sequence of inputs sampled from a prior distribution to generate a new neural network output. 19. The method of claim 18, wherein the data items are images, and wherein the new neural network output is a new image generated by the decoder neural network. 20. A computer storage medium encoded with instructions that, when executed by one or more computers, cause one or more computers to implement a neural network system, the neural network system comprising:
an encoder neural network, wherein the encoder neural network is a recurrent neural network that is configured to, for each input data item processed by the encoder neural network and at each time step of a plurality steps:
receive a glimpse captured by reading from the input data item,
receive a decoder hidden state vector of a decoder neural network for the preceding time step, and
process the glimpse, the decoder hidden state vector, and an encoder hidden state vector of the encoder neural network from the preceding time step to generate an encoder hidden state vector for the time step;
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
read the glimpse from the input data item using the decoder hidden state vector for the preceding time step;
provide the glimpse as input to the encoder neural network;
generate the decoder input for the decoder neural network from the encoder hidden state vector at the time step;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 21. A neural network system implemented by one or more computers, the neural network system comprising:
a decoder neural network, wherein the decoder neural network is a recurrent neural network that is configured to, for each of the plurality of time steps:
receive a decoder input for the time step, and
process the decoder hidden state vector for the preceding time step and the decoder input to generate a decoder hidden state vector for the time step; and
a subsystem, wherein the subsystem is configured to, for each of the time steps:
generate the decoder input for the decoder neural network;
provide the decoder input as input to the decoder neural network for the time step;
generate a neural network output update for the time step from the decoder hidden state vector for the time step; and
combine the neural network output update for the time step with a current neural network output to generate an updated neural network output. 22. The neural network system of claim 21, wherein generating decoder input for the decoder neural network comprises selecting latent variable samples from a prior distribution. 23. The neural network system of claim 21, wherein the updated neural network outputs are images, and wherein the updated neural network output for a last time step in the plurality of time steps is a new image generated by the neural network system. | 2,100 |
5,607 | 5,607 | 14,828,176 | 2,198 | Embodiments of the present invention relate to knowledge representation systems which include a knowledge base in which knowledge is represented in a structured, machine-readable format that encodes meaning. Techniques for extracting structured knowledge from unstructured text and for determining the reliability of such extracted knowledge are also described. | 1. A computer-implemented method, comprising:
identifying a question and a corresponding answer in unstructured text using one or more computing devices; generating a first fact triple from the question using the one or more computing devices, the first fact triple including an unknown entity object representing an unknown entity; identifying information in the answer corresponding to the unknown entity using the one or more computing devices; identifying a first known entity object corresponding to the information identified in the answer using the one or more computing devices; and replacing the unknown entity object of the first fact triple with the first known entity object to generate a second fact triple using the one or more computing devices. 2. The method of claim 1, wherein the first fact triple includes a second known entity object and a relation object representing a relationship between the unknown entity object and the second known entity object, and wherein generating the first fact triple from the question includes identifying the unknown entity object, the relation object, and the second known entity object from text in the question corresponding to each. 3. The method of claim 2, wherein identifying the unknown entity object, the relation object, and the second known entity object from text in the question includes natural language processing of the unstructured text using one or more of sentence splitting, sentence markup, part-of-speech tagging, sentence parsing, or sentence transformation. 4. The method of claim 1, wherein identifying the information in the answer includes identifying text in the answer corresponding to one of a plurality of entity types. 5. The method of claim 4, wherein identifying the first known entity object includes comparing the text in the answer to one or more text strings associated with each of a plurality of entity objects in a knowledge base, the plurality of entity objects including the first known entity object. 6. The method of claim 1, further comprising retrieving a web page including the unstructured text, wherein identifying the question and the answer in the unstructured text includes natural language processing of the unstructured text. 7. The method of claim 1, further comprising determining a reliability score for the second fact triple, and adding the second fact triple to a knowledge base based on the reliability score. 8. The method of claim 1, further comprising:
identifying a second question and a second answer corresponding to the second question from second unstructured text; determining that the second question requires a complex response not suited for representation as a fact triple; and disambiguating one or more entities identified in the second question and referenced in the second answer. 9. The method of claim 1, further comprising:
identifying a second question and a second answer corresponding to the second question in second unstructured text; generating a third fact triple from the second question; and determining a polarity of the third fact triple from the answer. 10. A system, comprising one or more computing devices configured to:
identify a question and a corresponding answer in unstructured text; generate a fact triple from the question; and determine a polarity of the fact triple from the answer. 11. The system of claim 10, wherein the fact triple includes a first entity object, a second entity object, and a relation object representing a relationship between the first and second entity objects, and wherein the one or more computing devices are configured to generate the fact triple from the question by identifying the relation object and the first and second entity objects from text in the question corresponding to each. 12. The system of claim 11, wherein the one or more computing devices are configured to identify the relation object and the first and second entity objects from text in the question using natural language processing of the unstructured text that includes one or more of sentence splitting, sentence markup, part-of-speech tagging, sentence parsing, or sentence transformation. 13. The system of claim 10, wherein the one or more computing devices are configured to determine a polarity of the fact triple from the answer by identifying positive or negative terms in the answer. 14. The system of claim 10, wherein the one or more computing devices are further configured to retrieve a web page including the unstructured text, and wherein the one or more computing devices are configured to identify the question and the answer in the unstructured text using natural language processing of the unstructured text. 15. The system of claim 10, wherein the one or more computing devices are further configured to determine a reliability score for the second fact triple, and add the second fact triple to a knowledge base based on the reliability score. 16. The system of claim 10, wherein the one or more computing devices are further configured to:
identify a second question and a second answer corresponding to the second question from second unstructured text; determine that the second question requires a complex response not suited for representation as a fact triple; and disambiguate one or more entities identified in the second question and referenced in the second answer. 17. The system of claim 10, wherein the one or more computing devices are further configured to:
identify a second question and a second answer corresponding to the second question from second unstructured text; generate a second fact triple from the question, the second fact triple including an unknown entity object representing an unknown entity; identify information in the second answer corresponding to the unknown entity; identify a first known entity object corresponding to the information identified in the second answer; and replace the unknown entity object of the second fact triple with the first known entity object to generate a third fact triple. 18. The system of claim 17, wherein the one or more computing devices are configured to identify the information in the second answer by identifying text in the second answer corresponding to one of a plurality of entity types. 19. The system of claim 18, wherein the one or more computing devices are configured to identify the first known entity object by comparing the text in the second answer to one or more text strings associated with each of a plurality of entity objects in a knowledge base, the plurality of entity objects including the first known entity object. 20. A computer program product, comprising one or more computer-readable media having computer program instructions stored therein, the computer program instructions being configured such that, when executed by one or more computing devices, the computer program instructions cause the one or more computing devices to:
identify a question and a corresponding answer in unstructured text; generate a first fact triple from the question, the first fact triple including an unknown entity object representing an unknown entity; identify information in the answer corresponding to the unknown entity; identify a first known entity object corresponding to the information identified in the answer; replace the unknown entity object of the first fact triple with the first known entity object to generate a second fact triple; identify a second question and a second answer corresponding to the second question in second unstructured text; generate a third fact triple from the second question; and determine a polarity of the third fact triple from the answer. | Embodiments of the present invention relate to knowledge representation systems which include a knowledge base in which knowledge is represented in a structured, machine-readable format that encodes meaning. Techniques for extracting structured knowledge from unstructured text and for determining the reliability of such extracted knowledge are also described.1. A computer-implemented method, comprising:
identifying a question and a corresponding answer in unstructured text using one or more computing devices; generating a first fact triple from the question using the one or more computing devices, the first fact triple including an unknown entity object representing an unknown entity; identifying information in the answer corresponding to the unknown entity using the one or more computing devices; identifying a first known entity object corresponding to the information identified in the answer using the one or more computing devices; and replacing the unknown entity object of the first fact triple with the first known entity object to generate a second fact triple using the one or more computing devices. 2. The method of claim 1, wherein the first fact triple includes a second known entity object and a relation object representing a relationship between the unknown entity object and the second known entity object, and wherein generating the first fact triple from the question includes identifying the unknown entity object, the relation object, and the second known entity object from text in the question corresponding to each. 3. The method of claim 2, wherein identifying the unknown entity object, the relation object, and the second known entity object from text in the question includes natural language processing of the unstructured text using one or more of sentence splitting, sentence markup, part-of-speech tagging, sentence parsing, or sentence transformation. 4. The method of claim 1, wherein identifying the information in the answer includes identifying text in the answer corresponding to one of a plurality of entity types. 5. The method of claim 4, wherein identifying the first known entity object includes comparing the text in the answer to one or more text strings associated with each of a plurality of entity objects in a knowledge base, the plurality of entity objects including the first known entity object. 6. The method of claim 1, further comprising retrieving a web page including the unstructured text, wherein identifying the question and the answer in the unstructured text includes natural language processing of the unstructured text. 7. The method of claim 1, further comprising determining a reliability score for the second fact triple, and adding the second fact triple to a knowledge base based on the reliability score. 8. The method of claim 1, further comprising:
identifying a second question and a second answer corresponding to the second question from second unstructured text; determining that the second question requires a complex response not suited for representation as a fact triple; and disambiguating one or more entities identified in the second question and referenced in the second answer. 9. The method of claim 1, further comprising:
identifying a second question and a second answer corresponding to the second question in second unstructured text; generating a third fact triple from the second question; and determining a polarity of the third fact triple from the answer. 10. A system, comprising one or more computing devices configured to:
identify a question and a corresponding answer in unstructured text; generate a fact triple from the question; and determine a polarity of the fact triple from the answer. 11. The system of claim 10, wherein the fact triple includes a first entity object, a second entity object, and a relation object representing a relationship between the first and second entity objects, and wherein the one or more computing devices are configured to generate the fact triple from the question by identifying the relation object and the first and second entity objects from text in the question corresponding to each. 12. The system of claim 11, wherein the one or more computing devices are configured to identify the relation object and the first and second entity objects from text in the question using natural language processing of the unstructured text that includes one or more of sentence splitting, sentence markup, part-of-speech tagging, sentence parsing, or sentence transformation. 13. The system of claim 10, wherein the one or more computing devices are configured to determine a polarity of the fact triple from the answer by identifying positive or negative terms in the answer. 14. The system of claim 10, wherein the one or more computing devices are further configured to retrieve a web page including the unstructured text, and wherein the one or more computing devices are configured to identify the question and the answer in the unstructured text using natural language processing of the unstructured text. 15. The system of claim 10, wherein the one or more computing devices are further configured to determine a reliability score for the second fact triple, and add the second fact triple to a knowledge base based on the reliability score. 16. The system of claim 10, wherein the one or more computing devices are further configured to:
identify a second question and a second answer corresponding to the second question from second unstructured text; determine that the second question requires a complex response not suited for representation as a fact triple; and disambiguate one or more entities identified in the second question and referenced in the second answer. 17. The system of claim 10, wherein the one or more computing devices are further configured to:
identify a second question and a second answer corresponding to the second question from second unstructured text; generate a second fact triple from the question, the second fact triple including an unknown entity object representing an unknown entity; identify information in the second answer corresponding to the unknown entity; identify a first known entity object corresponding to the information identified in the second answer; and replace the unknown entity object of the second fact triple with the first known entity object to generate a third fact triple. 18. The system of claim 17, wherein the one or more computing devices are configured to identify the information in the second answer by identifying text in the second answer corresponding to one of a plurality of entity types. 19. The system of claim 18, wherein the one or more computing devices are configured to identify the first known entity object by comparing the text in the second answer to one or more text strings associated with each of a plurality of entity objects in a knowledge base, the plurality of entity objects including the first known entity object. 20. A computer program product, comprising one or more computer-readable media having computer program instructions stored therein, the computer program instructions being configured such that, when executed by one or more computing devices, the computer program instructions cause the one or more computing devices to:
identify a question and a corresponding answer in unstructured text; generate a first fact triple from the question, the first fact triple including an unknown entity object representing an unknown entity; identify information in the answer corresponding to the unknown entity; identify a first known entity object corresponding to the information identified in the answer; replace the unknown entity object of the first fact triple with the first known entity object to generate a second fact triple; identify a second question and a second answer corresponding to the second question in second unstructured text; generate a third fact triple from the second question; and determine a polarity of the third fact triple from the answer. | 2,100 |
5,608 | 5,608 | 14,652,228 | 2,142 | Extracorporeal blood treatment systems and methods to use and modify/create treatment profiles for extracorporeal blood treatments. For example, treatment profiles may include one or more preset, or predefined, settings or values for an extracorporeal blood treatment such as, e.g., therapy type, therapy set (e.g., tubing set, filter set, etc.), anticoagulation type, and one or more flow rates, etc. | 1. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to select a profile using the profile identifier region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises a preset therapy type of a plurality of different therapy types and a preset therapy set of a plurality of different therapy sets,
allow a user to use the input apparatus to select a profile of the plurality of profiles using a profile identifier region of a graphical user interface, and
display on the graphical user interface the preset therapy type of the selected profile in a therapy type region and the preset therapy set of the selected profile in a therapy set region. 2. A method for an extracorporeal blood treatment system comprising:
storing a plurality of profiles, wherein each profile of the plurality of profiles comprises at least a preset therapy type of a plurality of different therapy types and a preset therapy set of a plurality of different therapy sets; providing a graphical user interface comprising a profile identifier region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to select a profile of the plurality of profiles using the profile identifier region of the graphical user interface; allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile identifier region of the graphical user interface; and displaying on the graphical user interface the preset therapy type of the selected profile in the therapy type region and the preset therapy set of the selected profile in the therapy set region. 3. The system of claim 1, wherein the plurality of different therapy types comprises at least one of SCUF, CVVH, CVVHD, CVVHDF, TPE, HP, MARS, and carbon dioxide removal. 4. The system of claim 1, wherein each profile of the plurality of profiles further comprises an identifier, wherein the computing apparatus is further configured to execute:
displaying the identifier of each of the plurality of profiles; and allowing a user to use the input apparatus to select a profile of the plurality of profiles by selecting the identifier of the profile. 5. The system of claim 1, wherein the graphical user interface is further configured to depict a profile filter region, wherein each profile of the plurality of profiles further comprises identification data, wherein the computing apparatus is further configured to execute:
allowing a user to use the input apparatus to select one or more filters using the profile filter region; and displaying on the graphical user interface one or more profiles of the plurality of profiles based on the one or more selected filters. 6. The system of claim 5, wherein the identification data comprises one or more of prescribing doctor, weight, age, gender disease state, location, patient identifier, and intracellular volume. 7. The system of claim 1, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to select at least one of a different therapy type of the plurality of different therapy types than the preset therapy type of the selected profile using the therapy type region of the graphical user interface and a different therapy set of the plurality of different therapy sets than the preset therapy set of the selected profile using the therapy set region of the graphical user interface. 8. The system of claim 1, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus, without selecting a profile of the plurality of profiles, to select at least one of a therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and a therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface. 9. The system of claim 1, wherein the graphical user interface is further configured to depict an anticoagulation region, wherein each profile of the plurality of profiles further comprises a preset anticoagulation type of a plurality of different types of anticoagulation, wherein the computing apparatus is further configured to execute displaying on the graphical user interface the preset anticoagulation type of the selected profile in an anticoagulation region of the graphical user interface. 10. The system of claim 9, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to select a different anticoagulation type of the plurality of different types of anticoagulation than the present anticoagulation type using the anticoagulation region of the graphical user interface. 11. The system of claim 1,
wherein each profile of the plurality of profiles further comprises a preset value for at least one flow rate of a plurality of flow rates, wherein the graphical user interface is further configured to depict a flow rate region, wherein the computing apparatus is further configured to execute displaying on the graphical user interface the preset value of the at least one flow rate of the selected profile in a flow rate region. 12. The system of claim 11, wherein the computing apparatus is further configured to execute:
allowing a user to use the input apparatus to adjust the preset value of the at least one flow rate using flow rate region; and displaying on the graphical user interface an indication proximate the adjusted preset value of the at least one flow rate in the flow rate region. 13. The system of claim 1, wherein each profile of the plurality of profiles further comprises at least one preset alarm value for at least one alarm limit of a plurality of alarm limits, wherein the graphical user interface is further configured to depict an alarm region, wherein the computing apparatus is further configured to execute:
displaying the at least one preset alarm value for at least one alarm limit of the selected profile in an alarm region on the graphical user interface; and allowing a user to use the input apparatus to adjust the at least one preset alarm value of the at least one alarm limit of the plurality of alarm limits of the selected profile using the alarm region of the graphical user interface. 14. The system of claim 1, wherein each profile of the plurality of profiles further comprises at least one preset anticoagulation value for at least one anticoagulation advisory of a plurality of anticoagulation advisories, wherein the graphical user interface is further configured to depict an anticoagulation advisory region, wherein the computing apparatus is further configured to execute:
displaying the at least one preset anticoagulation value for the at least one anticoagulation advisory of the plurality of anticoagulation advisories of the selected profile in an anticoagulation advisory region on the graphical user interface; and allowing a user to use the input apparatus to adjust the at least one preset anticoagulation value of at least one anticoagulation advisory of the plurality of anticoagulation advisories of the selected profile using the anticoagulation advisory region of the graphical user interface. 15. The system of claim 1, wherein the input apparatus comprises a touch screen. 16. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to create a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets,
display a profile identifier region, a therapy type region and a therapy set region on the graphical user interface,
allow a user to use the input apparatus to enter an identifier for a new profile of the plurality of profiles using the profile identifier region, to select a therapy type of the plurality of different therapy types to be the preset therapy type of the new profile using the therapy type region of the graphical user interface, and to select a therapy set of the plurality of different therapy sets to be the preset therapy set of the new profile using the therapy set region of the graphical user interface, and
allow a user to save the new profile into the plurality of stored profiles. 17. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface comprising a profile identifier region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to create or edit a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; allowing a user to use the input apparatus to enter an identifier for a new profile of the plurality of profiles using the profile identifier region of the graphical user interface, to select a therapy type of the plurality of different therapy types to be the preset therapy type of the new profile using the therapy type region of the graphical user interface, and to select a therapy set of the plurality of different therapy sets to be the preset therapy set of the new profile using the therapy set region of the graphical user interface; and allow a user to save the new profile into the plurality of stored profiles. 18. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a profile selection region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to edit a profile identifier using the profile identifier region of the graphical user interface, to select a profile using the profile selection region, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets,
display a profile identifier region, a profile selection region, a therapy type region, and a therapy set region on the graphical user interface,
allow a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface,
display on the graphical user interface the identifier of the selected profile in the profile identifier region, the preset therapy type of the selected profile in the therapy type region, and the preset therapy set of the selected profile in the therapy set region,
allow a user to use the input apparatus to modify at least one of the preset therapy type of the selected profile to a different therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and the preset therapy set of the selected profile to a different therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface, and
allow a user to save the modified profile into the plurality of stored profiles. 19. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface comprising a profile identifier region, a profile selection region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to create or edit a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; displaying a profile identifier region, a profile selection region, a therapy type region, and a therapy set region on the graphical user interface; allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface; displaying on the graphical user interface the identifier of the selected profile in the profile identifier region, the preset therapy type of the selected profile in the therapy region, and the preset therapy set of the selected profile in the therapy set region; allowing a user to use the input apparatus to modify at least one of the preset therapy type of the selected profile to a different therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and the preset therapy set of the selected profile to a different therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface; and allowing a user to save the modified profile into the plurality of stored profiles. 20. The system of claim 16, wherein the plurality of different therapy types comprises one or more of SCUF, CVVH, CVVHD, CVVHDF, TPE, HP, MARS, and carbon dioxide removal. 21. The system of claim 16, wherein the graphical user interface is further configured to depict an anticoagulation region, wherein each profile of the plurality of profiles further comprises a preset anticoagulation type of a plurality of different types of anticoagulation,
wherein the computing apparatus is further configured to execute:
displaying an anticoagulation region on the graphical user interface; and
allowing a user to use the input apparatus to select an anticoagulation type to be the preset anticoagulation type of the new profile using the anticoagulation region of the graphical user interface. 22. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to modify the identifier of the new profile using the profile identifier region. 23. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to save the new profile into the plurality of stored profiles if at least a therapy type and a therapy set has been selected. 24. The system of claim 16, wherein each profile of the plurality of profiles further comprises a preset value for at least one flow rate of a plurality of flow rates, wherein the graphical user interface is further configured to depict a flow rate region, wherein the computing apparatus is further configured to execute:
displaying a flow rate region on the graphical user interface; and allowing a user to use the input apparatus to adjust the preset value of the at least one flow rate of the new profile using the flow rate region of the graphical user interface. 25. The system of claim 24, wherein the computing apparatus is further configured to execute displaying on the graphical user interface an indication proximate the adjusted preset value of the at least one flow rate in the flow rate region. 26. The system of claim 16, wherein each profile of the plurality of profiles further comprises at least one preset alarm value for at least one alarm limit of a plurality of alarm limits, wherein the graphical user interface is further configured to depict an alarm region, wherein the computing apparatus is further configured to execute:
displaying an alarm region on the graphical user interface; and allowing a user to use the input apparatus to adjust at least one preset alarm value of the plurality of alarm limits of the new profile using the alarm region of the graphical user interface. 27. The system of claim 16, wherein each profile of the plurality of profiles further comprises at least one preset anticoagulation value for at least one anticoagulation advisory of a plurality of anticoagulation advisories, wherein the graphical user interface is further configured to depict an anticoagulation advisory region, wherein the computing apparatus is further configured to execute:
displaying an anticoagulation advisory region on the graphical user interface; and allowing a user to use the input apparatus to adjust at least one preset anticoagulation value of the plurality of the plurality anticoagulation advisories of the new profile using the anticoagulation advisory region of the graphical user interface. 28. The system of claim 16, wherein the input apparatus comprises a touch screen. 29. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to transfer at least one profile of the plurality of profiles to an external device. 30. The system of claim 16, wherein the graphical user interface is further configured to depict a profile selection region comprising a list of the identifiers of the plurality of profiles,
wherein the computing apparatus is further configured to execute:
displaying a profile selection region on the graphical user interface; and
allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface. 31. The system of claim 18, wherein the plurality of profiles comprise at least one protected profile, wherein at least one of the identifier, preset therapy type, and preset therapy set of the at least one protected profile are not modifiable by a user. 32. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile selection interface and a profile creation/modification interface; an input apparatus configured to allow a user to select, create, and modify one or more profiles; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets;
display on the graphical user interface a profile selection interface configured to allow a user to select a profile for use in a treatment; and
display on the graphical user interface a profile creation/modification interface configured to allow a user to modify one or more profiles of the plurality of profiles and/or to allow a user to create one or more profiles to be stored in the plurality of profiles 33. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface, wherein the graphical user interface is configured to depict a profile selection interface and a profile creation/modification interface; providing an input apparatus configured to allow a user to select, create, and modify one or more profiles; storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; and displaying on the graphical user interface a profile selection interface configured to allow a user to select a profile for use in a treatment; and displaying on the graphical user interface a profile creation/modification interface configured to allow a user to modify one or more profiles of the plurality of profiles and/or to allow a user to create one or more profiles to be stored in the plurality of profiles. 34. The system of claim 32, wherein the profile selection interface and the profile creation/modification interface are not displayed at the same time. | Extracorporeal blood treatment systems and methods to use and modify/create treatment profiles for extracorporeal blood treatments. For example, treatment profiles may include one or more preset, or predefined, settings or values for an extracorporeal blood treatment such as, e.g., therapy type, therapy set (e.g., tubing set, filter set, etc.), anticoagulation type, and one or more flow rates, etc.1. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to select a profile using the profile identifier region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises a preset therapy type of a plurality of different therapy types and a preset therapy set of a plurality of different therapy sets,
allow a user to use the input apparatus to select a profile of the plurality of profiles using a profile identifier region of a graphical user interface, and
display on the graphical user interface the preset therapy type of the selected profile in a therapy type region and the preset therapy set of the selected profile in a therapy set region. 2. A method for an extracorporeal blood treatment system comprising:
storing a plurality of profiles, wherein each profile of the plurality of profiles comprises at least a preset therapy type of a plurality of different therapy types and a preset therapy set of a plurality of different therapy sets; providing a graphical user interface comprising a profile identifier region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to select a profile of the plurality of profiles using the profile identifier region of the graphical user interface; allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile identifier region of the graphical user interface; and displaying on the graphical user interface the preset therapy type of the selected profile in the therapy type region and the preset therapy set of the selected profile in the therapy set region. 3. The system of claim 1, wherein the plurality of different therapy types comprises at least one of SCUF, CVVH, CVVHD, CVVHDF, TPE, HP, MARS, and carbon dioxide removal. 4. The system of claim 1, wherein each profile of the plurality of profiles further comprises an identifier, wherein the computing apparatus is further configured to execute:
displaying the identifier of each of the plurality of profiles; and allowing a user to use the input apparatus to select a profile of the plurality of profiles by selecting the identifier of the profile. 5. The system of claim 1, wherein the graphical user interface is further configured to depict a profile filter region, wherein each profile of the plurality of profiles further comprises identification data, wherein the computing apparatus is further configured to execute:
allowing a user to use the input apparatus to select one or more filters using the profile filter region; and displaying on the graphical user interface one or more profiles of the plurality of profiles based on the one or more selected filters. 6. The system of claim 5, wherein the identification data comprises one or more of prescribing doctor, weight, age, gender disease state, location, patient identifier, and intracellular volume. 7. The system of claim 1, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to select at least one of a different therapy type of the plurality of different therapy types than the preset therapy type of the selected profile using the therapy type region of the graphical user interface and a different therapy set of the plurality of different therapy sets than the preset therapy set of the selected profile using the therapy set region of the graphical user interface. 8. The system of claim 1, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus, without selecting a profile of the plurality of profiles, to select at least one of a therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and a therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface. 9. The system of claim 1, wherein the graphical user interface is further configured to depict an anticoagulation region, wherein each profile of the plurality of profiles further comprises a preset anticoagulation type of a plurality of different types of anticoagulation, wherein the computing apparatus is further configured to execute displaying on the graphical user interface the preset anticoagulation type of the selected profile in an anticoagulation region of the graphical user interface. 10. The system of claim 9, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to select a different anticoagulation type of the plurality of different types of anticoagulation than the present anticoagulation type using the anticoagulation region of the graphical user interface. 11. The system of claim 1,
wherein each profile of the plurality of profiles further comprises a preset value for at least one flow rate of a plurality of flow rates, wherein the graphical user interface is further configured to depict a flow rate region, wherein the computing apparatus is further configured to execute displaying on the graphical user interface the preset value of the at least one flow rate of the selected profile in a flow rate region. 12. The system of claim 11, wherein the computing apparatus is further configured to execute:
allowing a user to use the input apparatus to adjust the preset value of the at least one flow rate using flow rate region; and displaying on the graphical user interface an indication proximate the adjusted preset value of the at least one flow rate in the flow rate region. 13. The system of claim 1, wherein each profile of the plurality of profiles further comprises at least one preset alarm value for at least one alarm limit of a plurality of alarm limits, wherein the graphical user interface is further configured to depict an alarm region, wherein the computing apparatus is further configured to execute:
displaying the at least one preset alarm value for at least one alarm limit of the selected profile in an alarm region on the graphical user interface; and allowing a user to use the input apparatus to adjust the at least one preset alarm value of the at least one alarm limit of the plurality of alarm limits of the selected profile using the alarm region of the graphical user interface. 14. The system of claim 1, wherein each profile of the plurality of profiles further comprises at least one preset anticoagulation value for at least one anticoagulation advisory of a plurality of anticoagulation advisories, wherein the graphical user interface is further configured to depict an anticoagulation advisory region, wherein the computing apparatus is further configured to execute:
displaying the at least one preset anticoagulation value for the at least one anticoagulation advisory of the plurality of anticoagulation advisories of the selected profile in an anticoagulation advisory region on the graphical user interface; and allowing a user to use the input apparatus to adjust the at least one preset anticoagulation value of at least one anticoagulation advisory of the plurality of anticoagulation advisories of the selected profile using the anticoagulation advisory region of the graphical user interface. 15. The system of claim 1, wherein the input apparatus comprises a touch screen. 16. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to create a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets,
display a profile identifier region, a therapy type region and a therapy set region on the graphical user interface,
allow a user to use the input apparatus to enter an identifier for a new profile of the plurality of profiles using the profile identifier region, to select a therapy type of the plurality of different therapy types to be the preset therapy type of the new profile using the therapy type region of the graphical user interface, and to select a therapy set of the plurality of different therapy sets to be the preset therapy set of the new profile using the therapy set region of the graphical user interface, and
allow a user to save the new profile into the plurality of stored profiles. 17. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface comprising a profile identifier region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to create or edit a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; allowing a user to use the input apparatus to enter an identifier for a new profile of the plurality of profiles using the profile identifier region of the graphical user interface, to select a therapy type of the plurality of different therapy types to be the preset therapy type of the new profile using the therapy type region of the graphical user interface, and to select a therapy set of the plurality of different therapy sets to be the preset therapy set of the new profile using the therapy set region of the graphical user interface; and allow a user to save the new profile into the plurality of stored profiles. 18. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile identifier region, a profile selection region, a therapy type region, and a therapy set region; an input apparatus configured to allow a user to edit a profile identifier using the profile identifier region of the graphical user interface, to select a profile using the profile selection region, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets,
display a profile identifier region, a profile selection region, a therapy type region, and a therapy set region on the graphical user interface,
allow a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface,
display on the graphical user interface the identifier of the selected profile in the profile identifier region, the preset therapy type of the selected profile in the therapy type region, and the preset therapy set of the selected profile in the therapy set region,
allow a user to use the input apparatus to modify at least one of the preset therapy type of the selected profile to a different therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and the preset therapy set of the selected profile to a different therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface, and
allow a user to save the modified profile into the plurality of stored profiles. 19. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface comprising a profile identifier region, a profile selection region, a therapy type region, and a therapy set region; providing an input apparatus configured to allow a user to create or edit a profile identifier using the profile identifier region of the graphical user interface, to select a therapy type using the therapy type region of the graphical user interface, and to select a therapy set using the therapy set region of the graphical user interface; and storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; displaying a profile identifier region, a profile selection region, a therapy type region, and a therapy set region on the graphical user interface; allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface; displaying on the graphical user interface the identifier of the selected profile in the profile identifier region, the preset therapy type of the selected profile in the therapy region, and the preset therapy set of the selected profile in the therapy set region; allowing a user to use the input apparatus to modify at least one of the preset therapy type of the selected profile to a different therapy type of the plurality of different therapy types using the therapy type region of the graphical user interface and the preset therapy set of the selected profile to a different therapy set of the plurality of different therapy sets using the therapy set region of the graphical user interface; and allowing a user to save the modified profile into the plurality of stored profiles. 20. The system of claim 16, wherein the plurality of different therapy types comprises one or more of SCUF, CVVH, CVVHD, CVVHDF, TPE, HP, MARS, and carbon dioxide removal. 21. The system of claim 16, wherein the graphical user interface is further configured to depict an anticoagulation region, wherein each profile of the plurality of profiles further comprises a preset anticoagulation type of a plurality of different types of anticoagulation,
wherein the computing apparatus is further configured to execute:
displaying an anticoagulation region on the graphical user interface; and
allowing a user to use the input apparatus to select an anticoagulation type to be the preset anticoagulation type of the new profile using the anticoagulation region of the graphical user interface. 22. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to modify the identifier of the new profile using the profile identifier region. 23. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to save the new profile into the plurality of stored profiles if at least a therapy type and a therapy set has been selected. 24. The system of claim 16, wherein each profile of the plurality of profiles further comprises a preset value for at least one flow rate of a plurality of flow rates, wherein the graphical user interface is further configured to depict a flow rate region, wherein the computing apparatus is further configured to execute:
displaying a flow rate region on the graphical user interface; and allowing a user to use the input apparatus to adjust the preset value of the at least one flow rate of the new profile using the flow rate region of the graphical user interface. 25. The system of claim 24, wherein the computing apparatus is further configured to execute displaying on the graphical user interface an indication proximate the adjusted preset value of the at least one flow rate in the flow rate region. 26. The system of claim 16, wherein each profile of the plurality of profiles further comprises at least one preset alarm value for at least one alarm limit of a plurality of alarm limits, wherein the graphical user interface is further configured to depict an alarm region, wherein the computing apparatus is further configured to execute:
displaying an alarm region on the graphical user interface; and allowing a user to use the input apparatus to adjust at least one preset alarm value of the plurality of alarm limits of the new profile using the alarm region of the graphical user interface. 27. The system of claim 16, wherein each profile of the plurality of profiles further comprises at least one preset anticoagulation value for at least one anticoagulation advisory of a plurality of anticoagulation advisories, wherein the graphical user interface is further configured to depict an anticoagulation advisory region, wherein the computing apparatus is further configured to execute:
displaying an anticoagulation advisory region on the graphical user interface; and allowing a user to use the input apparatus to adjust at least one preset anticoagulation value of the plurality of the plurality anticoagulation advisories of the new profile using the anticoagulation advisory region of the graphical user interface. 28. The system of claim 16, wherein the input apparatus comprises a touch screen. 29. The system of claim 16, wherein the computing apparatus is further configured to execute allowing a user to use the input apparatus to transfer at least one profile of the plurality of profiles to an external device. 30. The system of claim 16, wherein the graphical user interface is further configured to depict a profile selection region comprising a list of the identifiers of the plurality of profiles,
wherein the computing apparatus is further configured to execute:
displaying a profile selection region on the graphical user interface; and
allowing a user to use the input apparatus to select a profile of the plurality of profiles using the profile selection region of the graphical user interface. 31. The system of claim 18, wherein the plurality of profiles comprise at least one protected profile, wherein at least one of the identifier, preset therapy type, and preset therapy set of the at least one protected profile are not modifiable by a user. 32. An extracorporeal blood treatment system comprising:
a display apparatus comprising a graphical user interface, wherein the graphical user interface is configured to depict a profile selection interface and a profile creation/modification interface; an input apparatus configured to allow a user to select, create, and modify one or more profiles; and a computing apparatus operatively coupled to the display apparatus and the input apparatus, wherein the computing apparatus is configured to:
store a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets;
display on the graphical user interface a profile selection interface configured to allow a user to select a profile for use in a treatment; and
display on the graphical user interface a profile creation/modification interface configured to allow a user to modify one or more profiles of the plurality of profiles and/or to allow a user to create one or more profiles to be stored in the plurality of profiles 33. A method for an extracorporeal blood treatment system comprising:
providing a graphical user interface, wherein the graphical user interface is configured to depict a profile selection interface and a profile creation/modification interface; providing an input apparatus configured to allow a user to select, create, and modify one or more profiles; storing a plurality of profiles, wherein each profile of the plurality of profiles comprises an identifier, at least a preset therapy type of a plurality of different therapy types, and a preset therapy set of a plurality of different therapy sets; and displaying on the graphical user interface a profile selection interface configured to allow a user to select a profile for use in a treatment; and displaying on the graphical user interface a profile creation/modification interface configured to allow a user to modify one or more profiles of the plurality of profiles and/or to allow a user to create one or more profiles to be stored in the plurality of profiles. 34. The system of claim 32, wherein the profile selection interface and the profile creation/modification interface are not displayed at the same time. | 2,100 |
5,609 | 5,609 | 14,738,783 | 2,163 | In one embodiment, a method for managing a data storage system includes: in response to receiving a data object, sorting data records in the data object on the basis of a first query so as to form a first backup; causing the first backup to be stored in the data storage system; and cause to be stored, in an index of the data storage system, the first query and a first address of the first backup in the data storage system. | 1. A method for managing a data storage system, comprising:
in response to receiving a data object, sorting data records in the data object on the basis of a first query so as to form a first backup; cause the first backup to be stored in a data storage system; and cause to be stored, in an index of the data storage system, the first query and a first address of the first backup in the data storage system. 2. The method according to claim 1, wherein the sorting, in response to receiving the data object, data records in the data object on the basis of the first query so as to form the first backup comprises:
obtaining a first standard on the basis of the first query; and sorting data records in the data object according to the first standard so as to form the first backup. 3. The method according to claim 2, wherein the data object is a multi-dimensional database, and the obtaining the first standard on the basis of the first query comprises:
obtaining the first standard on the basis of at least one dimension in the multi-dimensional database corresponding to the first query. 4. The method according to claim 1, wherein the sorting, in response to receiving the data object, data records in the data object on the basis of the first query so as to form the first backup comprises:
dividing the sorted data records into a plurality of data blocks according to block size supported by the data storage system; and forming the first backup on the basis of the plurality of data blocks. 5. The method according to claim 4, further comprising:
sorting the data records in the data object on the basis of a second query so as to form a second backup; storing the second backup in the data storage system; and storing, in the index of the data storage system, the second query and a second address of the second backup in the data storage system. 6. The method according to claim 5, further comprising:
obtaining a mapping relationship between data blocks in the first backup and data blocks in the second backup; and in response to the first backup being corrupted, recovering the first backup from the second backup on the basis of the mapping relationship. 7. The method according to claim 6, wherein the recovering, in response to the first backup being corrupted, the first backup from the second backup on the basis of the mapping relationship comprises:
looking up in the second backup a second backup block corresponding to a corrupted first backup block in the first backup on the basis of the mapping relationship; and copying the second backup block to replace the corrupted first backup block. 8. The method according to claim 5, further comprising:
obtaining a mapping relationship between data blocks in the first backup and data blocks in the second backup; and in response to the second backup being updated, updating the first backup using the updated second backup on the basis of the mapping relationship. 9. A computer program product for querying a data storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable by a processor to cause the processor to perform a method comprising:
receiving, by the processor a query with respect to a data storage system; and in response to there existing, in an index of the data storage system, a query matching the query, accessing, by the processor, an address associated with the matching query in the data storage system so as to execute the query, the address being of a first backup of sorted data records of a data object previously created using the matching query. 10. The computer program product according to claim 9, comprising program instructions readable by a processor to cause the processor to:
in response to there existing, in the index of the data storage system, no query matching the query, accessing an address, in the data storage system, associated with any query so as to execute the query. 11. An apparatus for managing a data storage system, comprising:
a sorting module configured to, in response to receiving a data object, sort data records in the data object on the basis of a first query so as to form a first backup; a storing module configured to store the first backup in the data storage system; and an indexing module configured to store, in an index of the data storage system, the first query and a first address of the first backup in the data storage system. 12. The apparatus according to claim 11, wherein the sorting module comprises:
an obtaining module configured to obtain a first standard on the basis of the first query; and a first sorting module configured to sort data records in the data object according to the first standard so as to form the first backup. 13. The apparatus according to claim 12, wherein the data object is a multi-dimensional database, and the obtaining module comprises:
a first obtaining module configured to obtain the first standard on the basis of at least one dimension in the multi-dimensional database corresponding to the first query. 14. The apparatus according to claim 11, wherein the sorting module comprises:
a dividing module configured to divide the sorted data records into a plurality of data blocks according to block size supported by the data storage system; and a forming module configured to form the first backup on the basis of the plurality of data blocks. 15. The apparatus according to claim 14, wherein:
the sorting module is further configured to sort the data records in the data object on the basis of a second query so as to form a second backup; the storing module is further configured to store the second backup in the data storage system; and the indexing module is further configured to store, in the index of the data storage system, the second query and a second address of the second backup in the data storage system. 16. The apparatus according to claim 15, comprising:
a mapping module configured to obtain a mapping relationship between data blocks in the first backup and data blocks in the second backup; and a recovering module configured to, in response to the first backup being corrupted, recover the first backup from the second backup on the basis of the mapping relationship. 17. The apparatus according to claim 16, wherein the recovering module comprises:
a lookup module configured to look up in the second backup a second backup block corresponding to a corrupted first backup block in the first backup on the basis of the mapping relationship; and a copying module configured to copy the second backup block to replace the corrupted first backup block. 18. The apparatus according to claim 15, comprising:
a mapping module configured to obtain a mapping relationship between data blocks in the first backup and data blocks in the second backup; and an updating module configured to, in response to the second backup being updated, update the first backup using the updated second backup on the basis of the mapping relationship. 19. An apparatus for querying a data storage system, comprising:
a receiving module configured to receive a query with respect to the data storage system; and a first querying module configured to, in response to there existing, in an index of the data storage system, a query matching the query, access an address associated with the matching query in the data storage system so as to execute the query; wherein the data storage system is a data storage system managed by an apparatus according to claim 11. 20. The apparatus according to claim 19, comprising:
a second querying module configured to, in response to there existing, in the index of the data storage system, no query matching the query, access an address, in the data storage system, associated with any query so as to execute the query. | In one embodiment, a method for managing a data storage system includes: in response to receiving a data object, sorting data records in the data object on the basis of a first query so as to form a first backup; causing the first backup to be stored in the data storage system; and cause to be stored, in an index of the data storage system, the first query and a first address of the first backup in the data storage system.1. A method for managing a data storage system, comprising:
in response to receiving a data object, sorting data records in the data object on the basis of a first query so as to form a first backup; cause the first backup to be stored in a data storage system; and cause to be stored, in an index of the data storage system, the first query and a first address of the first backup in the data storage system. 2. The method according to claim 1, wherein the sorting, in response to receiving the data object, data records in the data object on the basis of the first query so as to form the first backup comprises:
obtaining a first standard on the basis of the first query; and sorting data records in the data object according to the first standard so as to form the first backup. 3. The method according to claim 2, wherein the data object is a multi-dimensional database, and the obtaining the first standard on the basis of the first query comprises:
obtaining the first standard on the basis of at least one dimension in the multi-dimensional database corresponding to the first query. 4. The method according to claim 1, wherein the sorting, in response to receiving the data object, data records in the data object on the basis of the first query so as to form the first backup comprises:
dividing the sorted data records into a plurality of data blocks according to block size supported by the data storage system; and forming the first backup on the basis of the plurality of data blocks. 5. The method according to claim 4, further comprising:
sorting the data records in the data object on the basis of a second query so as to form a second backup; storing the second backup in the data storage system; and storing, in the index of the data storage system, the second query and a second address of the second backup in the data storage system. 6. The method according to claim 5, further comprising:
obtaining a mapping relationship between data blocks in the first backup and data blocks in the second backup; and in response to the first backup being corrupted, recovering the first backup from the second backup on the basis of the mapping relationship. 7. The method according to claim 6, wherein the recovering, in response to the first backup being corrupted, the first backup from the second backup on the basis of the mapping relationship comprises:
looking up in the second backup a second backup block corresponding to a corrupted first backup block in the first backup on the basis of the mapping relationship; and copying the second backup block to replace the corrupted first backup block. 8. The method according to claim 5, further comprising:
obtaining a mapping relationship between data blocks in the first backup and data blocks in the second backup; and in response to the second backup being updated, updating the first backup using the updated second backup on the basis of the mapping relationship. 9. A computer program product for querying a data storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable by a processor to cause the processor to perform a method comprising:
receiving, by the processor a query with respect to a data storage system; and in response to there existing, in an index of the data storage system, a query matching the query, accessing, by the processor, an address associated with the matching query in the data storage system so as to execute the query, the address being of a first backup of sorted data records of a data object previously created using the matching query. 10. The computer program product according to claim 9, comprising program instructions readable by a processor to cause the processor to:
in response to there existing, in the index of the data storage system, no query matching the query, accessing an address, in the data storage system, associated with any query so as to execute the query. 11. An apparatus for managing a data storage system, comprising:
a sorting module configured to, in response to receiving a data object, sort data records in the data object on the basis of a first query so as to form a first backup; a storing module configured to store the first backup in the data storage system; and an indexing module configured to store, in an index of the data storage system, the first query and a first address of the first backup in the data storage system. 12. The apparatus according to claim 11, wherein the sorting module comprises:
an obtaining module configured to obtain a first standard on the basis of the first query; and a first sorting module configured to sort data records in the data object according to the first standard so as to form the first backup. 13. The apparatus according to claim 12, wherein the data object is a multi-dimensional database, and the obtaining module comprises:
a first obtaining module configured to obtain the first standard on the basis of at least one dimension in the multi-dimensional database corresponding to the first query. 14. The apparatus according to claim 11, wherein the sorting module comprises:
a dividing module configured to divide the sorted data records into a plurality of data blocks according to block size supported by the data storage system; and a forming module configured to form the first backup on the basis of the plurality of data blocks. 15. The apparatus according to claim 14, wherein:
the sorting module is further configured to sort the data records in the data object on the basis of a second query so as to form a second backup; the storing module is further configured to store the second backup in the data storage system; and the indexing module is further configured to store, in the index of the data storage system, the second query and a second address of the second backup in the data storage system. 16. The apparatus according to claim 15, comprising:
a mapping module configured to obtain a mapping relationship between data blocks in the first backup and data blocks in the second backup; and a recovering module configured to, in response to the first backup being corrupted, recover the first backup from the second backup on the basis of the mapping relationship. 17. The apparatus according to claim 16, wherein the recovering module comprises:
a lookup module configured to look up in the second backup a second backup block corresponding to a corrupted first backup block in the first backup on the basis of the mapping relationship; and a copying module configured to copy the second backup block to replace the corrupted first backup block. 18. The apparatus according to claim 15, comprising:
a mapping module configured to obtain a mapping relationship between data blocks in the first backup and data blocks in the second backup; and an updating module configured to, in response to the second backup being updated, update the first backup using the updated second backup on the basis of the mapping relationship. 19. An apparatus for querying a data storage system, comprising:
a receiving module configured to receive a query with respect to the data storage system; and a first querying module configured to, in response to there existing, in an index of the data storage system, a query matching the query, access an address associated with the matching query in the data storage system so as to execute the query; wherein the data storage system is a data storage system managed by an apparatus according to claim 11. 20. The apparatus according to claim 19, comprising:
a second querying module configured to, in response to there existing, in the index of the data storage system, no query matching the query, access an address, in the data storage system, associated with any query so as to execute the query. | 2,100 |
5,610 | 5,610 | 15,143,248 | 2,132 | A 3D-stacked memory device including: a base die including a plurality of switches to direct data flow and a plurality of arithmetic logic units (ALUs) to compute data; a plurality of memory dies stacked on the base die; and an interface to transfer signals to control the base die. | 1. A 3D-stacked memory device comprising:
a base die comprising a plurality of switches configured to direct data flow and a plurality of arithmetic logic units (ALUs) configured to compute data; a plurality of memory dies stacked on the base die; and an interface configured to transfer signals to control the base die. 2. The device of claim 1, wherein the base die further comprises a program memory, the program memory being configured to be controlled by an external host through the interface, to configure the switches, and to control operations of the ALUs. 3. The device of claim 2, wherein the interface comprises:
a request link configured to transmit a request packet from the host to the base die; and a response link configured to transmit a response packet from the base die to the host. 4. The device of claim 3, wherein the request packet comprises configuration instructions and/or commands to instruct the switches and the ALUs to compute the data. 5. The device of claim 4, wherein the request packet comprises reserved bits to be utilized to transmit the configuration instructions and/or the commands to the base die. 6. The device of claim 4, wherein the request packet comprises a header and a tail, the tail comprising bits utilized to transmit the configuration instructions and/or the commands to the base die. 7. The device of claim 1, wherein the interface comprises:
a control bus configured to transmit commands from a host to the base die; and a data bus configured to transmit data between the host and the base die. 8. The device of claim 7, wherein the commands comprise a mode register set command (MRS command) to configure the 3DS memory device to operate in a PIM mode to compute the data. 9. The device of claim 8, wherein the commands comprise a memory command, and
the base die is configured to translate the memory command to compute the data, when operating in the PIM mode. 10. The device of claim 9, wherein the base die is configured to perform the memory command, when operating in a normal mode. 11. The device of claim 10, wherein the memory command comprises a DRAM command. 12. A method of operating a 3D-stacked memory device comprising a base die comprising a plurality of switches and a plurality of arithmetic logic units (ALUs), a plurality of memory dies stacked on the base die, and an interface configured to control the base die, the method comprising:
configuring the switches to direct data flow according to configuration instructions; controlling operations of the ALUs to compute data according to logic commands; and storing the computed data in the memory dies. 13. The method of claim 12, wherein the configuration instructions and the logic commands are embedded in a request packet, and the method further comprises:
receiving the request packet through a request link of the interface from a host; and decoding the request packet to identify the configuration instructions and the logic commands. 14. The method of claim 13, wherein the method further comprises:
transmitting a response packet through a response link of the interface to the host. 15. The method of claim 13, wherein the request packet comprises reserved bits for the configuration instructions and/or the logic commands. 16. The method of claim 13, wherein the request packet comprises a header and a tail, the tail comprising bits for the configuration instructions and/or the logic commands. 17. The method of claim 12, further comprising:
receiving a mode register set command through a control bus of the interface from a host; and in response to receiving the mode register set command, configuring a PIM mode to compute the data. 18. The method of claim 17, further comprising:
receiving a first memory command from the host through the control bus; translating the first memory command into the logic commands; and computing the data according to the logic commands. 19. The method of claim 18, further comprising:
configuring a normal mode; receiving a second memory command from the host through the control bus; and performing a memory function according to the second memory command. 20. An interface of a memory device comprising a processor in memory, the interface comprising:
a control bus configured to transfer commands from an external host to the memory device; and a data bus configured to transfer data between the memory device and the host; wherein the interface is configured to transfer the commands to set the memory device to operate in a PIM mode to compute data, and to set the memory device to operate in a normal mode to perform memory functions, and wherein the memory device is configured to translate memory commands into logic commands to compute the data according to the logic commands when in the PIM mode, and to perform the memory functions according to the memory commands when in the normal mode. | A 3D-stacked memory device including: a base die including a plurality of switches to direct data flow and a plurality of arithmetic logic units (ALUs) to compute data; a plurality of memory dies stacked on the base die; and an interface to transfer signals to control the base die.1. A 3D-stacked memory device comprising:
a base die comprising a plurality of switches configured to direct data flow and a plurality of arithmetic logic units (ALUs) configured to compute data; a plurality of memory dies stacked on the base die; and an interface configured to transfer signals to control the base die. 2. The device of claim 1, wherein the base die further comprises a program memory, the program memory being configured to be controlled by an external host through the interface, to configure the switches, and to control operations of the ALUs. 3. The device of claim 2, wherein the interface comprises:
a request link configured to transmit a request packet from the host to the base die; and a response link configured to transmit a response packet from the base die to the host. 4. The device of claim 3, wherein the request packet comprises configuration instructions and/or commands to instruct the switches and the ALUs to compute the data. 5. The device of claim 4, wherein the request packet comprises reserved bits to be utilized to transmit the configuration instructions and/or the commands to the base die. 6. The device of claim 4, wherein the request packet comprises a header and a tail, the tail comprising bits utilized to transmit the configuration instructions and/or the commands to the base die. 7. The device of claim 1, wherein the interface comprises:
a control bus configured to transmit commands from a host to the base die; and a data bus configured to transmit data between the host and the base die. 8. The device of claim 7, wherein the commands comprise a mode register set command (MRS command) to configure the 3DS memory device to operate in a PIM mode to compute the data. 9. The device of claim 8, wherein the commands comprise a memory command, and
the base die is configured to translate the memory command to compute the data, when operating in the PIM mode. 10. The device of claim 9, wherein the base die is configured to perform the memory command, when operating in a normal mode. 11. The device of claim 10, wherein the memory command comprises a DRAM command. 12. A method of operating a 3D-stacked memory device comprising a base die comprising a plurality of switches and a plurality of arithmetic logic units (ALUs), a plurality of memory dies stacked on the base die, and an interface configured to control the base die, the method comprising:
configuring the switches to direct data flow according to configuration instructions; controlling operations of the ALUs to compute data according to logic commands; and storing the computed data in the memory dies. 13. The method of claim 12, wherein the configuration instructions and the logic commands are embedded in a request packet, and the method further comprises:
receiving the request packet through a request link of the interface from a host; and decoding the request packet to identify the configuration instructions and the logic commands. 14. The method of claim 13, wherein the method further comprises:
transmitting a response packet through a response link of the interface to the host. 15. The method of claim 13, wherein the request packet comprises reserved bits for the configuration instructions and/or the logic commands. 16. The method of claim 13, wherein the request packet comprises a header and a tail, the tail comprising bits for the configuration instructions and/or the logic commands. 17. The method of claim 12, further comprising:
receiving a mode register set command through a control bus of the interface from a host; and in response to receiving the mode register set command, configuring a PIM mode to compute the data. 18. The method of claim 17, further comprising:
receiving a first memory command from the host through the control bus; translating the first memory command into the logic commands; and computing the data according to the logic commands. 19. The method of claim 18, further comprising:
configuring a normal mode; receiving a second memory command from the host through the control bus; and performing a memory function according to the second memory command. 20. An interface of a memory device comprising a processor in memory, the interface comprising:
a control bus configured to transfer commands from an external host to the memory device; and a data bus configured to transfer data between the memory device and the host; wherein the interface is configured to transfer the commands to set the memory device to operate in a PIM mode to compute data, and to set the memory device to operate in a normal mode to perform memory functions, and wherein the memory device is configured to translate memory commands into logic commands to compute the data according to the logic commands when in the PIM mode, and to perform the memory functions according to the memory commands when in the normal mode. | 2,100 |
5,611 | 5,611 | 14,736,817 | 2,117 | A component mounting system includes a component mounting apparatus, a data creating apparatus and a component arranging operation supporting apparatus. The component mounting apparatus mounts components on a substrate. The data creating apparatus creates component data for each component. The component arranging operation supporting apparatus includes an identification information acquiring unit that acquires component identification information given to the component supplying member, and a control unit which checks a component to be disposed in a position based on the component identification information. The control unit of the component arranging operation supporting apparatus performs a request for a creation of component data regarding an alternative component, and the data creating apparatus receives the request and creates the component data regarding the alternative component. | 1. A component mounting system comprising:
a component mounting apparatus which mounts components supplied from a component supply member disposed in a component supplying unit on a substrate; a data creating apparatus which creates component data, which is a control parameter set for mounting the component on the substrate by the component mounting apparatus, for each component; and a component arranging operation supporting apparatus which includes an identification information acquiring unit that acquires component identification information given to the component supplying member, and a control unit which checks whether or not the component disposed in a predetermined position in the component supplying unit is a component to be disposed in the predetermined position based on the component identification information acquired by the identification information acquiring unit, wherein the control unit of the component arranging operation supporting apparatus includes a component data creation requesting unit that transmits the component identification information acquired by the identification information acquiring unit and identification information related to an alternative component that is used as an alternative to the component to the data creating apparatus and performs a request for a creation of component data regarding the alternative component, and the data creating apparatus receives the request from the component data creation requesting unit and creates the component data regarding the alternative component. 2. The component mounting system according to claim 1, wherein the data creating apparatus creates the component data regarding the alternative component by using the component data regarding the component which is replaced with the alternative component. 3. A component data creation method of a component mounting system that includes a component mounting apparatus which mounts components supplied from a component supply member disposed in a component supplying unit on a substrate, a data creating apparatus which creates component data, which is a control parameter set for mounting the component on the substrate by the component mounting apparatus, for each component, and a component arranging operation supporting apparatus which includes an identification information acquiring unit that acquires component identification information given to the component supplying member and a control unit that checks whether or not the component disposed in a predetermined position in the component supplying unit is a component to be disposed in the predetermined position based on the component identification information acquired by the identification information acquiring unit, the method comprising:
causing the identification information acquiring unit to acquire identification information related to the component and identification information related to an alternative component that is used as an alternative to the component; causing the component arranging operation supporting apparatus to transmit both of the identification information related to the component and the alternative component acquired by the identification information acquiring unit to the data creating apparatus; and causing the data creating apparatus to create component data regarding the alternative component based on both of the identification information related to the component and the alternative component received from the component arranging operation supporting apparatus. 4. The component data creation method according to claim 3, wherein the component data regarding the alternative component is created by using component data regarding the component which is replaced with the alternative component. | A component mounting system includes a component mounting apparatus, a data creating apparatus and a component arranging operation supporting apparatus. The component mounting apparatus mounts components on a substrate. The data creating apparatus creates component data for each component. The component arranging operation supporting apparatus includes an identification information acquiring unit that acquires component identification information given to the component supplying member, and a control unit which checks a component to be disposed in a position based on the component identification information. The control unit of the component arranging operation supporting apparatus performs a request for a creation of component data regarding an alternative component, and the data creating apparatus receives the request and creates the component data regarding the alternative component.1. A component mounting system comprising:
a component mounting apparatus which mounts components supplied from a component supply member disposed in a component supplying unit on a substrate; a data creating apparatus which creates component data, which is a control parameter set for mounting the component on the substrate by the component mounting apparatus, for each component; and a component arranging operation supporting apparatus which includes an identification information acquiring unit that acquires component identification information given to the component supplying member, and a control unit which checks whether or not the component disposed in a predetermined position in the component supplying unit is a component to be disposed in the predetermined position based on the component identification information acquired by the identification information acquiring unit, wherein the control unit of the component arranging operation supporting apparatus includes a component data creation requesting unit that transmits the component identification information acquired by the identification information acquiring unit and identification information related to an alternative component that is used as an alternative to the component to the data creating apparatus and performs a request for a creation of component data regarding the alternative component, and the data creating apparatus receives the request from the component data creation requesting unit and creates the component data regarding the alternative component. 2. The component mounting system according to claim 1, wherein the data creating apparatus creates the component data regarding the alternative component by using the component data regarding the component which is replaced with the alternative component. 3. A component data creation method of a component mounting system that includes a component mounting apparatus which mounts components supplied from a component supply member disposed in a component supplying unit on a substrate, a data creating apparatus which creates component data, which is a control parameter set for mounting the component on the substrate by the component mounting apparatus, for each component, and a component arranging operation supporting apparatus which includes an identification information acquiring unit that acquires component identification information given to the component supplying member and a control unit that checks whether or not the component disposed in a predetermined position in the component supplying unit is a component to be disposed in the predetermined position based on the component identification information acquired by the identification information acquiring unit, the method comprising:
causing the identification information acquiring unit to acquire identification information related to the component and identification information related to an alternative component that is used as an alternative to the component; causing the component arranging operation supporting apparatus to transmit both of the identification information related to the component and the alternative component acquired by the identification information acquiring unit to the data creating apparatus; and causing the data creating apparatus to create component data regarding the alternative component based on both of the identification information related to the component and the alternative component received from the component arranging operation supporting apparatus. 4. The component data creation method according to claim 3, wherein the component data regarding the alternative component is created by using component data regarding the component which is replaced with the alternative component. | 2,100 |
5,612 | 5,612 | 15,110,832 | 2,115 | Mechanisms are described for correlating environmental data (such as data regarding object settings) with performance data (such as data regarding a result of a predefined activity). The performance data may be analyzed to determine whether the result of the predefined activity can be considered a predetermined aspirational result (e.g., a result that the user desires to achieve), such that the user would want to obtain the same result the next time the user performs the same activity. In the event the result is a predetermined aspirational result, the object or objects that contributed to the predetermined aspirational result may be identified, such as by correlating the performance data with the environmental data to determine the relationship between the two. The object settings for the identified objects may also be identified. | 1-29. (canceled) 30. 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:
receive environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receive performance data regarding a result of a predefined activity; determine whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identify at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 31. The apparatus of claim 30, wherein, in an instance in which the result is the predetermined aspirational result, the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to determine the object setting for at least one of the objects identified based at least on the environmental data. 32. The apparatus of claim 31, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to cause the at least one object identified to be set at the respective object setting determined. 33. The apparatus of claim 30, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide for storage of the environmental data and the performance data received and to determine a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. 34. The apparatus of claim 33, wherein, in an instance in which the result is not the predetermined aspirational result, the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to determine a future setting of at least one of the objects based on the relationship determined in an attempt to achieve the predetermined aspirational result. 35. The apparatus of claim 34, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide for adjustment of a setting of the at least one of the objects to the setting determined. 36. The apparatus of claim 30, wherein the performance data is received from at least one performance sensor. 37. The apparatus of claim 30, wherein the object settings comprise an operational state of an object or an indication of presence of the object. 38. A method comprising:
receiving environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receiving performance data regarding a result of a predefined activity; determining whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identifying at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 39. The method of claim 38, wherein, in an instance in which the result is the predetermined aspirational result, the method further comprises determining the object setting for at least one of the objects identified based at least on the environmental data. 40. The method of claim 39 further comprising causing the at least one object identified to be set at the respective object setting determined. 41. The method of claim 38, further comprising providing for storage of the environmental data and the performance data received and determining a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. 42. The method of claim 41, wherein, in an instance in which the result is not the predetermined aspirational result, the method further comprises determining a future setting of at least one of the objects based on the relationship determined in an attempt to achieve the predetermined aspirational result. 43. The method of claim 42, further comprising providing for adjustment of a setting of the at least one of the objects to the setting determined. 44. The method of claim 38, wherein the performance data is received from at least one performance sensor. 45. The method of claim 38, wherein the object settings comprise an operational state of an object or an indication of presence of the object. 46. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
receiving environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receiving performance data regarding a result of a predefined activity; determining whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identifying at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 47. The computer program product of claim 46, wherein, in an instance in which the result is the predetermined aspirational result, the computer program product further comprises program code instructions for determining the object setting for at least one of the objects identified based at least on the environmental data. 48. The computer program product of claim 47, further comprising program code instructions for causing the at least one object identified to be set at the respective object setting determined. 49. The computer program product of claim 47, further comprising program code instructions for providing for storage of the environmental data and the performance data received and determining a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. | Mechanisms are described for correlating environmental data (such as data regarding object settings) with performance data (such as data regarding a result of a predefined activity). The performance data may be analyzed to determine whether the result of the predefined activity can be considered a predetermined aspirational result (e.g., a result that the user desires to achieve), such that the user would want to obtain the same result the next time the user performs the same activity. In the event the result is a predetermined aspirational result, the object or objects that contributed to the predetermined aspirational result may be identified, such as by correlating the performance data with the environmental data to determine the relationship between the two. The object settings for the identified objects may also be identified.1-29. (canceled) 30. 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:
receive environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receive performance data regarding a result of a predefined activity; determine whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identify at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 31. The apparatus of claim 30, wherein, in an instance in which the result is the predetermined aspirational result, the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to determine the object setting for at least one of the objects identified based at least on the environmental data. 32. The apparatus of claim 31, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to cause the at least one object identified to be set at the respective object setting determined. 33. The apparatus of claim 30, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide for storage of the environmental data and the performance data received and to determine a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. 34. The apparatus of claim 33, wherein, in an instance in which the result is not the predetermined aspirational result, the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to determine a future setting of at least one of the objects based on the relationship determined in an attempt to achieve the predetermined aspirational result. 35. The apparatus of claim 34, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide for adjustment of a setting of the at least one of the objects to the setting determined. 36. The apparatus of claim 30, wherein the performance data is received from at least one performance sensor. 37. The apparatus of claim 30, wherein the object settings comprise an operational state of an object or an indication of presence of the object. 38. A method comprising:
receiving environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receiving performance data regarding a result of a predefined activity; determining whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identifying at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 39. The method of claim 38, wherein, in an instance in which the result is the predetermined aspirational result, the method further comprises determining the object setting for at least one of the objects identified based at least on the environmental data. 40. The method of claim 39 further comprising causing the at least one object identified to be set at the respective object setting determined. 41. The method of claim 38, further comprising providing for storage of the environmental data and the performance data received and determining a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. 42. The method of claim 41, wherein, in an instance in which the result is not the predetermined aspirational result, the method further comprises determining a future setting of at least one of the objects based on the relationship determined in an attempt to achieve the predetermined aspirational result. 43. The method of claim 42, further comprising providing for adjustment of a setting of the at least one of the objects to the setting determined. 44. The method of claim 38, wherein the performance data is received from at least one performance sensor. 45. The method of claim 38, wherein the object settings comprise an operational state of an object or an indication of presence of the object. 46. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
receiving environmental data regarding object settings for a plurality of objects, wherein the object settings comprise one or more of an operational state of an object and an indication of presence of the object; receiving performance data regarding a result of a predefined activity; determining whether the result is a predetermined aspirational result based at least on the performance data received; and in an instance in which the result is the predetermined aspirational result, identifying at least one of the plurality of objects as contributing to the predetermined aspirational result based at least on the environmental data received. 47. The computer program product of claim 46, wherein, in an instance in which the result is the predetermined aspirational result, the computer program product further comprises program code instructions for determining the object setting for at least one of the objects identified based at least on the environmental data. 48. The computer program product of claim 47, further comprising program code instructions for causing the at least one object identified to be set at the respective object setting determined. 49. The computer program product of claim 47, further comprising program code instructions for providing for storage of the environmental data and the performance data received and determining a relationship between the object settings and the result of the predefined activity based on analysis of the environmental data and the performance data over a period of time. | 2,100 |
5,613 | 5,613 | 15,642,113 | 2,184 | A method for outputting reliably predictable instruction sequences. The method includes tracking repetitive hits to determine a set of frequently hit instruction sequences for a microprocessor, and out of that set, identifying a branch instruction having a series of subsequent frequently executed branch instructions that form a reliably predictable instruction sequence. The reliably predictable instruction sequence is stored into a buffer. On a subsequent hit to the branch instruction, the reliably predictable instruction sequence is output from the buffer. | 1.-19. (canceled) 20. A method for outputting reliably predictable instruction sequences, comprising:
tracking fetches of instruction sequences from memory; determining instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence; identifying a branch instruction preceding the instruction sequences that exceed the threshold; storing the reliably predictable instruction sequence into a buffer; and outputting the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 21. The method of claim 20, further comprising:
determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 22. The method of claim 21, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent access to the branch instruction where a predicted outcome of the branch instruction is wrong. 23. The method of claim 20, wherein an address of a branch instruction is used to index the buffer. 24. The method of claim 23, wherein addresses of a plurality of following branches are used as tags to index the buffer. 25. The method of claim 20, wherein a plurality of branch prediction bits are used as tags to index the buffer. 26. The method of claim 23, wherein a hash of the address of the branch instruction is used to index the buffer. 27. A processor pipeline for outputting reliably predictable instruction sequences, the processor pipeline comprising:
a buffer to store reliably predictable instruction sequences; an instruction fetch that accesses a plurality of instructions from memory, the fetch means configured to track fetches of instruction sequences from memory, determine instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence, identify a branch instruction preceding the instruction sequences that exceed the threshold, store the reliably predictable instruction sequence into the buffer, and output the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 28. The processor pipeline of claim 27, wherein the instruction fetch is further configured to determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 29. The processor pipeline of claim 28, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent hit to the branch instruction where a predicted outcome of the branch instruction is wrong. 30. The processor pipeline of claim 27, wherein the buffer is configured to store the reliably predictable instruction sequence and is indexed to access the reliably predictable instruction sequence in at least two ways. 31. The processor pipeline of claim 27, wherein an address of a branch instruction is used to index the buffer. 32. The processor pipeline of claim 31, wherein addresses of a plurality of following branches are used as tags to index the buffer or a hash of the address of the branch instruction is used to index the buffer. 33. The processor pipeline of claim 31, wherein a plurality of branch prediction bits are used as tags to index the buffer. 34. A computing system comprising:
a memory to store instructions; and a processor, wherein the processor includes a processor pipeline configured to output reliably predictable instruction sequences, the processor pipeline including a buffer to store reliably predictable instruction sequences, an instruction fetch that accesses a plurality of instructions from memory, the instruction fetch configured to track fetches of instruction sequences from memory, determine instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence, identify a branch instruction preceding the instruction sequences that exceed the threshold, store the reliably predictable instruction sequence into a buffer, and output the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 35. The computing system of claim 34, wherein the instruction fetch is further configured to determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 36. The computing system of claim 35, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent hit to the branch instruction where a predicted outcome of the branch instruction is wrong. 37. The computing system of claim 34, wherein the buffer is configured to store the reliably predictable instruction sequence and is indexed to access the reliably predictable instruction sequence in at least two ways. 38. The computing system of claim 34, wherein an address of a branch instruction is used to index the buffer. 39. The computing system of claim 38, wherein addresses of a plurality of following branches are used as tags to index the buffer or a hash of the address of the branch instruction is used to index the buffer. 40. The processor pipeline of claim 38, wherein a plurality of branch prediction bits are used as tags to index the buffer. | A method for outputting reliably predictable instruction sequences. The method includes tracking repetitive hits to determine a set of frequently hit instruction sequences for a microprocessor, and out of that set, identifying a branch instruction having a series of subsequent frequently executed branch instructions that form a reliably predictable instruction sequence. The reliably predictable instruction sequence is stored into a buffer. On a subsequent hit to the branch instruction, the reliably predictable instruction sequence is output from the buffer.1.-19. (canceled) 20. A method for outputting reliably predictable instruction sequences, comprising:
tracking fetches of instruction sequences from memory; determining instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence; identifying a branch instruction preceding the instruction sequences that exceed the threshold; storing the reliably predictable instruction sequence into a buffer; and outputting the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 21. The method of claim 20, further comprising:
determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 22. The method of claim 21, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent access to the branch instruction where a predicted outcome of the branch instruction is wrong. 23. The method of claim 20, wherein an address of a branch instruction is used to index the buffer. 24. The method of claim 23, wherein addresses of a plurality of following branches are used as tags to index the buffer. 25. The method of claim 20, wherein a plurality of branch prediction bits are used as tags to index the buffer. 26. The method of claim 23, wherein a hash of the address of the branch instruction is used to index the buffer. 27. A processor pipeline for outputting reliably predictable instruction sequences, the processor pipeline comprising:
a buffer to store reliably predictable instruction sequences; an instruction fetch that accesses a plurality of instructions from memory, the fetch means configured to track fetches of instruction sequences from memory, determine instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence, identify a branch instruction preceding the instruction sequences that exceed the threshold, store the reliably predictable instruction sequence into the buffer, and output the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 28. The processor pipeline of claim 27, wherein the instruction fetch is further configured to determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 29. The processor pipeline of claim 28, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent hit to the branch instruction where a predicted outcome of the branch instruction is wrong. 30. The processor pipeline of claim 27, wherein the buffer is configured to store the reliably predictable instruction sequence and is indexed to access the reliably predictable instruction sequence in at least two ways. 31. The processor pipeline of claim 27, wherein an address of a branch instruction is used to index the buffer. 32. The processor pipeline of claim 31, wherein addresses of a plurality of following branches are used as tags to index the buffer or a hash of the address of the branch instruction is used to index the buffer. 33. The processor pipeline of claim 31, wherein a plurality of branch prediction bits are used as tags to index the buffer. 34. A computing system comprising:
a memory to store instructions; and a processor, wherein the processor includes a processor pipeline configured to output reliably predictable instruction sequences, the processor pipeline including a buffer to store reliably predictable instruction sequences, an instruction fetch that accesses a plurality of instructions from memory, the instruction fetch configured to track fetches of instruction sequences from memory, determine instruction sequences that exceed a threshold frequency of fetches to be a reliably predictable instruction sequence, identify a branch instruction preceding the instruction sequences that exceed the threshold, store the reliably predictable instruction sequence into a buffer, and output the reliably predictable instruction sequence from the buffer into the pipeline of the processor, in response to a subsequent access of the branch instruction. 35. The computing system of claim 34, wherein the instruction fetch is further configured to determining to evict the reliably predictable instruction sequence from the buffer, in response to an attempt to store another instructions sequence in the buffer when full. 36. The computing system of claim 35, wherein compare logic is used to evaluate the reliably predictable instruction sequence to determine whether said sequence should be evicted from the buffer, and wherein the reliably predictable instruction sequence is evicted from the buffer and stored in a second buffer as an alternative instruction sequence for retrieval therefrom upon a subsequent hit to the branch instruction where a predicted outcome of the branch instruction is wrong. 37. The computing system of claim 34, wherein the buffer is configured to store the reliably predictable instruction sequence and is indexed to access the reliably predictable instruction sequence in at least two ways. 38. The computing system of claim 34, wherein an address of a branch instruction is used to index the buffer. 39. The computing system of claim 38, wherein addresses of a plurality of following branches are used as tags to index the buffer or a hash of the address of the branch instruction is used to index the buffer. 40. The processor pipeline of claim 38, wherein a plurality of branch prediction bits are used as tags to index the buffer. | 2,100 |
5,614 | 5,614 | 13,800,796 | 2,137 | Methods and apparatus for token-based admission control for replicated writes are disclosed. Data objects are divided into partitions, and corresponding to each partition, at least a master replica and a slave replica are stored. A determination as to whether to accept a write request directed to the partition is made based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the slave replica. If the write request is accepted, one or more data modification operations are initiated. | 1. A method, comprising:
storing, corresponding to a logical partition of a data object comprising one or more logical partitions, a master replica of the logical partition and one or more slave replicas of the logical partition, wherein writes to the logical partition are replicated at the master replica and at least one slave replica in accordance with a replication policy; storing, corresponding to the master replica, a master bucket set comprising one or more buckets, and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set (a) comprises a respective refillable collection of tokens usable to limit throughput of operations directed at the logical partition and (b) has a token consumption policy indicating a number of tokens to be consumed for an allowed operation; updating a token population of a particular bucket of the slave-snapshot bucket set based at least in part on a slave bucket update protocol, wherein, in accordance with the slave bucket update protocol, the master replica is configured to obtain an indication of an available throughput capacity at a shared storage device at which at least a portion of data of a particular slave replica of the one or more slave replicas is stored, wherein the shared storage device is configurable to store data corresponding to one or more logical partitions of one or more data objects; in response to receiving a write request directed to the logical partition,
determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in at least one bucket set of the master bucket set and the slave-snapshot bucket set, in accordance with respective token consumption policies of the buckets of the master bucket set and the slave-snapshot bucket set; and
in response to determining that the write request is to be accepted for execution, initiating one or more data modification operations corresponding to the write request. 2. The method as recited in claim 1, further comprising:
determining, based at least in part on a token population of a particular bucket of the master bucket set, whether the logical partition is in a burst mode of operation; and in response to determining that the logical partition is in a burst mode of operation, determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in (a) the master bucket set and (b) the slave-snapshot bucket set. 3. The method as recited in claim 1, wherein the one or more slave replicas comprise the particular slave replica and a second slave replica, further comprising:
storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the shared storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a second shared storage device at which at least a portion of data of the second slave replica is stored, wherein the second shared storage device is configurable to store data corresponding to one or more logical partitions of one or more data objects;
and wherein implementing said slave bucket update protocol comprises the master replica obtaining respective point-in-time snapshots of the (a) the token population of the first shared-device bucket and (b) the token population of the second shared-device bucket. 4. The method as recited in claim 3, wherein the slave-snapshot bucket set comprises a common proxy bucket, wherein implementing said slave bucket update protocol comprises:
determining, based at least in part on the respective point-in-time snapshots, an estimate of the minimum of the token populations among the token populations of the first and second shared-device buckets; and updating the token population of the common proxy bucket based at least in part on the estimate; and wherein, in accordance with a token consumption policy associated with the common proxy bucket, the method further comprises: accepting the write request for execution based on a determination that the common proxy bucket comprises at least one token and that at least one bucket of the master bucket set comprises at least one token. 5. The method as recited in claim 3, wherein the slave-snapshot bucket set comprises a first snapshot bucket corresponding to the particular slave replica and a second snapshot bucket corresponding to the second slave replica, wherein implementing said slave bucket update protocol comprises:
updating the token population of the first snapshot bucket based on a point-in-time indication of the token population of the first shared-device bucket; updating the token population of the second snapshot bucket based on a point-in-time indication of the token population of the second shared-device bucket;
and wherein the method further comprises:
accepting the write request for execution based on a determination that the first snapshot bucket comprises at least one token, the second snapshot bucket comprises at least one token, and at least one bucket of the master bucket set comprises at least one token. 6. The method as recited in claim 1, further comprising:
transmitting, from the master replica to the particular slave replica, a write replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the write replication request, wherein the acknowledgment comprises, in accordance with the slave bucket update protocol, an indication of the available throughput capacity at the shared storage device. 7. A system, comprising:
one or more processors; and a memory coupled to the one or more processors and storing program instructions that when executed by the one or more processors cause the one or more processors to perform:
storing, corresponding to a master replica of a logical partition of one or more logical partitions of a data object, a master bucket set comprising one or more buckets and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set comprises a respective collection of tokens usable to limit throughput of write operations directed at the logical partition;
updating a token population of a particular bucket of the slave-snapshot bucket set based at least in part on an indication of an available throughput capacity at a shared storage device at which at least a portion of data of a particular slave replica of the logical partition is stored;
in response to receiving a write request directed to the logical partition,
determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in at least one bucket set of (a) the master bucket set and (b) the slave-snapshot bucket set in accordance with respective token consumption policies of the buckets of the master bucket set and the slave-snapshot bucket set; and
in response to determining that the write request is to be accepted for execution, initiating one or more data modification operations corresponding to the write request. 8. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
storing a plurality of slave replicas of the logical partition, including the particular slave replica and a second slave replica; storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the shared storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a second shared storage device at which at least a portion of data of the second slave replica is stored;
and wherein said updating the token population of the particular bucket is based at least in part on the master replica obtaining (a) a snapshot of the token population of the first shared-device bucket and (b) a snapshot of the token population of the second shared-device bucket. 9. The system as recited in claim 8, wherein the particular bucket comprises a common proxy bucket corresponding to the combination of at least the particular slave replica and the second slave replica, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
determining, based at least in part on obtaining a respective snapshot of the first and second shared-device buckets, an estimate of the minimum token population among the token populations of the first and second shared-device buckets; updating a token population of the common proxy bucket based on the estimate; and accepting the write request for execution based at least in part on an indication that the common proxy bucket comprises at least one token. 10. The system as recited in claim 8, wherein the slave-snapshot bucket set comprises a first snapshot bucket corresponding to the particular slave replica and a second snapshot bucket corresponding to the second slave replica, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
updating the token population of the first snapshot bucket based on an indication of the token population of the first shared-device bucket; updating the token population of the second snapshot bucket based on an indication of the token population of the second shared-device bucket; accepting the write request for execution based at least in part on a determination that the first snapshot bucket comprises at least one token and the second snapshot bucket comprises at least one token. 11. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
transmitting, from the master replica to the particular slave replica, a replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the replication request, wherein the acknowledgment comprises an indication of the available throughput capacity at the shared storage device. 12. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
receiving, at the master replica from the particular slave replica, a heartbeat message indicative of a health state of the particular slave replica, wherein the heartbeat message comprises an indication of the available throughput capacity at the shared storage device. 13. The system as recited in claim 7, wherein the master bucket set comprises a provisioned capacity bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
configuring one or more parameters of the provisioned capacity bucket, including its initial token population and refill rate, based at least in part on an indication of a targeted throughput provided by a client authorized to access the data object; and determining that the write request is to be accepted for execution based at least in part on a determination that the provisioned capacity bucket comprises at least one token. 14. The system as recited in claim 13, wherein the master bucket set comprises a burst-handling bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
adding tokens to the burst-handling bucket, wherein the number of tokens added is based at least in part on a determination that a measured rate of operations directed to the logical partition is less than the targeted throughput during a particular time period; and in response to (a) receiving a different write request and (b) determining that the provisioned capacity bucket does not contain tokens when the different write request is received, accepting the different write request for execution based at least in part on a determination that the burst-handling bucket comprises at least one token. 15. The system as recited in claim 7, wherein the master bucket set comprises a master shared-device bucket whose token population is based at least in part on available throughput capacity of a different shared storage device used to store at least a portion of the master replica's data, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
accepting the write request for execution based at least in part on a determination that the master shared-device bucket comprises at least one token. 16. The system as recited in claim 7, wherein the master bucket set comprises a node capability bucket whose token population is based at least in part on a metric of a performance capability of a storage node at which at least a portion of the master replica's data is stored, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
accepting the write request for execution based at least in part on a determination that the node capability bucket comprises at least one token. 17. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
modifying, in accordance with a configuration request received via a programmatic interface, a property of an admission control policy; in response to receiving a different write request directed to the logical partition, determining whether the different write request is to be accepted for execution based at least in part on the property. 18. A non-transitory computer-accessible storage medium storing program instructions that when executed on one or more processors cause the one or more processors to perform:
storing, corresponding to a logical partition of a data object, a master replica and one or more slave replicas including a particular slave replica, wherein the master replica comprises data stored on a first storage device and the particular slave replica comprises data stored on a second storage device; receiving a write request directed to at least a portion of the logical partition; determining whether to accept the write request for execution based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the particular slave replica; in response to accepting the write request for execution, initiating one or more data modification operations corresponding to the write request. 19. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed on the one or more processors cause the processors to perform:
storing, corresponding to the master replica, a master bucket set comprising one or more buckets and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set comprises a respective collection of tokens; updating a token population of at least a particular bucket of the master bucket set to represent available throughput capacity at the master replica; updating a token population of at least a particular bucket of the slave-snapshot bucket set to represent available throughput capacity at the particular slave replica;
and wherein said determining whether to accept the write request for execution comprises:
in response to determining that the logical partition is in a burst mode of operation, examining the token population of the particular bucket of the master bucket set and the token population of the particular bucket of the slave-snapshot bucket set. 20. The non-transitory computer-accessible storage medium as recited in claim 19, wherein the program instructions when executed on the one or more processors cause the one or more processors to perform:
in accordance with said accepting the write request for execution, consuming at least one token from the particular bucket of the master bucket set and at least one token from the particular bucket of the slave-snapshot bucket set. 21. The non-transitory computer-accessible storage medium as recited in claim 20, wherein the at least one token from the particular bucket of the master bucket set and the at least one token from the particular bucket of the slave-snapshot bucket set are consumed within an atomic operation. 22. The non-transitory computer-accessible storage medium as recited in claim 19, wherein the program instructions when executed on the one or more processors cause the processors to perform:
storing a plurality of slave replicas of the logical partition, including the particular slave replica and a second slave replica; storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the second storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a third storage device at which at least a portion of data of the second slave replica is stored;
and wherein said updating the token population of the particular bucket of the slave-snapshot bucket set is based at least in part on obtaining a respective snapshot of (a) the token population of the first shared-device bucket and (b) the token population of the second shared-device bucket. 23. The non-transitory computer-accessible storage medium as recited in claim 22, wherein the particular bucket of the slave-snapshot bucket set comprises a common proxy bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
determining an estimate of the minimum token population among the token populations of the first and second shared-device buckets; updating the population of the common proxy bucket based on the estimate; and accepting the write request for execution based at least in part on determining that the common proxy bucket comprises at least one token. 24. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
transmitting, from the master replica to the particular slave replica, a replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the replication request, wherein the acknowledgment comprises the indication of the available throughput capacity at the particular slave replica. 25. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
receiving, at the master replica from the particular slave replica, a heartbeat message indicative of a health state of the particular slave replica, wherein the heartbeat message comprises the indication of the available throughput capacity at the shared storage device. 26. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the data object comprises contents of a database table. | Methods and apparatus for token-based admission control for replicated writes are disclosed. Data objects are divided into partitions, and corresponding to each partition, at least a master replica and a slave replica are stored. A determination as to whether to accept a write request directed to the partition is made based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the slave replica. If the write request is accepted, one or more data modification operations are initiated.1. A method, comprising:
storing, corresponding to a logical partition of a data object comprising one or more logical partitions, a master replica of the logical partition and one or more slave replicas of the logical partition, wherein writes to the logical partition are replicated at the master replica and at least one slave replica in accordance with a replication policy; storing, corresponding to the master replica, a master bucket set comprising one or more buckets, and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set (a) comprises a respective refillable collection of tokens usable to limit throughput of operations directed at the logical partition and (b) has a token consumption policy indicating a number of tokens to be consumed for an allowed operation; updating a token population of a particular bucket of the slave-snapshot bucket set based at least in part on a slave bucket update protocol, wherein, in accordance with the slave bucket update protocol, the master replica is configured to obtain an indication of an available throughput capacity at a shared storage device at which at least a portion of data of a particular slave replica of the one or more slave replicas is stored, wherein the shared storage device is configurable to store data corresponding to one or more logical partitions of one or more data objects; in response to receiving a write request directed to the logical partition,
determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in at least one bucket set of the master bucket set and the slave-snapshot bucket set, in accordance with respective token consumption policies of the buckets of the master bucket set and the slave-snapshot bucket set; and
in response to determining that the write request is to be accepted for execution, initiating one or more data modification operations corresponding to the write request. 2. The method as recited in claim 1, further comprising:
determining, based at least in part on a token population of a particular bucket of the master bucket set, whether the logical partition is in a burst mode of operation; and in response to determining that the logical partition is in a burst mode of operation, determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in (a) the master bucket set and (b) the slave-snapshot bucket set. 3. The method as recited in claim 1, wherein the one or more slave replicas comprise the particular slave replica and a second slave replica, further comprising:
storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the shared storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a second shared storage device at which at least a portion of data of the second slave replica is stored, wherein the second shared storage device is configurable to store data corresponding to one or more logical partitions of one or more data objects;
and wherein implementing said slave bucket update protocol comprises the master replica obtaining respective point-in-time snapshots of the (a) the token population of the first shared-device bucket and (b) the token population of the second shared-device bucket. 4. The method as recited in claim 3, wherein the slave-snapshot bucket set comprises a common proxy bucket, wherein implementing said slave bucket update protocol comprises:
determining, based at least in part on the respective point-in-time snapshots, an estimate of the minimum of the token populations among the token populations of the first and second shared-device buckets; and updating the token population of the common proxy bucket based at least in part on the estimate; and wherein, in accordance with a token consumption policy associated with the common proxy bucket, the method further comprises: accepting the write request for execution based on a determination that the common proxy bucket comprises at least one token and that at least one bucket of the master bucket set comprises at least one token. 5. The method as recited in claim 3, wherein the slave-snapshot bucket set comprises a first snapshot bucket corresponding to the particular slave replica and a second snapshot bucket corresponding to the second slave replica, wherein implementing said slave bucket update protocol comprises:
updating the token population of the first snapshot bucket based on a point-in-time indication of the token population of the first shared-device bucket; updating the token population of the second snapshot bucket based on a point-in-time indication of the token population of the second shared-device bucket;
and wherein the method further comprises:
accepting the write request for execution based on a determination that the first snapshot bucket comprises at least one token, the second snapshot bucket comprises at least one token, and at least one bucket of the master bucket set comprises at least one token. 6. The method as recited in claim 1, further comprising:
transmitting, from the master replica to the particular slave replica, a write replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the write replication request, wherein the acknowledgment comprises, in accordance with the slave bucket update protocol, an indication of the available throughput capacity at the shared storage device. 7. A system, comprising:
one or more processors; and a memory coupled to the one or more processors and storing program instructions that when executed by the one or more processors cause the one or more processors to perform:
storing, corresponding to a master replica of a logical partition of one or more logical partitions of a data object, a master bucket set comprising one or more buckets and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set comprises a respective collection of tokens usable to limit throughput of write operations directed at the logical partition;
updating a token population of a particular bucket of the slave-snapshot bucket set based at least in part on an indication of an available throughput capacity at a shared storage device at which at least a portion of data of a particular slave replica of the logical partition is stored;
in response to receiving a write request directed to the logical partition,
determining whether the write request is to be accepted for execution based at least in part on whether a sufficient number of tokens is available in at least one bucket set of (a) the master bucket set and (b) the slave-snapshot bucket set in accordance with respective token consumption policies of the buckets of the master bucket set and the slave-snapshot bucket set; and
in response to determining that the write request is to be accepted for execution, initiating one or more data modification operations corresponding to the write request. 8. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
storing a plurality of slave replicas of the logical partition, including the particular slave replica and a second slave replica; storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the shared storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a second shared storage device at which at least a portion of data of the second slave replica is stored;
and wherein said updating the token population of the particular bucket is based at least in part on the master replica obtaining (a) a snapshot of the token population of the first shared-device bucket and (b) a snapshot of the token population of the second shared-device bucket. 9. The system as recited in claim 8, wherein the particular bucket comprises a common proxy bucket corresponding to the combination of at least the particular slave replica and the second slave replica, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
determining, based at least in part on obtaining a respective snapshot of the first and second shared-device buckets, an estimate of the minimum token population among the token populations of the first and second shared-device buckets; updating a token population of the common proxy bucket based on the estimate; and accepting the write request for execution based at least in part on an indication that the common proxy bucket comprises at least one token. 10. The system as recited in claim 8, wherein the slave-snapshot bucket set comprises a first snapshot bucket corresponding to the particular slave replica and a second snapshot bucket corresponding to the second slave replica, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
updating the token population of the first snapshot bucket based on an indication of the token population of the first shared-device bucket; updating the token population of the second snapshot bucket based on an indication of the token population of the second shared-device bucket; accepting the write request for execution based at least in part on a determination that the first snapshot bucket comprises at least one token and the second snapshot bucket comprises at least one token. 11. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
transmitting, from the master replica to the particular slave replica, a replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the replication request, wherein the acknowledgment comprises an indication of the available throughput capacity at the shared storage device. 12. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
receiving, at the master replica from the particular slave replica, a heartbeat message indicative of a health state of the particular slave replica, wherein the heartbeat message comprises an indication of the available throughput capacity at the shared storage device. 13. The system as recited in claim 7, wherein the master bucket set comprises a provisioned capacity bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
configuring one or more parameters of the provisioned capacity bucket, including its initial token population and refill rate, based at least in part on an indication of a targeted throughput provided by a client authorized to access the data object; and determining that the write request is to be accepted for execution based at least in part on a determination that the provisioned capacity bucket comprises at least one token. 14. The system as recited in claim 13, wherein the master bucket set comprises a burst-handling bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
adding tokens to the burst-handling bucket, wherein the number of tokens added is based at least in part on a determination that a measured rate of operations directed to the logical partition is less than the targeted throughput during a particular time period; and in response to (a) receiving a different write request and (b) determining that the provisioned capacity bucket does not contain tokens when the different write request is received, accepting the different write request for execution based at least in part on a determination that the burst-handling bucket comprises at least one token. 15. The system as recited in claim 7, wherein the master bucket set comprises a master shared-device bucket whose token population is based at least in part on available throughput capacity of a different shared storage device used to store at least a portion of the master replica's data, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
accepting the write request for execution based at least in part on a determination that the master shared-device bucket comprises at least one token. 16. The system as recited in claim 7, wherein the master bucket set comprises a node capability bucket whose token population is based at least in part on a metric of a performance capability of a storage node at which at least a portion of the master replica's data is stored, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
accepting the write request for execution based at least in part on a determination that the node capability bucket comprises at least one token. 17. The system as recited in claim 7, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
modifying, in accordance with a configuration request received via a programmatic interface, a property of an admission control policy; in response to receiving a different write request directed to the logical partition, determining whether the different write request is to be accepted for execution based at least in part on the property. 18. A non-transitory computer-accessible storage medium storing program instructions that when executed on one or more processors cause the one or more processors to perform:
storing, corresponding to a logical partition of a data object, a master replica and one or more slave replicas including a particular slave replica, wherein the master replica comprises data stored on a first storage device and the particular slave replica comprises data stored on a second storage device; receiving a write request directed to at least a portion of the logical partition; determining whether to accept the write request for execution based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the particular slave replica; in response to accepting the write request for execution, initiating one or more data modification operations corresponding to the write request. 19. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed on the one or more processors cause the processors to perform:
storing, corresponding to the master replica, a master bucket set comprising one or more buckets and a slave-snapshot bucket set comprising one or more buckets, wherein each bucket of the master bucket set and the slave-snapshot bucket set comprises a respective collection of tokens; updating a token population of at least a particular bucket of the master bucket set to represent available throughput capacity at the master replica; updating a token population of at least a particular bucket of the slave-snapshot bucket set to represent available throughput capacity at the particular slave replica;
and wherein said determining whether to accept the write request for execution comprises:
in response to determining that the logical partition is in a burst mode of operation, examining the token population of the particular bucket of the master bucket set and the token population of the particular bucket of the slave-snapshot bucket set. 20. The non-transitory computer-accessible storage medium as recited in claim 19, wherein the program instructions when executed on the one or more processors cause the one or more processors to perform:
in accordance with said accepting the write request for execution, consuming at least one token from the particular bucket of the master bucket set and at least one token from the particular bucket of the slave-snapshot bucket set. 21. The non-transitory computer-accessible storage medium as recited in claim 20, wherein the at least one token from the particular bucket of the master bucket set and the at least one token from the particular bucket of the slave-snapshot bucket set are consumed within an atomic operation. 22. The non-transitory computer-accessible storage medium as recited in claim 19, wherein the program instructions when executed on the one or more processors cause the processors to perform:
storing a plurality of slave replicas of the logical partition, including the particular slave replica and a second slave replica; storing, corresponding to the particular slave replica, a first shared-device bucket whose token population is indicative of available throughput capacity at the second storage device; storing, corresponding to the second slave replica, a second shared-device bucket whose token population is indicative of available throughput capacity at a third storage device at which at least a portion of data of the second slave replica is stored;
and wherein said updating the token population of the particular bucket of the slave-snapshot bucket set is based at least in part on obtaining a respective snapshot of (a) the token population of the first shared-device bucket and (b) the token population of the second shared-device bucket. 23. The non-transitory computer-accessible storage medium as recited in claim 22, wherein the particular bucket of the slave-snapshot bucket set comprises a common proxy bucket, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
determining an estimate of the minimum token population among the token populations of the first and second shared-device buckets; updating the population of the common proxy bucket based on the estimate; and accepting the write request for execution based at least in part on determining that the common proxy bucket comprises at least one token. 24. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
transmitting, from the master replica to the particular slave replica, a replication request corresponding to the write request; and receiving, at the master replica, an acknowledgment of the replication request, wherein the acknowledgment comprises the indication of the available throughput capacity at the particular slave replica. 25. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the program instructions when executed by the one or more processors cause the one or more processors to perform:
receiving, at the master replica from the particular slave replica, a heartbeat message indicative of a health state of the particular slave replica, wherein the heartbeat message comprises the indication of the available throughput capacity at the shared storage device. 26. The non-transitory computer-accessible storage medium as recited in claim 18, wherein the data object comprises contents of a database table. | 2,100 |
5,615 | 5,615 | 14,982,001 | 2,127 | A computer-implemented method for solving a MAX SAT instance in provided in which a MAX SAT instance is transformed into a MAX 3SAT instance. The MAX 3SAT instance is transformed into a MAX 2SAT instance which is solved for an optimum solution. A solution to the MAX SAT instance is recovered from the MAX 2SAT optimum solution. | 1. A computer-implemented method for solving a general MAX SAT instance comprising:
storing, in a computer memory, a general MAX SAT instance comprising a set of clauses containing Boolean variables connected by disjunctions; transforming the general MAX SAT instance into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; solving the MAX 2SAT instance by obtaining an optimum solution to the MAX 2SAT instance; and recovering an optimum solution to the MAX SAT instance from the optimum solution to the MAX 2SAT instance, wherein one or more of the transforming of the general MAX SAT instance, the transforming of the MAX 3SAT instance, the solving, and the recovering are performed by at least one hardware processor, and the method reduces the computer processing time for finding an optimum MAX SAT solution when compared to obtaining an optimum solution to the MAX SAT instance directly. 2. The method of claim 1, wherein the general MAX SAT instance has n variables and the MAX 2SAT instance has n′ variables, wherein n′>n. 3. The method according to claim 1, wherein the clauses of the general MAX SAT instance are assigned weight values. 4. The method of claim 3, wherein the assigned weight value for each clause of the MAX SAT instance is retained by the clauses generated in transforming same to the MAX 3SAT instance. 5. The method of claim 4, wherein the weight values of the clauses generated in transforming to the MAX 3SAT instance are retained by the clauses generated in transforming same to the MAX 2SAT instance. 6. The method of claim 1, further comprising, in transforming from MAX SAT to MAX 3SAT, including slack variables in the MAX 3SAT clauses. 7. The method of claim 1, further comprising, in transforming from MAX 3SAT to MAX 2SAT, including slack variables in the MAX 2SAT clauses. 8. The method of claim 1, wherein solving the MAX 2SAT instance comprises performing an algorithm based on the half integrality property and the persistency property. 9. The method of claim 1, wherein the recovering of the optimum solution to the MAX SAT instance comprises removing slack variables added to clauses during the transformation from MAX SAT to MAX 2 SAT. 10. A system for solving a MAX SAT instance comprising:
one or more processors including memory for storing a MAX SAT instance; a MAX SAT transformer, for transforming the MAX SAT instance comprised of a set of clauses containing Boolean variables connected by disjunctions into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; a MAX 3SAT transformer, for transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; a MAX 2SAT instance solver, for providing an optimum solution to the MAX 2SAT instance; and a MAX SAT instance solution recoverer, for recovering a solution to the MAX SAT instance from the optimum solution to the MAX 2SAT instance. 11. The system of claim 10, wherein the MAX SAT transformer is configured to transform MAX SAT clauses of k variables into sets of k−2 clauses of at most length 3 variables. 12. The system of claim 10, wherein the MAX SAT transformer is configured to transform clauses of k variables into sets of k−2 clauses of at most length 3 variables that include slack variables. 13. The system of claim 10, wherein the MAX 3SAT transformer is configured to transform clauses of 3 variables into sets of 5 clauses of at most length 2 variables. 14. The system of claim 10, wherein the MAX 3SAT transformer is configured to transform clauses of 3 variables into sets of 5 clauses of at most length 2 variables that include slack variables. 15. The system of claim 10, wherein the MAX 2SAT solver s configured to solve the MAX 2SAT instance by performing an algorithm based on the half integrality property and the persistency property. 16. The system of claim 10, wherein the MAX SAT instance solution recoverer is configured to recover the optimum solution to the MAX SAT instance by removing slack variables added to clauses during the transformation from MAX SAT to MAX 2SAT. 17. A computer program product for solving a general MAX SAT instance, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions being executable by a computer to cause the computer to perform a method comprising:
storing a general MAX SAT instance comprising a set of clauses containing Boolean variables connected by disjunctions; transforming the general MAX SAT instance into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; solving the MAX 2SAT instance by obtaining an optimum solution to the MAX 2SAT instance; and recovering an optimum solution of the MAX SAT instance from the optimum solution to the MAX 2SAT instance, wherein the method reduces the computer processing time for finding an optimum MAX SAT solution when compared to obtaining an optimum solution to the MAX SAT instance directly. 18. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
transforming clauses in MAX SAT of k variables into sets of k−2 clauses of length at most 3 variables that include slack variables. 19. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
transforming clauses in MAX 3SAT of 3 variables into a set of 5 clauses of at most length 2 variables that include slack variables. 20. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
solving the MAX 2SAT instance by performing an algorithm based on the half integrality property and the persistency property. | A computer-implemented method for solving a MAX SAT instance in provided in which a MAX SAT instance is transformed into a MAX 3SAT instance. The MAX 3SAT instance is transformed into a MAX 2SAT instance which is solved for an optimum solution. A solution to the MAX SAT instance is recovered from the MAX 2SAT optimum solution.1. A computer-implemented method for solving a general MAX SAT instance comprising:
storing, in a computer memory, a general MAX SAT instance comprising a set of clauses containing Boolean variables connected by disjunctions; transforming the general MAX SAT instance into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; solving the MAX 2SAT instance by obtaining an optimum solution to the MAX 2SAT instance; and recovering an optimum solution to the MAX SAT instance from the optimum solution to the MAX 2SAT instance, wherein one or more of the transforming of the general MAX SAT instance, the transforming of the MAX 3SAT instance, the solving, and the recovering are performed by at least one hardware processor, and the method reduces the computer processing time for finding an optimum MAX SAT solution when compared to obtaining an optimum solution to the MAX SAT instance directly. 2. The method of claim 1, wherein the general MAX SAT instance has n variables and the MAX 2SAT instance has n′ variables, wherein n′>n. 3. The method according to claim 1, wherein the clauses of the general MAX SAT instance are assigned weight values. 4. The method of claim 3, wherein the assigned weight value for each clause of the MAX SAT instance is retained by the clauses generated in transforming same to the MAX 3SAT instance. 5. The method of claim 4, wherein the weight values of the clauses generated in transforming to the MAX 3SAT instance are retained by the clauses generated in transforming same to the MAX 2SAT instance. 6. The method of claim 1, further comprising, in transforming from MAX SAT to MAX 3SAT, including slack variables in the MAX 3SAT clauses. 7. The method of claim 1, further comprising, in transforming from MAX 3SAT to MAX 2SAT, including slack variables in the MAX 2SAT clauses. 8. The method of claim 1, wherein solving the MAX 2SAT instance comprises performing an algorithm based on the half integrality property and the persistency property. 9. The method of claim 1, wherein the recovering of the optimum solution to the MAX SAT instance comprises removing slack variables added to clauses during the transformation from MAX SAT to MAX 2 SAT. 10. A system for solving a MAX SAT instance comprising:
one or more processors including memory for storing a MAX SAT instance; a MAX SAT transformer, for transforming the MAX SAT instance comprised of a set of clauses containing Boolean variables connected by disjunctions into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; a MAX 3SAT transformer, for transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; a MAX 2SAT instance solver, for providing an optimum solution to the MAX 2SAT instance; and a MAX SAT instance solution recoverer, for recovering a solution to the MAX SAT instance from the optimum solution to the MAX 2SAT instance. 11. The system of claim 10, wherein the MAX SAT transformer is configured to transform MAX SAT clauses of k variables into sets of k−2 clauses of at most length 3 variables. 12. The system of claim 10, wherein the MAX SAT transformer is configured to transform clauses of k variables into sets of k−2 clauses of at most length 3 variables that include slack variables. 13. The system of claim 10, wherein the MAX 3SAT transformer is configured to transform clauses of 3 variables into sets of 5 clauses of at most length 2 variables. 14. The system of claim 10, wherein the MAX 3SAT transformer is configured to transform clauses of 3 variables into sets of 5 clauses of at most length 2 variables that include slack variables. 15. The system of claim 10, wherein the MAX 2SAT solver s configured to solve the MAX 2SAT instance by performing an algorithm based on the half integrality property and the persistency property. 16. The system of claim 10, wherein the MAX SAT instance solution recoverer is configured to recover the optimum solution to the MAX SAT instance by removing slack variables added to clauses during the transformation from MAX SAT to MAX 2SAT. 17. A computer program product for solving a general MAX SAT instance, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions being executable by a computer to cause the computer to perform a method comprising:
storing a general MAX SAT instance comprising a set of clauses containing Boolean variables connected by disjunctions; transforming the general MAX SAT instance into a MAX 3SAT instance by converting the clauses in MAX SAT into sets of clauses of at most 3 variables; transforming the MAX 3SAT instance into a MAX 2SAT instance by converting the clauses in MAX 3SAT into sets of clauses of at most 2 variables; solving the MAX 2SAT instance by obtaining an optimum solution to the MAX 2SAT instance; and recovering an optimum solution of the MAX SAT instance from the optimum solution to the MAX 2SAT instance, wherein the method reduces the computer processing time for finding an optimum MAX SAT solution when compared to obtaining an optimum solution to the MAX SAT instance directly. 18. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
transforming clauses in MAX SAT of k variables into sets of k−2 clauses of length at most 3 variables that include slack variables. 19. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
transforming clauses in MAX 3SAT of 3 variables into a set of 5 clauses of at most length 2 variables that include slack variables. 20. The computer program product of claim 17, wherein the program instructions executable by a computer cause the computer to perform the method that further comprises:
solving the MAX 2SAT instance by performing an algorithm based on the half integrality property and the persistency property. | 2,100 |
5,616 | 5,616 | 14,538,393 | 2,163 | Techniques for organizing knowledge about a dataset storing data from or about multiple sources may be provided. For example, the data can be accessed from the multiple sources and categorized based on the data type. For each data type, a triple extraction technique specific to that data type may be invoked. One set of techniques can allow the extraction of triples from the data based on natural language-based rules. Another set of techniques can allow a similar extraction based on logical or structural-based rules. A triple may store a relationship between elements of the data. The extracted triples can be stored with corresponding identifiers in a list. Further, dictionaries storing associations between elements of the data and the triples can be updated. The list and the dictionaries can be used to return triples in response to a query that specifies one or more elements. | 1. A computer-implemented method for creating a dataset to facilitate natural language searching of data from a plurality of different source files, the computer-implemented method comprising:
identifying, by a processor, different triple extraction techniques corresponding to source files of different types; extracting, by the processor, triples from each of the source files using a triple extraction technique corresponding to a type of the respective source file, each of the triples extracted by identifying, from the respective source file, a first natural language phrase as a subject, a second natural language phrase as an object, and an association between the first natural language phrase and the second natural language phrase as a predicate; and storing, by the processor, the triples in the dataset. 2. The computer-implemented method of claim 1 further comprising:
using a first technique to identify associations between natural language phrases for source files storing data in a structured format; and
using a second technique, different from the first technique, to identify associations between natural language phrases for source files storing data in an unstructured format. 3. The computer-implemented method of claim 1, wherein extracting the triple from the respective source file comprises:
detecting that the source file stores data in one or more of: a structured data format, a semi-structured data format, or an unstructured data format; if the data is stored in the structured data format or the semi-structured data format, identifying a structure storing natural language phrases and determining a first association to be stored as the predicate of the triple based on the structure; and if the data is stored in the unstructured data format, identifying one or more words from the natural language phrases and determining a second association to be stored as the predicate of the triple by applying a set of rules specifying relationships between the natural language phrases based on word type. 4. The computer-implemented method of claim 1, further comprising:
parsing a user query to identify a natural language phrase of the query; identifying a first triple of the dataset by matching the natural language phrase of the query with the identified first triple's subject or object; and returning a query result comprising data from the source files based on the identified first triple. 5. The computer-implemented method of claim 1, further comprising:
parsing a user query to identify a natural language phrase of the query; identifying a first triple of the dataset by matching the natural language phrase of the query with the identified first triple's subject or object; identifying a second triple of the dataset based on the identified first triple's subject or object matching the identified second triple's subject or object; and returning a query result comprising data from the source files based on the identified first triple and the identified second triple. 6. The computer-implemented method of claim 1, wherein a type of a source file indicates that the source file comprises unstructured data, and wherein a triple extraction technique specific to the unstructured data comprises: generating a string, identifying words and word types from the string, generating natural language phrases from the words, applying a set of rules specifying relationships between the natural language phrases based on the word types, and generating triples based on the applied rules. 7. The computer-implemented method of claim 1, wherein a source file comprises a text string, wherein extracting the triples comprises:
identifying words and corresponding word types from the text string; generating natural language phrases based on proximities between the words; and applying one or more rules to the first natural language phrase and the second natural language phrase to generate a triple, the one or more rules associated with one or more patterns and being applied based on matching the one or more patterns to the word types, the one or more rules specifying relationships between two or more natural language phrases. 8. The computer-implemented method of claim 1, further comprising updating an entity dictionary based on the first natural language phrase, wherein the entity dictionary associates subjects and objects with natural language phrases in which each respective subject and object participates, wherein the updating comprises:
identifying a word from the subject of the triple; updating a key from a key-value pair of the entity dictionary with the word; and updating a value of the key-value pair with the first natural language phrase. 9. The computer-implemented method of claim 1, further comprising updating a mention dictionary based on the first natural language phrase, wherein the mention dictionary associates natural language phrases with triples in which each natural language phrase participates, wherein the updating comprises:
updating a key from a key-value pair of the mention dictionary with the first natural language phrase; and updating a value of the key-value pair with an identifier of a corresponding triple. 10. The computer-implemented method of claim 1, wherein a source file comprises text defined in a hierarchical structure, wherein extracting the triples comprises:
extracting words from the text; identifying types of the words, the types comprising a noun, a verb, an adjective, an adverb, and a preposition; generating a first triple based on the words and the types; generating a second triple based on the hierarchical structure, wherein a subject and an object of the second triple correspond to edges of the hierarchical structure, and wherein a predicate of the second triple corresponds to a relationship between the two edges. 11. A system comprising:
a processor; a memory communicatively coupled to the processor and bearing instructions that, upon execution by the processor, cause the system to at least perform operations comprising:
accessing words from a source file, the words to be organized based on associations between the words;
extracting a triple from a subset of the words based on a set of rules, the triple comprising a subject, a predicate, and an object corresponding to the subset of the words, the set of rules applicable to the subset of the words based on a pattern of word types;
generating a structure configured to store an association between an entity and a phrase associated with the subject or the object, the entity comprising one or more words from the subject or the object, the phrase comprising the subject or the object; and
generating another structure configured to store another association between the phrase and the triple. 12. The system of claim 11, wherein accessing words from the source file comprises:
receiving the source file, the source file comprising one or more of: an image, a video, an audio, or a text; and generating the words from content of the source file. 13. The system of claim 11, wherein the source file comprises natural language utterances. 14. The system of claim 11, wherein extracting the triple comprises:
annotating each word with a corresponding word type; identifying phrase expressions formed by proximate words; and applying the set of rules to the words and the phrase expressions based on the pattern of the word types. 15. The system of claim 11, wherein extracting triples from the subset of the words comprises:
detecting the pattern of the word types based on annotations of the subset of the words, the annotations comprising the word types; matching the pattern to one or more rules from the set of rules, the one or more rules specifying an association between two or more words based on the pattern; and applying the one or more rules to the subset of the words to generate the triple based on the specified association. 16. The system of claim 11, wherein accessing the words from the source file comprises identifying a string of the words and a structure associated with the source file, and wherein extracting the triple comprises:
extracting a first triple from the string of the words based on a first subset of the rules applicable to the string of words, and extracting a second triple from the structure based on a second subset of the rules applicable to structure. 17. A computer-readable storage medium storing instructions that, when executed on a computing device, configure the computing device to perform operations comprising:
detecting words and corresponding word types from a source; generating a triple based on applying a set of rules to the words, the set of rules applied based on a pattern of the word types and providing an association between at least two words, the triple comprising the at least two words; generating a first structure configured to store a first association between a word from the triple and a phrase, the phrase formed based on a proximity of the word with another word; and generating a second structure configured to store a second association between the phrase and the triple. 18. The computer-readable storage medium of claim 17, wherein the first structure is further configured to store first associations between words from triples and phrases, wherein the second structure is further configured to store second associations between the phrases and the triples, wherein the triples, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying the triples, wherein querying the triples comprises:
receiving a query comprising a keyword; identifying a subset of the phrases based on matching the keyword to the words from the first structure; identifying a subset of the triples from the second structure based on the second associations between the subset of phrases and the subset of triples; replacing the keyword with one or more of a synonym, a hypernym, or a thesaurus equivalent word; identifying additional subsets of the phrases from the first structure and additional subsets of the triples from the second structure based on the replacing; and scoring the subset of the triples and the additional subsets of the triples based on whether the keyword was used or whether the keyword was replaced to identify the triples. 19. The computer-readable storage medium of claim 17, wherein the first structure is further configured to store first associations between words from triples and phrases, wherein the second structure is further configured to store second associations between the phrases and the triples, wherein the triples, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying the triples, wherein querying the triples comprises:
receiving a query comprising a plurality of keywords; identifying, for each keyword, a subset of the phrases and a subset of the triples based on the first structure and the second structure; determining, for each triple from the identified subsets of the triples, a frequency of identifying the triple based the plurality of keywords; and scoring the identified triples based on corresponding frequencies. 20. The computer-readable storage medium of claim 17, wherein the triple comprises a subject, a predicate, and an object, wherein the triple, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying triples, wherein querying the triples comprises:
receiving a query comprising a keyword; identifying the phrase and the triple from the first structure and the second structure based on matching the keyword; and identifying another triple from the triples based on matching the subject of the triple with another object of the other triple or based on matching the object of the triple with another subject of the other triple. | Techniques for organizing knowledge about a dataset storing data from or about multiple sources may be provided. For example, the data can be accessed from the multiple sources and categorized based on the data type. For each data type, a triple extraction technique specific to that data type may be invoked. One set of techniques can allow the extraction of triples from the data based on natural language-based rules. Another set of techniques can allow a similar extraction based on logical or structural-based rules. A triple may store a relationship between elements of the data. The extracted triples can be stored with corresponding identifiers in a list. Further, dictionaries storing associations between elements of the data and the triples can be updated. The list and the dictionaries can be used to return triples in response to a query that specifies one or more elements.1. A computer-implemented method for creating a dataset to facilitate natural language searching of data from a plurality of different source files, the computer-implemented method comprising:
identifying, by a processor, different triple extraction techniques corresponding to source files of different types; extracting, by the processor, triples from each of the source files using a triple extraction technique corresponding to a type of the respective source file, each of the triples extracted by identifying, from the respective source file, a first natural language phrase as a subject, a second natural language phrase as an object, and an association between the first natural language phrase and the second natural language phrase as a predicate; and storing, by the processor, the triples in the dataset. 2. The computer-implemented method of claim 1 further comprising:
using a first technique to identify associations between natural language phrases for source files storing data in a structured format; and
using a second technique, different from the first technique, to identify associations between natural language phrases for source files storing data in an unstructured format. 3. The computer-implemented method of claim 1, wherein extracting the triple from the respective source file comprises:
detecting that the source file stores data in one or more of: a structured data format, a semi-structured data format, or an unstructured data format; if the data is stored in the structured data format or the semi-structured data format, identifying a structure storing natural language phrases and determining a first association to be stored as the predicate of the triple based on the structure; and if the data is stored in the unstructured data format, identifying one or more words from the natural language phrases and determining a second association to be stored as the predicate of the triple by applying a set of rules specifying relationships between the natural language phrases based on word type. 4. The computer-implemented method of claim 1, further comprising:
parsing a user query to identify a natural language phrase of the query; identifying a first triple of the dataset by matching the natural language phrase of the query with the identified first triple's subject or object; and returning a query result comprising data from the source files based on the identified first triple. 5. The computer-implemented method of claim 1, further comprising:
parsing a user query to identify a natural language phrase of the query; identifying a first triple of the dataset by matching the natural language phrase of the query with the identified first triple's subject or object; identifying a second triple of the dataset based on the identified first triple's subject or object matching the identified second triple's subject or object; and returning a query result comprising data from the source files based on the identified first triple and the identified second triple. 6. The computer-implemented method of claim 1, wherein a type of a source file indicates that the source file comprises unstructured data, and wherein a triple extraction technique specific to the unstructured data comprises: generating a string, identifying words and word types from the string, generating natural language phrases from the words, applying a set of rules specifying relationships between the natural language phrases based on the word types, and generating triples based on the applied rules. 7. The computer-implemented method of claim 1, wherein a source file comprises a text string, wherein extracting the triples comprises:
identifying words and corresponding word types from the text string; generating natural language phrases based on proximities between the words; and applying one or more rules to the first natural language phrase and the second natural language phrase to generate a triple, the one or more rules associated with one or more patterns and being applied based on matching the one or more patterns to the word types, the one or more rules specifying relationships between two or more natural language phrases. 8. The computer-implemented method of claim 1, further comprising updating an entity dictionary based on the first natural language phrase, wherein the entity dictionary associates subjects and objects with natural language phrases in which each respective subject and object participates, wherein the updating comprises:
identifying a word from the subject of the triple; updating a key from a key-value pair of the entity dictionary with the word; and updating a value of the key-value pair with the first natural language phrase. 9. The computer-implemented method of claim 1, further comprising updating a mention dictionary based on the first natural language phrase, wherein the mention dictionary associates natural language phrases with triples in which each natural language phrase participates, wherein the updating comprises:
updating a key from a key-value pair of the mention dictionary with the first natural language phrase; and updating a value of the key-value pair with an identifier of a corresponding triple. 10. The computer-implemented method of claim 1, wherein a source file comprises text defined in a hierarchical structure, wherein extracting the triples comprises:
extracting words from the text; identifying types of the words, the types comprising a noun, a verb, an adjective, an adverb, and a preposition; generating a first triple based on the words and the types; generating a second triple based on the hierarchical structure, wherein a subject and an object of the second triple correspond to edges of the hierarchical structure, and wherein a predicate of the second triple corresponds to a relationship between the two edges. 11. A system comprising:
a processor; a memory communicatively coupled to the processor and bearing instructions that, upon execution by the processor, cause the system to at least perform operations comprising:
accessing words from a source file, the words to be organized based on associations between the words;
extracting a triple from a subset of the words based on a set of rules, the triple comprising a subject, a predicate, and an object corresponding to the subset of the words, the set of rules applicable to the subset of the words based on a pattern of word types;
generating a structure configured to store an association between an entity and a phrase associated with the subject or the object, the entity comprising one or more words from the subject or the object, the phrase comprising the subject or the object; and
generating another structure configured to store another association between the phrase and the triple. 12. The system of claim 11, wherein accessing words from the source file comprises:
receiving the source file, the source file comprising one or more of: an image, a video, an audio, or a text; and generating the words from content of the source file. 13. The system of claim 11, wherein the source file comprises natural language utterances. 14. The system of claim 11, wherein extracting the triple comprises:
annotating each word with a corresponding word type; identifying phrase expressions formed by proximate words; and applying the set of rules to the words and the phrase expressions based on the pattern of the word types. 15. The system of claim 11, wherein extracting triples from the subset of the words comprises:
detecting the pattern of the word types based on annotations of the subset of the words, the annotations comprising the word types; matching the pattern to one or more rules from the set of rules, the one or more rules specifying an association between two or more words based on the pattern; and applying the one or more rules to the subset of the words to generate the triple based on the specified association. 16. The system of claim 11, wherein accessing the words from the source file comprises identifying a string of the words and a structure associated with the source file, and wherein extracting the triple comprises:
extracting a first triple from the string of the words based on a first subset of the rules applicable to the string of words, and extracting a second triple from the structure based on a second subset of the rules applicable to structure. 17. A computer-readable storage medium storing instructions that, when executed on a computing device, configure the computing device to perform operations comprising:
detecting words and corresponding word types from a source; generating a triple based on applying a set of rules to the words, the set of rules applied based on a pattern of the word types and providing an association between at least two words, the triple comprising the at least two words; generating a first structure configured to store a first association between a word from the triple and a phrase, the phrase formed based on a proximity of the word with another word; and generating a second structure configured to store a second association between the phrase and the triple. 18. The computer-readable storage medium of claim 17, wherein the first structure is further configured to store first associations between words from triples and phrases, wherein the second structure is further configured to store second associations between the phrases and the triples, wherein the triples, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying the triples, wherein querying the triples comprises:
receiving a query comprising a keyword; identifying a subset of the phrases based on matching the keyword to the words from the first structure; identifying a subset of the triples from the second structure based on the second associations between the subset of phrases and the subset of triples; replacing the keyword with one or more of a synonym, a hypernym, or a thesaurus equivalent word; identifying additional subsets of the phrases from the first structure and additional subsets of the triples from the second structure based on the replacing; and scoring the subset of the triples and the additional subsets of the triples based on whether the keyword was used or whether the keyword was replaced to identify the triples. 19. The computer-readable storage medium of claim 17, wherein the first structure is further configured to store first associations between words from triples and phrases, wherein the second structure is further configured to store second associations between the phrases and the triples, wherein the triples, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying the triples, wherein querying the triples comprises:
receiving a query comprising a plurality of keywords; identifying, for each keyword, a subset of the phrases and a subset of the triples based on the first structure and the second structure; determining, for each triple from the identified subsets of the triples, a frequency of identifying the triple based the plurality of keywords; and scoring the identified triples based on corresponding frequencies. 20. The computer-readable storage medium of claim 17, wherein the triple comprises a subject, a predicate, and an object, wherein the triple, the first structure, and the second structure are stored in a dataset, wherein the dataset is configured to facilitate querying triples, wherein querying the triples comprises:
receiving a query comprising a keyword; identifying the phrase and the triple from the first structure and the second structure based on matching the keyword; and identifying another triple from the triples based on matching the subject of the triple with another object of the other triple or based on matching the object of the triple with another subject of the other triple. | 2,100 |
5,617 | 5,617 | 14,407,623 | 2,127 | A simplified calculation model for use in predicting life consumption of a component subjected to loads during operation may be generated. Accordingly, a first set of load input data resulting from a first set of load sessions during operation is received. At least one of stresses, strains and temperatures for a critical area of said component is calculated by a numerical calculation model. Life consumption of said component is predicted based on said at least one of the numerically calculated stresses, strains and temperatures. Said simplified calculation model is generated defining a relationship between load input data and predicted life consumption by: assigning a plurality of linear difference equations for said simplified calculation model, and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption. | 1-27. (canceled) 28. A method, comprising:
receiving a first set of load input data resulting from a first set of load sessions during operation of a machine that includes a component; calculating at least one of stresses, strains and temperatures for a critical area of said component using a numerical calculation model; predicting life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures; and generating said simplified calculation model defining a relationship between load input data and predicted life consumption by:
assigning a plurality of linear difference equations for said simplified calculation model; and
calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption. 29. The method according to claim 28, further comprising:
receiving a second set of load input data resulting from a second set of load sessions during the operation of the machine; calculating at least one of stresses, strains and temperatures for said critical area of said component using said numerical calculation model; predicting life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures; calculating at least one of stresses, strains and temperatures for said critical area of said component using said simplified calculation model; predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model; and verifying that said simplified calculation model is correct if a difference between said numerically calculated predicted life consumption and said predicted life consumption predicted using said simplified calculation model is within a predetermined life consumption limit. 30. The method according to claim 29, wherein the step of predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model is preceded by the steps of:
comparing said numerically calculated stresses and/or strains with said stresses and/or strains calculated using said simplified calculation model; and predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model if a difference in stresses and/or strains is within a predetermined stress and/or strain limit. 31. The method according to claim 29, wherein the step of predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model is preceded by the steps of:
comparing said numerically calculated temperatures with said temperatures calculated using said simplified calculation model; and predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model if a difference in temperatures is within a predetermined temperature limit. 32. The method according to claim 29, wherein said simplified calculation model is generated using iteratively calculating said parameters of said linear difference equations until said verification that said simplified calculation model is within said predetermined life consumption limit. 33. The method according to claim 28, wherein said linear difference equations comprise the equation:
y i(t)+αi — 1xy i(t−1)+ . . . +αi — nαxy i(t−na)=b i — 1xu i(t−nk)+ . . . +b i — nbxu i(t−nk−nb+1)
wherein ui(t) are time-dependent inputs resulting from said load sessions during the operation of the machine, yi(t) are time-dependent stresses, strains or temperatures, na and nb are the number of ai- and bi-parameters, respectively, and nk are the number of sample times before the current time t. 34. The method according to claim 33, wherein said linear difference equations further comprise equations relating the stresses, strains and temperatures with the predicted life consumption. 35. The method according to claim 28, wherein said simplified calculation model comprises a temperature calculating module and a stress/strain calculating module. 36. The method according to claim 28, wherein said calculated stresses, strains and temperatures are time-dependent components. 37. The method according to claim 28, wherein said load sessions are constituted by recorded loads from a flight mission of an aircraft. 38. The method according to claim 28, wherein said numerical calculation model is a mesh-based numerical model using finite element calculations. 39. The method according to claim 28, wherein said load input data comprises at least one of thermal- and mechanical loads. 40. A method, comprising:
receiving a first set of load input data resulting from a first load session during operation of a machine that includes a component; calculating at least one of stresses, strains and temperature for a critical area of said component based on said first set of load input data using a simplified calculation model comprising linear difference equations; and predicting life consumption of said component for said first load session based on said at least one of the calculated stresses, strains and temperatures. 41. The method according to claim 40, wherein said simplified calculation model is generated by:
assigning a plurality of linear difference equations for said simplified calculation model; and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption; 42. The method according to claim 40, further comprising:
receiving a second set of load input data resulting from a second load session during operation; calculating at least one of stresses, strains and temperatures for said critical area of said component using said simplified calculation model; predicting life consumption of said component for said second load session based on said calculated stresses, strains and temperatures; and adding said predicted life consumption resulting from said second load session with said predicted life consumption resulting from said first load session for accumulation of life consumption of said component. 43. The method according to any claim 41, preceded by the steps of:
receiving a third set of load input data resulting from a third load session during operation; calculating at least one of stresses, strains and temperatures for said critical area of said component using said numerical calculation model and said simplified calculation model; predicting life consumption of said component for said third load session based on said at least one of stresses, strains and temperatures calculated using said numerical calculation model and said simplified calculation model; and validating that said simplified calculation model is correct if a difference between said numerically predicted life consumption and said predicted life consumption predicted using said simplified calculation model is within a predetermined life consumption limit. 44. The method according to claim 40, wherein said linear difference equations comprises the equation:
y i(t)+αi — 1xy i(t−1)+ . . . +αi — nαxy i(t−na)=b i — 1xu i(t−nk)+ . . . +b i — nbxu i(t−nk−nb+1)
wherein ui(t) are time-dependent inputs resulting from said load sessions during operation, yi(t) are time-dependent stresses, strains or temperatures, na and nb are the number of ai- and bi-parameters, respectively, and nk are the number of sample times before the current time t. 45. The method according to claim 41 wherein said linear difference equations further comprises equations relating the stresses, strains and temperatures with the predicted life consumption. 46. The method according to claim 40, wherein said simplified calculation model comprises a temperature calculating module and a stress/strain calculating module. 47. The method according to claim 40, wherein said calculated stresses, strains and temperatures are time-dependent components. 48. The method according to claim 40, wherein said load session is constituted by recorded loads from a flight mission of an aircraft. 49. The method according to claim 40, wherein said load input data comprises at least one of thermal- and mechanical loads. 50. A system, comprising:
a load session module comprising load session information exposed to a machine during operation; a load input data module comprising load generating instructions for transformation of load session information to thermal and mechanical loads; a numerical calculation model comprising a temperature calculating module and a stress/strain calculating module; a simplified calculating module comprising a temperature calculating module and a stress/strain calculating module; and a life consumption prediction module comprising instructions for predicting life consumption based on at least one of stresses, strains and temperatures; wherein said system is configured to: receive a first set of load input data resulting from a first set of load sessions during operation; calculate at least one of stresses, strains and temperatures for a critical area of a component using said numerical calculation model; predict life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures using said life consumption prediction module; and generate the simplified calculation model defining a relationship between load input data and predicted life consumption for said component by:
assigning a plurality of linear difference equations for said simplified calculation model; and
calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and at least one of said numerically calculated predicted life consumption. 51. A system, comprising:
a load session module comprising load session information exposed to a machine during operation; a load input data module comprising load generating instructions for transformation of load session information to thermal and mechanical loads; a simplified calculation model comprising a temperature calculating module and a stress/strain calculating module; and a life consumption prediction module comprising instructions for predicting life consumption based on at least one of stresses, strains and temperatures; wherein said system is programmed to:
receive a first set of load input data resulting from a first load session during operation;
calculate at least one of stresses, strains and temperature for a critical area of a component based on said first load input data and using said simplified calculation model comprising linear difference equations; and
predict life consumption of said component for said first load session based on said at least one of the calculated stresses, strains and temperatures. 52. The system according to claim 51, wherein said simplified calculation model is generated by:
assigning a plurality of linear difference equations for said simplified calculation model; and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and at least one of said numerically calculated predicted life consumption. | A simplified calculation model for use in predicting life consumption of a component subjected to loads during operation may be generated. Accordingly, a first set of load input data resulting from a first set of load sessions during operation is received. At least one of stresses, strains and temperatures for a critical area of said component is calculated by a numerical calculation model. Life consumption of said component is predicted based on said at least one of the numerically calculated stresses, strains and temperatures. Said simplified calculation model is generated defining a relationship between load input data and predicted life consumption by: assigning a plurality of linear difference equations for said simplified calculation model, and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption.1-27. (canceled) 28. A method, comprising:
receiving a first set of load input data resulting from a first set of load sessions during operation of a machine that includes a component; calculating at least one of stresses, strains and temperatures for a critical area of said component using a numerical calculation model; predicting life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures; and generating said simplified calculation model defining a relationship between load input data and predicted life consumption by:
assigning a plurality of linear difference equations for said simplified calculation model; and
calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption. 29. The method according to claim 28, further comprising:
receiving a second set of load input data resulting from a second set of load sessions during the operation of the machine; calculating at least one of stresses, strains and temperatures for said critical area of said component using said numerical calculation model; predicting life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures; calculating at least one of stresses, strains and temperatures for said critical area of said component using said simplified calculation model; predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model; and verifying that said simplified calculation model is correct if a difference between said numerically calculated predicted life consumption and said predicted life consumption predicted using said simplified calculation model is within a predetermined life consumption limit. 30. The method according to claim 29, wherein the step of predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model is preceded by the steps of:
comparing said numerically calculated stresses and/or strains with said stresses and/or strains calculated using said simplified calculation model; and predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model if a difference in stresses and/or strains is within a predetermined stress and/or strain limit. 31. The method according to claim 29, wherein the step of predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model is preceded by the steps of:
comparing said numerically calculated temperatures with said temperatures calculated using said simplified calculation model; and predicting life consumption of said component based on said at least one of stresses, strains and temperatures calculated using said simplified calculation model if a difference in temperatures is within a predetermined temperature limit. 32. The method according to claim 29, wherein said simplified calculation model is generated using iteratively calculating said parameters of said linear difference equations until said verification that said simplified calculation model is within said predetermined life consumption limit. 33. The method according to claim 28, wherein said linear difference equations comprise the equation:
y i(t)+αi — 1xy i(t−1)+ . . . +αi — nαxy i(t−na)=b i — 1xu i(t−nk)+ . . . +b i — nbxu i(t−nk−nb+1)
wherein ui(t) are time-dependent inputs resulting from said load sessions during the operation of the machine, yi(t) are time-dependent stresses, strains or temperatures, na and nb are the number of ai- and bi-parameters, respectively, and nk are the number of sample times before the current time t. 34. The method according to claim 33, wherein said linear difference equations further comprise equations relating the stresses, strains and temperatures with the predicted life consumption. 35. The method according to claim 28, wherein said simplified calculation model comprises a temperature calculating module and a stress/strain calculating module. 36. The method according to claim 28, wherein said calculated stresses, strains and temperatures are time-dependent components. 37. The method according to claim 28, wherein said load sessions are constituted by recorded loads from a flight mission of an aircraft. 38. The method according to claim 28, wherein said numerical calculation model is a mesh-based numerical model using finite element calculations. 39. The method according to claim 28, wherein said load input data comprises at least one of thermal- and mechanical loads. 40. A method, comprising:
receiving a first set of load input data resulting from a first load session during operation of a machine that includes a component; calculating at least one of stresses, strains and temperature for a critical area of said component based on said first set of load input data using a simplified calculation model comprising linear difference equations; and predicting life consumption of said component for said first load session based on said at least one of the calculated stresses, strains and temperatures. 41. The method according to claim 40, wherein said simplified calculation model is generated by:
assigning a plurality of linear difference equations for said simplified calculation model; and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and said numerically calculated predicted life consumption; 42. The method according to claim 40, further comprising:
receiving a second set of load input data resulting from a second load session during operation; calculating at least one of stresses, strains and temperatures for said critical area of said component using said simplified calculation model; predicting life consumption of said component for said second load session based on said calculated stresses, strains and temperatures; and adding said predicted life consumption resulting from said second load session with said predicted life consumption resulting from said first load session for accumulation of life consumption of said component. 43. The method according to any claim 41, preceded by the steps of:
receiving a third set of load input data resulting from a third load session during operation; calculating at least one of stresses, strains and temperatures for said critical area of said component using said numerical calculation model and said simplified calculation model; predicting life consumption of said component for said third load session based on said at least one of stresses, strains and temperatures calculated using said numerical calculation model and said simplified calculation model; and validating that said simplified calculation model is correct if a difference between said numerically predicted life consumption and said predicted life consumption predicted using said simplified calculation model is within a predetermined life consumption limit. 44. The method according to claim 40, wherein said linear difference equations comprises the equation:
y i(t)+αi — 1xy i(t−1)+ . . . +αi — nαxy i(t−na)=b i — 1xu i(t−nk)+ . . . +b i — nbxu i(t−nk−nb+1)
wherein ui(t) are time-dependent inputs resulting from said load sessions during operation, yi(t) are time-dependent stresses, strains or temperatures, na and nb are the number of ai- and bi-parameters, respectively, and nk are the number of sample times before the current time t. 45. The method according to claim 41 wherein said linear difference equations further comprises equations relating the stresses, strains and temperatures with the predicted life consumption. 46. The method according to claim 40, wherein said simplified calculation model comprises a temperature calculating module and a stress/strain calculating module. 47. The method according to claim 40, wherein said calculated stresses, strains and temperatures are time-dependent components. 48. The method according to claim 40, wherein said load session is constituted by recorded loads from a flight mission of an aircraft. 49. The method according to claim 40, wherein said load input data comprises at least one of thermal- and mechanical loads. 50. A system, comprising:
a load session module comprising load session information exposed to a machine during operation; a load input data module comprising load generating instructions for transformation of load session information to thermal and mechanical loads; a numerical calculation model comprising a temperature calculating module and a stress/strain calculating module; a simplified calculating module comprising a temperature calculating module and a stress/strain calculating module; and a life consumption prediction module comprising instructions for predicting life consumption based on at least one of stresses, strains and temperatures; wherein said system is configured to: receive a first set of load input data resulting from a first set of load sessions during operation; calculate at least one of stresses, strains and temperatures for a critical area of a component using said numerical calculation model; predict life consumption of said component based on said at least one of the numerically calculated stresses, strains and temperatures using said life consumption prediction module; and generate the simplified calculation model defining a relationship between load input data and predicted life consumption for said component by:
assigning a plurality of linear difference equations for said simplified calculation model; and
calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and at least one of said numerically calculated predicted life consumption. 51. A system, comprising:
a load session module comprising load session information exposed to a machine during operation; a load input data module comprising load generating instructions for transformation of load session information to thermal and mechanical loads; a simplified calculation model comprising a temperature calculating module and a stress/strain calculating module; and a life consumption prediction module comprising instructions for predicting life consumption based on at least one of stresses, strains and temperatures; wherein said system is programmed to:
receive a first set of load input data resulting from a first load session during operation;
calculate at least one of stresses, strains and temperature for a critical area of a component based on said first load input data and using said simplified calculation model comprising linear difference equations; and
predict life consumption of said component for said first load session based on said at least one of the calculated stresses, strains and temperatures. 52. The system according to claim 51, wherein said simplified calculation model is generated by:
assigning a plurality of linear difference equations for said simplified calculation model; and calculating parameters of said plurality of linear difference equations based on said relationship between the first set of load input data and at least one of said numerically calculated predicted life consumption. | 2,100 |
5,618 | 5,618 | 15,222,024 | 2,154 | Example techniques and systems may obtain one or more search types associated with a geographic location of a computing device. In one example, a technique may include determining, by a mobile computing device, a geographic location of the mobile computing device and obtaining one or more search types associated with the geographic location. Responsive to obtaining the one or more search types, the technique may also include outputting, by the mobile computing device and for display, a graphical user interface comprising at least an indication of the one or more search types associated with the geographic location. | 1. (canceled) 2. A computer-implemented method comprising:
before a user has initiated an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 3. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 4. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 5. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. 6. The computer-implemented method of claim 2, further comprising:
determining a geographic location of the mobile device; determining that the geographic location of the mobile device does not satisfy a threshold distance from a location associated with the particular image-based search type; withholding the particular image-based search type; and providing an error message at the user interface. 7. The computer-implemented method of claim 2, wherein the current context associated with the mobile device includes one or more of a geographic location of the mobile device among a set of whitelist locations, a current time, a calendar event, a day of the week, a month, a season, and a year. 8. The computer-implemented method of claim 2, wherein the particular image-based search type includes one or more of a barcode scanning capability, a quick response code scanning capability, an image recognizer capability, and an optical character recognition capability. 9. The computer-implemented method of claim 2, wherein the particular image-based search type that is identified by the predictive model as likely relevant to the current context corresponds to a particular search engine. 10. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
before a user has initiated an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 11. The system of claim 10, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 12. The system of claim 10, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 13. The system of claim 10, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. 14. The system of claim 10, wherein the operations further comprise:
determining a geographic location of the mobile device; determining that the geographic location of the mobile device does not satisfy a threshold distance from a location associated with the particular image-based search type; withholding the particular image-based search type; and providing an error message at the user interface. 15. The system of claim 10, wherein the current context associated with the mobile device includes one or more of a geographic location of the mobile device among a set of whitelist locations, a current time, a calendar event, a day of the week, a month, a season, and a year. 16. The system of claim 10, wherein the particular image-based search type includes one or more of a barcode scanning capability, a quick response code scanning capability, an image recognizer capability, and an optical character recognition capability. 17. The system of claim 10, wherein the particular image-based search type that is identified by the predictive model as likely relevant to the current context corresponds to a particular search engine. 18. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
before initiating an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 19. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 20. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 21. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. | Example techniques and systems may obtain one or more search types associated with a geographic location of a computing device. In one example, a technique may include determining, by a mobile computing device, a geographic location of the mobile computing device and obtaining one or more search types associated with the geographic location. Responsive to obtaining the one or more search types, the technique may also include outputting, by the mobile computing device and for display, a graphical user interface comprising at least an indication of the one or more search types associated with the geographic location.1. (canceled) 2. A computer-implemented method comprising:
before a user has initiated an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 3. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 4. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 5. The computer-implemented method of claim 2, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. 6. The computer-implemented method of claim 2, further comprising:
determining a geographic location of the mobile device; determining that the geographic location of the mobile device does not satisfy a threshold distance from a location associated with the particular image-based search type; withholding the particular image-based search type; and providing an error message at the user interface. 7. The computer-implemented method of claim 2, wherein the current context associated with the mobile device includes one or more of a geographic location of the mobile device among a set of whitelist locations, a current time, a calendar event, a day of the week, a month, a season, and a year. 8. The computer-implemented method of claim 2, wherein the particular image-based search type includes one or more of a barcode scanning capability, a quick response code scanning capability, an image recognizer capability, and an optical character recognition capability. 9. The computer-implemented method of claim 2, wherein the particular image-based search type that is identified by the predictive model as likely relevant to the current context corresponds to a particular search engine. 10. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
before a user has initiated an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 11. The system of claim 10, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 12. The system of claim 10, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 13. The system of claim 10, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. 14. The system of claim 10, wherein the operations further comprise:
determining a geographic location of the mobile device; determining that the geographic location of the mobile device does not satisfy a threshold distance from a location associated with the particular image-based search type; withholding the particular image-based search type; and providing an error message at the user interface. 15. The system of claim 10, wherein the current context associated with the mobile device includes one or more of a geographic location of the mobile device among a set of whitelist locations, a current time, a calendar event, a day of the week, a month, a season, and a year. 16. The system of claim 10, wherein the particular image-based search type includes one or more of a barcode scanning capability, a quick response code scanning capability, an image recognizer capability, and an optical character recognition capability. 17. The system of claim 10, wherein the particular image-based search type that is identified by the predictive model as likely relevant to the current context corresponds to a particular search engine. 18. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
before initiating an image-based search:
obtaining data indicating a current context associated with a mobile device,
obtaining data indicating a particular image-based search type, from among multiple candidate image-based search types, that is identified by a predictive model as likely relevant to the current context, and
providing a user interface including a control for initiating an image-based search of the particular image-based search type that is identified by the predictive model as likely relevant to the current context. 19. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for selecting particular data to be transmitted for the image-based search. 20. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for restricting the mobile device from transmitting personally identifiable information of the user for the image-based search. 21. The non-transitory computer-readable medium of claim 18, wherein the user interface further comprises an additional control for identifying the particular image-based search type based on one or more inputs at the user interface. | 2,100 |
5,619 | 5,619 | 15,543,335 | 2,178 | In one example in accordance with the present disclosure, a method for in-line editor insertion includes accessing code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page. The method includes automatically modifying the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page. | 1. A method for in-line editor insertion, the method comprising:
accessing code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; and automatically modifying the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page. 2. The method of claim 1, wherein automatically modifying the code includes:
identifying at least one page element of the front-end page that is to be in-line editable; and inserting into the code of the application, for each page element that is to be in-line editable, editing interface code that is capable of displaying an editing interface for the page element on the front-end page. 3. The method of claim 2, wherein automatically modifying the code further includes determining, for each page element that is to be in-line editable, the form of the editing interface by looking up a corresponding back-end editing interface of the back-end editing page and using a similar form. 4. The method of claim 3, wherein a connection between each page element that is to be in-line editable and the corresponding back-end editing interface is established based on user selection or a configuration file. 5. The method of claim 4, wherein the connection includes:
identifying each page element using an HTML tag or CSS selector; and identifying each corresponding back-end editing interface using an HTML tag or CSS selector. 6. The method of claim 4, wherein a connection between the front-end page and the corresponding back-end editing page is established based on user selection or a configuration file, wherein the connection includes:
identifying the front-end page using a URL, URL extension, HTML tag or CSS selector of the front-end page; and identifying the corresponding back-end editing page using a URL, URL extension, HTML tag or CSS selector of the front-end page. 7. The method of claim 2, wherein automatically modifying the code further includes inserting, into the code of the application, in-line editing activation code that is capable of displaying an icon, link or toolbar that allows a user to engage with it to cause at least one of the editing interfaces to display or activate. 8. The method of claim 2, wherein automatically modifying the code further includes inserting, into the code of the application, content commit code that, for each editing interface, is capable of sending a request with updated information from the editing interface to the back-end editing page and the corresponding back-end editing interface to save the updated information. 9. The method of claim 8, wherein a connection between the front-end page and the back-end editing page is established based on user selection or a configuration file, and wherein a connection between each editing interface and the corresponding back-end editing interface is established based on user selection or a configuration file. 10. The method of claim 8, wherein automatically modifying the code further includes inserting, into the code of the application, local update code that, for any updated information sent by any of the editing interfaces to the back-end editing page, is also updated on the front-end page. 11. A system for in-line editor insertion, the system comprising:
a code accessor to access code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; an information collector to access information provided by user selection or a configuration file, the information indicating a connection between a page element of the front-end page that is to be in-line editable and a corresponding editing interface of the back-end editing page; and a code modifier to automatically modifying the code of the application to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is made editable in-line via the modified front-end page using the information indicating a connection. 12. The system of claim 11, wherein content on the modified front-end page is made editable in-line by inserting into the code of the application code that is capable of displaying an editing interface for the front-end page element and sending modified information from the editing interface for the front-end page element to the corresponding editing interface of the back-end editing page. 13. The system of claim 12, wherein the code modifier is further to determine the form of the editing interface for the front-end page element by looking up the corresponding editing interface of the back-end editing page and using a similar form. 14. A machine-readable storage medium encoded with instructions for in-line editor insertion, the instructions executable by a processor of a system to cause the system to:
access code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; and automatically modify the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page, wherein automatically modifying the code includes inserting into the code of the application, for at least one page element of the front-end page that is to be in-line editable, code that is capable of displaying an editing interface for the page element on the front-end page and sending modified information for the page element to a corresponding editing interface of the back-end editing page. 15. The machine-readable storage medium of claim 14, wherein the instructions executable by the processor of the system further cause the system to collect information that establishes a connection, for the at least one page element of the front-end page that is to be in-line editable, between the page element and the corresponding back-end editing interface, identifying the page element using an HTML tag or CSS selector and identifying the corresponding back-end editing interface using an HTML tag or CSS selector. | In one example in accordance with the present disclosure, a method for in-line editor insertion includes accessing code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page. The method includes automatically modifying the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page.1. A method for in-line editor insertion, the method comprising:
accessing code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; and automatically modifying the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page. 2. The method of claim 1, wherein automatically modifying the code includes:
identifying at least one page element of the front-end page that is to be in-line editable; and inserting into the code of the application, for each page element that is to be in-line editable, editing interface code that is capable of displaying an editing interface for the page element on the front-end page. 3. The method of claim 2, wherein automatically modifying the code further includes determining, for each page element that is to be in-line editable, the form of the editing interface by looking up a corresponding back-end editing interface of the back-end editing page and using a similar form. 4. The method of claim 3, wherein a connection between each page element that is to be in-line editable and the corresponding back-end editing interface is established based on user selection or a configuration file. 5. The method of claim 4, wherein the connection includes:
identifying each page element using an HTML tag or CSS selector; and identifying each corresponding back-end editing interface using an HTML tag or CSS selector. 6. The method of claim 4, wherein a connection between the front-end page and the corresponding back-end editing page is established based on user selection or a configuration file, wherein the connection includes:
identifying the front-end page using a URL, URL extension, HTML tag or CSS selector of the front-end page; and identifying the corresponding back-end editing page using a URL, URL extension, HTML tag or CSS selector of the front-end page. 7. The method of claim 2, wherein automatically modifying the code further includes inserting, into the code of the application, in-line editing activation code that is capable of displaying an icon, link or toolbar that allows a user to engage with it to cause at least one of the editing interfaces to display or activate. 8. The method of claim 2, wherein automatically modifying the code further includes inserting, into the code of the application, content commit code that, for each editing interface, is capable of sending a request with updated information from the editing interface to the back-end editing page and the corresponding back-end editing interface to save the updated information. 9. The method of claim 8, wherein a connection between the front-end page and the back-end editing page is established based on user selection or a configuration file, and wherein a connection between each editing interface and the corresponding back-end editing interface is established based on user selection or a configuration file. 10. The method of claim 8, wherein automatically modifying the code further includes inserting, into the code of the application, local update code that, for any updated information sent by any of the editing interfaces to the back-end editing page, is also updated on the front-end page. 11. A system for in-line editor insertion, the system comprising:
a code accessor to access code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; an information collector to access information provided by user selection or a configuration file, the information indicating a connection between a page element of the front-end page that is to be in-line editable and a corresponding editing interface of the back-end editing page; and a code modifier to automatically modifying the code of the application to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is made editable in-line via the modified front-end page using the information indicating a connection. 12. The system of claim 11, wherein content on the modified front-end page is made editable in-line by inserting into the code of the application code that is capable of displaying an editing interface for the front-end page element and sending modified information from the editing interface for the front-end page element to the corresponding editing interface of the back-end editing page. 13. The system of claim 12, wherein the code modifier is further to determine the form of the editing interface for the front-end page element by looking up the corresponding editing interface of the back-end editing page and using a similar form. 14. A machine-readable storage medium encoded with instructions for in-line editor insertion, the instructions executable by a processor of a system to cause the system to:
access code for an application that is capable of presenting a front-end page to a user, where content on the front-end page is editable via a back-end editing page; and automatically modify the code to create a modified application that is capable of presenting a modified front-end page to the user that is similar to the front-end page and where content on the modified front-end page is editable in-line via the modified front-end page, wherein automatically modifying the code includes inserting into the code of the application, for at least one page element of the front-end page that is to be in-line editable, code that is capable of displaying an editing interface for the page element on the front-end page and sending modified information for the page element to a corresponding editing interface of the back-end editing page. 15. The machine-readable storage medium of claim 14, wherein the instructions executable by the processor of the system further cause the system to collect information that establishes a connection, for the at least one page element of the front-end page that is to be in-line editable, between the page element and the corresponding back-end editing interface, identifying the page element using an HTML tag or CSS selector and identifying the corresponding back-end editing interface using an HTML tag or CSS selector. | 2,100 |
5,620 | 5,620 | 14,374,698 | 2,157 | In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c, and the entropy of demand distribution, H. More precisely, the present principles show that the average search costs scales C F =O(c 5 H), which improves upon the previously best known bound and is order optimal for constant c. | 1. A method for searching content within a data base, comprising the steps of:
constructing a net having a size that contains a target; choosing a plurality of exemplars; comparing each exemplar with every other exemplar; determining the exemplar closest to the target; reducing the size of the net to a smaller size that contains the target; repeating said choosing, comparing, determining, and reducing steps until the size of the net is small enough to locate the target. 2. The method of claim 1, wherein said repeating step is performed for at least two iterations. 3. The method of claim 1, wherein said repeating step is performed until the size of the last net is within a threshold value. 4. The method of claim 1, wherein said repeating step is performed for a predetermined number of iterations. 5. The method of claim 1, wherein the target is located by an alternative search method after the net becomes small enough. 6. A computer for searching content within a data base, comprising:
circuitry to construct a net having a size that contains a target; circuitry to choose a plurality of exemplars; comparator circuitry that operates on the exemplars; a determining circuit that finds the exemplar closest to the target; circuitry to reduce the size of the net to a smaller size that contains the target; and control circuitry to cause said circuitry to construct, said circuitry to choose, said comparator, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the net is small enough to locate the target. 7. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation for at least two iterations. 8. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value. 9. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value. 10. The apparatus of claim 6, wherein said control circuitry causes the target to be located by an alternative search method after the net becomes small enough. | In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c, and the entropy of demand distribution, H. More precisely, the present principles show that the average search costs scales C F =O(c 5 H), which improves upon the previously best known bound and is order optimal for constant c.1. A method for searching content within a data base, comprising the steps of:
constructing a net having a size that contains a target; choosing a plurality of exemplars; comparing each exemplar with every other exemplar; determining the exemplar closest to the target; reducing the size of the net to a smaller size that contains the target; repeating said choosing, comparing, determining, and reducing steps until the size of the net is small enough to locate the target. 2. The method of claim 1, wherein said repeating step is performed for at least two iterations. 3. The method of claim 1, wherein said repeating step is performed until the size of the last net is within a threshold value. 4. The method of claim 1, wherein said repeating step is performed for a predetermined number of iterations. 5. The method of claim 1, wherein the target is located by an alternative search method after the net becomes small enough. 6. A computer for searching content within a data base, comprising:
circuitry to construct a net having a size that contains a target; circuitry to choose a plurality of exemplars; comparator circuitry that operates on the exemplars; a determining circuit that finds the exemplar closest to the target; circuitry to reduce the size of the net to a smaller size that contains the target; and control circuitry to cause said circuitry to construct, said circuitry to choose, said comparator, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the net is small enough to locate the target. 7. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation for at least two iterations. 8. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value. 9. The apparatus of claim 6, wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value. 10. The apparatus of claim 6, wherein said control circuitry causes the target to be located by an alternative search method after the net becomes small enough. | 2,100 |
5,621 | 5,621 | 12,622,857 | 2,198 | One embodiment provides a system for generating an inference model that determines an activity type for a user from contextual information. During operation, the system receives a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates. The system then determines an association between the contextual information and an activity type. Next, the system generates an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type. The model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. | 1. A computer-implemented method for generating an inference model that determines an activity type for a user from contextual information, the method comprising:
receiving a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; determining an association between the contextual information, and an activity type; and generating an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 2. The computer-implemented method of claim 1, wherein the contextual information includes a number of timestamped location coordinates. 3. The computer-implemented method of claim 1, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 4. The computer-implemented method of claim 1, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 5. The computer-implemented method of claim 1, further comprising determining a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 6. The computer-implemented method of claim 5, wherein the role is determined in conjunction with the activity inference model. 7. The computer-implemented method of claim 5, further comprising determining an activity type for the user that corresponds to the determined role associated with the venue. 8. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for generating an inference model that determines an activity type for a user from contextual information, the method comprising:
receiving a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; determining an association between the contextual information, and an activity type; and generating an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 9. The computer-readable storage medium of claim 8, wherein the contextual information includes a number of timestamped location coordinates. 10. The computer-readable storage medium of claim 8, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 11. The computer-readable storage medium of claim 8, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 12. The computer-readable storage medium of claim 8, wherein the method further comprises determining a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 13. The computer-readable storage medium of claim 12, wherein the role is determined in conjunction with the activity inference model. 14. The computer-readable storage medium of claim 12, wherein the method further comprises determining an activity type for the user that corresponds to the determined role associated with the venue. 15. A computer system for generating an inference model that determines an activity type for a user from contextual information, the computer system comprising:
a receiving mechanism configured to receive a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; a determination mechanism configured to determine an association between the contextual information and an activity type; and a generation mechanism configured to generate an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 16. The computer system of claim 15, wherein the contextual information includes a number of timestamped location coordinates. 17. The computer system of claim 15, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 18. The computer system of claim 15, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 19. The computer system of claim 15, wherein the determination mechanism is further configured to determine a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 20. The computer system of claim 19, wherein the role is determined in conjunction with the activity inference model. 21. The computer system of claim 19, wherein the determination mechanism is further configured to determine an activity type for the user that corresponds to the determined role associated with the venue. | One embodiment provides a system for generating an inference model that determines an activity type for a user from contextual information. During operation, the system receives a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates. The system then determines an association between the contextual information and an activity type. Next, the system generates an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type. The model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history.1. A computer-implemented method for generating an inference model that determines an activity type for a user from contextual information, the method comprising:
receiving a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; determining an association between the contextual information, and an activity type; and generating an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 2. The computer-implemented method of claim 1, wherein the contextual information includes a number of timestamped location coordinates. 3. The computer-implemented method of claim 1, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 4. The computer-implemented method of claim 1, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 5. The computer-implemented method of claim 1, further comprising determining a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 6. The computer-implemented method of claim 5, wherein the role is determined in conjunction with the activity inference model. 7. The computer-implemented method of claim 5, further comprising determining an activity type for the user that corresponds to the determined role associated with the venue. 8. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for generating an inference model that determines an activity type for a user from contextual information, the method comprising:
receiving a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; determining an association between the contextual information, and an activity type; and generating an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 9. The computer-readable storage medium of claim 8, wherein the contextual information includes a number of timestamped location coordinates. 10. The computer-readable storage medium of claim 8, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 11. The computer-readable storage medium of claim 8, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 12. The computer-readable storage medium of claim 8, wherein the method further comprises determining a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 13. The computer-readable storage medium of claim 12, wherein the role is determined in conjunction with the activity inference model. 14. The computer-readable storage medium of claim 12, wherein the method further comprises determining an activity type for the user that corresponds to the determined role associated with the venue. 15. A computer system for generating an inference model that determines an activity type for a user from contextual information, the computer system comprising:
a receiving mechanism configured to receive a set of contextual information associated with the user, wherein the contextual information includes at least a set of location coordinates; a determination mechanism configured to determine an association between the contextual information and an activity type; and a generation mechanism configured to generate an activity inference model based in part on the association, wherein the activity inference model takes an instance of contextual information as an input parameter and outputs a corresponding activity type, wherein the model's parameters are based at least on statistics associated with the user's contextual history but not based on the complete contents of the user's contextual history. 16. The computer system of claim 15, wherein the contextual information includes a number of timestamped location coordinates. 17. The computer system of claim 15, wherein the contextual information includes venue-specific contextual data, which facilitates identifying a correct activity type from one or more activities associated with a venue. 18. The computer system of claim 15, wherein a respective instance of contextual information indicates one or more of: a time of day, a time range, a day of week, a range of days of a week, a date, a range of dates, a weather condition, a traffic condition, a social context, a sensed motion, an ambient sound, and an ambient video feed. 19. The computer system of claim 15, wherein the determination mechanism is further configured to determine a venue-specific context for the user by:
receiving information indicating a set of user roles associated with a venue; analyzing the contextual information associated with the venue to determine a pattern; and determining a role for the user that matches the determined pattern. 20. The computer system of claim 19, wherein the role is determined in conjunction with the activity inference model. 21. The computer system of claim 19, wherein the determination mechanism is further configured to determine an activity type for the user that corresponds to the determined role associated with the venue. | 2,100 |
5,622 | 5,622 | 14,519,576 | 2,164 | Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices. | 1. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; identifying a backbone graph within the initial graph at least in part by a graph creation module; creating a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph, at least in part by the graph creation module; and computing the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 2. The method of claim 1, wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 3. The method of claim 1, wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 4. The method of claim 1, wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. 5. The method of claim 1, wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 6. The method of claim 5, wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach the first vertice. 7. The method of claim 6, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the first vertice. 8. The method of claim 6, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 9. The method of claim 5, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the first vertice. 10. The method of claim 5, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 11. One or more computer readable storage media having program instructions stored thereon for scaling reachability computations on relatively large graphs that, when executed by a computing system, direct the computing system to at least:
identify an initial graph comprising a plurality of vertices and a plurality of edges; identify a backbone graph within the initial graph at least in part by a graph creation module; create a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph at least in part by the graph creation module; and compute the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 12. The one or more computer readable storage media of claim 9, having further instructions wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 13. The one or more computer readable storage media of claim 9, having further instructions wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 14. The one or more computer readable storage media of claim 9, having further instructions wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. 15. The one or more computer readable storage media of claim 9, having further instructions wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 16. The one or more computer readable storage media of claim 9, having further instructions wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach the first vertice. 17. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; creating a scaled-down backbone graph of the initial graph based at least in part on a locality threshold; and computing the reachability of at least two of the plurality vertices using at least the initial graph or the backbone graph. 18. The method of claim 15, wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 19. The method of claim 15, wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 20. The method of claim 15, wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. | Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices.1. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; identifying a backbone graph within the initial graph at least in part by a graph creation module; creating a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph, at least in part by the graph creation module; and computing the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 2. The method of claim 1, wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 3. The method of claim 1, wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 4. The method of claim 1, wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. 5. The method of claim 1, wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 6. The method of claim 5, wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach the first vertice. 7. The method of claim 6, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the first vertice. 8. The method of claim 6, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 9. The method of claim 5, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the first vertice. 10. The method of claim 5, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 11. One or more computer readable storage media having program instructions stored thereon for scaling reachability computations on relatively large graphs that, when executed by a computing system, direct the computing system to at least:
identify an initial graph comprising a plurality of vertices and a plurality of edges; identify a backbone graph within the initial graph at least in part by a graph creation module; create a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph at least in part by the graph creation module; and compute the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 12. The one or more computer readable storage media of claim 9, having further instructions wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 13. The one or more computer readable storage media of claim 9, having further instructions wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 14. The one or more computer readable storage media of claim 9, having further instructions wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. 15. The one or more computer readable storage media of claim 9, having further instructions wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 16. The one or more computer readable storage media of claim 9, having further instructions wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach the first vertice. 17. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; creating a scaled-down backbone graph of the initial graph based at least in part on a locality threshold; and computing the reachability of at least two of the plurality vertices using at least the initial graph or the backbone graph. 18. The method of claim 15, wherein the creating a subsequent graph is accomplished at least in part by a hierarchical labeling method. 19. The method of claim 15, wherein the creating a subsequent graph is accomplished at least in part by a distribution labeling method. 20. The method of claim 15, wherein the computing the reachability of local vertices is accomplished at least in part using a search of the subsequent graph and/or the backbone graph. | 2,100 |
5,623 | 5,623 | 14,159,777 | 2,173 | Automated injection system disclosed in this application advantageously provides physicians with a simplified interface for selecting fluid sources, such as saline, contrast, or a mixture of both, to inject at high pressures. The injector system may comprise a multi-use subassembly, a single-use subassembly, a fitting to fluidly connect the multi-use and single-use subassemblies, a hand held controller, a user interface, and an injector housing. | 1. A method to provide injection system parameters, comprising:
providing a user interface having a touchscreen display; displaying on a first screen of the touchscreen display a plurality of selectable options for controlling the injection system; receiving a user selection for one of the selectable options; changing a system parameter or setting as a result of the user selection. 2. The method of claim 1, further comprising notifying user with a visual notification after receiving the user selection. 3. The method of claim 1, wherein the user interface further includes a display unit that is attached to the injection system or a bed rail. 4. The method of claim 1, wherein the user selection for one of the selectable options further comprises of contrast ration option, flow rate option, volume option, pressure option, rise time option, or arm option. 5. The method of claim 1, wherein the user selection for one of the selectable options further consists of a cardiac procedure option, a peripheral procedure option, or a physician list option. 6. The method of claim 5, wherein changing a system parameter or setting includes a preset injection parameter being populated. 7. The method of claim 6, wherein the preset injection parameters further consists of at least two of the following: contrast to saline ratio, flow rate, volume, pressure, or rise time. 8. The method of claim 6, further comprising:
displaying a second screen which is different from the first screen. 9. The method of claim 8, further comprising the step:
selecting to arm the injection system after all of the injection parameters have been set by the user. 10. The method of claim 9, further comprising the step:
displaying a third screen which is different from the second screen that allows the user to inject fluid into the patient. 11. The method of claim 2, wherein the visual indication may comprises of one of the following: a disposable sub-assembly has been properly installed, the injection system has been armed, the injection system is performing an injection, or the injection system has been disarmed. 12. The method of claim 3, wherein the display unit is attached to the bed rail or injector system by a movable arm. 13. The method of claim 12, further comprising the steps of:
pulling the moveable arm closer to the user; and folding the movable arm. 14. The method of claim 8, wherein the first screen comprises of a dashboard screen and the second screen consists of an armed dashboard screen. 15. The method of claim 8, further comprising the step of:
displaying on the dashboard screen a plurality of selectable options for controlling the injection parameters. 16. The method of claim 15, wherein the step of displaying on the dashboard screen a plurality of selectable options for controlling the injection parameters includes a contrast option for changing the contrast to saline ratio. 17. A method to provide injection system parameters, comprising:
providing a user interface having a touchscreen display; displaying on a first screen of the touchscreen display a plurality of injection parameter options; and receiving a user selection for one of the plurality of injection parameter options. 18. The method of claim 17, further comprising the step of:
displaying on a second screen a preset injection parameter based on the users selection. 19. The method of claim 18, wherein the second screen further comprises an option to arm the injection system. 20. The method of claim 19, further comprising the step of:
receiving the user input to arm the injection system; and displaying an option to inject fluid into the patient. | Automated injection system disclosed in this application advantageously provides physicians with a simplified interface for selecting fluid sources, such as saline, contrast, or a mixture of both, to inject at high pressures. The injector system may comprise a multi-use subassembly, a single-use subassembly, a fitting to fluidly connect the multi-use and single-use subassemblies, a hand held controller, a user interface, and an injector housing.1. A method to provide injection system parameters, comprising:
providing a user interface having a touchscreen display; displaying on a first screen of the touchscreen display a plurality of selectable options for controlling the injection system; receiving a user selection for one of the selectable options; changing a system parameter or setting as a result of the user selection. 2. The method of claim 1, further comprising notifying user with a visual notification after receiving the user selection. 3. The method of claim 1, wherein the user interface further includes a display unit that is attached to the injection system or a bed rail. 4. The method of claim 1, wherein the user selection for one of the selectable options further comprises of contrast ration option, flow rate option, volume option, pressure option, rise time option, or arm option. 5. The method of claim 1, wherein the user selection for one of the selectable options further consists of a cardiac procedure option, a peripheral procedure option, or a physician list option. 6. The method of claim 5, wherein changing a system parameter or setting includes a preset injection parameter being populated. 7. The method of claim 6, wherein the preset injection parameters further consists of at least two of the following: contrast to saline ratio, flow rate, volume, pressure, or rise time. 8. The method of claim 6, further comprising:
displaying a second screen which is different from the first screen. 9. The method of claim 8, further comprising the step:
selecting to arm the injection system after all of the injection parameters have been set by the user. 10. The method of claim 9, further comprising the step:
displaying a third screen which is different from the second screen that allows the user to inject fluid into the patient. 11. The method of claim 2, wherein the visual indication may comprises of one of the following: a disposable sub-assembly has been properly installed, the injection system has been armed, the injection system is performing an injection, or the injection system has been disarmed. 12. The method of claim 3, wherein the display unit is attached to the bed rail or injector system by a movable arm. 13. The method of claim 12, further comprising the steps of:
pulling the moveable arm closer to the user; and folding the movable arm. 14. The method of claim 8, wherein the first screen comprises of a dashboard screen and the second screen consists of an armed dashboard screen. 15. The method of claim 8, further comprising the step of:
displaying on the dashboard screen a plurality of selectable options for controlling the injection parameters. 16. The method of claim 15, wherein the step of displaying on the dashboard screen a plurality of selectable options for controlling the injection parameters includes a contrast option for changing the contrast to saline ratio. 17. A method to provide injection system parameters, comprising:
providing a user interface having a touchscreen display; displaying on a first screen of the touchscreen display a plurality of injection parameter options; and receiving a user selection for one of the plurality of injection parameter options. 18. The method of claim 17, further comprising the step of:
displaying on a second screen a preset injection parameter based on the users selection. 19. The method of claim 18, wherein the second screen further comprises an option to arm the injection system. 20. The method of claim 19, further comprising the step of:
receiving the user input to arm the injection system; and displaying an option to inject fluid into the patient. | 2,100 |
5,624 | 5,624 | 14,895,382 | 2,119 | A method for operating a process automation system that is configured to control an industrial process and/or traffic-control signals, wherein the process automation system includes field devices arranged in a field of the industrial process and a central controller unit for controlling the process through the field devices, where the central controller unit generates control data for the field devices by running a control program, where the control program forms a browser executable application that receives and processes field data from the field devices and generates and sends out the control data, and where the central controller unit executes an internet browser program and the internet browser program runs the application. | 1.-15. (canceled) 16. A method for operating a process automation system which controls at least one of (i) an industrial process and (ii) traffic-control signals, the system comprising field devices arranged in a field of the industrial process and a central controller unit for controlling the industrial process through the field devices, the method comprising:
transmitting, by at least one of the field devices, field data to the central controller unit; running, by the central controller unit, a control program comprising a browser executable application to generate control data for the at least one field device; receiving the field data at the browser executable application and processing the field data by the browser executable application to generate and send out the control data; executing, by the central controller unit, an internet browser program, the internet browser program running the application. 17. The method according to claim 16, wherein the application comprises at least one control loop for controlling at least a part of the industrial process; and wherein each control loop generates at least a part of the control data dependent on at least a part of the received field data. 18. The method according to claim 16, wherein the application is provides a user interface to a user of the browser program, the user interface providing a monitoring functionality for at least one of (i) the process automation system and (ii) a configuration functionality for setting a parameter value of at least one of (i) at least one parameter of the central controller unit and (ii) at least one of the field devices. 19. The method according to claim 16, wherein the application comprises an engineering tool for setting up the system. 20. The method according to claim 16, wherein the central controller unit executes at least one additional internet browser program, each additional internet browser program also running the same application; and wherein a verification unit receives the control data sent out by running applications and selects the control data of one of the running applications in accordance with a pre-defined selection criterion. 21. The method according to claim 20, wherein the selection criterion comprises at least one of:
(i) the application running for the longest time is declared a master and the control data of the master is selected when only two applications are running; and (ii) the control data of all applications are compared and the control data are selected according to a majority vote when more than two applications are running. 22. The method according to claim 20, wherein one of the running applications receives a user input regarding a re-configuration of the running application and the one running application notifies remaining running applications of this re-configuration. 23. The method according to claim 20, wherein one of the running applications receives a user input regarding a re-configuration of the running application and the one running application notifies remaining running applications of this re-configuration. 24. The method according to claim 16, further comprising:
reporting at least one of (i) at least a part of the field data a measurement and (ii) a state of at least one of the field devices. 25. The method according to claim 16, wherein at least a part of the control data comprises at least one of (i) a control command for a field device and (ii) a setpoint value for a setpoint control performed by a field device. 26. A process automation system configured to control at least one of an industrial process and traffic-control signals, the system comprising:
field devices arranged in a field of the industrial process; a central controller unit for controlling the industrial process through the field devices by running a control program, the central controller unit comprising at least one computing device including an internet browser program which executes at least one instance of the internet browser program; a communication network structure coupling the field devices with the central controller unit; and a storage unit containing the control program as a browser executable application which receives field data from the field over the communication network structure, processes the received field data and generates and sends out control data to the field over the communication network structure, the storage unit being configured to provide the application to each executed internet browser program for running the application. 27. The system according to claim 26, wherein the field devices comprise at least one of:
(i) at least one input device for transforming a sensor signal into network data; (ii) at least one sensor device directly connected to the network structure; (iii) at least one actuation device directly connected to the network structure; and (iv) at least one output device for transforming the control data into a control signal for an actuation device. 28. The system according to claim 26, wherein the field devices and the central controller unit are coupled through a web server which receives a part or all of the field data and forwards at least a part of the received data to all running applications in the central computing unit. 29. The system according to claim 27, wherein the field devices and the central controller unit are coupled through a web server which receives a part or all of the field data and forwards at least a part of the received data to all running applications in the central computing unit. 30. The system according to claim 26, wherein at least one real-time control device is provided generates additional control data. 31. A non-statutory tangible storage medium including a control program comprising a browser executable application which, when executed by an internet browser program, receives and processes field data from field devices of a process automation system and generates and sends out control data to field devices of the system. 32. A web server device comprising:
a first connecting unit for connecting the web server device to a first part of a communication network structure, the first connecting unit receiving field data from field devices over the first part of the communication network structure; a second connecting unit for connecting the web server device to a second part of a communication network structure, the second connecting unit forwarding at least a part of the received field data to at least one internet browser program over the second part of the communication network structure; a non-statutory tangible storage medium including a control program comprising a browser executable application which, when executed by an internet browser program, receives and processes field data from field devices of a process automation system and generates and sends out control data to field devices of the system; and a web server program for sending out the application to at least one requesting internet browser program. | A method for operating a process automation system that is configured to control an industrial process and/or traffic-control signals, wherein the process automation system includes field devices arranged in a field of the industrial process and a central controller unit for controlling the process through the field devices, where the central controller unit generates control data for the field devices by running a control program, where the control program forms a browser executable application that receives and processes field data from the field devices and generates and sends out the control data, and where the central controller unit executes an internet browser program and the internet browser program runs the application.1.-15. (canceled) 16. A method for operating a process automation system which controls at least one of (i) an industrial process and (ii) traffic-control signals, the system comprising field devices arranged in a field of the industrial process and a central controller unit for controlling the industrial process through the field devices, the method comprising:
transmitting, by at least one of the field devices, field data to the central controller unit; running, by the central controller unit, a control program comprising a browser executable application to generate control data for the at least one field device; receiving the field data at the browser executable application and processing the field data by the browser executable application to generate and send out the control data; executing, by the central controller unit, an internet browser program, the internet browser program running the application. 17. The method according to claim 16, wherein the application comprises at least one control loop for controlling at least a part of the industrial process; and wherein each control loop generates at least a part of the control data dependent on at least a part of the received field data. 18. The method according to claim 16, wherein the application is provides a user interface to a user of the browser program, the user interface providing a monitoring functionality for at least one of (i) the process automation system and (ii) a configuration functionality for setting a parameter value of at least one of (i) at least one parameter of the central controller unit and (ii) at least one of the field devices. 19. The method according to claim 16, wherein the application comprises an engineering tool for setting up the system. 20. The method according to claim 16, wherein the central controller unit executes at least one additional internet browser program, each additional internet browser program also running the same application; and wherein a verification unit receives the control data sent out by running applications and selects the control data of one of the running applications in accordance with a pre-defined selection criterion. 21. The method according to claim 20, wherein the selection criterion comprises at least one of:
(i) the application running for the longest time is declared a master and the control data of the master is selected when only two applications are running; and (ii) the control data of all applications are compared and the control data are selected according to a majority vote when more than two applications are running. 22. The method according to claim 20, wherein one of the running applications receives a user input regarding a re-configuration of the running application and the one running application notifies remaining running applications of this re-configuration. 23. The method according to claim 20, wherein one of the running applications receives a user input regarding a re-configuration of the running application and the one running application notifies remaining running applications of this re-configuration. 24. The method according to claim 16, further comprising:
reporting at least one of (i) at least a part of the field data a measurement and (ii) a state of at least one of the field devices. 25. The method according to claim 16, wherein at least a part of the control data comprises at least one of (i) a control command for a field device and (ii) a setpoint value for a setpoint control performed by a field device. 26. A process automation system configured to control at least one of an industrial process and traffic-control signals, the system comprising:
field devices arranged in a field of the industrial process; a central controller unit for controlling the industrial process through the field devices by running a control program, the central controller unit comprising at least one computing device including an internet browser program which executes at least one instance of the internet browser program; a communication network structure coupling the field devices with the central controller unit; and a storage unit containing the control program as a browser executable application which receives field data from the field over the communication network structure, processes the received field data and generates and sends out control data to the field over the communication network structure, the storage unit being configured to provide the application to each executed internet browser program for running the application. 27. The system according to claim 26, wherein the field devices comprise at least one of:
(i) at least one input device for transforming a sensor signal into network data; (ii) at least one sensor device directly connected to the network structure; (iii) at least one actuation device directly connected to the network structure; and (iv) at least one output device for transforming the control data into a control signal for an actuation device. 28. The system according to claim 26, wherein the field devices and the central controller unit are coupled through a web server which receives a part or all of the field data and forwards at least a part of the received data to all running applications in the central computing unit. 29. The system according to claim 27, wherein the field devices and the central controller unit are coupled through a web server which receives a part or all of the field data and forwards at least a part of the received data to all running applications in the central computing unit. 30. The system according to claim 26, wherein at least one real-time control device is provided generates additional control data. 31. A non-statutory tangible storage medium including a control program comprising a browser executable application which, when executed by an internet browser program, receives and processes field data from field devices of a process automation system and generates and sends out control data to field devices of the system. 32. A web server device comprising:
a first connecting unit for connecting the web server device to a first part of a communication network structure, the first connecting unit receiving field data from field devices over the first part of the communication network structure; a second connecting unit for connecting the web server device to a second part of a communication network structure, the second connecting unit forwarding at least a part of the received field data to at least one internet browser program over the second part of the communication network structure; a non-statutory tangible storage medium including a control program comprising a browser executable application which, when executed by an internet browser program, receives and processes field data from field devices of a process automation system and generates and sends out control data to field devices of the system; and a web server program for sending out the application to at least one requesting internet browser program. | 2,100 |
5,625 | 5,625 | 13,651,317 | 2,142 | A method for traversing a streaming video file includes receiving a representative streaming video file that includes less information than a higher-resolution streaming video file and spans the entire streaming video file. Based on navigation information associated with the representative streaming video file, a playback engine navigates to a different portion of the streaming video file. The navigation information may be based on input information received from a viewer of the streaming video file. One advantage of the disclosed method is that it enables fast and accurate navigation of a streaming video. | 1. A method for traversing a streaming video file, the method comprising:
receiving a representative video file of the streaming video file that includes less information than the streaming video file and spans the entire streaming video file; and based on navigation information associated with the representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 2. The method of claim 1, wherein the representative video file has a lower pixel resolution than the streaming video file. 3. The method of claim 1, wherein the representative video file has fewer total frames than the streaming video file. 4. The method of claim 3, wherein the number of frames in the representative video file is selected based on a pixel width of a timeline slider associated with the streaming video file. 5. The method of claim 3, wherein the total number of frames in the representative video file is no greater than a number of pixels that make up the width of a timeline slider associated with the streaming video file. 6. The method of claim 1, further comprising receiving the representative video file immediately prior to receiving the streaming video file. 7. The method of claim 1, wherein the representative video file is received concurrently with the streaming video file. 8. The method of claim 1, wherein the navigation information is based on input information received from a viewer of the streaming video file. 9. The method of claim 8, further comprising displaying the representative video file in substantially the same dimensions as the streaming video when the input information is generated by the viewer. 10. The method of claim 1, wherein the representative video file includes meta data associated with the streaming video file that changes over the course of the streaming video file. 11. The method of claim 1, further comprising:
prior to receiving the representative video file, receiving an initial representative video file that includes less information than the representative video file and spans the entire streaming video file; and based on navigation information associated with the initial representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 12. A computer readable medium storing instructions that, when executed by a processor, cause the processor to traverse a streaming video file, by performing the steps of:
receiving the representative video file of the streaming video file that includes less information than the streaming video file and spans the entire streaming video file; and based on navigation information associated with the representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 13. The method of claim 12, wherein the representative video file has a lower pixel resolution than the streaming video file. 14. The method of claim 12, wherein the representative video file has fewer total frames than the streaming video file. 15. The method of claim 14, wherein the number of frames in the representative video file is selected based on a pixel width of a timeline slider associated with the streaming video file. 16. The method of claim 14, wherein the total number of frames in the representative video file is no greater than a number of pixels that make up the width of a timeline slider associated with the streaming video file. 17. The method of claim 12, further comprising receiving the representative video file immediately prior to receiving the streaming video file. 18. The method of claim 12, wherein the representative video file is received concurrently with the streaming video file. 19. The method of claim 12, wherein the navigation information is based on input information received from a viewer of the streaming video file. 20. The method of claim 12, further comprising:
prior to receiving the representative video file, receiving an initial representative video file that includes less information than the representative video file and spans the entire streaming video file; and based on navigation information associated with the initial representative video file, causing a playback engine to navigate to a different portion of the streaming video file. | A method for traversing a streaming video file includes receiving a representative streaming video file that includes less information than a higher-resolution streaming video file and spans the entire streaming video file. Based on navigation information associated with the representative streaming video file, a playback engine navigates to a different portion of the streaming video file. The navigation information may be based on input information received from a viewer of the streaming video file. One advantage of the disclosed method is that it enables fast and accurate navigation of a streaming video.1. A method for traversing a streaming video file, the method comprising:
receiving a representative video file of the streaming video file that includes less information than the streaming video file and spans the entire streaming video file; and based on navigation information associated with the representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 2. The method of claim 1, wherein the representative video file has a lower pixel resolution than the streaming video file. 3. The method of claim 1, wherein the representative video file has fewer total frames than the streaming video file. 4. The method of claim 3, wherein the number of frames in the representative video file is selected based on a pixel width of a timeline slider associated with the streaming video file. 5. The method of claim 3, wherein the total number of frames in the representative video file is no greater than a number of pixels that make up the width of a timeline slider associated with the streaming video file. 6. The method of claim 1, further comprising receiving the representative video file immediately prior to receiving the streaming video file. 7. The method of claim 1, wherein the representative video file is received concurrently with the streaming video file. 8. The method of claim 1, wherein the navigation information is based on input information received from a viewer of the streaming video file. 9. The method of claim 8, further comprising displaying the representative video file in substantially the same dimensions as the streaming video when the input information is generated by the viewer. 10. The method of claim 1, wherein the representative video file includes meta data associated with the streaming video file that changes over the course of the streaming video file. 11. The method of claim 1, further comprising:
prior to receiving the representative video file, receiving an initial representative video file that includes less information than the representative video file and spans the entire streaming video file; and based on navigation information associated with the initial representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 12. A computer readable medium storing instructions that, when executed by a processor, cause the processor to traverse a streaming video file, by performing the steps of:
receiving the representative video file of the streaming video file that includes less information than the streaming video file and spans the entire streaming video file; and based on navigation information associated with the representative video file, causing a playback engine to navigate to a different portion of the streaming video file. 13. The method of claim 12, wherein the representative video file has a lower pixel resolution than the streaming video file. 14. The method of claim 12, wherein the representative video file has fewer total frames than the streaming video file. 15. The method of claim 14, wherein the number of frames in the representative video file is selected based on a pixel width of a timeline slider associated with the streaming video file. 16. The method of claim 14, wherein the total number of frames in the representative video file is no greater than a number of pixels that make up the width of a timeline slider associated with the streaming video file. 17. The method of claim 12, further comprising receiving the representative video file immediately prior to receiving the streaming video file. 18. The method of claim 12, wherein the representative video file is received concurrently with the streaming video file. 19. The method of claim 12, wherein the navigation information is based on input information received from a viewer of the streaming video file. 20. The method of claim 12, further comprising:
prior to receiving the representative video file, receiving an initial representative video file that includes less information than the representative video file and spans the entire streaming video file; and based on navigation information associated with the initial representative video file, causing a playback engine to navigate to a different portion of the streaming video file. | 2,100 |
5,626 | 5,626 | 12,762,298 | 2,121 | A human-machine interface with learning while using functionality, is involved with the fields of communication interface between human and machine.
The present invention lets users obtain intelligent and pertinent operation guides and/or help according to the user's operation situations and/or the document state without resorting to the user manual or the help system, providing an intelligent human-machine interface with learning while using functionality, thus augments greatly the ease of use for computers and electronic appliances. | 1. A human-machine interface with learning while using functionality wherein conditional commands and/or conditional buttons are embedded with intelligent descriptions, operation guides and/or help which are dependent on the document state and/or user's operational situations, provides timely and pertinent operation guide and/or help to users when it is needed realizing the intelligent learning while using functionality. 2. The human-machine interface with learning while using functionality of claim 1 first tests the condition that needs to be satisfied for the execution of the conditional command or conditional button when users invoke the conditional command or pressed down the conditional button. If the conditions for its execution are not satisfied, it performs examination on the current state of the current document the user is working on and/or the user's operation stage or operational situations, or conducts conditional test related to the two states when only two states are possible and offers intelligent and pertinent descriptions, operation guides and/or help which are different for different document states and/or user operation situations. 3. The human-machine interface with learning while using functionality of claim 1 executes the conditional command or the command for the conditional button directly if the conditions for the execution of the conditional command or the conditional button are satisfied in the conditional test described in claim 2, without providing any description, operation guide or help. This eliminates the drawbacks of those annoying tips which always pop-up. 4. The human-machine interface with learning while using functionality of claim 1 wherein the conditional commands are always activated and invokable when applied to software for computers and other electronic appliances, eliminating the command update system and the conditional command update program blocks in the prior technology from the software. | A human-machine interface with learning while using functionality, is involved with the fields of communication interface between human and machine.
The present invention lets users obtain intelligent and pertinent operation guides and/or help according to the user's operation situations and/or the document state without resorting to the user manual or the help system, providing an intelligent human-machine interface with learning while using functionality, thus augments greatly the ease of use for computers and electronic appliances.1. A human-machine interface with learning while using functionality wherein conditional commands and/or conditional buttons are embedded with intelligent descriptions, operation guides and/or help which are dependent on the document state and/or user's operational situations, provides timely and pertinent operation guide and/or help to users when it is needed realizing the intelligent learning while using functionality. 2. The human-machine interface with learning while using functionality of claim 1 first tests the condition that needs to be satisfied for the execution of the conditional command or conditional button when users invoke the conditional command or pressed down the conditional button. If the conditions for its execution are not satisfied, it performs examination on the current state of the current document the user is working on and/or the user's operation stage or operational situations, or conducts conditional test related to the two states when only two states are possible and offers intelligent and pertinent descriptions, operation guides and/or help which are different for different document states and/or user operation situations. 3. The human-machine interface with learning while using functionality of claim 1 executes the conditional command or the command for the conditional button directly if the conditions for the execution of the conditional command or the conditional button are satisfied in the conditional test described in claim 2, without providing any description, operation guide or help. This eliminates the drawbacks of those annoying tips which always pop-up. 4. The human-machine interface with learning while using functionality of claim 1 wherein the conditional commands are always activated and invokable when applied to software for computers and other electronic appliances, eliminating the command update system and the conditional command update program blocks in the prior technology from the software. | 2,100 |
5,627 | 5,627 | 14,946,847 | 2,157 | A system and method for identifying data fields for remote address cleansing, whereby a plurality of address file hash values are stored and associated with a plurality of known address data file profiles. An uploaded address file is received at the processing site from a sender who wishes to have his address list processed. A received address data file profile is identified for the uploaded address the. A first hash value is calculated based on the identified received address data the profile. The first hash value is compared with the stored plurality of address the hash values. If the first hash value matches one of the stored plurality of hash values, then the known address data profile of the matching stored hash value is associated with the uploaded address file. If the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash. | 1. A method of recognizing and verifying data formats of received address lists for address cleansing, the method comprising:
storing a plurality of address file hash values associated with a plurality of known address data file profiles, the a dress data file profiles including address data file formats and data field structure; receiving an uploaded address file: identifying a received address data the profile of the uploaded address file; calculating a first hash value based on the identified received address data file profile; comparing the first hash value with the stored plurality of address the hash values to determine whether the received address data file has a known data format and structure; and if the first hash value matches one of the stored plurality of hash values, then associating the known address data profile of the matching stored hash value with the uploaded address file; if the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash. 2. The method of claim 1 wherein
the step of identifying the received address data file profile includes identifying a received address data file format and received data field structure; and
the step of calculating the first hash value includes calculating based on the received address data file format and received data field structure. 3. The method of claim 2 wherein the steps of calculating hash values further includes calculating based on a quantity of fields in the data file, data types in the fields in the data file, and data field properties. 4. The method of claim 1 wherein the step of identifying the received address data file profile includes querying a sender of the received address data to identify characteristics of the received address data file. 5. The method of claim 1 wherein the step of identifying the received address data file profile includes automatedly analyzing characteristics of data in data fields to determine if the data can be recognized as pertaining to a known type of address data field, and automatically identifying the data fields based on the analyzed characteristics. 6. The method of claim 5 further including a step of requesting that a sender of the received address data file confirm data field characteristics that were automatedly analyzed and identified. 7. The method of claim 1 further including performing address verification and cleansing on the uploaded address file in accordance with the associated known address data profile. 8. The method of claim 1 wherein there are a plurality of services that can be performed on the uploaded address file and the step of calculating the first hash value and the step of generating the new hash include incorporating a value for a particular service, or set of services, that are to be performed. 9. The method of claim 1 including, subsequent to associating the known address data profile of the matching stored hash value with the uploaded address file, a step of receiving further modifications to the known address data profile from a sender and generating a modified hash of the modified profile, and storing the modified profile along with the associated modified hash. 10. A computer system for recognizing and verifying data formats of received address lists for address cleansing, the system comprising one or more computer servers including a processor programmed for performing the following steps:
storing a plurality of address file hash values associated with a plurality of known address data file profiles in a database memory, the address data file profiles including address data file formats and data field structure; receiving an uploaded address file from a sender over a communication network; identifying a received address data file profile of the uploaded address file; calculating a first hash value based on the identified received address data file profile; comparing the first hash value with the stored plurality of address file hash values to determine whether the received address data file has a known data format and structure; and if the first hash value matches one of the stored plurality of hash values, then associating the known address data profile of the matching stored hash value with the uploaded address file; if the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash. 11. The system of claim 10 wherein the processor is further programmed such that:
the step of identifying the received address data file profile includes identifying a received address data file format and received data field structure; and
the step of calculating the first hash value includes calculating based on the received address data file format and received data field structure. 12. The system of claim 11 wherein the processor is further programmed such that the steps of calculating hash values further include calculating based on a quantity of fields in the data file, data types in the fields in the data file, and data field properties. 13. The system of claim 10 wherein the processor is further programmed such that the step of identifying the received address data file profile includes querying the sender of the received address data to identify characteristics of the received address data file. 14. The system of claim 10 wherein the processor is further programmed such that the step of identifying the received address data file profile includes automatedly analyzing characteristics of data in data fields to determine if the data can be recognized as pertaining to a known type of address data field, and automatically identifying the data fields based on the analyzed characteristics. 15. The system of claim 14 wherein the processor is programmed to include a step of requesting that a sender of the received address data file confirm data field characteristics that were automatedly analyzed and identified. 16. The system of claim 10 wherein the processor is further programmed to include a step of performing address verification and cleansing on the uploaded address file in accordance with the associated known address data profile. 17. The system of claim 10 wherein there are a plurality of services that can be performed on the uploaded address file and the processor is further programmed such that the step of calculating the first hash value and the step of generating the new hash include incorporating a value for a particular service, or set of services, that are to be performed. 16. The system of claim 10 wherein the processor is further programmed such that, subsequent to associating the known address data profile of the matching stored hash value with the uploaded address file, there is a step of receiving further modifications to the known address data profile from a sender and generating a modified hash of the modified profile, and storing the modified profile along with the associated modified hash. | A system and method for identifying data fields for remote address cleansing, whereby a plurality of address file hash values are stored and associated with a plurality of known address data file profiles. An uploaded address file is received at the processing site from a sender who wishes to have his address list processed. A received address data file profile is identified for the uploaded address the. A first hash value is calculated based on the identified received address data the profile. The first hash value is compared with the stored plurality of address the hash values. If the first hash value matches one of the stored plurality of hash values, then the known address data profile of the matching stored hash value is associated with the uploaded address file. If the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash.1. A method of recognizing and verifying data formats of received address lists for address cleansing, the method comprising:
storing a plurality of address file hash values associated with a plurality of known address data file profiles, the a dress data file profiles including address data file formats and data field structure; receiving an uploaded address file: identifying a received address data the profile of the uploaded address file; calculating a first hash value based on the identified received address data file profile; comparing the first hash value with the stored plurality of address the hash values to determine whether the received address data file has a known data format and structure; and if the first hash value matches one of the stored plurality of hash values, then associating the known address data profile of the matching stored hash value with the uploaded address file; if the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash. 2. The method of claim 1 wherein
the step of identifying the received address data file profile includes identifying a received address data file format and received data field structure; and
the step of calculating the first hash value includes calculating based on the received address data file format and received data field structure. 3. The method of claim 2 wherein the steps of calculating hash values further includes calculating based on a quantity of fields in the data file, data types in the fields in the data file, and data field properties. 4. The method of claim 1 wherein the step of identifying the received address data file profile includes querying a sender of the received address data to identify characteristics of the received address data file. 5. The method of claim 1 wherein the step of identifying the received address data file profile includes automatedly analyzing characteristics of data in data fields to determine if the data can be recognized as pertaining to a known type of address data field, and automatically identifying the data fields based on the analyzed characteristics. 6. The method of claim 5 further including a step of requesting that a sender of the received address data file confirm data field characteristics that were automatedly analyzed and identified. 7. The method of claim 1 further including performing address verification and cleansing on the uploaded address file in accordance with the associated known address data profile. 8. The method of claim 1 wherein there are a plurality of services that can be performed on the uploaded address file and the step of calculating the first hash value and the step of generating the new hash include incorporating a value for a particular service, or set of services, that are to be performed. 9. The method of claim 1 including, subsequent to associating the known address data profile of the matching stored hash value with the uploaded address file, a step of receiving further modifications to the known address data profile from a sender and generating a modified hash of the modified profile, and storing the modified profile along with the associated modified hash. 10. A computer system for recognizing and verifying data formats of received address lists for address cleansing, the system comprising one or more computer servers including a processor programmed for performing the following steps:
storing a plurality of address file hash values associated with a plurality of known address data file profiles in a database memory, the address data file profiles including address data file formats and data field structure; receiving an uploaded address file from a sender over a communication network; identifying a received address data file profile of the uploaded address file; calculating a first hash value based on the identified received address data file profile; comparing the first hash value with the stored plurality of address file hash values to determine whether the received address data file has a known data format and structure; and if the first hash value matches one of the stored plurality of hash values, then associating the known address data profile of the matching stored hash value with the uploaded address file; if the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash. 11. The system of claim 10 wherein the processor is further programmed such that:
the step of identifying the received address data file profile includes identifying a received address data file format and received data field structure; and
the step of calculating the first hash value includes calculating based on the received address data file format and received data field structure. 12. The system of claim 11 wherein the processor is further programmed such that the steps of calculating hash values further include calculating based on a quantity of fields in the data file, data types in the fields in the data file, and data field properties. 13. The system of claim 10 wherein the processor is further programmed such that the step of identifying the received address data file profile includes querying the sender of the received address data to identify characteristics of the received address data file. 14. The system of claim 10 wherein the processor is further programmed such that the step of identifying the received address data file profile includes automatedly analyzing characteristics of data in data fields to determine if the data can be recognized as pertaining to a known type of address data field, and automatically identifying the data fields based on the analyzed characteristics. 15. The system of claim 14 wherein the processor is programmed to include a step of requesting that a sender of the received address data file confirm data field characteristics that were automatedly analyzed and identified. 16. The system of claim 10 wherein the processor is further programmed to include a step of performing address verification and cleansing on the uploaded address file in accordance with the associated known address data profile. 17. The system of claim 10 wherein there are a plurality of services that can be performed on the uploaded address file and the processor is further programmed such that the step of calculating the first hash value and the step of generating the new hash include incorporating a value for a particular service, or set of services, that are to be performed. 16. The system of claim 10 wherein the processor is further programmed such that, subsequent to associating the known address data profile of the matching stored hash value with the uploaded address file, there is a step of receiving further modifications to the known address data profile from a sender and generating a modified hash of the modified profile, and storing the modified profile along with the associated modified hash. | 2,100 |
5,628 | 5,628 | 14,453,164 | 2,193 | Client side code of a web application can be received by a mobile device. The mobile device can automatically inject mobile aware code into the client side code of the web application. The mobile aware code can modify the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected. The client side code of the web application modified by the mobile aware code can be executed by the mobile device. | 1-7. (canceled) 8. A mobile device, comprising:
a processor programmed to initiate executable operations comprising: receiving client side code of a web application; automatically injecting mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing the client side code of the web application modified by the mobile aware code. 9. The mobile device of claim 8, wherein automatically injecting the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 10. The mobile device of claim 8, wherein automatically injecting the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 11. The mobile device of claim 10, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 12. The mobile device of claim 8, wherein automatically injecting mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 13. The mobile device of claim 8, the executable operations further comprising:
querying a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing a file containing information on revisions to the web application; and revising the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 14. The mobile device of claim 13, wherein automatically injecting the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor of a mobile device to perform a method comprising:
receiving, by the processor of the mobile device, client side code of a web application; automatically injecting, by the processor of the mobile device, mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing, by the processor of the mobile device, the client side code of the web application modified by the mobile aware code. 16. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 17. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 18. The computer program product of claim 17, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 19. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 20. The computer program product of claim 15, the method further comprising:
querying, by the processor of the mobile device, a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing, by the processor of the mobile device, a file containing information on revisions to the web application; and revising, by the processor of the mobile device, the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 21. The computer program product of claim 20, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. | Client side code of a web application can be received by a mobile device. The mobile device can automatically inject mobile aware code into the client side code of the web application. The mobile aware code can modify the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected. The client side code of the web application modified by the mobile aware code can be executed by the mobile device.1-7. (canceled) 8. A mobile device, comprising:
a processor programmed to initiate executable operations comprising: receiving client side code of a web application; automatically injecting mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing the client side code of the web application modified by the mobile aware code. 9. The mobile device of claim 8, wherein automatically injecting the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 10. The mobile device of claim 8, wherein automatically injecting the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 11. The mobile device of claim 10, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 12. The mobile device of claim 8, wherein automatically injecting mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 13. The mobile device of claim 8, the executable operations further comprising:
querying a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing a file containing information on revisions to the web application; and revising the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 14. The mobile device of claim 13, wherein automatically injecting the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor of a mobile device to perform a method comprising:
receiving, by the processor of the mobile device, client side code of a web application; automatically injecting, by the processor of the mobile device, mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing, by the processor of the mobile device, the client side code of the web application modified by the mobile aware code. 16. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 17. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 18. The computer program product of claim 17, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 19. The computer program product of claim 15, wherein automatically injecting, by the processor of the mobile device, mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 20. The computer program product of claim 15, the method further comprising:
querying, by the processor of the mobile device, a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing, by the processor of the mobile device, a file containing information on revisions to the web application; and revising, by the processor of the mobile device, the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 21. The computer program product of claim 20, wherein automatically injecting, by the processor of the mobile device, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. | 2,100 |
5,629 | 5,629 | 14,724,754 | 2,193 | Client side code of a web application can be received by a mobile device. The mobile device can automatically inject mobile aware code into the client side code of the web application. The mobile aware code can modify the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected. The client side code of the web application modified by the mobile aware code can be executed by the mobile device. | 1. A method, comprising:
receiving, by a mobile device, client side code of a web application; automatically injecting, by the mobile device, using a processor, mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing, by the mobile device, the client side code of the web application modified by the mobile aware code. 2. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 3. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 4. The method of claim 3, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 5. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 6. The method of claim 1, further comprising:
querying, by the mobile device, a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing, by the mobile device, a file containing information on revisions to the web application; and revising, by the mobile device, the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 7. The method of claim 6, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. 8-20. (canceled) | Client side code of a web application can be received by a mobile device. The mobile device can automatically inject mobile aware code into the client side code of the web application. The mobile aware code can modify the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected. The client side code of the web application modified by the mobile aware code can be executed by the mobile device.1. A method, comprising:
receiving, by a mobile device, client side code of a web application; automatically injecting, by the mobile device, using a processor, mobile aware code into the client side code of the web application, the mobile aware code modifying the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected; and executing, by the mobile device, the client side code of the web application modified by the mobile aware code. 2. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises overriding with at least one portion of the mobile aware code at least one portion of the client side code of the web application. 3. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises configuring the client side code to load at least a first library optimized for use by the mobile device in lieu of a second library that is not optimized for use by the mobile device. 4. The method of claim 3, wherein configuring the client side code to load at least the first library optimized for use by the mobile device in lieu of the second library that is not optimized for use by the mobile device comprises adding at least one statement to a window document object model (DOM) object of the client side code of the web application, the at least one statement configured to load the first library optimized for the mobile device. 5. The method of claim 1, wherein automatically injecting, by the mobile device, using the processor, mobile aware code into the client side code of the web application comprises injecting the mobile aware code into the client side code prior to an entry point for the web application finishing loading on the mobile device. 6. The method of claim 1, further comprising:
querying, by the mobile device, a server hosting the web application inquiring whether the web application has been revised; responsive to receiving a response from the server indicating that the web application has been revised, accessing, by the mobile device, a file containing information on revisions to the web application; and revising, by the mobile device, the mobile aware code according to the file containing information on revisions to the web application; wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing information on revisions to the web application. 7. The method of claim 6, wherein automatically injecting, by the mobile device, using the processor, the mobile aware code into the client side code of the web application comprises injecting the mobile aware code revised according to the file containing the information on the updates. 8-20. (canceled) | 2,100 |
5,630 | 5,630 | 14,484,592 | 2,114 | Examples of the present disclosure describe implementing bitmap-based data replication when a primary form of data replication between a source device and a target device cannot be used. According to one example, a temporal identifier may be received from the target device. If the source device determines that the primary replication method is unable to be used to replicate data associated with the temporal identifier, a secondary replication method may be initiated. The secondary replication method may utilize a recovery bitmap identifying data blocks that have changed on the source device since a previous event. | 1. A method comprising:
receiving a temporal identifier from a target device; determining that a primary replication method is unable to be used to replicate data associated with the temporal identifier; and initiating replication of data using a secondary replication method, wherein the secondary replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 2. The method according to claim 1, further comprising:
switching back to the primary replication method upon receiving indication that the target device is sufficiently synchronized with the source device. 3. The method according to claim 1, wherein the initiating further comprises sending the recovery bitmap to the target device. 4. The method according to claim 3, wherein the primary replication method is a log-based replication method, the temporal identifier is a log sequence number, and the previous event is a previous replication of data to the target device through a transaction indicated by the log sequence number. 5. The method according to claim 1, further comprising creating the recovery bitmap, wherein creating the recovery bitmap comprises propagating bitmap data throughout a hierarchical bitmap structure maintained on behalf of the target device. 6. The method according to claim 1, further comprising:
tagging, in the recovery bitmap, a starting temporal identifier and an ending temporal identifier for the data blocks that have changed on the source device since the previous event. 7. The method according to claim 1, further comprising:
creating a hierarchical bitmap structure that is maintained on the source device, the hierarchical bitmap structure including a plurality of bitmaps maintained on behalf of the target device, wherein the recovery bitmap comprises an accumulation of data indicated by the plurality of bitmaps. 8. The method according to claim 7, wherein the plurality of bitmaps maintained on behalf of the target device include a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs. 9. The method according to claim 8, wherein data is propagated from the checkpoint bitmap to the accumulating bitmap when the current virtual log represented by the checkpoint bitmap is full. 10. The method according to claim 9, wherein the creating of the hierarchical bitmap structure includes creating the recovery bitmap, and data is propagated from the accumulating bitmap to the recovery bitmap upon determining that the primary replication method is unable to be used to replicate data associated with the temporal identifier. 11. The method according to claim 1, wherein the recovery bitmap identifies a second temporal identifier corresponding to a most recent data change represented by the recovery bitmap. 12. The method according to claim 1, wherein the source device replicates data to a plurality of target devices, and the source device creates and maintains a separate recovery bitmap for each of the plurality of target devices. 13. The method according to claim 1, further comprising:
setting a new bit in the recovery bitmap when a new update is made on the source device, wherein the new bit equates to a range of storage of the source device in which a change has occurred. 14. The method according to claim 1, further comprising:
receiving the second temporal identifier from the target device; determining if the accumulating bitmap for the target device is empty; When the accumulating bitmap for the target device is empty, providing replication to the target device using the primary replication method; and when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. 15. A computer-readable storage medium that when executed on a computer, causes the computer to execute a process comprising:
receiving a temporal identifier from a target device; determining that a primary replication method is unable to be used to replicate data associated with the temporal identifier; and initiating replication of data using a secondary replication method, wherein the secondary replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 16. The computer-readable storage medium according to claim 15, further comprising:
propagating bitmap data through a target-specific bitmap structure including the recovery bitmap, wherein the target-specific bitmap structure further includes:
a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs, and wherein data is propagated from the checkpoint bitmap to the accumulating bitmap when the current virtual log represented by the checkpoint bitmap is full, and data is propagated from the accumulating bitmap to the recovery bitmap upon determining that the primary replication method is unable to be used to replicate data associated with the temporal identifier. 17. The computer-readable storage medium according to claim 16, wherein the process executed by the computer further comprises:
receiving a second temporal identifier from the target device; determining if the accumulating bitmap for the target device is empty; when the accumulating bitmap for the target device is empty, providing replication to the target device using the primary replication method; and when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. 18. A method comprising:
receiving a log sequence number (LSN) from a target device; determining that a log-based replication method is unable to be used to replicate data associated with the LSN; and initiating replication of data using a bitmap-based replication method, wherein the bitmap-based replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 19. The method according to claim 18, wherein bits of data are transmitted from the recovery bitmap to the target device for replication, and each bit of data equates to a range of disk data from the source device in which a change has occurred since a previous replication to the target device. 20. The method according to claim 18, wherein the initiating further comprises propagating bitmap data through a target-specific bitmap structure including the recovery bitmap, the target-specific bitmap structure including a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs, and
wherein the method further comprises:
receiving a second LSN from the target device;
determining if the accumulating bitmap for the target device is empty;
when the accumulating bitmap for the target device is empty, providing replication to the target device using the bitmap-based replication method; and
when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. | Examples of the present disclosure describe implementing bitmap-based data replication when a primary form of data replication between a source device and a target device cannot be used. According to one example, a temporal identifier may be received from the target device. If the source device determines that the primary replication method is unable to be used to replicate data associated with the temporal identifier, a secondary replication method may be initiated. The secondary replication method may utilize a recovery bitmap identifying data blocks that have changed on the source device since a previous event.1. A method comprising:
receiving a temporal identifier from a target device; determining that a primary replication method is unable to be used to replicate data associated with the temporal identifier; and initiating replication of data using a secondary replication method, wherein the secondary replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 2. The method according to claim 1, further comprising:
switching back to the primary replication method upon receiving indication that the target device is sufficiently synchronized with the source device. 3. The method according to claim 1, wherein the initiating further comprises sending the recovery bitmap to the target device. 4. The method according to claim 3, wherein the primary replication method is a log-based replication method, the temporal identifier is a log sequence number, and the previous event is a previous replication of data to the target device through a transaction indicated by the log sequence number. 5. The method according to claim 1, further comprising creating the recovery bitmap, wherein creating the recovery bitmap comprises propagating bitmap data throughout a hierarchical bitmap structure maintained on behalf of the target device. 6. The method according to claim 1, further comprising:
tagging, in the recovery bitmap, a starting temporal identifier and an ending temporal identifier for the data blocks that have changed on the source device since the previous event. 7. The method according to claim 1, further comprising:
creating a hierarchical bitmap structure that is maintained on the source device, the hierarchical bitmap structure including a plurality of bitmaps maintained on behalf of the target device, wherein the recovery bitmap comprises an accumulation of data indicated by the plurality of bitmaps. 8. The method according to claim 7, wherein the plurality of bitmaps maintained on behalf of the target device include a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs. 9. The method according to claim 8, wherein data is propagated from the checkpoint bitmap to the accumulating bitmap when the current virtual log represented by the checkpoint bitmap is full. 10. The method according to claim 9, wherein the creating of the hierarchical bitmap structure includes creating the recovery bitmap, and data is propagated from the accumulating bitmap to the recovery bitmap upon determining that the primary replication method is unable to be used to replicate data associated with the temporal identifier. 11. The method according to claim 1, wherein the recovery bitmap identifies a second temporal identifier corresponding to a most recent data change represented by the recovery bitmap. 12. The method according to claim 1, wherein the source device replicates data to a plurality of target devices, and the source device creates and maintains a separate recovery bitmap for each of the plurality of target devices. 13. The method according to claim 1, further comprising:
setting a new bit in the recovery bitmap when a new update is made on the source device, wherein the new bit equates to a range of storage of the source device in which a change has occurred. 14. The method according to claim 1, further comprising:
receiving the second temporal identifier from the target device; determining if the accumulating bitmap for the target device is empty; When the accumulating bitmap for the target device is empty, providing replication to the target device using the primary replication method; and when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. 15. A computer-readable storage medium that when executed on a computer, causes the computer to execute a process comprising:
receiving a temporal identifier from a target device; determining that a primary replication method is unable to be used to replicate data associated with the temporal identifier; and initiating replication of data using a secondary replication method, wherein the secondary replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 16. The computer-readable storage medium according to claim 15, further comprising:
propagating bitmap data through a target-specific bitmap structure including the recovery bitmap, wherein the target-specific bitmap structure further includes:
a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs, and wherein data is propagated from the checkpoint bitmap to the accumulating bitmap when the current virtual log represented by the checkpoint bitmap is full, and data is propagated from the accumulating bitmap to the recovery bitmap upon determining that the primary replication method is unable to be used to replicate data associated with the temporal identifier. 17. The computer-readable storage medium according to claim 16, wherein the process executed by the computer further comprises:
receiving a second temporal identifier from the target device; determining if the accumulating bitmap for the target device is empty; when the accumulating bitmap for the target device is empty, providing replication to the target device using the primary replication method; and when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. 18. A method comprising:
receiving a log sequence number (LSN) from a target device; determining that a log-based replication method is unable to be used to replicate data associated with the LSN; and initiating replication of data using a bitmap-based replication method, wherein the bitmap-based replication method utilizes a recovery bitmap identifying data blocks that have changed on a source device since a previous event. 19. The method according to claim 18, wherein bits of data are transmitted from the recovery bitmap to the target device for replication, and each bit of data equates to a range of disk data from the source device in which a change has occurred since a previous replication to the target device. 20. The method according to claim 18, wherein the initiating further comprises propagating bitmap data through a target-specific bitmap structure including the recovery bitmap, the target-specific bitmap structure including a checkpoint bitmap corresponding to data records in a current virtual log, and an accumulating bitmap corresponding to data records in previous virtual logs, and
wherein the method further comprises:
receiving a second LSN from the target device;
determining if the accumulating bitmap for the target device is empty;
when the accumulating bitmap for the target device is empty, providing replication to the target device using the bitmap-based replication method; and
when the accumulating bitmap for the target is not empty, propagating data from the accumulating bitmap to the recovery bitmap and sending the recovery bitmap to the target device. | 2,100 |
5,631 | 5,631 | 15,199,609 | 2,153 | A system and method for information retrieval are presented. A natural language query is received from a client computer. The natural language query is analyzed to identify a plurality of terms, and a relationship between a pair of terms in the plurality of terms is determined using a knowledge model. The knowledge model defines a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain. A triple statement is constructed using the relationship between the pair of terms, and a query is executed against a knowledge base using the triple statement to generate a set of results. The knowledge base identifies a plurality of items, each of the plurality of items is associated with at least one annotation identifying at one of the entities in the knowledge model. The set of results are transmitted to the client computer. | 1. An information retrieval system, comprising:
a knowledge model database configured to store a knowledge model for a knowledge domain, the knowledge model defining a plurality of entities and interrelationships between one or more of the plurality of entities; a knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and a query processing server configured to:
receive, from a client computer, a natural language query using a computer network,
analyze the natural language query to identify a plurality of terms,
identify a first entity in the knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms,
construct a triple statement including the pair of terms and the first entity in the knowledge model database,
execute a query against the knowledge base using the triple statement to generate a set of results, and
transmit, to the client computer, the set of results. 2. The information retrieval system of claim 1, wherein the query processing server is configured to:
analyze the natural language query using named entity recognition. 3. The information retrieval system of claim 1, wherein the knowledge model database is configured as a triplestore. 4. The information retrieval system of claim 1, wherein the query processing server is configured to:
determine a distance between each term in the pair of terms using the knowledge model database. 5. The information retrieval system of claim 4, wherein the query processing server is configured to, when the distance between each term in the pair of terms is two or greater, discard the pair of terms. 6. The information retrieval system of claim 1, wherein the query processing server is configured to:
determine a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 7. The information retrieval system of claim 6, wherein the query processing server is configured to,when the type of each term in the pair of terms is the instance type or the concept type, analyze each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, include the linking term in the query. 8. A method for information retrieval, comprising:
receiving, from a client computer, a natural language query using a computer network; analyzing the natural language query to identify a plurality of terms; identifying a first entity in a knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms, the knowledge model database defining a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain; constructing a triple statement including the pair of terms and the first entity in the knowledge model database; executing a query against a knowledge base using the triple statement to generate a set of results, the knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and transmitting, to the client computer, the set of results. 9. The method of claim 8, including analyzing the natural language query using named entity recognition. 10. The method of claim 8, wherein the knowledge model database is configured as a triplestore. 11. The method of claim 8, including determining a distance between each term in the pair of terms using the knowledge model database. 12. The method of claim 11, including, when the distance between each term in the pair of terms is two or greater, discarding the pair of terms. 13. The method of claim 8, including determining a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 14. The method of claim 13, including, when the type of each term in the pair of terms is the instance type or the concept type, analyzing each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, and including the linking term in the query. 15. A non-transitory computer-readable medium containing instructions that, when executed by a processor, cause the processor to perform the steps of:
receiving, from a client computer, a natural language query using a computer network; analyzing the natural language query to identify a plurality of terms;
identifying a first entity in a knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms, the knowledge model database defining a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain;
constructing a triple statement including the pair of terms and the first entity in the knowledge model database;
executing a query against a knowledge base using the triple statement to generate a set of results, the knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and
transmitting, to the client computer, the set of results. 16. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
analyzing the natural language query using named entity recognition. 17. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
determining a distance between each term in the pair of terms using the knowledge model database. 18. The non-transitory computer-readable medium of claim 17, including instructions that, when executed by a processor, cause the processor to perform the steps of, when the distance between each term in the pair of terms is two or greater, discarding the pair of terms. 19. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
determining a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 20. The non-transitory computer-readable medium of claim 19, including instructions that, when executed by a processor, cause the processor to perform the steps of, when the type of each term in the pair of terms is the instance type or the concept type, analyzing each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, and including the linking term in the query. | A system and method for information retrieval are presented. A natural language query is received from a client computer. The natural language query is analyzed to identify a plurality of terms, and a relationship between a pair of terms in the plurality of terms is determined using a knowledge model. The knowledge model defines a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain. A triple statement is constructed using the relationship between the pair of terms, and a query is executed against a knowledge base using the triple statement to generate a set of results. The knowledge base identifies a plurality of items, each of the plurality of items is associated with at least one annotation identifying at one of the entities in the knowledge model. The set of results are transmitted to the client computer.1. An information retrieval system, comprising:
a knowledge model database configured to store a knowledge model for a knowledge domain, the knowledge model defining a plurality of entities and interrelationships between one or more of the plurality of entities; a knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and a query processing server configured to:
receive, from a client computer, a natural language query using a computer network,
analyze the natural language query to identify a plurality of terms,
identify a first entity in the knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms,
construct a triple statement including the pair of terms and the first entity in the knowledge model database,
execute a query against the knowledge base using the triple statement to generate a set of results, and
transmit, to the client computer, the set of results. 2. The information retrieval system of claim 1, wherein the query processing server is configured to:
analyze the natural language query using named entity recognition. 3. The information retrieval system of claim 1, wherein the knowledge model database is configured as a triplestore. 4. The information retrieval system of claim 1, wherein the query processing server is configured to:
determine a distance between each term in the pair of terms using the knowledge model database. 5. The information retrieval system of claim 4, wherein the query processing server is configured to, when the distance between each term in the pair of terms is two or greater, discard the pair of terms. 6. The information retrieval system of claim 1, wherein the query processing server is configured to:
determine a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 7. The information retrieval system of claim 6, wherein the query processing server is configured to,when the type of each term in the pair of terms is the instance type or the concept type, analyze each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, include the linking term in the query. 8. A method for information retrieval, comprising:
receiving, from a client computer, a natural language query using a computer network; analyzing the natural language query to identify a plurality of terms; identifying a first entity in a knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms, the knowledge model database defining a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain; constructing a triple statement including the pair of terms and the first entity in the knowledge model database; executing a query against a knowledge base using the triple statement to generate a set of results, the knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and transmitting, to the client computer, the set of results. 9. The method of claim 8, including analyzing the natural language query using named entity recognition. 10. The method of claim 8, wherein the knowledge model database is configured as a triplestore. 11. The method of claim 8, including determining a distance between each term in the pair of terms using the knowledge model database. 12. The method of claim 11, including, when the distance between each term in the pair of terms is two or greater, discarding the pair of terms. 13. The method of claim 8, including determining a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 14. The method of claim 13, including, when the type of each term in the pair of terms is the instance type or the concept type, analyzing each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, and including the linking term in the query. 15. A non-transitory computer-readable medium containing instructions that, when executed by a processor, cause the processor to perform the steps of:
receiving, from a client computer, a natural language query using a computer network; analyzing the natural language query to identify a plurality of terms;
identifying a first entity in a knowledge model database that is related to at least one term in a pair of terms selected from the plurality of terms, the knowledge model database defining a plurality of entities and interrelationships between one or more of the plurality of entities for a knowledge domain;
constructing a triple statement including the pair of terms and the first entity in the knowledge model database;
executing a query against a knowledge base using the triple statement to generate a set of results, the knowledge base identifying a plurality of items, each of the plurality of items being associated with at least one annotation identifying at one of the entities in the knowledge model database; and
transmitting, to the client computer, the set of results. 16. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
analyzing the natural language query using named entity recognition. 17. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
determining a distance between each term in the pair of terms using the knowledge model database. 18. The non-transitory computer-readable medium of claim 17, including instructions that, when executed by a processor, cause the processor to perform the steps of, when the distance between each term in the pair of terms is two or greater, discarding the pair of terms. 19. The non-transitory computer-readable medium of claim 15, including instructions that, when executed by a processor, cause the processor to perform the steps of:
determining a type of each term in the pair of terms, where the type is one of an instance type, a concept type, and a relationship type. 20. The non-transitory computer-readable medium of claim 19, including instructions that, when executed by a processor, cause the processor to perform the steps of, when the type of each term in the pair of terms is the instance type or the concept type, analyzing each of the plurality of the terms to identify a linking term having a type that is the relationship type, where the linking term links the pair of terms in the knowledge model database, and including the linking term in the query. | 2,100 |
5,632 | 5,632 | 15,336,622 | 2,164 | Systems and methods are provided for generating a GUI from multiple JavaScript Object Notation (JSON) files. One embodiment is a system that includes a memory storing multiple JSON files. Each JSON file stores JSON objects that each define a portion of a Graphical User Interface (GUI). The system also includes a controller that reviews dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files, determines an order for the JSON objects based on their dependencies, and generates a master JSON file by including JSON objects from each of the JSON files in the determined order. | 1. A system comprising:
a memory storing multiple JavaScript Object Notation (JSON) files, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); and a controller that reviews dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files, determines an order for the JSON objects based on their dependencies, and generates a master JSON file by including JSON objects from each of the JSON files in the determined order. 2. The system of claim 1 wherein:
the JSON objects include other JSON objects by reference. 3. The system of claim 1 wherein:
each of the JSON objects defines a location for an element of the GUI. 4. The system of claim 1 wherein:
the controller further identifies changes to the JSON files, and generates a new master JSON file in response to identifying the changes. 5. The system of claim 1 wherein:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 6. The system of claim 1 wherein:
the controller reviews the JSON objects for compatibility with JSON standards, and removes JSON objects that are not compatible with JSON standards from the master JSON file. 7. The system of claim 1 wherein:
a dependency of a first JSON object upon a second JSON object means that the first JSON object should be processed after the second JSON object in order to avoid an error when generating the GUI. 8. A method comprising:
identifying multiple JavaScript Object Notation (JSON) files for merging into a master JSON file, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); reviewing dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files; determining an order for the JSON objects based on their dependencies; and generating a master JSON file by including JSON objects from each of the JSON files in the determined order. 9. The method of claim 8 wherein:
the JSON objects include other JSON objects by reference. 10. The method of claim 8 wherein:
each of the JSON objects defines a location for an element of the GUI. 11. The method of claim 8 further comprising:
identifying changes to the JSON files;
generating a new master JSON file in response to identifying the changes. 12. The method of claim 8 further comprising:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 13. The method of claim 8 further comprising:
reviewing the JSON objects for compatibility with JSON standards; and
removing JSON objects that are not compatible with JSON standards from the master JSON file. 14. The method of claim 8 wherein:
a dependency of a first JSON object upon a second JSON object means that the first JSON object should be processed after the second JSON object in order to avoid an error when generating the GUI. 15. A non-transitory computer readable medium embodying programmed instructions which, when executed by a processor, are operable for performing a method comprising:
identifying multiple JavaScript Object Notation (JSON) files for merging into a master JSON file, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); reviewing dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files; determining an order for the JSON objects based on their dependencies; and generating a master JSON file by including JSON objects from each of the JSON files in the determined order. 16. The medium of claim 15 wherein:
the JSON objects include other JSON objects by reference. 17. The medium of claim 15 wherein:
each of the JSON objects defines a location for an element of the GUI. 18. The medium of claim 15 wherein the method further comprises:
identifying changes to the JSON files;
generating a new master JSON file in response to identifying the changes. 19. The medium of claim 15 wherein the method further comprises:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 20. The medium of claim 15 wherein the method further comprises:
reviewing the JSON objects for compatibility with JSON standards; and
removing JSON objects that are not compatible with JSON standards from the master JSON file. | Systems and methods are provided for generating a GUI from multiple JavaScript Object Notation (JSON) files. One embodiment is a system that includes a memory storing multiple JSON files. Each JSON file stores JSON objects that each define a portion of a Graphical User Interface (GUI). The system also includes a controller that reviews dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files, determines an order for the JSON objects based on their dependencies, and generates a master JSON file by including JSON objects from each of the JSON files in the determined order.1. A system comprising:
a memory storing multiple JavaScript Object Notation (JSON) files, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); and a controller that reviews dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files, determines an order for the JSON objects based on their dependencies, and generates a master JSON file by including JSON objects from each of the JSON files in the determined order. 2. The system of claim 1 wherein:
the JSON objects include other JSON objects by reference. 3. The system of claim 1 wherein:
each of the JSON objects defines a location for an element of the GUI. 4. The system of claim 1 wherein:
the controller further identifies changes to the JSON files, and generates a new master JSON file in response to identifying the changes. 5. The system of claim 1 wherein:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 6. The system of claim 1 wherein:
the controller reviews the JSON objects for compatibility with JSON standards, and removes JSON objects that are not compatible with JSON standards from the master JSON file. 7. The system of claim 1 wherein:
a dependency of a first JSON object upon a second JSON object means that the first JSON object should be processed after the second JSON object in order to avoid an error when generating the GUI. 8. A method comprising:
identifying multiple JavaScript Object Notation (JSON) files for merging into a master JSON file, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); reviewing dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files; determining an order for the JSON objects based on their dependencies; and generating a master JSON file by including JSON objects from each of the JSON files in the determined order. 9. The method of claim 8 wherein:
the JSON objects include other JSON objects by reference. 10. The method of claim 8 wherein:
each of the JSON objects defines a location for an element of the GUI. 11. The method of claim 8 further comprising:
identifying changes to the JSON files;
generating a new master JSON file in response to identifying the changes. 12. The method of claim 8 further comprising:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 13. The method of claim 8 further comprising:
reviewing the JSON objects for compatibility with JSON standards; and
removing JSON objects that are not compatible with JSON standards from the master JSON file. 14. The method of claim 8 wherein:
a dependency of a first JSON object upon a second JSON object means that the first JSON object should be processed after the second JSON object in order to avoid an error when generating the GUI. 15. A non-transitory computer readable medium embodying programmed instructions which, when executed by a processor, are operable for performing a method comprising:
identifying multiple JavaScript Object Notation (JSON) files for merging into a master JSON file, each JSON file storing JSON objects that each define a portion of a Graphical User Interface (GUI); reviewing dependency information within the JSON files to identify dependencies between JSON objects stored in the JSON files; determining an order for the JSON objects based on their dependencies; and generating a master JSON file by including JSON objects from each of the JSON files in the determined order. 16. The medium of claim 15 wherein:
the JSON objects include other JSON objects by reference. 17. The medium of claim 15 wherein:
each of the JSON objects defines a location for an element of the GUI. 18. The medium of claim 15 wherein the method further comprises:
identifying changes to the JSON files;
generating a new master JSON file in response to identifying the changes. 19. The medium of claim 15 wherein the method further comprises:
the dependency information comprises a custom JSON name/value pair, within a JSON object, that refers to another JSON object. 20. The medium of claim 15 wherein the method further comprises:
reviewing the JSON objects for compatibility with JSON standards; and
removing JSON objects that are not compatible with JSON standards from the master JSON file. | 2,100 |
5,633 | 5,633 | 13,978,106 | 2,128 | The invention describes a method of determining virtual tooth restorations on the basis of scan data (D) of oral structures, wherein a model database (DB) comprising a number of parameterized tooth models for each of several tooth types is used, whereby the parameterization is carried out on the basis of model parameters comprising position parameters and/or shape parameters and whereby each tooth model (M) is linked with a number of tooth models (M) of the same tooth type, and wherein, for each desired tooth type, an optimal tooth model (M) in the model database (DB) is determined by means of an iterative method in which initially at least one start tooth model (M) of the desired tooth type is selected from the model database (DB), and subsequently, commencing with this start tooth model (M), in each iteration step (S) a tooth model (M) is tested with regard to a quality value, wherein for individualization, the tooth model (M) currently in test is adjusted to the scan data (D) by varying model parameters and a quality value is computed for this individualization. Furthermore, at least one tooth model (M) linked with the tooth model (M) in test is also, for individualization, adjusted to the scan data (D) by variation of model parameters and a further quality value is computed for this individualization. On the basis of the computed quality values, a new tooth model (M) in test of the desired tooth type is selected if necessary from the model database (DB) for the next iteration step (S). Iteration is interrupted upon reaching a quality criterion, and finally at least one virtual tooth restoration is determined from among the optimal tooth models (M) and scan data (D). The invention also describes a method of generating a model database (DB) for use in such a method, a method of manufacturing or selecting a tooth restoration part, and a tooth restoration determination system ( 5 ) for determining virtual tooth restorations. | 1. Method of determining virtual tooth restorations on the basis of scan data (D) of oral structures, wherein
a model database (DB) comprising a number of parameterized tooth models for each of several tooth types is used, whereby the parameterization is carried out on the basis of model parameters comprising position parameters and/or shape parameters and whereby each tooth model (M) is linked with a number of tooth models (M) of the same tooth type, for each desired tooth type, an optimal tooth model (M) in the model database (DB) is determined by means of an iterative method in which initially at least one start tooth model (M) of the desired tooth type is selected from the model database (DB), and subsequently, commencing with this start tooth model (M), in each iteration step (S) a tooth model (M) is tested with regard to a quality value, wherein
for individualization, the tooth model (M) currently in test is adjusted to the scan data (D) by varying model parameters and a quality value is computed for this individualization,
at least one tooth model (M) linked with the tooth model (M) in test is also, for individualization, adjusted to the scan data (D) by variation of model parameters and a further quality value is computed for this individualization,
on the basis of the computed quality values, a new tooth model (M) in test of the desired tooth type is selected if necessary from the model database (DB) for the next iteration step (S),
iteration is interrupted upon reaching a quality criterion,
and finally at least one virtual tooth restoration is determined from among the optimal tooth models (M) and scan data (D). 2. Method according to claim 1, characterized in that, for each desired tooth type of a tooth type group, an optimal tooth model (M) in the model database (DB) is determined by an iterative method in which initially, for each desired tooth type, at least one start tooth model (M) is selected from the model database (DB) and then, commencing with these start tooth models (M), a group of tooth models (M) is tested in each iteration step (S) with regard to a (group) quality value,
wherein
the tooth model (M) group currently in test is adjusted for individualization to the scan data (D) by variation of model parameters and a quality value is computed,
at least one further group of tooth models (M) is also adjusted for individualization to the scan data (D) by variation of model parameters, and a further quality value is computed, whereby, to form the further group, at least one tooth model (M) of the group currently in test is replaced by a tooth model (M) that is linked to it,
if necessary, a new group of tooth models (M) of the desired tooth types is selected for the next iteration step (S) from the model database (DB), on the basis of the computed quality values,
the iteration is interrupted upon reaching a quality criterion. 3. Method according to any of claims 1 to 2, characterized in that the individualization of tooth models (M) is performed by solving an optimization problem, in which an optimization value results from a number of optimization partial values, whereby at least some of the optimization partial values are chosen to describe at least one of the following optimization criteria:
the adjustment of tooth models (M) to teeth and/or remaining tooth structure,
the adjustment of tooth models (M) to opposing dentition,
the adjustment of tooth models (M) to bite registrations,
the adjustment of tooth models (M) to adjacent teeth,
the adjustment of tooth models (M) to preparation lines (LP) and/or segmentation lines (LS),
the adjustment of tooth models (M) to anatomical landmarks (AL),
the mechanical stability of virtual tooth restorations (R) belonging to tooth models (M),
the aesthetic effect of virtual tooth restorations (R) belonging to tooth models (M),
the contacts of tooth models (M),
the spatial relations of the positions of tooth models (M)
the spatial relations of the shapes of tooth models (M). 4. Method according to any of claims 1 to 3, characterized in that, after determination of the optimal tooth models (M) and prior to determining the virtual tooth restorations (R), a precision adjustment of the optimal tooth models (M) is performed relative to each other and/or to the scan data (D). 5. Method according to any of claims 1 to 4, characterized in that the search for an optimal tooth model (M) of a tooth type commences with at least one start tooth model (M), which start tooth model (M)
is defined in the model database (DB) and/or
is a mean tooth model (M) of tooth models (M) of the tooth type and/or
is determined from a geometrical analysis of the scan data. 6. Method according to any of claims 1 to 5, characterized in that the search for an optimal tooth model (M) of a tooth type commences with several start tooth models (M) of the tooth type, which start tooth models (M)
are defined in the model database (DB) and/or
are mean tooth models (M) of sub-groups of the tooth models (M) of the tooth type and/or
are determined from a geometrical analysis of the scan data. 7. Method according to any of claims 1 to 6, characterized in that the available tooth types of a model database (DB) are forwarded for selection to a selection unit, and desired tooth types are selected with the aid of a selection signal, and the method is performed on the basis of the tooth types thus selected. 8. Method according to any of claims 1 to 7, characterized in that tooth types and/or tooth models (M) of a desired tooth type, available in the model database (DB), are forwarded for selection to a selection unit, and desired tooth types and/or tooth models (M) are selected with the aid of a selection signal, and the optimal tooth models (M) are determined on this basis. 9. Method according to any of claims 1 to 8, characterized in that the shape parameters of the tooth models (M) are ordered according to their influence on the tooth model geometry and/or in that the shape parameters of the tooth models (M) parameterize three-dimensional transformation fields for the tooth models (M) and/or are geometrical construction parameters. 10. Method of manufacturing or selecting a tooth restoration part, wherein at first, on the basis of scan data (D) of oral structures, a virtual tooth restoration (R) is determined by a method according to any of claims 1 to 9, and the tooth restoration part is subsequently manufactured or chosen from a set of prefabricated tooth restoration parts, based on the determined virtual tooth restoration (R). 11. Method of generating a model database (DB) comprising a number of parameterized tooth models (M) for each of a number of different tooth types, for use in the method according to any of claims 1 to 9, whereby parameterization is performed on the basis of model parameters comprising position parameters and/or shape parameters, and whereby each tooth model (M) is linked (L) with a number of tooth models (M) of the same tooth type. 12. Method according to claim 11, characterized in that at least parts of the model database (DB) are built by the analysis of a set of scan data (D) of artificial and/or natural oral structures, in which, for a desired tooth type,
the scan data (D) are optionally segmented in order to obtain scan data (D) of the desired tooth type, tooth models (M) of the model database (DB) are constructed by adjustment to the scan data (D) of the desired tooth type, an analysis of morphological differences among the tooth models is carried out, wherein a difference value is computed for each possible pair of tooth models (M), clusters (C1, C2, C3, C4) of morphologically similar tooth models (M) are formed by an analysis of difference values amongst the tooth models (M), a linking (L) of tooth models (M) within the clusters (C1, C2, C3, C4) and of mean tooth models (M) of the clusters (C1, C2, C3, C4) is performed. 13. Method according to claim 12, characterized in that parameterized geometrical transformations are added to the tooth models (M), defined in that the shape of a tooth model (M) can be smoothly transformed to at least one tooth model (M) of the same cluster (C1, C2, C3, C4) linked to that tooth model (M). 14. A computer program product, directly loadable in the memory of a computer, comprising program code means for carrying out all steps of a method according to any of claims 1 to 13 when said computer program product is run on the computer. 15. Tooth restoration determination system (5) for determining virtual tooth restorations on the basis of scan data (D) of oral structures, comprising
an interface (11) for receiving scan data (D) measured by a measurement means, a selection unit (14) for determining the tooth types to be used by the method, a memory means (12) with a model database (DB) that comprises a number of parameterized tooth models (M) for each of several tooth types, wherein the parameterization is performed using model parameters comprising position parameters and/or shape parameters, and wherein each tooth model (M) is linked (L) with a number of tooth models (M) of the same tooth type, an optimization unit (15), realised to determine an optimal tooth model (M) from the model database (DB) for each desired tooth type, using an iterative method in which, commencing with at least one start tooth model (M) a tooth model (M) is tested with regard to a quality value at each iteration step (S), a loading unit (16), realised to load tooth models (M) from a model database (DB), an Individualization unit (17), realised to adjust at least one tooth model (M) currently in test, and at least one tooth model (M) linked to the tooth model (M) currently in test, to the scan data (D) for individualization by varying model parameters, a quality determination unit (18), realised to determine quality values for individualization of the tooth models (M) and to assess quality criteria for interruption of the iteration, and a restoration unit (19), realised to determine at least one virtual tooth restoration (R) from the optimal tooth models (M) and scan data (D). | The invention describes a method of determining virtual tooth restorations on the basis of scan data (D) of oral structures, wherein a model database (DB) comprising a number of parameterized tooth models for each of several tooth types is used, whereby the parameterization is carried out on the basis of model parameters comprising position parameters and/or shape parameters and whereby each tooth model (M) is linked with a number of tooth models (M) of the same tooth type, and wherein, for each desired tooth type, an optimal tooth model (M) in the model database (DB) is determined by means of an iterative method in which initially at least one start tooth model (M) of the desired tooth type is selected from the model database (DB), and subsequently, commencing with this start tooth model (M), in each iteration step (S) a tooth model (M) is tested with regard to a quality value, wherein for individualization, the tooth model (M) currently in test is adjusted to the scan data (D) by varying model parameters and a quality value is computed for this individualization. Furthermore, at least one tooth model (M) linked with the tooth model (M) in test is also, for individualization, adjusted to the scan data (D) by variation of model parameters and a further quality value is computed for this individualization. On the basis of the computed quality values, a new tooth model (M) in test of the desired tooth type is selected if necessary from the model database (DB) for the next iteration step (S). Iteration is interrupted upon reaching a quality criterion, and finally at least one virtual tooth restoration is determined from among the optimal tooth models (M) and scan data (D). The invention also describes a method of generating a model database (DB) for use in such a method, a method of manufacturing or selecting a tooth restoration part, and a tooth restoration determination system ( 5 ) for determining virtual tooth restorations.1. Method of determining virtual tooth restorations on the basis of scan data (D) of oral structures, wherein
a model database (DB) comprising a number of parameterized tooth models for each of several tooth types is used, whereby the parameterization is carried out on the basis of model parameters comprising position parameters and/or shape parameters and whereby each tooth model (M) is linked with a number of tooth models (M) of the same tooth type, for each desired tooth type, an optimal tooth model (M) in the model database (DB) is determined by means of an iterative method in which initially at least one start tooth model (M) of the desired tooth type is selected from the model database (DB), and subsequently, commencing with this start tooth model (M), in each iteration step (S) a tooth model (M) is tested with regard to a quality value, wherein
for individualization, the tooth model (M) currently in test is adjusted to the scan data (D) by varying model parameters and a quality value is computed for this individualization,
at least one tooth model (M) linked with the tooth model (M) in test is also, for individualization, adjusted to the scan data (D) by variation of model parameters and a further quality value is computed for this individualization,
on the basis of the computed quality values, a new tooth model (M) in test of the desired tooth type is selected if necessary from the model database (DB) for the next iteration step (S),
iteration is interrupted upon reaching a quality criterion,
and finally at least one virtual tooth restoration is determined from among the optimal tooth models (M) and scan data (D). 2. Method according to claim 1, characterized in that, for each desired tooth type of a tooth type group, an optimal tooth model (M) in the model database (DB) is determined by an iterative method in which initially, for each desired tooth type, at least one start tooth model (M) is selected from the model database (DB) and then, commencing with these start tooth models (M), a group of tooth models (M) is tested in each iteration step (S) with regard to a (group) quality value,
wherein
the tooth model (M) group currently in test is adjusted for individualization to the scan data (D) by variation of model parameters and a quality value is computed,
at least one further group of tooth models (M) is also adjusted for individualization to the scan data (D) by variation of model parameters, and a further quality value is computed, whereby, to form the further group, at least one tooth model (M) of the group currently in test is replaced by a tooth model (M) that is linked to it,
if necessary, a new group of tooth models (M) of the desired tooth types is selected for the next iteration step (S) from the model database (DB), on the basis of the computed quality values,
the iteration is interrupted upon reaching a quality criterion. 3. Method according to any of claims 1 to 2, characterized in that the individualization of tooth models (M) is performed by solving an optimization problem, in which an optimization value results from a number of optimization partial values, whereby at least some of the optimization partial values are chosen to describe at least one of the following optimization criteria:
the adjustment of tooth models (M) to teeth and/or remaining tooth structure,
the adjustment of tooth models (M) to opposing dentition,
the adjustment of tooth models (M) to bite registrations,
the adjustment of tooth models (M) to adjacent teeth,
the adjustment of tooth models (M) to preparation lines (LP) and/or segmentation lines (LS),
the adjustment of tooth models (M) to anatomical landmarks (AL),
the mechanical stability of virtual tooth restorations (R) belonging to tooth models (M),
the aesthetic effect of virtual tooth restorations (R) belonging to tooth models (M),
the contacts of tooth models (M),
the spatial relations of the positions of tooth models (M)
the spatial relations of the shapes of tooth models (M). 4. Method according to any of claims 1 to 3, characterized in that, after determination of the optimal tooth models (M) and prior to determining the virtual tooth restorations (R), a precision adjustment of the optimal tooth models (M) is performed relative to each other and/or to the scan data (D). 5. Method according to any of claims 1 to 4, characterized in that the search for an optimal tooth model (M) of a tooth type commences with at least one start tooth model (M), which start tooth model (M)
is defined in the model database (DB) and/or
is a mean tooth model (M) of tooth models (M) of the tooth type and/or
is determined from a geometrical analysis of the scan data. 6. Method according to any of claims 1 to 5, characterized in that the search for an optimal tooth model (M) of a tooth type commences with several start tooth models (M) of the tooth type, which start tooth models (M)
are defined in the model database (DB) and/or
are mean tooth models (M) of sub-groups of the tooth models (M) of the tooth type and/or
are determined from a geometrical analysis of the scan data. 7. Method according to any of claims 1 to 6, characterized in that the available tooth types of a model database (DB) are forwarded for selection to a selection unit, and desired tooth types are selected with the aid of a selection signal, and the method is performed on the basis of the tooth types thus selected. 8. Method according to any of claims 1 to 7, characterized in that tooth types and/or tooth models (M) of a desired tooth type, available in the model database (DB), are forwarded for selection to a selection unit, and desired tooth types and/or tooth models (M) are selected with the aid of a selection signal, and the optimal tooth models (M) are determined on this basis. 9. Method according to any of claims 1 to 8, characterized in that the shape parameters of the tooth models (M) are ordered according to their influence on the tooth model geometry and/or in that the shape parameters of the tooth models (M) parameterize three-dimensional transformation fields for the tooth models (M) and/or are geometrical construction parameters. 10. Method of manufacturing or selecting a tooth restoration part, wherein at first, on the basis of scan data (D) of oral structures, a virtual tooth restoration (R) is determined by a method according to any of claims 1 to 9, and the tooth restoration part is subsequently manufactured or chosen from a set of prefabricated tooth restoration parts, based on the determined virtual tooth restoration (R). 11. Method of generating a model database (DB) comprising a number of parameterized tooth models (M) for each of a number of different tooth types, for use in the method according to any of claims 1 to 9, whereby parameterization is performed on the basis of model parameters comprising position parameters and/or shape parameters, and whereby each tooth model (M) is linked (L) with a number of tooth models (M) of the same tooth type. 12. Method according to claim 11, characterized in that at least parts of the model database (DB) are built by the analysis of a set of scan data (D) of artificial and/or natural oral structures, in which, for a desired tooth type,
the scan data (D) are optionally segmented in order to obtain scan data (D) of the desired tooth type, tooth models (M) of the model database (DB) are constructed by adjustment to the scan data (D) of the desired tooth type, an analysis of morphological differences among the tooth models is carried out, wherein a difference value is computed for each possible pair of tooth models (M), clusters (C1, C2, C3, C4) of morphologically similar tooth models (M) are formed by an analysis of difference values amongst the tooth models (M), a linking (L) of tooth models (M) within the clusters (C1, C2, C3, C4) and of mean tooth models (M) of the clusters (C1, C2, C3, C4) is performed. 13. Method according to claim 12, characterized in that parameterized geometrical transformations are added to the tooth models (M), defined in that the shape of a tooth model (M) can be smoothly transformed to at least one tooth model (M) of the same cluster (C1, C2, C3, C4) linked to that tooth model (M). 14. A computer program product, directly loadable in the memory of a computer, comprising program code means for carrying out all steps of a method according to any of claims 1 to 13 when said computer program product is run on the computer. 15. Tooth restoration determination system (5) for determining virtual tooth restorations on the basis of scan data (D) of oral structures, comprising
an interface (11) for receiving scan data (D) measured by a measurement means, a selection unit (14) for determining the tooth types to be used by the method, a memory means (12) with a model database (DB) that comprises a number of parameterized tooth models (M) for each of several tooth types, wherein the parameterization is performed using model parameters comprising position parameters and/or shape parameters, and wherein each tooth model (M) is linked (L) with a number of tooth models (M) of the same tooth type, an optimization unit (15), realised to determine an optimal tooth model (M) from the model database (DB) for each desired tooth type, using an iterative method in which, commencing with at least one start tooth model (M) a tooth model (M) is tested with regard to a quality value at each iteration step (S), a loading unit (16), realised to load tooth models (M) from a model database (DB), an Individualization unit (17), realised to adjust at least one tooth model (M) currently in test, and at least one tooth model (M) linked to the tooth model (M) currently in test, to the scan data (D) for individualization by varying model parameters, a quality determination unit (18), realised to determine quality values for individualization of the tooth models (M) and to assess quality criteria for interruption of the iteration, and a restoration unit (19), realised to determine at least one virtual tooth restoration (R) from the optimal tooth models (M) and scan data (D). | 2,100 |
5,634 | 5,634 | 13,876,426 | 2,127 | A method for simulating a geological phenomenon which resulted in the formation of a geological region, comprising the following steps:
(a) defining a model of the geological region, (b) receiving an observation of a given parameter of the geological region, (c) defining the relevant zone, for which the observation received in step (b) is relevant, (d) simulating the geological phenomenon based on the model, (e) estimating the value of the given parameter for the relevant zone of the model, (f) comparing the observation of the given parameter received in step (b) with the estimate of said parameter obtained in step (e), and (g) modifying a simulation parameter based on the results of the comparison in step (f). | 1-10. (canceled) 11. A method for simulating a geological phenomenon which resulted in the formation of a geological region, comprising the following steps:
a) defining a model of the geological region, b) receiving an observation of a given parameter of the geological region, c) defining a zone of the model for which the observation received in step b) is relevant, d) simulating the geological phenomenon based on the model of the geological region defined in step a), e) estimating the value of the given parameter for the relevant zone of the model defined in step c), using the results of the simulation, f) comparing the observation of the given parameter received in step b) with the estimate of said parameter obtained in step e), and g) modifying a simulation parameter to adjust the effects of the simulation for at least a portion of the model, based on the results of the comparison in step f). 12. The simulation method according to claim 11, wherein, in step g), the simulation is ended if the results of the comparison in step f) show that the observation and the estimate for the given parameter are sufficiently close. 13. The simulation method according to claim 11, wherein, in step g), the simulation parameter is modified in a manner that attenuates the effects of the simulation on said at least a portion of the model. 14. The simulation method according to claim 11, wherein,
in step b), multiple observations are received, the steps c), e) and f) being performed for each of the observations received. 15. The simulation method according to claim 14, wherein for each observation, a representative zone for the observation is defined, and
in step g), for each representative zone, the simulation parameter corresponding to said zone is modified based on the result of the comparison between the observation corresponding to this zone and the estimate corresponding to this zone. 16. The simulation method according to claim 15, wherein, for at least one observation,
at least one supplemental representative zone is defined, each of said supplemental representative zones being associated with a supplemental simulation parameter value, and during step g), and depending on the results of the comparison in step f), at least said supplemental simulation parameter is additionally modified so as to adjust the effects of the simulation for said at least one supplemental representative zone. 17. The simulation method according to claim 11, wherein
the model for the geological region defined in step a) comprises a grid network, and during the simulation step d), stochastic displacements of particles in the grid of the geological model are simulated. 18. The simulation method according to claim 11, wherein
the parameter for which an observation is received in step b) is a permeability parameter. 19. A non-transitory computer readable storage medium for simulating a geological phenomenon which resulted in the formation of a geological region, the medium having stored thereon a computer program comprising program instructions, the computer program being loadable into a data-processing unit and adapted to cause the data-processing unit to carry out, when the computer program is run by the data-processing device, the steps of:
a) defining a model of the geological region, b) receiving an observation of a given parameter of the geological region, c) defining a zone of the model, herein referred to as the relevant zone, for which the received observation is relevant, d) simulating the geological phenomenon based on the model of the geological region, e) estimating the value of the given parameter for the relevant zone of the model, using the results of the simulation, f) comparing the observation of the given parameter received with the estimate of said parameter, and g) depending on the results of the comparison, modifying a simulation parameter to adjust the effects of the simulation for at least a portion of the model. 20. A simulation device for simulating a geological phenomenon which resulted in the formation of a geological region, said device comprising
a receiving means for receiving an observation of a given parameter of the geological region, a processing means for
defining a model of the geological region,
defining a zone of the model, herein referred to as the relevant zone, for which the observation received by the receiving means is relevant,
simulating the geological phenomenon based on the model of the geological region, and
estimating the value of the given parameter for the relevant zone of the model, using the results of the simulation,
a comparison means for comparing the observation of the given parameter received from the receiving means with the estimate of said parameter obtained by the processing means, and wherein the processing means is arranged to modify a simulation parameter in a manner that adjusts the effects of the simulation for at least a portion of the model after receiving a signal originating from the comparison means. | A method for simulating a geological phenomenon which resulted in the formation of a geological region, comprising the following steps:
(a) defining a model of the geological region, (b) receiving an observation of a given parameter of the geological region, (c) defining the relevant zone, for which the observation received in step (b) is relevant, (d) simulating the geological phenomenon based on the model, (e) estimating the value of the given parameter for the relevant zone of the model, (f) comparing the observation of the given parameter received in step (b) with the estimate of said parameter obtained in step (e), and (g) modifying a simulation parameter based on the results of the comparison in step (f).1-10. (canceled) 11. A method for simulating a geological phenomenon which resulted in the formation of a geological region, comprising the following steps:
a) defining a model of the geological region, b) receiving an observation of a given parameter of the geological region, c) defining a zone of the model for which the observation received in step b) is relevant, d) simulating the geological phenomenon based on the model of the geological region defined in step a), e) estimating the value of the given parameter for the relevant zone of the model defined in step c), using the results of the simulation, f) comparing the observation of the given parameter received in step b) with the estimate of said parameter obtained in step e), and g) modifying a simulation parameter to adjust the effects of the simulation for at least a portion of the model, based on the results of the comparison in step f). 12. The simulation method according to claim 11, wherein, in step g), the simulation is ended if the results of the comparison in step f) show that the observation and the estimate for the given parameter are sufficiently close. 13. The simulation method according to claim 11, wherein, in step g), the simulation parameter is modified in a manner that attenuates the effects of the simulation on said at least a portion of the model. 14. The simulation method according to claim 11, wherein,
in step b), multiple observations are received, the steps c), e) and f) being performed for each of the observations received. 15. The simulation method according to claim 14, wherein for each observation, a representative zone for the observation is defined, and
in step g), for each representative zone, the simulation parameter corresponding to said zone is modified based on the result of the comparison between the observation corresponding to this zone and the estimate corresponding to this zone. 16. The simulation method according to claim 15, wherein, for at least one observation,
at least one supplemental representative zone is defined, each of said supplemental representative zones being associated with a supplemental simulation parameter value, and during step g), and depending on the results of the comparison in step f), at least said supplemental simulation parameter is additionally modified so as to adjust the effects of the simulation for said at least one supplemental representative zone. 17. The simulation method according to claim 11, wherein
the model for the geological region defined in step a) comprises a grid network, and during the simulation step d), stochastic displacements of particles in the grid of the geological model are simulated. 18. The simulation method according to claim 11, wherein
the parameter for which an observation is received in step b) is a permeability parameter. 19. A non-transitory computer readable storage medium for simulating a geological phenomenon which resulted in the formation of a geological region, the medium having stored thereon a computer program comprising program instructions, the computer program being loadable into a data-processing unit and adapted to cause the data-processing unit to carry out, when the computer program is run by the data-processing device, the steps of:
a) defining a model of the geological region, b) receiving an observation of a given parameter of the geological region, c) defining a zone of the model, herein referred to as the relevant zone, for which the received observation is relevant, d) simulating the geological phenomenon based on the model of the geological region, e) estimating the value of the given parameter for the relevant zone of the model, using the results of the simulation, f) comparing the observation of the given parameter received with the estimate of said parameter, and g) depending on the results of the comparison, modifying a simulation parameter to adjust the effects of the simulation for at least a portion of the model. 20. A simulation device for simulating a geological phenomenon which resulted in the formation of a geological region, said device comprising
a receiving means for receiving an observation of a given parameter of the geological region, a processing means for
defining a model of the geological region,
defining a zone of the model, herein referred to as the relevant zone, for which the observation received by the receiving means is relevant,
simulating the geological phenomenon based on the model of the geological region, and
estimating the value of the given parameter for the relevant zone of the model, using the results of the simulation,
a comparison means for comparing the observation of the given parameter received from the receiving means with the estimate of said parameter obtained by the processing means, and wherein the processing means is arranged to modify a simulation parameter in a manner that adjusts the effects of the simulation for at least a portion of the model after receiving a signal originating from the comparison means. | 2,100 |
5,635 | 5,635 | 14,382,784 | 2,164 | Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices. | 1. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges;
identifying a backbone graph within the initial graph at least in part by a graph creation module;
creating a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph, at least in part by the graph creation module; and computing the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 2. The method of claim 1, wherein the plurality of vertices classified as either local or non-local based at least in part on a locality threshold, wherein the relationship of the local vertices is below the locality threshold and the relationship of the non-local vertices is above the threshold. 3. The method of claim 2, wherein the computing the reachability of local vertices is accomplished at least in part using a bidirectional breadth first search of the initial graph and/or the subsequent graph. 4. The method of claim 2, wherein the subsequent graph comprises non-local relationships of the plurality of vertices. 5. The method of claim 3 or 4, wherein the computing the reachability of at least two vertices is accomplished at least in part using the initial graph, and if the reachability of the two vertices cannot be computed using at least the initial graph and based at least in part on local relationships, computing the reachability of the at least two vertices using at least the subsequent graph. 6. The method of claim 5, wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 7. The method of claim 5, wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach a second vertice. 8. The method of claims 7, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the second vertice. 9. The method of claims 6 and 7, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 10. The method of claim 1, wherein the identifying the backbone graph is accomplished at least in part by a set cover method. 11. The method of claim 1, wherein the identifying the backbone graph is accomplished at least in part by a fast cover method. 12. One or more computer readable storage media having program instructions stored thereon for scaling reachability computations on relatively large graphs that, when executed by a computing system, direct the computing system to at least:
identify an initial graph comprising a plurality of vertices and a plurality of edges;
identify a backbone graph within the initial graph at least in part by a graph creation module;
create a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph at least in part by the graph creation module; and compute the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 13. The one or more computer readable storage media of claim 12, having further instructions which cause the computing system to, wherein the computing the reachability of at least two vertices is accomplished at least in part using the initial graph, and if the reachability of the two vertices cannot be computed using the initial graph, computing the reachability of the at least two vertices using at least the backbone graph. 14. The one or more computer readable storage media of claim 12, having further instructions wherein a relationship of the plurality of vertices is determined at least in part on a locality threshold, where local vertices are below the locality threshold and non-local vertices are above the locality threshold. 15. The one or more computer readable storage media of claim 14, having further instructions which cause the computing system to compute the reachability for local vertices from the initial graph, and the non-local vertices in the backbone graph. 16. The one or more computer readable storage media of claim 15, having further instructions wherein the computing the reachability of local vertices is accomplished at least in part using a bidirectional breadth first search of the initial graph and/or the backbone graph. 17. The one or more computer readable storage media of claim 12, having further instructions wherein the creating a scaled-down backbone graph is accomplished at least in part via a set cover or fast cover function. 18. The one or more computer readable storage media of claim 12, having further instructions which cause the computing system to wherein the reachability of the at least two vertices is determined in part on whether the at least two vertices can be reached by the backbone. 19. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; creating a scaled-down backbone graph of the initial graph based at least in part on a locality threshold; and computing the reachability of at least two of the plurality vertices using at least the initial graph or the backbone graph. 20. The method of claim 19, wherein the creating a scaled-down backbone graph is accomplished at least in part via a set cover or fast cover function. | Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices.1. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges;
identifying a backbone graph within the initial graph at least in part by a graph creation module;
creating a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph, at least in part by the graph creation module; and computing the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 2. The method of claim 1, wherein the plurality of vertices classified as either local or non-local based at least in part on a locality threshold, wherein the relationship of the local vertices is below the locality threshold and the relationship of the non-local vertices is above the threshold. 3. The method of claim 2, wherein the computing the reachability of local vertices is accomplished at least in part using a bidirectional breadth first search of the initial graph and/or the subsequent graph. 4. The method of claim 2, wherein the subsequent graph comprises non-local relationships of the plurality of vertices. 5. The method of claim 3 or 4, wherein the computing the reachability of at least two vertices is accomplished at least in part using the initial graph, and if the reachability of the two vertices cannot be computed using at least the initial graph and based at least in part on local relationships, computing the reachability of the at least two vertices using at least the subsequent graph. 6. The method of claim 5, wherein a reachability of a first processed vertice of the at least two vertices, is based at least in part on a function of vertices that can be reached by the first vertice. 7. The method of claim 5, wherein computing the reachability of a first vertice of the at least two vertices, is accomplished at least in part using a function of vertices which can reach a second vertice. 8. The method of claims 7, wherein a reachability of the at least two vertices is the Cartesian product of the function of vertices the first vertice can reach and a function of vertices that can reach the second vertice. 9. The method of claims 6 and 7, wherein a reachability of the at least two vertices is determined in part on whether the at least two vertices can reach the backbone. 10. The method of claim 1, wherein the identifying the backbone graph is accomplished at least in part by a set cover method. 11. The method of claim 1, wherein the identifying the backbone graph is accomplished at least in part by a fast cover method. 12. One or more computer readable storage media having program instructions stored thereon for scaling reachability computations on relatively large graphs that, when executed by a computing system, direct the computing system to at least:
identify an initial graph comprising a plurality of vertices and a plurality of edges;
identify a backbone graph within the initial graph at least in part by a graph creation module;
create a subsequent graph comprising a scaled-down version of the initial graph, based at least in part on the backbone graph at least in part by the graph creation module; and compute the reachability of at least two of the vertices using at least the subsequent graph at least in part with a processor and a reachability analytics module. 13. The one or more computer readable storage media of claim 12, having further instructions which cause the computing system to, wherein the computing the reachability of at least two vertices is accomplished at least in part using the initial graph, and if the reachability of the two vertices cannot be computed using the initial graph, computing the reachability of the at least two vertices using at least the backbone graph. 14. The one or more computer readable storage media of claim 12, having further instructions wherein a relationship of the plurality of vertices is determined at least in part on a locality threshold, where local vertices are below the locality threshold and non-local vertices are above the locality threshold. 15. The one or more computer readable storage media of claim 14, having further instructions which cause the computing system to compute the reachability for local vertices from the initial graph, and the non-local vertices in the backbone graph. 16. The one or more computer readable storage media of claim 15, having further instructions wherein the computing the reachability of local vertices is accomplished at least in part using a bidirectional breadth first search of the initial graph and/or the backbone graph. 17. The one or more computer readable storage media of claim 12, having further instructions wherein the creating a scaled-down backbone graph is accomplished at least in part via a set cover or fast cover function. 18. The one or more computer readable storage media of claim 12, having further instructions which cause the computing system to wherein the reachability of the at least two vertices is determined in part on whether the at least two vertices can be reached by the backbone. 19. A method for scaling reachability computations on relatively large graphs, the method comprising:
identifying an initial graph comprising a plurality of vertices and a plurality of edges; creating a scaled-down backbone graph of the initial graph based at least in part on a locality threshold; and computing the reachability of at least two of the plurality vertices using at least the initial graph or the backbone graph. 20. The method of claim 19, wherein the creating a scaled-down backbone graph is accomplished at least in part via a set cover or fast cover function. | 2,100 |
5,636 | 5,636 | 15,118,757 | 2,129 | A device and a method for determining a suitability of an active ingredient to be applied transdermally or transmucosally. In particular, a system that includes:
at least one input device for inputting at least one designation of an active ingredient; a database for storing a plurality of data at least relating to the active ingredient; a computing unit for assessing a suitability of the active ingredient to be applied transdermally and/or transmucosally while taking into consideration data entered via the input device and/or data stored in the database; and an output device for displaying the assessed suitability. | 1. A system for determining a suitability of an active ingredient for transdermal or transmucosal application, comprising:
at least one input device configured to input at least a name of an active ingredient; a database comprising data relating to the active ingredient; a computing unit configured to assess a suitability of the active ingredient for transdermal or transmucosal application, while considering data input via the input device, the data stored in the database, or a combination of the two; an output device configured to display the assessed suitability. 2. The system according to claim 1;
wherein the computing unit is configured to form a weighted average using a plurality of characteristic numbers to assess the suitability. 3. The system according to claim 1;
wherein the computing unit is configured to establish characteristic numbers while considering in each case at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient;
an item of information concerning a skin permeability of the active ingredient;
an item of information concerning a bioavailability of the active ingredient;
an item of information concerning a dose of the active ingredient;
an item of information concerning a metabolism of the active ingredient;
an item of information concerning a skin irritation potential of the active ingredient;
at least one item of information concerning an indication of the active ingredient; and
an item of information concerning a description of a dose-response relationship of the active ingredient. 4. The system according to claim 1;
wherein at least some of the characteristic numbers are a selection of whole numbers or of numbers with a decimal place. 5. The system according to claim 3;
wherein the computing unit is configured, when assessing the suitability of the active ingredient, to take into consideration at least one item of information selected from the group consisting of:
the item of information or characteristic number concerning the structural formula of the active ingredient;
the item of information or characteristic number concerning the bioavailability of the active ingredient; and
the item of information or characteristic number concerning the dose, where the dose has at least 5% and at most 40% of the active ingredient. 6. The system according to claim 3;
wherein the computing unit is configured, when assessing the suitability of the active ingredient, to take into consideration at least one item of information selected from the group consisting:
the item of information or characteristic number concerning the acid strength of the active ingredient;
the item of information or characteristic number concerning the melting point of the active ingredient;
the item of information or characteristic number concerning the water solubility, fat solubility, or both, of the active ingredient;
the item of information or characteristic number concerning the skin permeability of the active ingredient; and
the item of information concerning the skin irritation potential of the active ingredient;
wherein the at least one item of information selected is for a concentration of the active ingredient of at least 2% and at most 20%. 7. The system according to claim 1;
wherein the database stores mapping tables for mapping, onto in each case at least one characteristic number, at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a biological half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient and
an item of information concerning a dose of the active ingredient. 8. The system according to claim 1, further comprising:
at least one measuring device configured to determine a molecular weight, an acid strength, a water solubility, a melting point, or a combination thereof, of the active ingredient. 9. A method for determining a suitability of an active ingredient for transdermal or transmucosal application, comprising the steps:
acquiring characteristics of the active ingredient; establishing characteristic numbers in each case for the characteristics of the active ingredient; calculating a weighted average via the characteristic numbers; and displaying an assessed suitability of the active ingredient using the weighted average. 10. The method according to claim 9;
wherein the characteristics of the active ingredient comprise at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient;
an item of information concerning a skin permeability of the active ingredient;
an item of information concerning a bioavailability of the active ingredient;
an item of information concerning a dose of the active ingredient;
an item of information concerning a metabolism of the active ingredient;
an item of information concerning skin irritation potential of the active ingredient;
an item of information concerning an indication of the active ingredient; and
an item of information concerning a description of a dose-response relationship of the active ingredient. 11. The method according to claim 9;
wherein the step of acquiring characteristics of the active ingredient comprises:
determining at least one of the characteristics by at least one measuring device. 12. The method according to claim 9, further comprising:
reading out, from a database, at least one characteristic number that is assigned to at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a biological half-life period of the active ingredient; and/or
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient and
an ne item of information concerning a dose. 13. The method according to claim 9, further comprising:
comparing the weighted average with a threshold value, where the active ingredient is determined as suitable and indicated for transdermal or transmucosal application if the weighted average is greater than the threshold value. 14. A computer-readable medium comprising:
instructions that, when carried out by a computer, implement the method according to claim 9. | A device and a method for determining a suitability of an active ingredient to be applied transdermally or transmucosally. In particular, a system that includes:
at least one input device for inputting at least one designation of an active ingredient; a database for storing a plurality of data at least relating to the active ingredient; a computing unit for assessing a suitability of the active ingredient to be applied transdermally and/or transmucosally while taking into consideration data entered via the input device and/or data stored in the database; and an output device for displaying the assessed suitability.1. A system for determining a suitability of an active ingredient for transdermal or transmucosal application, comprising:
at least one input device configured to input at least a name of an active ingredient; a database comprising data relating to the active ingredient; a computing unit configured to assess a suitability of the active ingredient for transdermal or transmucosal application, while considering data input via the input device, the data stored in the database, or a combination of the two; an output device configured to display the assessed suitability. 2. The system according to claim 1;
wherein the computing unit is configured to form a weighted average using a plurality of characteristic numbers to assess the suitability. 3. The system according to claim 1;
wherein the computing unit is configured to establish characteristic numbers while considering in each case at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient;
an item of information concerning a skin permeability of the active ingredient;
an item of information concerning a bioavailability of the active ingredient;
an item of information concerning a dose of the active ingredient;
an item of information concerning a metabolism of the active ingredient;
an item of information concerning a skin irritation potential of the active ingredient;
at least one item of information concerning an indication of the active ingredient; and
an item of information concerning a description of a dose-response relationship of the active ingredient. 4. The system according to claim 1;
wherein at least some of the characteristic numbers are a selection of whole numbers or of numbers with a decimal place. 5. The system according to claim 3;
wherein the computing unit is configured, when assessing the suitability of the active ingredient, to take into consideration at least one item of information selected from the group consisting of:
the item of information or characteristic number concerning the structural formula of the active ingredient;
the item of information or characteristic number concerning the bioavailability of the active ingredient; and
the item of information or characteristic number concerning the dose, where the dose has at least 5% and at most 40% of the active ingredient. 6. The system according to claim 3;
wherein the computing unit is configured, when assessing the suitability of the active ingredient, to take into consideration at least one item of information selected from the group consisting:
the item of information or characteristic number concerning the acid strength of the active ingredient;
the item of information or characteristic number concerning the melting point of the active ingredient;
the item of information or characteristic number concerning the water solubility, fat solubility, or both, of the active ingredient;
the item of information or characteristic number concerning the skin permeability of the active ingredient; and
the item of information concerning the skin irritation potential of the active ingredient;
wherein the at least one item of information selected is for a concentration of the active ingredient of at least 2% and at most 20%. 7. The system according to claim 1;
wherein the database stores mapping tables for mapping, onto in each case at least one characteristic number, at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a biological half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient and
an item of information concerning a dose of the active ingredient. 8. The system according to claim 1, further comprising:
at least one measuring device configured to determine a molecular weight, an acid strength, a water solubility, a melting point, or a combination thereof, of the active ingredient. 9. A method for determining a suitability of an active ingredient for transdermal or transmucosal application, comprising the steps:
acquiring characteristics of the active ingredient; establishing characteristic numbers in each case for the characteristics of the active ingredient; calculating a weighted average via the characteristic numbers; and displaying an assessed suitability of the active ingredient using the weighted average. 10. The method according to claim 9;
wherein the characteristics of the active ingredient comprise at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning half-life period of the active ingredient;
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient;
an item of information concerning a skin permeability of the active ingredient;
an item of information concerning a bioavailability of the active ingredient;
an item of information concerning a dose of the active ingredient;
an item of information concerning a metabolism of the active ingredient;
an item of information concerning skin irritation potential of the active ingredient;
an item of information concerning an indication of the active ingredient; and
an item of information concerning a description of a dose-response relationship of the active ingredient. 11. The method according to claim 9;
wherein the step of acquiring characteristics of the active ingredient comprises:
determining at least one of the characteristics by at least one measuring device. 12. The method according to claim 9, further comprising:
reading out, from a database, at least one characteristic number that is assigned to at least one item of information selected from the group consisting of:
an item of information concerning a structural formula of the active ingredient;
an item of information concerning an acid strength of the active ingredient;
an item of information concerning a melting point of the active ingredient;
an item of information concerning a biological half-life period of the active ingredient; and/or
an item of information concerning a water solubility, fat solubility, or both, of the active ingredient and
an ne item of information concerning a dose. 13. The method according to claim 9, further comprising:
comparing the weighted average with a threshold value, where the active ingredient is determined as suitable and indicated for transdermal or transmucosal application if the weighted average is greater than the threshold value. 14. A computer-readable medium comprising:
instructions that, when carried out by a computer, implement the method according to claim 9. | 2,100 |
5,637 | 5,637 | 15,605,436 | 2,135 | Disclosed are various embodiments for loading a network site that uses a hierarchical site model. A computing device receives a request to generate a user interface associated with a network site. A caching process is initiated that caches data associated with the network site. A hierarchical site model is retrieved and processed to identify a subset of page models of the network site for generation of the user interface. Once it is determined that one of the subset of page models is stored in the cache, it is retrieved from the cache for generation of the user interface. | 1. A non-transitory computer readable medium embodying instructions, executable by at least one computing device, that when executed cause the at least one computing device to at least:
receive a request to generate a user interface associated with a network site; initiate a caching process that retrieves data associated with the network site from a data store and stores the data in a cache for generation of the user interface, wherein the data comprises at least one of a plurality of page models associated with the network site; retrieve a hierarchical site model that identifies the plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site; process the hierarchical site model to identify a subset of the plurality of page models required for generation of the user interface; and determine that at least one of the subset of the plurality of page models required for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page models from the cache. 2. The non-transitory computer readable medium of claim 1, wherein when executed the instructions further cause the at least one computing device to at least determine that another one of the subset of the plurality of page models required for generation of the user interface is not stored in the cache and retrieve the another one of the subset of the plurality of page models from the data store. 3. The non-transitory computer readable medium of claim 1, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site and wherein when executed the instructions further cause the at least one computing device to at least:
process the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determine that at least one of the subset of the plurality of page components for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page components from the cache. 4. The non-transitory computer readable medium of claim 1, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 5. The non-transitory computer readable medium of claim 1, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 6. The non-transitory computer readable medium of claim 1, wherein the hierarchical site model is defined at least in part using extensible markup language (XML). 7. The non-transitory computer readable medium of claim 1, wherein the data associated with the network site that is retrieved and stored in the caching process includes a user-modifiable subset of the plurality of page models associated with the network site and excludes a static subset of the plurality of page models. 8. A system, comprising:
at least one computing device; a cache; at least one data store; and instructions stored in the at least one data store and executable by the at least one computing device, wherein when executed the instructions cause the at least one computing device to at least:
receive a request to generate a user interface associated with a network site;
initiate a caching process that retrieves data associated with the network site from the at least one data store and stores the data in the cache for generation of the user interface;
retrieve a hierarchical site model that identifies a plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site;
process the hierarchical site model to identify a subset of the plurality of page models for generation of the user interface; and
determine that at least one of the subset of the plurality of page models for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page models from the cache. 9. The system of claim 8, wherein when executed the instructions further cause the at least one computing device to at least determine that another one of the subset of the plurality of page models for generation of the user interface is not stored in the cache and retrieve the another one of the subset of the plurality of page models from the data store. 10. The system of claim 8, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site and wherein when executed the instructions further cause the at least one computing device to at least:
process the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determine that at least one of the subset of the plurality of page components are stored in the cache and retrieve the at least one of the subset of the plurality of page components from the cache. 11. The system of claim 8, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 12. The system of claim 8, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 13. The system of claim 8, wherein the hierarchical site model is defined at least in part using JavaScript Object Notation (JSON). 14. The system of claim 8, wherein the user interface is one of a network page or an administrative user interface. 15. A method, comprising:
receiving a request to generate a user interface associated with a network site; initiating a caching process that stores data associated with the network site in a cache for generation of the user interface; retrieving a hierarchical site model that identifies a plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site; processing the hierarchical site model to identify a subset of the plurality of page models for generation of the user interface; and determining that at least one of the subset of the plurality of page models for generation of the user interface are stored in the cache and retrieving the at least one of the subset of the plurality of page models from the cache. 16. The method of claim 15, further comprising determining that another one of the subset of the plurality of page models is not stored in the cache and retrieving the another one of the subset of the plurality of page models from a data store. 17. The method of claim 15, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site, the method further comprising:
processing the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determining that at least one of the subset of the plurality of page components are stored in the cache and retrieving the at least one of the subset of the plurality of page components from the cache. 18. The method of claim 15, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 19. The method of claim 15, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 20. The method of claim 15, wherein the data associated with the network site that is retrieved and stored in the caching process includes a user-modifiable subset of the plurality of page models associated with the network site. | Disclosed are various embodiments for loading a network site that uses a hierarchical site model. A computing device receives a request to generate a user interface associated with a network site. A caching process is initiated that caches data associated with the network site. A hierarchical site model is retrieved and processed to identify a subset of page models of the network site for generation of the user interface. Once it is determined that one of the subset of page models is stored in the cache, it is retrieved from the cache for generation of the user interface.1. A non-transitory computer readable medium embodying instructions, executable by at least one computing device, that when executed cause the at least one computing device to at least:
receive a request to generate a user interface associated with a network site; initiate a caching process that retrieves data associated with the network site from a data store and stores the data in a cache for generation of the user interface, wherein the data comprises at least one of a plurality of page models associated with the network site; retrieve a hierarchical site model that identifies the plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site; process the hierarchical site model to identify a subset of the plurality of page models required for generation of the user interface; and determine that at least one of the subset of the plurality of page models required for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page models from the cache. 2. The non-transitory computer readable medium of claim 1, wherein when executed the instructions further cause the at least one computing device to at least determine that another one of the subset of the plurality of page models required for generation of the user interface is not stored in the cache and retrieve the another one of the subset of the plurality of page models from the data store. 3. The non-transitory computer readable medium of claim 1, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site and wherein when executed the instructions further cause the at least one computing device to at least:
process the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determine that at least one of the subset of the plurality of page components for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page components from the cache. 4. The non-transitory computer readable medium of claim 1, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 5. The non-transitory computer readable medium of claim 1, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 6. The non-transitory computer readable medium of claim 1, wherein the hierarchical site model is defined at least in part using extensible markup language (XML). 7. The non-transitory computer readable medium of claim 1, wherein the data associated with the network site that is retrieved and stored in the caching process includes a user-modifiable subset of the plurality of page models associated with the network site and excludes a static subset of the plurality of page models. 8. A system, comprising:
at least one computing device; a cache; at least one data store; and instructions stored in the at least one data store and executable by the at least one computing device, wherein when executed the instructions cause the at least one computing device to at least:
receive a request to generate a user interface associated with a network site;
initiate a caching process that retrieves data associated with the network site from the at least one data store and stores the data in the cache for generation of the user interface;
retrieve a hierarchical site model that identifies a plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site;
process the hierarchical site model to identify a subset of the plurality of page models for generation of the user interface; and
determine that at least one of the subset of the plurality of page models for generation of the user interface are stored in the cache and retrieve the at least one of the subset of the plurality of page models from the cache. 9. The system of claim 8, wherein when executed the instructions further cause the at least one computing device to at least determine that another one of the subset of the plurality of page models for generation of the user interface is not stored in the cache and retrieve the another one of the subset of the plurality of page models from the data store. 10. The system of claim 8, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site and wherein when executed the instructions further cause the at least one computing device to at least:
process the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determine that at least one of the subset of the plurality of page components are stored in the cache and retrieve the at least one of the subset of the plurality of page components from the cache. 11. The system of claim 8, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 12. The system of claim 8, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 13. The system of claim 8, wherein the hierarchical site model is defined at least in part using JavaScript Object Notation (JSON). 14. The system of claim 8, wherein the user interface is one of a network page or an administrative user interface. 15. A method, comprising:
receiving a request to generate a user interface associated with a network site; initiating a caching process that stores data associated with the network site in a cache for generation of the user interface; retrieving a hierarchical site model that identifies a plurality of page models associated with the network site and a hierarchical relationship of the plurality of page models associated with the network site; processing the hierarchical site model to identify a subset of the plurality of page models for generation of the user interface; and determining that at least one of the subset of the plurality of page models for generation of the user interface are stored in the cache and retrieving the at least one of the subset of the plurality of page models from the cache. 16. The method of claim 15, further comprising determining that another one of the subset of the plurality of page models is not stored in the cache and retrieving the another one of the subset of the plurality of page models from a data store. 17. The method of claim 15, wherein the data associated with the network site further comprises at least one of a plurality of page components associated with the network site, the method further comprising:
processing the hierarchical site model to identify a subset of the plurality of page components for generation of the user interface, wherein the subset of the plurality of page components are individually referenced by at least one of the subset of the plurality of page models; and determining that at least one of the subset of the plurality of page components are stored in the cache and retrieving the at least one of the subset of the plurality of page components from the cache. 18. The method of claim 15, wherein at least a portion of the caching process is performed while the hierarchical site model is processed. 19. The method of claim 15, wherein the caching process further identifies the data associated with the network site using a list of links to files associated with the network site. 20. The method of claim 15, wherein the data associated with the network site that is retrieved and stored in the caching process includes a user-modifiable subset of the plurality of page models associated with the network site. | 2,100 |
5,638 | 5,638 | 13,849,517 | 2,175 | A method, including receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface and segmenting the physical surface into one or more physical regions. A functionality is assigned to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, and a sequence of three-dimensional (3D) maps is received, the sequence of 3D maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions. The 3D maps are analyzed to detect a gesture performed by the user, and based on the gesture, an input is simulated for the tactile input device corresponding to the one of the physical regions. | 1. A method, comprising:
receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface; segmenting the physical surface into one or more physical regions; assigning a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device; receiving a sequence of three-dimensional (3D) maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions; analyzing the 3D maps to detect a gesture performed by the user; and simulating, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 2. The method according to claim 1, wherein the tactile input device is selected from a list comprising a keyboard, a mouse, and a touchpad. 3. The method according to claim 1, and comprising projecting an image on the physical surface in response to the gesture. 4. The method according to claim 3, wherein the tactile input device comprises a touchscreen. 5. The method according to claim 1, and comprising determining, based the sequence of 3D maps, a pressure applied by one or more fingers of the hand against the physical surface, and incorporating the pressure into the simulated input. 6. The method according to claim 1, and comprising identifying, based on the 2D image, a color of an object held by the hand and in contact with the physical surface, and incorporating the color into the simulated input. 7. The method according to claim 1, and comprising determining, based on the sequence of 3D maps, a position and a velocity of one or more fingers of the hand, and incorporating the position and the velocity into the simulated input. 8. An apparatus, comprising:
a sensing device configured to receive a two dimensional (2D) image containing at least a physical surface, and to receive a sequence of three dimensional (3D) maps containing at least a hand of a user, the hand positioned on the physical surface; a display; and a computer coupled to the sensing device and the display, and configured to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to analyze the 3D maps to detect a gesture performed by the user, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 9. The apparatus according to claim 8, wherein the computer is configured to select the tactile input device from a list comprising a keyboard, a mouse, and a touchpad. 10. The apparatus according to claim 8, and comprising a projector coupled to the computer and configured to project an image on the physical surface in response to the gesture. 11. The apparatus according to claim 10, wherein the tactile input device comprises a touchscreen. 12. The apparatus according to claim 8, wherein the computer is configured to determine, based the sequence of 3D maps, a pressure applied by one or more fingers of the hand against the physical surface, and to incorporate the pressure into the simulated input. 13. The apparatus according to claim 8, wherein the computer is configured to identify, based on the 2D image, a color of an object held by the hand and in contact with the physical surface, and to incorporate the color into the simulated input. 14. The apparatus according to claim 8, wherein the computer is configured to determine, based on the sequence of 3D maps, a position and a velocity of one or more fingers of the hand, and to incorporate the position and the velocity into the simulated input. 15. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a two-dimensional image (2D) containing at least a physical surface, to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to receive a sequence of three-dimensional (3D) maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions, to analyze the 3D maps to detect a gesture performed by the user, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 16. A method, comprising:
receiving a sequence of three-dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user of the computer, the hand positioned in proximity to the physical surface; analyzing the 3D maps to detect a gesture performed by the user; projecting, onto the physical surface, an animation in response to the gesture; and incorporating the one or more physical objects into the animation. 17. The method according to claim 16, and comprising projecting a respective contour image encompassing each of the one or more physical objects, and incorporating the respective contour image into the animation. 18. An apparatus, comprising:
a sensing device configured to receive a sequence of three dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user, the hand positioned in proximity to the physical surface; a projector; and a computer coupled to the sensing device and the projector, and configured to analyze the 3D maps to detect a gesture performed by the user, to present, using the projector, an animation onto the physical surface in response to the gesture, and to incorporate the one or more physical objects into the animation. 19. The apparatus according to claim 18, wherein the computer is configured to present, using the projector, a respective contour image encompassing each of the one or more physical objects, and to incorporate the respective contour image into the animation. 20. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a sequence of three-dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user of the computer, the hand positioned in proximity to the physical surface, to analyze the 3D maps to detect a gesture performed by the user, to project, onto the physical surface, an animation in response to the gesture, and to incorporate the one or more physical objects into the animation. 21. A method, comprising:
receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface; segmenting the physical surface into one or more physical regions; assigning a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device; receiving a sequence of three-dimensional (3D) maps containing at least an object held by a hand of a user of the computer, the object positioned on one of the physical regions; analyzing the 3D maps to detect a gesture performed using the object; and simulating, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 22. The method according to claim 21, and comprising identifying, based on the 2D image, a color of the object, and incorporating the color into the simulated input. 23. An apparatus, comprising:
a sensing device configured to receive a two dimensional (2D) image containing at least a physical surface, and to receive a sequence of three dimensional (3D) maps containing at least an object held by a hand of a user, the object positioned on the physical surface; a display; and a computer coupled to the sensing device and the display, and configured to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to analyze the 3D maps to detect a gesture performed using the object, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 24. The apparatus according to claim 21, wherein the computer is configured to identify, based on the 2D image, a color of the object, and to incorporate the color into the simulated input. 25. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a two-dimensional image (2D) containing at least a physical surface, to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to receive a sequence of three-dimensional (3D) maps containing at least an object held by a hand of a user of the computer, the object positioned on one of the physical regions, to analyze the 3D maps to detect a gesture performed using the object, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. | A method, including receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface and segmenting the physical surface into one or more physical regions. A functionality is assigned to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, and a sequence of three-dimensional (3D) maps is received, the sequence of 3D maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions. The 3D maps are analyzed to detect a gesture performed by the user, and based on the gesture, an input is simulated for the tactile input device corresponding to the one of the physical regions.1. A method, comprising:
receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface; segmenting the physical surface into one or more physical regions; assigning a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device; receiving a sequence of three-dimensional (3D) maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions; analyzing the 3D maps to detect a gesture performed by the user; and simulating, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 2. The method according to claim 1, wherein the tactile input device is selected from a list comprising a keyboard, a mouse, and a touchpad. 3. The method according to claim 1, and comprising projecting an image on the physical surface in response to the gesture. 4. The method according to claim 3, wherein the tactile input device comprises a touchscreen. 5. The method according to claim 1, and comprising determining, based the sequence of 3D maps, a pressure applied by one or more fingers of the hand against the physical surface, and incorporating the pressure into the simulated input. 6. The method according to claim 1, and comprising identifying, based on the 2D image, a color of an object held by the hand and in contact with the physical surface, and incorporating the color into the simulated input. 7. The method according to claim 1, and comprising determining, based on the sequence of 3D maps, a position and a velocity of one or more fingers of the hand, and incorporating the position and the velocity into the simulated input. 8. An apparatus, comprising:
a sensing device configured to receive a two dimensional (2D) image containing at least a physical surface, and to receive a sequence of three dimensional (3D) maps containing at least a hand of a user, the hand positioned on the physical surface; a display; and a computer coupled to the sensing device and the display, and configured to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to analyze the 3D maps to detect a gesture performed by the user, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 9. The apparatus according to claim 8, wherein the computer is configured to select the tactile input device from a list comprising a keyboard, a mouse, and a touchpad. 10. The apparatus according to claim 8, and comprising a projector coupled to the computer and configured to project an image on the physical surface in response to the gesture. 11. The apparatus according to claim 10, wherein the tactile input device comprises a touchscreen. 12. The apparatus according to claim 8, wherein the computer is configured to determine, based the sequence of 3D maps, a pressure applied by one or more fingers of the hand against the physical surface, and to incorporate the pressure into the simulated input. 13. The apparatus according to claim 8, wherein the computer is configured to identify, based on the 2D image, a color of an object held by the hand and in contact with the physical surface, and to incorporate the color into the simulated input. 14. The apparatus according to claim 8, wherein the computer is configured to determine, based on the sequence of 3D maps, a position and a velocity of one or more fingers of the hand, and to incorporate the position and the velocity into the simulated input. 15. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a two-dimensional image (2D) containing at least a physical surface, to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to receive a sequence of three-dimensional (3D) maps containing at least a hand of a user of the computer, the hand positioned on one of the physical regions, to analyze the 3D maps to detect a gesture performed by the user, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 16. A method, comprising:
receiving a sequence of three-dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user of the computer, the hand positioned in proximity to the physical surface; analyzing the 3D maps to detect a gesture performed by the user; projecting, onto the physical surface, an animation in response to the gesture; and incorporating the one or more physical objects into the animation. 17. The method according to claim 16, and comprising projecting a respective contour image encompassing each of the one or more physical objects, and incorporating the respective contour image into the animation. 18. An apparatus, comprising:
a sensing device configured to receive a sequence of three dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user, the hand positioned in proximity to the physical surface; a projector; and a computer coupled to the sensing device and the projector, and configured to analyze the 3D maps to detect a gesture performed by the user, to present, using the projector, an animation onto the physical surface in response to the gesture, and to incorporate the one or more physical objects into the animation. 19. The apparatus according to claim 18, wherein the computer is configured to present, using the projector, a respective contour image encompassing each of the one or more physical objects, and to incorporate the respective contour image into the animation. 20. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a sequence of three-dimensional (3D) maps containing at least a physical surface, one or more physical objects positioned on the physical surface, and a hand of a user of the computer, the hand positioned in proximity to the physical surface, to analyze the 3D maps to detect a gesture performed by the user, to project, onto the physical surface, an animation in response to the gesture, and to incorporate the one or more physical objects into the animation. 21. A method, comprising:
receiving, by a computer, a two-dimensional image (2D) containing at least a physical surface; segmenting the physical surface into one or more physical regions; assigning a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device; receiving a sequence of three-dimensional (3D) maps containing at least an object held by a hand of a user of the computer, the object positioned on one of the physical regions; analyzing the 3D maps to detect a gesture performed using the object; and simulating, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 22. The method according to claim 21, and comprising identifying, based on the 2D image, a color of the object, and incorporating the color into the simulated input. 23. An apparatus, comprising:
a sensing device configured to receive a two dimensional (2D) image containing at least a physical surface, and to receive a sequence of three dimensional (3D) maps containing at least an object held by a hand of a user, the object positioned on the physical surface; a display; and a computer coupled to the sensing device and the display, and configured to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to analyze the 3D maps to detect a gesture performed using the object, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. 24. The apparatus according to claim 21, wherein the computer is configured to identify, based on the 2D image, a color of the object, and to incorporate the color into the simulated input. 25. A computer software product comprising a non-transitory computer-readable medium, in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a two-dimensional image (2D) containing at least a physical surface, to segment the physical surface into one or more physical regions, to assign a functionality to each of the one or more physical regions, each of the functionalities corresponding to a tactile input device, to receive a sequence of three-dimensional (3D) maps containing at least an object held by a hand of a user of the computer, the object positioned on one of the physical regions, to analyze the 3D maps to detect a gesture performed using the object, and to simulate, based on the gesture, an input for the tactile input device corresponding to the one of the physical regions. | 2,100 |
5,639 | 5,639 | 13,286,594 | 2,178 | An account ribbon of a website has a plurality of message fields each having a link activatable to cause a display of a type of user related information. Continued access to the user related is provided by causing the account ribbon to be persisted across plural webpages of the website. | 1. A non-transitory computer-readable media having stored thereon computer executable instructions that, when executed by a processor, cause the processor to perform steps comprising:
causing an account ribbon to be persisted across plural webpages of a website, the account ribbon having a plurality of message fields each having a link activatable to cause a display of a type of user related information wherein the type of user related information that is accessible via activation of a one of the links is determined considering at least one characteristic of a user. 2. The non-transitory computer-readable media as recited in claim 1, wherein the links displayed in the message fields of the account ribbon are changed considering the at least one characteristic of the user. 3. The non-transitory computer-readable media as recited in claim 1, wherein the at least one characteristic of the user comprises a user role within a group. 4. The non-transitory computer-readable media as recited in claim 3, wherein the at least one characteristic of the user comprises a user role within an enterprise account with a vendor. 5. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is made accessible by being displayed in a further webpage of the website. 6. The non-transitory computer-readable media as recited in claim 5, wherein the user related information comprises additional links which are activatable to cause a display of a sub-type of user related information. 7. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is made accessible by being displayed in a webpage modal. 8. The non-transitory computer-readable media as recited in claim 7, wherein the user related information comprises additional links which are activatable to cause a display of a sub-type of user related information. 9. The non-transitory computer-readable media as recited in claim 1, wherein account ribbon is persisted across plural webpages of a website in a heading section of the plural webpages. 10. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is displayed with a temporal ordering. 11. The non-transitory computer-readable media as recited in claim 10, wherein the user related information comprises a listing of event titles. 12. The non-transitory computer-readable media as recited in claim 10, wherein the listing of event titles are representative of events in one or more of a search channel, communications channel, and a purchasing channel. 13. The non-transitory computer-readable media as recited in claim 12, wherein the listing of event titles are representative of events in one or more of an on-line channel and an off-line channel. 14. The non-transitory computer-readable media as recited in claim 13, wherein the instructions capture event related metadata and the instructions provide for using a search query to include within the listing of event titles only those event titles having associated metadata which meets the search criteria. 15. The non-transitory computer-readable media as recited in claim 13, wherein at least one event titles is presented multiple times within the listing of event titles at different locations within the temporal ordering. 16. The non-transitory computer-readable media as recited in claim 13, wherein at least one event title is presented within the listing of event titles at a location that is associated with a related event title without regard to when in time an event corresponding to the event title occurred. 17. The non-transitory computer-readable media as recited in claim 1, wherein the message fields within the account ribbon are further user selectable. 18. The non-transitory computer-readable media as recited in claim 1, wherein the links of the account ribbon are activatable in response to a mouse over event. 19. The non-transitory computer-readable media as recited in claim 1, wherein one or more of the message fields are updateable in real-time. | An account ribbon of a website has a plurality of message fields each having a link activatable to cause a display of a type of user related information. Continued access to the user related is provided by causing the account ribbon to be persisted across plural webpages of the website.1. A non-transitory computer-readable media having stored thereon computer executable instructions that, when executed by a processor, cause the processor to perform steps comprising:
causing an account ribbon to be persisted across plural webpages of a website, the account ribbon having a plurality of message fields each having a link activatable to cause a display of a type of user related information wherein the type of user related information that is accessible via activation of a one of the links is determined considering at least one characteristic of a user. 2. The non-transitory computer-readable media as recited in claim 1, wherein the links displayed in the message fields of the account ribbon are changed considering the at least one characteristic of the user. 3. The non-transitory computer-readable media as recited in claim 1, wherein the at least one characteristic of the user comprises a user role within a group. 4. The non-transitory computer-readable media as recited in claim 3, wherein the at least one characteristic of the user comprises a user role within an enterprise account with a vendor. 5. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is made accessible by being displayed in a further webpage of the website. 6. The non-transitory computer-readable media as recited in claim 5, wherein the user related information comprises additional links which are activatable to cause a display of a sub-type of user related information. 7. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is made accessible by being displayed in a webpage modal. 8. The non-transitory computer-readable media as recited in claim 7, wherein the user related information comprises additional links which are activatable to cause a display of a sub-type of user related information. 9. The non-transitory computer-readable media as recited in claim 1, wherein account ribbon is persisted across plural webpages of a website in a heading section of the plural webpages. 10. The non-transitory computer-readable media as recited in claim 1, wherein the user related information is displayed with a temporal ordering. 11. The non-transitory computer-readable media as recited in claim 10, wherein the user related information comprises a listing of event titles. 12. The non-transitory computer-readable media as recited in claim 10, wherein the listing of event titles are representative of events in one or more of a search channel, communications channel, and a purchasing channel. 13. The non-transitory computer-readable media as recited in claim 12, wherein the listing of event titles are representative of events in one or more of an on-line channel and an off-line channel. 14. The non-transitory computer-readable media as recited in claim 13, wherein the instructions capture event related metadata and the instructions provide for using a search query to include within the listing of event titles only those event titles having associated metadata which meets the search criteria. 15. The non-transitory computer-readable media as recited in claim 13, wherein at least one event titles is presented multiple times within the listing of event titles at different locations within the temporal ordering. 16. The non-transitory computer-readable media as recited in claim 13, wherein at least one event title is presented within the listing of event titles at a location that is associated with a related event title without regard to when in time an event corresponding to the event title occurred. 17. The non-transitory computer-readable media as recited in claim 1, wherein the message fields within the account ribbon are further user selectable. 18. The non-transitory computer-readable media as recited in claim 1, wherein the links of the account ribbon are activatable in response to a mouse over event. 19. The non-transitory computer-readable media as recited in claim 1, wherein one or more of the message fields are updateable in real-time. | 2,100 |
5,640 | 5,640 | 14,655,278 | 2,145 | 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, with the at least one processor, to cause the apparatus to perform at least the following: based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. | 1. 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, with the at least one processor, to cause the apparatus to perform at least the following: based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. 2. The apparatus of claim 1, wherein the presented full text string is at least one of:
a full text string which has been previously input in an open application by the user; and a full text string which is available for view by the user during entry of the entered text string in an open application. 3. The apparatus of claim 1, wherein the apparatus is configured to highlight the presented full text string as a candidate to allow for selection of the presented full text string. 4. The apparatus of claim 3, wherein the apparatus is configured to enable the selection of the presented full text string by interaction with the highlighted presented full text string. 5. The apparatus of claim 1, wherein the full text string is presented within an open application, the open application being one of:
a separate application to the application being used to enter the text string; or the same application being used to enter the text string. 6. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with at least a part of the full text string, the full text string available in a temporary buffer store automatically populated with full text strings presented to the user. 7. The apparatus of claim 6, wherein the temporary buffer store is a temporary prediction dictionary which is automatically populated with presented full text strings from an open application and which is deleted when the open application is closed. 8. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with a portion of the full text string, the full text string available in a prediction dictionary automatically populated with presented full text strings. 9. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with at least a part of the full text string, the full text string available in a temporary buffer store automatically populated with presented full text strings. 10. The apparatus of claim 1, wherein the apparatus is configured to enable selection of at least part of a presented full text string, the at least part of the selectable presented full text string comprising a text string which is the same as the entered text string. 11. The apparatus of claim 1, wherein the apparatus comprises a graphical user interface configured to provide the entered text string and/or presented full text string as display outputs. 12. The apparatus of claim 1, wherein the apparatus is a portable electronic device, a laptop computer, a mobile phone, a smartphone, a tablet computer, a personal digital assistant, a digital camera, a watch, a server, a non-portable electronic device, a desktop computer, a monitor, a server, a wand, a pointing stick, a touchpad, a touch-screen, a mouse, a joystick or a module/circuitry for one or more of the same. 13. A method, the method comprising:
based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. 14. A computer program comprising computer program code, the computer program code being configured to perform at least the following:
based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. | 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, with the at least one processor, to cause the apparatus to perform at least the following: based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string.1. 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, with the at least one processor, to cause the apparatus to perform at least the following: based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. 2. The apparatus of claim 1, wherein the presented full text string is at least one of:
a full text string which has been previously input in an open application by the user; and a full text string which is available for view by the user during entry of the entered text string in an open application. 3. The apparatus of claim 1, wherein the apparatus is configured to highlight the presented full text string as a candidate to allow for selection of the presented full text string. 4. The apparatus of claim 3, wherein the apparatus is configured to enable the selection of the presented full text string by interaction with the highlighted presented full text string. 5. The apparatus of claim 1, wherein the full text string is presented within an open application, the open application being one of:
a separate application to the application being used to enter the text string; or the same application being used to enter the text string. 6. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with at least a part of the full text string, the full text string available in a temporary buffer store automatically populated with full text strings presented to the user. 7. The apparatus of claim 6, wherein the temporary buffer store is a temporary prediction dictionary which is automatically populated with presented full text strings from an open application and which is deleted when the open application is closed. 8. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with a portion of the full text string, the full text string available in a prediction dictionary automatically populated with presented full text strings. 9. The apparatus of claim 1, wherein the apparatus is configured to enable selection by a user interaction with the full text string itself by using a comparison of the entered text string with at least a part of the full text string, the full text string available in a temporary buffer store automatically populated with presented full text strings. 10. The apparatus of claim 1, wherein the apparatus is configured to enable selection of at least part of a presented full text string, the at least part of the selectable presented full text string comprising a text string which is the same as the entered text string. 11. The apparatus of claim 1, wherein the apparatus comprises a graphical user interface configured to provide the entered text string and/or presented full text string as display outputs. 12. The apparatus of claim 1, wherein the apparatus is a portable electronic device, a laptop computer, a mobile phone, a smartphone, a tablet computer, a personal digital assistant, a digital camera, a watch, a server, a non-portable electronic device, a desktop computer, a monitor, a server, a wand, a pointing stick, a touchpad, a touch-screen, a mouse, a joystick or a module/circuitry for one or more of the same. 13. A method, the method comprising:
based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. 14. A computer program comprising computer program code, the computer program code being configured to perform at least the following:
based on an entered text string, enable selection of at least a part of a presented full text string as an adaptation for the entered text string by a user interaction with the presented full text string itself, the presented full text string being presented to the user prior to initiation of entry of the entered text string. | 2,100 |
5,641 | 5,641 | 15,095,905 | 2,166 | A method for enabling applications content streaming to a user device in response to a search query. The method includes receiving an input search query from the user device; selecting, based on the input search query, at least one resource to respond to the input search query; sending the input search query as an input to each of the at least one selected resource; providing, for each of the at least one selected resource, a single display segment within a display area on the user device; causing the at least one selected resource, in response to receiving the input search query, to execute an application of the at least one selected resource within a corresponding display segment; and establishing a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource. | 1. A method for enabling applications content streaming to a user device in response to a search query, comprising:
receiving an input search query from the user device; selecting, based on the input search query, at least one resource from a plurality of resources to respond to the input search query; sending the input search query as an input to each of the at least one selected resource; providing, for each of the at least one selected resource, a single display segment within a display area on the user device; causing the at least one selected resource, in response to receiving the input search query, to execute an application of the at least one selected resource within a corresponding display segment, wherein content displayed in each display segment corresponds only to content streamed by the application; and establishing a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource. 2. The method of claim 1, wherein the input search query further includes metadata, wherein the metadata relates to at least one of: the input search query, the user device, and a user of the user device. 3. The method of claim 2, further comprising:
analyzing the input search query and the metadata, wherein the selection of the at least one resource is further based on the analysis. 4. The method of claim 1, wherein the application of the at least one selected resource is not installed on the user device. 5. The method of claim 1, wherein the application of the at least one selected resource is a native application installed on the user device. 6. The method of claim 5, further comprising:
causing the at least one selected resource to activate the application on the user device; and streaming content in response to the input search query to the application for display in the display segment. 7. The method of claim 1, further comprising:
ranking the at least one selected resource for display on the user device. 8. The method of claim 7, wherein the at least one selected resource is ranked based on a collection of data from previous searches including at least one of: an explicit feedback, and an implicit feedback. 9. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 10. A server for enabling applications content streaming to a user device in response to a search query, comprising:
a processing system; and a memory, the memory containing instructions that, when executed by the processing system, configure the server to: receive an input search query from the user device; select, based on the input search query, at least one resource from a plurality of resources to respond to the input search query; send the input search query as an input to each of the at least one selected resource; provide, for each of the at least one selected resource, a single display segment within a display area on the user device; cause the at least one selected resource, in response to the input search query, to execute an application of the at least one selected resource within a corresponding display segment, wherein content displayed in each display segment corresponds only to content streamed by the application; and establish a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource. 11. The server of claim 10, wherein the input search query further includes metadata, wherein the metadata relates to at least one of: the input search query, the user device, and a user of the user device. 12. The server of claim 11, wherein the server is further configured to:
analyze the input search query and the metadata, wherein the selection of the at least one resource is further based on the analysis. 13. The server of claim 10, wherein the application of the at least one selected resource is not installed on the user device. 14. The server of claim 10, wherein the application of the at least one selected resource is a native application installed on the user device. 15. The server of claim 14, wherein the server is further configured to:
cause the at least one selected resource to activate the application on the user device; and stream content in response to the input search query to the application for display in the display segment. 16. The server of claim 10, wherein the server is further configured to:
rank the at least one selected resource for display on the user device. 17. The server of claim 16, wherein the at least one selected resource is ranked based on a collection of data from previous searches including at least one of: an explicit feedback, and an implicit feedback. | A method for enabling applications content streaming to a user device in response to a search query. The method includes receiving an input search query from the user device; selecting, based on the input search query, at least one resource to respond to the input search query; sending the input search query as an input to each of the at least one selected resource; providing, for each of the at least one selected resource, a single display segment within a display area on the user device; causing the at least one selected resource, in response to receiving the input search query, to execute an application of the at least one selected resource within a corresponding display segment; and establishing a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource.1. A method for enabling applications content streaming to a user device in response to a search query, comprising:
receiving an input search query from the user device; selecting, based on the input search query, at least one resource from a plurality of resources to respond to the input search query; sending the input search query as an input to each of the at least one selected resource; providing, for each of the at least one selected resource, a single display segment within a display area on the user device; causing the at least one selected resource, in response to receiving the input search query, to execute an application of the at least one selected resource within a corresponding display segment, wherein content displayed in each display segment corresponds only to content streamed by the application; and establishing a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource. 2. The method of claim 1, wherein the input search query further includes metadata, wherein the metadata relates to at least one of: the input search query, the user device, and a user of the user device. 3. The method of claim 2, further comprising:
analyzing the input search query and the metadata, wherein the selection of the at least one resource is further based on the analysis. 4. The method of claim 1, wherein the application of the at least one selected resource is not installed on the user device. 5. The method of claim 1, wherein the application of the at least one selected resource is a native application installed on the user device. 6. The method of claim 5, further comprising:
causing the at least one selected resource to activate the application on the user device; and streaming content in response to the input search query to the application for display in the display segment. 7. The method of claim 1, further comprising:
ranking the at least one selected resource for display on the user device. 8. The method of claim 7, wherein the at least one selected resource is ranked based on a collection of data from previous searches including at least one of: an explicit feedback, and an implicit feedback. 9. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 10. A server for enabling applications content streaming to a user device in response to a search query, comprising:
a processing system; and a memory, the memory containing instructions that, when executed by the processing system, configure the server to: receive an input search query from the user device; select, based on the input search query, at least one resource from a plurality of resources to respond to the input search query; send the input search query as an input to each of the at least one selected resource; provide, for each of the at least one selected resource, a single display segment within a display area on the user device; cause the at least one selected resource, in response to the input search query, to execute an application of the at least one selected resource within a corresponding display segment, wherein content displayed in each display segment corresponds only to content streamed by the application; and establish a direct communication link between the at least one selected resource and the user device for at least enabling direct interaction with the application of the at least one selected resource. 11. The server of claim 10, wherein the input search query further includes metadata, wherein the metadata relates to at least one of: the input search query, the user device, and a user of the user device. 12. The server of claim 11, wherein the server is further configured to:
analyze the input search query and the metadata, wherein the selection of the at least one resource is further based on the analysis. 13. The server of claim 10, wherein the application of the at least one selected resource is not installed on the user device. 14. The server of claim 10, wherein the application of the at least one selected resource is a native application installed on the user device. 15. The server of claim 14, wherein the server is further configured to:
cause the at least one selected resource to activate the application on the user device; and stream content in response to the input search query to the application for display in the display segment. 16. The server of claim 10, wherein the server is further configured to:
rank the at least one selected resource for display on the user device. 17. The server of claim 16, wherein the at least one selected resource is ranked based on a collection of data from previous searches including at least one of: an explicit feedback, and an implicit feedback. | 2,100 |
5,642 | 5,642 | 14,066,901 | 2,187 | The arrangement and method of the invention comprises dynamically limiting current provided to multiple peripheral interfaces of an electronic device, comprising individual current limiting per peripheral interface and global current limiting over all peripheral interfaces, in way that is optimized to best suit power needs for the peripheral devices connected to the peripheral interfaces while respecting the power supplying capacity of the electronic device. | 1-15. (canceled) 16. A method for electric power management of a plurality of peripheral interfaces for connecting a plurality of peripheral devices to an electronic device, wherein the method comprises:
detecting that the sum of electric currents delivered to the plurality of peripheral interfaces exceeds a predetermined limit; selecting, upon said detecting, at least one peripheral interface of said plurality of peripheral interfaces for limiting electric current delivered to the selected at least one peripheral interface; and limiting electric current delivered to the selected at least one peripheral interface to a maximum value, the maximum value being equal to the predetermined limit minus the sum of electric currents delivered to peripheral interfaces that have not been selected in the selecting step. 17. The method according to claim 16, wherein the detecting further comprises taking into account a predetermined minimal time duration of exceeding the predetermined limit. 18. The method according to claim 16, wherein the method comprises changing of a signal on the selected at least one peripheral interface selected in the selecting step, for indicating a limiting of electric current delivered to the selected at least one peripheral interface. 19. The method according to claim 18, wherein the level of the signal is determined by the maximum value. 20. The method according to claim 16, wherein the method comprises transmission of a message on the selected at least one peripheral interface selected in the selecting step, the message indicating the limiting of electric current delivered to the selected at least one peripheral interface. 21. The method according to claim 20, wherein the message comprises the maximum value. 22. The method according to claim 16, wherein the selecting comprises choosing for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces to which is connected a peripheral device that specified upon connection to the electronic device a maximum electric current need that exceeds that of a predetermined threshold for a standard peripheral device. 23. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces to which is connected a peripheral device that is a non data communicating device. 24. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces which are dedicated charging ports. 25. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces which are low priority devices. 26. The method according to claim 16, the plurality of peripheral interfaces are according to a version of Universal Serial Bus. 27. A device for electric power management of a plurality of peripheral interfaces connecting a plurality of peripheral devices, characterized in that the device comprises:
a detector detecting if the sum of electric currents delivered to the plurality of peripheral interfaces exceeds a predetermined limit; a selector for selecting upon said detecting, at least one peripheral interface of said plurality of peripheral interfaces for limiting electric current delivered to the selected at least one peripheral interface; and a current limiter limiting electric current delivered to the selected at least one peripheral interface to a maximum value, the maximum value being equal to the predetermined limit minus the sum of electric currents delivered to the peripheral interfaces that have not been selected by said selector. 28. The device according to claim 27, further comprising a timer for taking into account a predetermined minimal time duration of exceeding the predetermined limit. 29. The device according to claim 27, further comprising an interface line on the peripheral interfaces on which is provided a signal that changes on the at least one peripheral interface selected by the selector, for indicating the limiting of electric current delivered to the at least one peripheral interface. 30. The device according to claim 27, further comprising a message transmitter for transmission of a message on the at least one peripheral interface selected by the selector, the message indicating the limiting of electric current delivered to the selected at least one peripheral interface. | The arrangement and method of the invention comprises dynamically limiting current provided to multiple peripheral interfaces of an electronic device, comprising individual current limiting per peripheral interface and global current limiting over all peripheral interfaces, in way that is optimized to best suit power needs for the peripheral devices connected to the peripheral interfaces while respecting the power supplying capacity of the electronic device.1-15. (canceled) 16. A method for electric power management of a plurality of peripheral interfaces for connecting a plurality of peripheral devices to an electronic device, wherein the method comprises:
detecting that the sum of electric currents delivered to the plurality of peripheral interfaces exceeds a predetermined limit; selecting, upon said detecting, at least one peripheral interface of said plurality of peripheral interfaces for limiting electric current delivered to the selected at least one peripheral interface; and limiting electric current delivered to the selected at least one peripheral interface to a maximum value, the maximum value being equal to the predetermined limit minus the sum of electric currents delivered to peripheral interfaces that have not been selected in the selecting step. 17. The method according to claim 16, wherein the detecting further comprises taking into account a predetermined minimal time duration of exceeding the predetermined limit. 18. The method according to claim 16, wherein the method comprises changing of a signal on the selected at least one peripheral interface selected in the selecting step, for indicating a limiting of electric current delivered to the selected at least one peripheral interface. 19. The method according to claim 18, wherein the level of the signal is determined by the maximum value. 20. The method according to claim 16, wherein the method comprises transmission of a message on the selected at least one peripheral interface selected in the selecting step, the message indicating the limiting of electric current delivered to the selected at least one peripheral interface. 21. The method according to claim 20, wherein the message comprises the maximum value. 22. The method according to claim 16, wherein the selecting comprises choosing for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces to which is connected a peripheral device that specified upon connection to the electronic device a maximum electric current need that exceeds that of a predetermined threshold for a standard peripheral device. 23. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces to which is connected a peripheral device that is a non data communicating device. 24. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces which are dedicated charging ports. 25. The method according to claim 16, the method further comprising choosing, for limiting electric current, among the at least one peripheral interfaces of the plurality of peripheral interfaces which are low priority devices. 26. The method according to claim 16, the plurality of peripheral interfaces are according to a version of Universal Serial Bus. 27. A device for electric power management of a plurality of peripheral interfaces connecting a plurality of peripheral devices, characterized in that the device comprises:
a detector detecting if the sum of electric currents delivered to the plurality of peripheral interfaces exceeds a predetermined limit; a selector for selecting upon said detecting, at least one peripheral interface of said plurality of peripheral interfaces for limiting electric current delivered to the selected at least one peripheral interface; and a current limiter limiting electric current delivered to the selected at least one peripheral interface to a maximum value, the maximum value being equal to the predetermined limit minus the sum of electric currents delivered to the peripheral interfaces that have not been selected by said selector. 28. The device according to claim 27, further comprising a timer for taking into account a predetermined minimal time duration of exceeding the predetermined limit. 29. The device according to claim 27, further comprising an interface line on the peripheral interfaces on which is provided a signal that changes on the at least one peripheral interface selected by the selector, for indicating the limiting of electric current delivered to the at least one peripheral interface. 30. The device according to claim 27, further comprising a message transmitter for transmission of a message on the at least one peripheral interface selected by the selector, the message indicating the limiting of electric current delivered to the selected at least one peripheral interface. | 2,100 |
5,643 | 5,643 | 14,705,574 | 2,128 | An approach is provided for simulating environmental impacts of road salt impact by providing a first-order salt load model that may be run on an information handling system to estimate the spatial differentiation on the environmental impact of road salt in a specified watershed area using only topological information for the specified watershed area. The disclosed salt load model employs a reservoir model to determine the salt loading coefficient c=1/(1+e −λ ) for each target point in the landscape, where the topographical index term λ may be efficiently computed by adjusting a topological wetness index term generated by the TOPMODEL runoff generation model to compute the salt loading coefficient c as a two-dimensional map using only topological or elevation data for the watershed area of interest. | 1. A method, in an information handling system comprising a processor and a memory, for assessing environmental effect of road salt distribution in a watershed area, the method comprising:
receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 2. The method of claim 1, wherein receiving the topographical model comprises retrieving digital elevation data from system memory. 3. The method of claim 1, wherein computing the salt loading coefficient metric comprises computing a topographical index term λ=ln(α/(α0 tan β), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 4. The method of claim 3, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ) 5. The method of claim 1, wherein computing the salt loading coefficient metric comprises:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI term and local slope correction term to compute a sum term λ. 6. The method of claim 5, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 7. The method of claim 1, further comprising computing a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. 8. An information handling system comprising:
one or more processors; a memory coupled to at least one of the processors; a set of instructions stored in the memory and executed by at least one of the processors to assess environmental effect of road salt distribution in a watershed area, wherein the set of instructions are executable to perform actions of: receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 9. The information handling system of claim 8, wherein the set of instructions are executable to receive the topographical model by retrieving digital elevation data from system memory, 10. The information handling system of claim 8, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing a topographical index term λ=ln(α/α0 tan β)), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 11. The information handling system of claim 10, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 12. The information handling system of claim 8, wherein the set of instructions are executable to compute the salt loading coefficient metric by:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI, term and local slope correction term to compute a sum term λ. 13. The information handling system of claim 12, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 14. The information handling system of claim 8, further comprising instructions that are executable to compute a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. 15. A computer program product stored in a computer readable storage medium, comprising computer instructions that, when executed by an information handling system, causes the system to assessing environmental effect of road salt distribution in a watershed area by performing actions comprising:
receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 16. The computer program product of claim 15, wherein computing the salt loading coefficient metric comprises computing a topographical index term λ=ln(α/(α0 tan β)), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 17. The computer program product of claim 16, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 18. The computer program product of claim 15, wherein computing the salt loading coefficient metric comprises:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI term and local slope correction term to compute a sum term λ. 19. The computer program product of claim 18, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 20. The computer program product of claim 15, further comprising instructions that, when executed by an information handling system, causes the system compute a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. | An approach is provided for simulating environmental impacts of road salt impact by providing a first-order salt load model that may be run on an information handling system to estimate the spatial differentiation on the environmental impact of road salt in a specified watershed area using only topological information for the specified watershed area. The disclosed salt load model employs a reservoir model to determine the salt loading coefficient c=1/(1+e −λ ) for each target point in the landscape, where the topographical index term λ may be efficiently computed by adjusting a topological wetness index term generated by the TOPMODEL runoff generation model to compute the salt loading coefficient c as a two-dimensional map using only topological or elevation data for the watershed area of interest.1. A method, in an information handling system comprising a processor and a memory, for assessing environmental effect of road salt distribution in a watershed area, the method comprising:
receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 2. The method of claim 1, wherein receiving the topographical model comprises retrieving digital elevation data from system memory. 3. The method of claim 1, wherein computing the salt loading coefficient metric comprises computing a topographical index term λ=ln(α/(α0 tan β), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 4. The method of claim 3, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ) 5. The method of claim 1, wherein computing the salt loading coefficient metric comprises:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI term and local slope correction term to compute a sum term λ. 6. The method of claim 5, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 7. The method of claim 1, further comprising computing a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. 8. An information handling system comprising:
one or more processors; a memory coupled to at least one of the processors; a set of instructions stored in the memory and executed by at least one of the processors to assess environmental effect of road salt distribution in a watershed area, wherein the set of instructions are executable to perform actions of: receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 9. The information handling system of claim 8, wherein the set of instructions are executable to receive the topographical model by retrieving digital elevation data from system memory, 10. The information handling system of claim 8, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing a topographical index term λ=ln(α/α0 tan β)), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 11. The information handling system of claim 10, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 12. The information handling system of claim 8, wherein the set of instructions are executable to compute the salt loading coefficient metric by:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI, term and local slope correction term to compute a sum term λ. 13. The information handling system of claim 12, wherein the set of instructions are executable to compute the salt loading coefficient metric by computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 14. The information handling system of claim 8, further comprising instructions that are executable to compute a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. 15. A computer program product stored in a computer readable storage medium, comprising computer instructions that, when executed by an information handling system, causes the system to assessing environmental effect of road salt distribution in a watershed area by performing actions comprising:
receiving, by the system, a topographical model for the watershed area; computing, by the system, a salt loading coefficient metric for each of a plurality of target points in the watershed area using a specified catchment area and local hydraulic gradient extracted from the topographical model; and mapping, by the system, each salt loading coefficient metric to a corresponding road segment in the watershed area to generate a salt loading coefficient map to provide a first-order model estimation of spatial differentiation on the environmental effect of road salt distribution in the watershed area. 16. The computer program product of claim 15, wherein computing the salt loading coefficient metric comprises computing a topographical index term λ=ln(α/(α0 tan β)), where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient. 17. The computer program product of claim 16, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 18. The computer program product of claim 15, wherein computing the salt loading coefficient metric comprises:
computing a topological wetness index TWI term, ln(α/tan β0), for each target point in the watershed area, where α specifies an amount of water in an upslope contributing area per unit contour length for each target point in the watershed area, and where tan β0 specifies a local surface topographic slope at the target point; computing a local slope correction term, ln(tan β0/(α0 tan β)), where tan β specifies a straight line topographic slope between the target point and a destination flow drainage point, and where α0 specifies a tuning coefficient; and adding the topological wetness index TWI term and local slope correction term to compute a sum term λ. 19. The computer program product of claim 18, wherein computing the salt loading coefficient metric comprises computing, for each target point in the watershed area, a salt loading coefficient metric value c=1/(1+e−λ). 20. The computer program product of claim 15, further comprising instructions that, when executed by an information handling system, causes the system compute a total salt contribution to a selected drainage point from each road located in the watershed area by integrating a total salt contribution value M=∫Lm(x)·c(x)dx, where L specifies road segments for each road located in the watershed area, m(x) specifies a salt dispersion rate along each road L, and c(x) specifies the salt loading coefficient metric corresponding to each road segment in the watershed area contained in the salt loading coefficient map. | 2,100 |
5,644 | 5,644 | 14,090,516 | 2,198 | Novel and useful systems and methods for identifying, organizing and displaying organizational information are provided for multiple users to define organizational relationships associated with an organization. The organizational relationships are included in a set of organizational relationships and stored as organizational data in a computer-readable medium for future access. The organizational data is used for a variety of purposes, such as generating visual depictions of the organizational relationships. | 1. A computer-implemented method comprising:
receiving data from a first user defining a first organizational relationship; receiving data from a second user defining a second organizational relationship; generating a set of organizational relationships wherein the set of organizational relationships includes the first organizational relationship and the second organizational relationship; and storing the set of relationships in a computer-readable medium. 2. The method of claim 1, wherein the first organizational relationship includes a first pair of nodes and the second organizational relationship includes a second pair nodes. 3. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a contributor. 4. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a role. 5. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a team. 6. The method of claim 2, wherein the first pair of nodes and the second pair of nodes are members of an organization. 7. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes is a non-member of an organization. 8. The method of claim 1 further comprising creating a visual depiction of the set of relationships, wherein the visual depiction includes:
a visual representation of a plurality of profiles corresponding to a plurality of nodes; and
a visual representation of a plurality of relationships. 9. The method of claim 8 wherein the visual representation of a plurality of relationships includes a plurality of visual indicators of a seniority status of the relationship. 10. The method of claim 8 wherein the visual representation of a plurality of relationships includes a plurality of visual indicators of a confirmation status of the relationship. 11. The method of claim 8 further comprising receiving a preference attribute from a user and wherein the plurality of profiles and the plurality of relationships are determined according to the preference attribute or a combination of preference attributes. 12. The method of claim 8 further comprising receiving a unique identifier from a user and wherein:
the unique identifier is associated with a user type; and
the visual representation of the plurality of profiles and the visual representation of the plurality of relationships are determined according to the user type. 13. The method of claim 8, wherein:
the plurality of profiles are associated with a plurality of profile rule attributes; the plurality of relationships are associated with a plurality of relationship rule attributes; the visual representation of the plurality of profiles is determined according to the plurality of profile rule attributes; and the visual representation of the plurality of relationships is determined according to the plurality of relationship rule attributes. 14. The method of claim 8, wherein one of the plurality of profiles includes a contact attribute. 15. The method of claim 14, wherein the contact attribute is associated with a contact type and a contact identifier. 16. The method of claim 15, wherein a visual representation of one of the plurality of profiles contains a visual indicator of the contact type. 17. The method of claim 15, wherein a visual representation of one of the plurality of profiles contains a visual indicator of the contact identifier. 18. The method of claim 15, further comprising receiving a user command corresponding to the contact attribute and opening a communications channel corresponding to the contact type and the contact identifier. 19. The method of claim 14, wherein the contact attribute is designated as a preferred contact attribute. 20. The method of claim 19 wherein a visual representation of one of the plurality of profiles contains a visual indicator of the preferred contact attribute. 21. (canceled) 22. (canceled) 23. (canceled) 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled) 28. (canceled) 29. (canceled) 30. (canceled) 31. (canceled) 32. (canceled) 33. (canceled) 34. (canceled) 35. (canceled) 36. (canceled) 37. (canceled) | Novel and useful systems and methods for identifying, organizing and displaying organizational information are provided for multiple users to define organizational relationships associated with an organization. The organizational relationships are included in a set of organizational relationships and stored as organizational data in a computer-readable medium for future access. The organizational data is used for a variety of purposes, such as generating visual depictions of the organizational relationships.1. A computer-implemented method comprising:
receiving data from a first user defining a first organizational relationship; receiving data from a second user defining a second organizational relationship; generating a set of organizational relationships wherein the set of organizational relationships includes the first organizational relationship and the second organizational relationship; and storing the set of relationships in a computer-readable medium. 2. The method of claim 1, wherein the first organizational relationship includes a first pair of nodes and the second organizational relationship includes a second pair nodes. 3. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a contributor. 4. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a role. 5. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes represents a team. 6. The method of claim 2, wherein the first pair of nodes and the second pair of nodes are members of an organization. 7. The method of claim 2, wherein at least one node from the first pair of nodes and the second pair of nodes is a non-member of an organization. 8. The method of claim 1 further comprising creating a visual depiction of the set of relationships, wherein the visual depiction includes:
a visual representation of a plurality of profiles corresponding to a plurality of nodes; and
a visual representation of a plurality of relationships. 9. The method of claim 8 wherein the visual representation of a plurality of relationships includes a plurality of visual indicators of a seniority status of the relationship. 10. The method of claim 8 wherein the visual representation of a plurality of relationships includes a plurality of visual indicators of a confirmation status of the relationship. 11. The method of claim 8 further comprising receiving a preference attribute from a user and wherein the plurality of profiles and the plurality of relationships are determined according to the preference attribute or a combination of preference attributes. 12. The method of claim 8 further comprising receiving a unique identifier from a user and wherein:
the unique identifier is associated with a user type; and
the visual representation of the plurality of profiles and the visual representation of the plurality of relationships are determined according to the user type. 13. The method of claim 8, wherein:
the plurality of profiles are associated with a plurality of profile rule attributes; the plurality of relationships are associated with a plurality of relationship rule attributes; the visual representation of the plurality of profiles is determined according to the plurality of profile rule attributes; and the visual representation of the plurality of relationships is determined according to the plurality of relationship rule attributes. 14. The method of claim 8, wherein one of the plurality of profiles includes a contact attribute. 15. The method of claim 14, wherein the contact attribute is associated with a contact type and a contact identifier. 16. The method of claim 15, wherein a visual representation of one of the plurality of profiles contains a visual indicator of the contact type. 17. The method of claim 15, wherein a visual representation of one of the plurality of profiles contains a visual indicator of the contact identifier. 18. The method of claim 15, further comprising receiving a user command corresponding to the contact attribute and opening a communications channel corresponding to the contact type and the contact identifier. 19. The method of claim 14, wherein the contact attribute is designated as a preferred contact attribute. 20. The method of claim 19 wherein a visual representation of one of the plurality of profiles contains a visual indicator of the preferred contact attribute. 21. (canceled) 22. (canceled) 23. (canceled) 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled) 28. (canceled) 29. (canceled) 30. (canceled) 31. (canceled) 32. (canceled) 33. (canceled) 34. (canceled) 35. (canceled) 36. (canceled) 37. (canceled) | 2,100 |
5,645 | 5,645 | 15,830,202 | 2,175 | The present invention offers a snap-shot view which brings together, in one summary window, a limited list of common functions and commonly accessed stored data which itself can be reached directly from the main menu listing some or all applications. This yields many advantages in ease and speed of navigation, particularly on small screen devices. | 1. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display a plurality of items on the screen, each item corresponding to an application, the plurality of items arranged in a main view from which, responsive to a user input of a first type selecting any of the plurality of items in the main view, the application corresponding to the selected item is opened; responsive to a user input of the first type selecting an item corresponding to a contacts application, open the contacts application to display on the screen a list of contacts; and responsive to a user input of a second type selecting a contact in the displayed list:
display on the screen one or more contact details corresponding to the selected contact, each of the contact details associated with a corresponding application; and
responsive to a user input selecting one of the contact details, initiate a communication using the selected contact detail in the corresponding application. 2. The mobile telephone of claim 1, wherein the mobile telephone is further adapted to:
receive further user inputs for entry into the initiated communication; and then, responsive to a user input actuating the communication, send the communication via the selected contact detail. 3. The mobile telephone of claim 1, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 4. The mobile telephone of claim 3, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the contact. 5. The mobile telephone of claim 1, wherein the displayed contact details for the selected contact overlies at least a second contact in the displayed list. 6. The mobile telephone of claim 1, wherein the displayed contact details corresponding to the selected contact comprise one or more of: an email address and a phone number. 7. The mobile telephone of claim 1, wherein the mobile telephone is keyboard-less. 8. A method comprising:
responsive to a user input of a first type selecting an item corresponding to a contacts application from a plurality of items displayed on a mobile telephone screen, opening the contacts application to display on the screen a list of contacts; and responsive to a user input of a second type selecting a contact in the displayed list:
displaying on the screen one or more contact details corresponding to the selected contact, each of the contact details associated with a corresponding application; and
responsive to a user input selecting one of the contact details, initiating a communication using the selected contact detail in the corresponding application. 9. The method of claim 8, further comprising:
receiving further user inputs for entry into the initiated communication; and then, responsive to a user input actuating the communication, sending the communication via the selected contact detail. 10. The method of claim 8, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 11. The method of claim 10, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the contact. 12. The method of claim 8, wherein the displayed contact details for the selected contact overlies at least a second contact in the displayed list. 13. The method of claim 8, wherein the displayed contact details corresponding to the selected contact comprise one or more of: an email address and a phone number. 14. The method of claim 14, wherein the mobile telephone is keyboard-less. 15. A method comprising:
displaying, on a screen of a mobile telephone, a main view comprising a plurality of items, each item representing an application; receiving a first user input of a first type selecting one of the plurality of items from the main view, the selected item representing a first application; responsive to the first user input, opening the first application to display a list of data elements stored in the mobile telephone; then receiving a second user input of a second type selecting one of the data elements in the displayed list; responsive to the second user input, displaying one or more data items corresponding to the selected data element, each data item associated with an application other than the first application; and responsive to a third user input selecting one of the displayed data items corresponding to the selected data element, initiate a function within the application associated with the selected data item and using the selected data item. 16. The method of claim 16, wherein the first application is a contacts application;
wherein the data elements are names of contacts; wherein the data items are contact details corresponding to the selected data element, the displayed one or more data items comprising one or more of an email address and a phone number; and wherein the function is initiation of a communication within the application associated with the selected data item. 17. The method of claim 15, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 18. The method of claim 15, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the data item. 19. The method of claim 15, wherein the mobile telephone is keyboard-less. | The present invention offers a snap-shot view which brings together, in one summary window, a limited list of common functions and commonly accessed stored data which itself can be reached directly from the main menu listing some or all applications. This yields many advantages in ease and speed of navigation, particularly on small screen devices.1. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display a plurality of items on the screen, each item corresponding to an application, the plurality of items arranged in a main view from which, responsive to a user input of a first type selecting any of the plurality of items in the main view, the application corresponding to the selected item is opened; responsive to a user input of the first type selecting an item corresponding to a contacts application, open the contacts application to display on the screen a list of contacts; and responsive to a user input of a second type selecting a contact in the displayed list:
display on the screen one or more contact details corresponding to the selected contact, each of the contact details associated with a corresponding application; and
responsive to a user input selecting one of the contact details, initiate a communication using the selected contact detail in the corresponding application. 2. The mobile telephone of claim 1, wherein the mobile telephone is further adapted to:
receive further user inputs for entry into the initiated communication; and then, responsive to a user input actuating the communication, send the communication via the selected contact detail. 3. The mobile telephone of claim 1, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 4. The mobile telephone of claim 3, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the contact. 5. The mobile telephone of claim 1, wherein the displayed contact details for the selected contact overlies at least a second contact in the displayed list. 6. The mobile telephone of claim 1, wherein the displayed contact details corresponding to the selected contact comprise one or more of: an email address and a phone number. 7. The mobile telephone of claim 1, wherein the mobile telephone is keyboard-less. 8. A method comprising:
responsive to a user input of a first type selecting an item corresponding to a contacts application from a plurality of items displayed on a mobile telephone screen, opening the contacts application to display on the screen a list of contacts; and responsive to a user input of a second type selecting a contact in the displayed list:
displaying on the screen one or more contact details corresponding to the selected contact, each of the contact details associated with a corresponding application; and
responsive to a user input selecting one of the contact details, initiating a communication using the selected contact detail in the corresponding application. 9. The method of claim 8, further comprising:
receiving further user inputs for entry into the initiated communication; and then, responsive to a user input actuating the communication, sending the communication via the selected contact detail. 10. The method of claim 8, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 11. The method of claim 10, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the contact. 12. The method of claim 8, wherein the displayed contact details for the selected contact overlies at least a second contact in the displayed list. 13. The method of claim 8, wherein the displayed contact details corresponding to the selected contact comprise one or more of: an email address and a phone number. 14. The method of claim 14, wherein the mobile telephone is keyboard-less. 15. A method comprising:
displaying, on a screen of a mobile telephone, a main view comprising a plurality of items, each item representing an application; receiving a first user input of a first type selecting one of the plurality of items from the main view, the selected item representing a first application; responsive to the first user input, opening the first application to display a list of data elements stored in the mobile telephone; then receiving a second user input of a second type selecting one of the data elements in the displayed list; responsive to the second user input, displaying one or more data items corresponding to the selected data element, each data item associated with an application other than the first application; and responsive to a third user input selecting one of the displayed data items corresponding to the selected data element, initiate a function within the application associated with the selected data item and using the selected data item. 16. The method of claim 16, wherein the first application is a contacts application;
wherein the data elements are names of contacts; wherein the data items are contact details corresponding to the selected data element, the displayed one or more data items comprising one or more of an email address and a phone number; and wherein the function is initiation of a communication within the application associated with the selected data item. 17. The method of claim 15, wherein the user input of the second type selecting the item comprises a press and hold relating to the first item. 18. The method of claim 15, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the contact comprises a press and hold of the select function of the mobile telephone relating to the data item. 19. The method of claim 15, wherein the mobile telephone is keyboard-less. | 2,100 |
5,646 | 5,646 | 15,785,645 | 2,175 | The present invention offers a snap-shot view which brings together, in one summary window, a limited list of common functions and commonly accessed stored data which itself can be reached directly from the main menu listing some or all applications. This yields many advantages in ease and speed of navigation, particularly on small screen devices. | 1. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display a plurality of items on the screen, each item corresponding to an application, the plurality of items arranged in a main view from which, responsive to a user input of a first type selecting any of the plurality of items in the main view, the application corresponding to the selected item is opened; and responsive to a user input of a second type selecting a first item of the plurality of items in the main view, the first item corresponding to a first application: display on the screen an application summary for the first application, the application summary comprising a list of at least one function that can be initiated within the first application, the list excluding at least one other function that can be initiated within the first application; and responsive to a user input selecting a function in the displayed application summary, open the first application and initiate the selected function within the first application. 2. The mobile telephone of claim 1, wherein each of the plurality of items comprises at least one of a name associated with a corresponding application and an icon associated with the corresponding application. 3. The mobile telephone of claim 1, wherein the user input of the second type selecting the first item comprises a press and hold relating to the first item. 4. The mobile telephone of claim 3, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the first item comprises a press and hold of the select function of the mobile telephone relating to the first item. 5. The mobile telephone of claim 1, wherein the displayed application summary for the first application overlies at least a second item in the main view, the second item corresponding to a second application. 6. The mobile telephone of claim 1, wherein the mobile telephone is adapted to vary contents of the application summary for the first application according to a current environment external to the mobile telephone. 7. The mobile telephone of claim 6, wherein the mobile telephone further comprises Bluetooth communications capability;
and wherein the contents of the application summary for the first application varying according to the current environment comprises a list of other devices with Bluetooth capability in the vicinity of the mobile telephone. 8. The mobile telephone of claim 1, wherein the mobile telephone is adapted to select contents of the application summary for the first application based on usage patterns of a user. 9. The mobile telephone of claim 1, wherein the displayed application summary for the first application further comprises data of at least one stored data type accessible within the first application when opened. 10. The mobile telephone of claim 1, wherein the mobile telephone is adapted to, responsive to the user input selecting the function in the displayed application summary, open the first application and initiate the selected function within the first application without an intervening further user input. 11. A method comprising:
responsive to a user input of a first type selecting any of a plurality of items arranged in a main view displayed on a mobile telephone screen, each of the plurality of items corresponding to an application, opening the application corresponding to the selected item; and responsive to a user input of a second type selecting a first item of the plurality of items in the main view, the first item corresponding to a first application:
displaying on the screen an application summary for the first application, the application summary comprising a list of at least one function that can be initiated within the first application, the list excluding at least one other function that can be initiated within the first application; and
responsive to a user input selecting a function in the displayed application summary, opening the first application and initiating the selected function within the first application. 12. The method of claim 11, wherein each of the plurality of items comprises at least one of a name associated with a corresponding application and an icon associated with the corresponding application. 13. The method of claim 11, wherein the user input of the second type selecting the first item comprises a press and hold relating to the first item. 14. The method of claim 13, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the first item comprises a press and hold of the select function of the mobile telephone relating to the first item. 15. The method of claim 11, wherein the displayed application summary for the first application overlies at least a second item in the main view, the second item corresponding to a second application. 16. The method of claim 11, further comprising:
selecting contents of the application summary for the first application according to a current environment external to the mobile telephone. 17. The method of claim 16, wherein the selected contents of the application summary for the first application comprises a list of devices with Bluetooth capability in the vicinity of the mobile telephone. 18. The method of claim 11, further comprising:
selecting contents of the application summary for the first application based on usage patterns of a user. 19. The method of claim 11, wherein the displayed application summary for the first application further comprises data of at least one stored data type accessible within the first application when opened. 20. The method of claim 11, wherein the opening and initiating steps are performed, responsive to the user input selecting the function in the displayed application summary, without an intervening further user input. 21. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display on the screen a main view comprising a plurality of items, each item representing an application; receive a user input selecting one of the plurality of items from the main view; responsive to the received user input being of a first type, open the application corresponding to the selected item; and responsive to the received user input being of a second type:
without opening the application, display on the screen an application summary for the application corresponding to the selected item, the application summary comprising a list of at least one of a plurality of functions that can be initiated within the application, the list not including at least one other of the plurality of functions that can be initiated within the application; and
then, responsive to a user input selecting a function from said application summary, open the application and initiate the selected function within the opened application without requiring an intervening further user input. 22. The mobile telephone of claim 21, wherein each of the plurality of items comprises at least one of a name representing an application and an icon representing the application. 23. The mobile telephone of claim 21, wherein the user input of the second type comprises a press and hold relating to the item. 24. The mobile telephone of claim 23, wherein the user input of the first type comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type comprises a press and hold of the select function of the mobile telephone relating to the item. 25. The mobile telephone of claim 21, wherein the displayed application summary for the application overlies at least one other item in the main view. 26. A method comprising:
displaying, on a screen of a mobile telephone, a main view comprising a plurality of items, each item representing an application; receiving a user input selecting one of the plurality of items from the main view; responsive to the received user input being of a first type, opening the application corresponding to the selected item; and responsive to the received user input being of a second type:
without opening the application, displaying on the screen an application summary for the application corresponding to the selected item, the application summary comprising a list of at least one of a plurality of functions that can be initiated within the application, the list not including at least one other of the plurality of functions that can be initiated within the application; and
then, responsive to a user input selecting a function from said application summary, opening the application and initiating the selected function within the opened application without requiring an intervening further user input. 27. The method of claim 26, wherein each of the plurality of items comprises at least one of a name representing an application and an icon representing the application. 28. The method of claim 26, wherein the user input of the second type comprises a press and hold relating to the item. 29. The method of claim 28, wherein the user input of the first type comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type comprises a press and hold of the select function of the mobile telephone relating to the item. 30. The method of claim 26, wherein the displayed application summary for the application overlies at least one other item in the main view. | The present invention offers a snap-shot view which brings together, in one summary window, a limited list of common functions and commonly accessed stored data which itself can be reached directly from the main menu listing some or all applications. This yields many advantages in ease and speed of navigation, particularly on small screen devices.1. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display a plurality of items on the screen, each item corresponding to an application, the plurality of items arranged in a main view from which, responsive to a user input of a first type selecting any of the plurality of items in the main view, the application corresponding to the selected item is opened; and responsive to a user input of a second type selecting a first item of the plurality of items in the main view, the first item corresponding to a first application: display on the screen an application summary for the first application, the application summary comprising a list of at least one function that can be initiated within the first application, the list excluding at least one other function that can be initiated within the first application; and responsive to a user input selecting a function in the displayed application summary, open the first application and initiate the selected function within the first application. 2. The mobile telephone of claim 1, wherein each of the plurality of items comprises at least one of a name associated with a corresponding application and an icon associated with the corresponding application. 3. The mobile telephone of claim 1, wherein the user input of the second type selecting the first item comprises a press and hold relating to the first item. 4. The mobile telephone of claim 3, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the first item comprises a press and hold of the select function of the mobile telephone relating to the first item. 5. The mobile telephone of claim 1, wherein the displayed application summary for the first application overlies at least a second item in the main view, the second item corresponding to a second application. 6. The mobile telephone of claim 1, wherein the mobile telephone is adapted to vary contents of the application summary for the first application according to a current environment external to the mobile telephone. 7. The mobile telephone of claim 6, wherein the mobile telephone further comprises Bluetooth communications capability;
and wherein the contents of the application summary for the first application varying according to the current environment comprises a list of other devices with Bluetooth capability in the vicinity of the mobile telephone. 8. The mobile telephone of claim 1, wherein the mobile telephone is adapted to select contents of the application summary for the first application based on usage patterns of a user. 9. The mobile telephone of claim 1, wherein the displayed application summary for the first application further comprises data of at least one stored data type accessible within the first application when opened. 10. The mobile telephone of claim 1, wherein the mobile telephone is adapted to, responsive to the user input selecting the function in the displayed application summary, open the first application and initiate the selected function within the first application without an intervening further user input. 11. A method comprising:
responsive to a user input of a first type selecting any of a plurality of items arranged in a main view displayed on a mobile telephone screen, each of the plurality of items corresponding to an application, opening the application corresponding to the selected item; and responsive to a user input of a second type selecting a first item of the plurality of items in the main view, the first item corresponding to a first application:
displaying on the screen an application summary for the first application, the application summary comprising a list of at least one function that can be initiated within the first application, the list excluding at least one other function that can be initiated within the first application; and
responsive to a user input selecting a function in the displayed application summary, opening the first application and initiating the selected function within the first application. 12. The method of claim 11, wherein each of the plurality of items comprises at least one of a name associated with a corresponding application and an icon associated with the corresponding application. 13. The method of claim 11, wherein the user input of the second type selecting the first item comprises a press and hold relating to the first item. 14. The method of claim 13, wherein the user input of the first type selecting an item comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type selecting the first item comprises a press and hold of the select function of the mobile telephone relating to the first item. 15. The method of claim 11, wherein the displayed application summary for the first application overlies at least a second item in the main view, the second item corresponding to a second application. 16. The method of claim 11, further comprising:
selecting contents of the application summary for the first application according to a current environment external to the mobile telephone. 17. The method of claim 16, wherein the selected contents of the application summary for the first application comprises a list of devices with Bluetooth capability in the vicinity of the mobile telephone. 18. The method of claim 11, further comprising:
selecting contents of the application summary for the first application based on usage patterns of a user. 19. The method of claim 11, wherein the displayed application summary for the first application further comprises data of at least one stored data type accessible within the first application when opened. 20. The method of claim 11, wherein the opening and initiating steps are performed, responsive to the user input selecting the function in the displayed application summary, without an intervening further user input. 21. A mobile telephone comprising a display screen, the mobile telephone being adapted to:
display on the screen a main view comprising a plurality of items, each item representing an application; receive a user input selecting one of the plurality of items from the main view; responsive to the received user input being of a first type, open the application corresponding to the selected item; and responsive to the received user input being of a second type:
without opening the application, display on the screen an application summary for the application corresponding to the selected item, the application summary comprising a list of at least one of a plurality of functions that can be initiated within the application, the list not including at least one other of the plurality of functions that can be initiated within the application; and
then, responsive to a user input selecting a function from said application summary, open the application and initiate the selected function within the opened application without requiring an intervening further user input. 22. The mobile telephone of claim 21, wherein each of the plurality of items comprises at least one of a name representing an application and an icon representing the application. 23. The mobile telephone of claim 21, wherein the user input of the second type comprises a press and hold relating to the item. 24. The mobile telephone of claim 23, wherein the user input of the first type comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type comprises a press and hold of the select function of the mobile telephone relating to the item. 25. The mobile telephone of claim 21, wherein the displayed application summary for the application overlies at least one other item in the main view. 26. A method comprising:
displaying, on a screen of a mobile telephone, a main view comprising a plurality of items, each item representing an application; receiving a user input selecting one of the plurality of items from the main view; responsive to the received user input being of a first type, opening the application corresponding to the selected item; and responsive to the received user input being of a second type:
without opening the application, displaying on the screen an application summary for the application corresponding to the selected item, the application summary comprising a list of at least one of a plurality of functions that can be initiated within the application, the list not including at least one other of the plurality of functions that can be initiated within the application; and
then, responsive to a user input selecting a function from said application summary, opening the application and initiating the selected function within the opened application without requiring an intervening further user input. 27. The method of claim 26, wherein each of the plurality of items comprises at least one of a name representing an application and an icon representing the application. 28. The method of claim 26, wherein the user input of the second type comprises a press and hold relating to the item. 29. The method of claim 28, wherein the user input of the first type comprises use of a select function of the mobile telephone relating to the item;
and wherein the user input of the second type comprises a press and hold of the select function of the mobile telephone relating to the item. 30. The method of claim 26, wherein the displayed application summary for the application overlies at least one other item in the main view. | 2,100 |
5,647 | 5,647 | 15,268,798 | 2,135 | The techniques described herein improve cache traffic performance in the context of contended lock instructions. More specifically, each core maintains a lock address contention table that stores addresses corresponding to contended lock instructions. The lock address contention table also includes a state value that indicates progress through a series of states meant to track whether a load by the core in a spin-loop associated with semaphore acquisition has obtained the semaphore in an exclusive state. Upon detecting that a load in a spin-loop has obtained the semaphore in an exclusive state, the core responds to incoming requests for access to the semaphore with negative acknowledgments. This allows the core to maintain the semaphore cache line in an exclusive state, which allows it to acquire the semaphore faster and to avoid transmitting that cache line to other cores unnecessarily. | 1. A method for handling cache coherency traffic for a contended semaphore, the method comprising:
a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore; a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted; a third detection, comprising detecting a fill of the cache line in an exclusive state; and responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 2. The method of claim 1, wherein:
the address associated with the contended semaphore is stored in a lock address contention table. 3. The method of claim 2, further comprising:
responsive to the first detection, associating a first state value with the address in the lock address contention table; responsive to the second detection, associating a second state value with the address in the lock address contention table; and responsive to the third detection, associating a third state value with the address in the lock address contention table. 4. The method of claim 1, further comprising:
entering the semaphore cache line protection mode occurs responsive to the first detection, the second detection, and the third detection occurring in order and without an out-of-sequence event occurring therebetween. 5. The method of claim 4, wherein the out-of-sequence event comprises one or more of:
a non-lock load to the address associated with the contended semaphore after the first detection but before the second detection or after the second detection but before the third detection, or a fill of the cache line in an exclusive state after the first detection but before the second detection. 6. The method of claim 1, wherein entering the semaphore cache line protection mode comprises entering the semaphore cache line protection mode for a first number of cycles, and, after the first number of cycles, leaving the semaphore cache line protection mode. 7. The method of claim 1, wherein:
the non-lock load is included within a spin-loop of a semaphore acquisition sequence. 8. The method of claim 1, wherein:
the cache line associated with the contended semaphore is evicted responsive to a core that owns the contended semaphore requesting to write a value to the contended semaphore indicating that the contended semaphore is available. 9. The method of claim 1, wherein the fill of the cache line in the exclusive state occurs responsive to a lock instruction for acquiring the semaphore. 10. A processing unit comprising:
a processing core including a load/store unit; and a cache, wherein the load/store unit is configured to handle cache coherency traffic for a contended semaphore by:
performing a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore;
performing a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted;
performing a third detection, comprising detecting a fill of the cache line in an exclusive state; and
responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 11. The processing unit of claim 10, wherein:
the address associated with the contended semaphore is stored in a lock address contention table. 12. The processing unit of claim 11, wherein the load/store unit is further configured to:
responsive to the first detection, associate a first state value with the address in the lock address contention table; responsive to the second detection, associate a second state value with the address in the lock address contention table; and responsive to the third detection, associate a third state value with the address in the lock address contention table. 13. The processing unit of claim 10, wherein the load/store unit is configured to:
enter the semaphore cache line protection mode responsive to the first detection, the second detection, and the third detection occurring in order and without an out-of-sequence event occurring therebetween. 14. The processing unit of claim 10, wherein the out-of-sequence event comprises one or more of:
a non-lock load to the address associated with the contended semaphore after the first detection but before the second detection or after the second detection but before the third detection, or a fill of the cache line in an exclusive state after the first detection but before the second detection. 15. The processing unit of claim 10, wherein the load/store unit is configured to:
leave the semaphore cache line protection mode after a first number of cycles has elapsed subsequent to entering the semaphore cache line protection mode. 16. The processing unit of claim 10, wherein:
the non-lock load is included within a spin-loop of a semaphore acquisition sequence. 17. The processing unit of claim 10, wherein:
the cache line associated with the contended semaphore is evicted responsive to a core that owns the contended semaphore requesting to write a value to the contended semaphore indicating that the contended semaphore is available. 18. The processing unit of claim 10, wherein the fill of the cache line in the exclusive state occurs responsive to a lock instruction for acquiring the semaphore. 19. A processor, comprising:
a plurality of processing cores coupled together, each processing core including a load/store unit; and a plurality of caches, each cache associated with a respective processing core of the plurality of processing cores, wherein the load/store unit of each processing core of the plurality of processing cores is configured to handle cache coherency traffic for a contended semaphore by:
performing a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore;
performing a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted;
performing a third detection, comprising detecting a fill of the cache line in an exclusive state; and
responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 20. The processor of claim 19, wherein:
each processing core of the plurality of processing cores includes a lock address contention table, and at least one lock address contention table stores an address associated with the contended semaphore. | The techniques described herein improve cache traffic performance in the context of contended lock instructions. More specifically, each core maintains a lock address contention table that stores addresses corresponding to contended lock instructions. The lock address contention table also includes a state value that indicates progress through a series of states meant to track whether a load by the core in a spin-loop associated with semaphore acquisition has obtained the semaphore in an exclusive state. Upon detecting that a load in a spin-loop has obtained the semaphore in an exclusive state, the core responds to incoming requests for access to the semaphore with negative acknowledgments. This allows the core to maintain the semaphore cache line in an exclusive state, which allows it to acquire the semaphore faster and to avoid transmitting that cache line to other cores unnecessarily.1. A method for handling cache coherency traffic for a contended semaphore, the method comprising:
a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore; a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted; a third detection, comprising detecting a fill of the cache line in an exclusive state; and responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 2. The method of claim 1, wherein:
the address associated with the contended semaphore is stored in a lock address contention table. 3. The method of claim 2, further comprising:
responsive to the first detection, associating a first state value with the address in the lock address contention table; responsive to the second detection, associating a second state value with the address in the lock address contention table; and responsive to the third detection, associating a third state value with the address in the lock address contention table. 4. The method of claim 1, further comprising:
entering the semaphore cache line protection mode occurs responsive to the first detection, the second detection, and the third detection occurring in order and without an out-of-sequence event occurring therebetween. 5. The method of claim 4, wherein the out-of-sequence event comprises one or more of:
a non-lock load to the address associated with the contended semaphore after the first detection but before the second detection or after the second detection but before the third detection, or a fill of the cache line in an exclusive state after the first detection but before the second detection. 6. The method of claim 1, wherein entering the semaphore cache line protection mode comprises entering the semaphore cache line protection mode for a first number of cycles, and, after the first number of cycles, leaving the semaphore cache line protection mode. 7. The method of claim 1, wherein:
the non-lock load is included within a spin-loop of a semaphore acquisition sequence. 8. The method of claim 1, wherein:
the cache line associated with the contended semaphore is evicted responsive to a core that owns the contended semaphore requesting to write a value to the contended semaphore indicating that the contended semaphore is available. 9. The method of claim 1, wherein the fill of the cache line in the exclusive state occurs responsive to a lock instruction for acquiring the semaphore. 10. A processing unit comprising:
a processing core including a load/store unit; and a cache, wherein the load/store unit is configured to handle cache coherency traffic for a contended semaphore by:
performing a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore;
performing a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted;
performing a third detection, comprising detecting a fill of the cache line in an exclusive state; and
responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 11. The processing unit of claim 10, wherein:
the address associated with the contended semaphore is stored in a lock address contention table. 12. The processing unit of claim 11, wherein the load/store unit is further configured to:
responsive to the first detection, associate a first state value with the address in the lock address contention table; responsive to the second detection, associate a second state value with the address in the lock address contention table; and responsive to the third detection, associate a third state value with the address in the lock address contention table. 13. The processing unit of claim 10, wherein the load/store unit is configured to:
enter the semaphore cache line protection mode responsive to the first detection, the second detection, and the third detection occurring in order and without an out-of-sequence event occurring therebetween. 14. The processing unit of claim 10, wherein the out-of-sequence event comprises one or more of:
a non-lock load to the address associated with the contended semaphore after the first detection but before the second detection or after the second detection but before the third detection, or a fill of the cache line in an exclusive state after the first detection but before the second detection. 15. The processing unit of claim 10, wherein the load/store unit is configured to:
leave the semaphore cache line protection mode after a first number of cycles has elapsed subsequent to entering the semaphore cache line protection mode. 16. The processing unit of claim 10, wherein:
the non-lock load is included within a spin-loop of a semaphore acquisition sequence. 17. The processing unit of claim 10, wherein:
the cache line associated with the contended semaphore is evicted responsive to a core that owns the contended semaphore requesting to write a value to the contended semaphore indicating that the contended semaphore is available. 18. The processing unit of claim 10, wherein the fill of the cache line in the exclusive state occurs responsive to a lock instruction for acquiring the semaphore. 19. A processor, comprising:
a plurality of processing cores coupled together, each processing core including a load/store unit; and a plurality of caches, each cache associated with a respective processing core of the plurality of processing cores, wherein the load/store unit of each processing core of the plurality of processing cores is configured to handle cache coherency traffic for a contended semaphore by:
performing a first detection, comprising detecting a non-lock load to an address associated with the contended semaphore;
performing a second detection, comprising detecting that a cache line associated with the contended semaphore is evicted;
performing a third detection, comprising detecting a fill of the cache line in an exclusive state; and
responsive to the first detection, the second detection, and the third detection, entering a semaphore cache line protection mode in which requests for access to the cache line associated with the contended semaphore are responded to with negative acknowledgments that prevent access to the cache line associated with the contended semaphore. 20. The processor of claim 19, wherein:
each processing core of the plurality of processing cores includes a lock address contention table, and at least one lock address contention table stores an address associated with the contended semaphore. | 2,100 |
5,648 | 5,648 | 15,342,117 | 2,125 | Devices and methods are disclosed for establishing interaction among electronic devices of an environment. The device has a transmitter, receiver, memory for storing interaction rules, and a processor for learning the interaction rules in association with the transmitter, receiver, and other devices of the environment. The device also includes components for performing the device specific functions and a state sensor for determining the logical or physical state of the device. Methods involve observing at one or more devices change of state activity among the plurality of devices through receiving a change of state message that is transmitted to the one or more devices. A set of rules are learned at the one or more devices based upon observing the change of state activity. The learned set of rules are then applied at the one or more devices to automatically control changes of state of devices within the plurality of devices. | 1.-20. (canceled) 21. A method comprising:
establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 22. The method of claim 21, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 23. The method of claim 21, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 24. The method of claim 23, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 25. The method of claim 21, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 26. The method of claim 25, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 27. The method of claim 21, wherein the one or more devices include a first device of a first device type and a second device of a second device type. 28. A non-transitory computer-readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 29. The non-transitory computer-readable medium of claim 28, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 30. The non-transitory computer-readable medium of claim 28, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 31. The non-transitory computer-readable medium of claim 30, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 32. The non-transitory computer-readable medium of claim 28, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 33. The non-transitory computer-readable medium of claim 32, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 34. The non-transitory computer-readable medium of claim 28, wherein the one or more devices include a first device of a first device type and a second device of a second device type. 35. A system comprising:
one or more processors; and a non-transitory computer-readable medium including one or more sequences of instructions that, when executed by the one or more processors, cause the processors to perform operations comprising: establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 36. The system of claim 35, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 37. The system of claim 35, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 38. The system of claim 37, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 39. The system of claim 35, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 40. The system of claim 39, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 41. The system of claim 35, wherein the one or more devices include a first device of a first device type and a second device of a second device type. | Devices and methods are disclosed for establishing interaction among electronic devices of an environment. The device has a transmitter, receiver, memory for storing interaction rules, and a processor for learning the interaction rules in association with the transmitter, receiver, and other devices of the environment. The device also includes components for performing the device specific functions and a state sensor for determining the logical or physical state of the device. Methods involve observing at one or more devices change of state activity among the plurality of devices through receiving a change of state message that is transmitted to the one or more devices. A set of rules are learned at the one or more devices based upon observing the change of state activity. The learned set of rules are then applied at the one or more devices to automatically control changes of state of devices within the plurality of devices.1.-20. (canceled) 21. A method comprising:
establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 22. The method of claim 21, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 23. The method of claim 21, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 24. The method of claim 23, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 25. The method of claim 21, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 26. The method of claim 25, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 27. The method of claim 21, wherein the one or more devices include a first device of a first device type and a second device of a second device type. 28. A non-transitory computer-readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 29. The non-transitory computer-readable medium of claim 28, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 30. The non-transitory computer-readable medium of claim 28, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 31. The non-transitory computer-readable medium of claim 30, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 32. The non-transitory computer-readable medium of claim 28, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 33. The non-transitory computer-readable medium of claim 32, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 34. The non-transitory computer-readable medium of claim 28, wherein the one or more devices include a first device of a first device type and a second device of a second device type. 35. A system comprising:
one or more processors; and a non-transitory computer-readable medium including one or more sequences of instructions that, when executed by the one or more processors, cause the processors to perform operations comprising: establishing, by an aggregator device, communication with a plurality of devices in a device environment; receiving, by the aggregator device from the plurality of devices, messages indicating state changes at the plurality of devices in the device environment; automatically determining, by the aggregator device, a plurality of interaction rules based on the state change messages, each of the plurality of interaction rules defining an association between a trigger event and one or more target states for respective one or more target devices in the device environment; storing, by the aggregator device, the plurality of interaction rules; detecting, by the aggregator device, a first event; determining, by the aggregator device, a particular interaction rule from the plurality of interaction rules that corresponds to the first event when the first event corresponds to the trigger event defined by the particular interaction rule; determining, by the aggregator device, the one or more target states for the one or more target devices defined by the particular interaction rule; automatically causing, by the aggregator device, the one or more devices in the device environment to change state to the respective one or more target states in response to detecting the first event. 36. The system of claim 35, wherein the first event corresponds to a first state change at a first device in the plurality of devices in the device environment. 37. The system of claim 35, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a first target state for a first target device in the one or more target devices defined by the particular interaction rule; and sending a first message to the first target device instructing the first target device to change state to the first target state. 38. The system of claim 37, wherein automatically causing the one or more devices in the device environment to change state comprises:
determining a second target state for a second target device in the one or more target devices defined by the particular interaction rule; and sending a second message to the second target device instructing the second target device to change state to the second target state, where the second target state is different than the first target state. 39. The system of claim 35, further comprising:
detecting a change to a first state at a first device at a first time; detecting a change to a second state at a second device at a second time; determining, based on the first time and the second time, whether the first state change and the second state change occur within a period of time; and automatically generating a new interaction rule based on the first state change and the second state change. 40. The system of claim 39, further comprising:
determining that the first state change occurred before the second state change; and automatically generating a new interaction rule that defines a change to the first state at the first device as a trigger for causing the second device to change state to the second state. 41. The system of claim 35, wherein the one or more devices include a first device of a first device type and a second device of a second device type. | 2,100 |
5,649 | 5,649 | 14,388,994 | 2,175 | A system and method for providing an enhanced second screen experience is provided includes a content-rich second screen user interface with information relative to an event and event participants as well as social media aspects relative to the event and event participants. | 1. A computer-implemented method for providing an enhanced second screen experience, comprising:
providing a user interface, the user interface configured to present data relative to an event and participants in said event; and providing a social media interface including a social media thread within or overlaid on said user interface, the social media thread being specific to the event or to participants in the event, the social media interface being configured receive or initiate a social media comment by a user and to display social media comments posted by plural users. 2. A computer-implemented method in accordance with claim 1, wherein the second screen experience is provided in temporal parallel with the event. 3. A computer-implemented method in accordance with claim 1, wherein the second screen experience provides information on plural levels of granularity relative to the event, including two or more of game or event status, team status or statistics, and player status or statistics. 4. A computer-implemented method in accordance with claim 1, wherein the user interface includes interactive content configured such that user interaction with the content reveals additional information about the event or the event participants. 5. A computer-implemented method in accordance with claim 1, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to reveal further information about the player 6. A computer-implemented method in accordance with claim 1, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to provide a social media thread specific to that participant. 7. A computer-implemented method in accordance with claim 1, wherein a shape or indicator of a participant's name or other identifier changes according to the level of social activity relative to that participant. 8. A computer-implemented method in accordance with claim 1, wherein a communications interface is provided and configured to allow users to send and receive answers to questions from an event expert. 9. A computer-implemented method in accordance with claim 1, wherein the social media interface displays an aggregate of thread comments from plural social media sources. 10. A computer-implemented method in accordance with claim 9, wherein said social media interface is configured to permit selection of one or more social media sources for thread display. 11. A computer-implemented method in accordance with claim 1, wherein the social media interface is configured to initiate user login to one or more social media sources. 12. A computer-implemented method in accordance with claim 11, wherein said social media interface is configured to automatically log a user into one or more social media sources. 13. A computer-implemented method in accordance with claim 1, further comprising presentation of media coinciding with an action in an event. 14. A computer-implemented method in accordance with claim 13, wherein such presentation of media is accompanied with a purchase command or icon, configured to allow a user to purchase the presented media. 15. A system for providing an enhanced second screen experience, comprising:
a user interface, the user interface configured to present data relative to an event and participants in said event; and a social media interface including a social media thread within or overlaid on said user interface, the social media thread being specific to the event or to participants in the event, the social media interface being configured receive or initiate a social media comment by a user and to display social media comments posted by plural users. 16. A system in accordance with claim 15, wherein the second screen experience is provided in temporal parallel with the event. 17. A system in accordance with claim 15, wherein the second screen experience provides information on plural levels of granularity relative to the event, including two or more of game or event status, team status or statistics, and player status or statistics. 18. A system in accordance with claim 15, wherein the user interface includes interactive content configured such that user interaction with the content reveals additional information about the event or the event participants. 19. A system in accordance with claim 15, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to reveal further information about the player 20. A system in accordance with claim 15, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to provide a social media thread specific to that participant. 21. A system in accordance with claim 15, wherein a shape or indicator of a participant's name or other identifier changes according to the level of social activity relative to that participant. 22. A system in accordance with claim 15, wherein a communications interface is provided and configured to allow users to send and receive answers to questions from an event expert. 23. A system in accordance with claim 15, wherein the social media interface displays an aggregate of thread comments from plural social media sources. 24. A system in accordance with claim 23, wherein said social media interface is configured to permit selection of one or more social media sources for thread display. 25. A system in accordance with claim 15, wherein the social media interface is configured to initiate user login to one or more social media sources. 26. A system in accordance with claim 25, wherein said social media interface is configured to automatically log a user into one or more social media sources. 27. A system in accordance with claim 15, further comprising presentation of media coinciding with an action in an event. 28. A system in accordance with claim 27, wherein such presentation of media is accompanied with a purchase command or icon, configured to allow a user to purchase the presented media. | A system and method for providing an enhanced second screen experience is provided includes a content-rich second screen user interface with information relative to an event and event participants as well as social media aspects relative to the event and event participants.1. A computer-implemented method for providing an enhanced second screen experience, comprising:
providing a user interface, the user interface configured to present data relative to an event and participants in said event; and providing a social media interface including a social media thread within or overlaid on said user interface, the social media thread being specific to the event or to participants in the event, the social media interface being configured receive or initiate a social media comment by a user and to display social media comments posted by plural users. 2. A computer-implemented method in accordance with claim 1, wherein the second screen experience is provided in temporal parallel with the event. 3. A computer-implemented method in accordance with claim 1, wherein the second screen experience provides information on plural levels of granularity relative to the event, including two or more of game or event status, team status or statistics, and player status or statistics. 4. A computer-implemented method in accordance with claim 1, wherein the user interface includes interactive content configured such that user interaction with the content reveals additional information about the event or the event participants. 5. A computer-implemented method in accordance with claim 1, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to reveal further information about the player 6. A computer-implemented method in accordance with claim 1, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to provide a social media thread specific to that participant. 7. A computer-implemented method in accordance with claim 1, wherein a shape or indicator of a participant's name or other identifier changes according to the level of social activity relative to that participant. 8. A computer-implemented method in accordance with claim 1, wherein a communications interface is provided and configured to allow users to send and receive answers to questions from an event expert. 9. A computer-implemented method in accordance with claim 1, wherein the social media interface displays an aggregate of thread comments from plural social media sources. 10. A computer-implemented method in accordance with claim 9, wherein said social media interface is configured to permit selection of one or more social media sources for thread display. 11. A computer-implemented method in accordance with claim 1, wherein the social media interface is configured to initiate user login to one or more social media sources. 12. A computer-implemented method in accordance with claim 11, wherein said social media interface is configured to automatically log a user into one or more social media sources. 13. A computer-implemented method in accordance with claim 1, further comprising presentation of media coinciding with an action in an event. 14. A computer-implemented method in accordance with claim 13, wherein such presentation of media is accompanied with a purchase command or icon, configured to allow a user to purchase the presented media. 15. A system for providing an enhanced second screen experience, comprising:
a user interface, the user interface configured to present data relative to an event and participants in said event; and a social media interface including a social media thread within or overlaid on said user interface, the social media thread being specific to the event or to participants in the event, the social media interface being configured receive or initiate a social media comment by a user and to display social media comments posted by plural users. 16. A system in accordance with claim 15, wherein the second screen experience is provided in temporal parallel with the event. 17. A system in accordance with claim 15, wherein the second screen experience provides information on plural levels of granularity relative to the event, including two or more of game or event status, team status or statistics, and player status or statistics. 18. A system in accordance with claim 15, wherein the user interface includes interactive content configured such that user interaction with the content reveals additional information about the event or the event participants. 19. A system in accordance with claim 15, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to reveal further information about the player 20. A system in accordance with claim 15, wherein a listing of an individual participant is configured to expand when a participant's name or other identifier is selected from a list to provide a social media thread specific to that participant. 21. A system in accordance with claim 15, wherein a shape or indicator of a participant's name or other identifier changes according to the level of social activity relative to that participant. 22. A system in accordance with claim 15, wherein a communications interface is provided and configured to allow users to send and receive answers to questions from an event expert. 23. A system in accordance with claim 15, wherein the social media interface displays an aggregate of thread comments from plural social media sources. 24. A system in accordance with claim 23, wherein said social media interface is configured to permit selection of one or more social media sources for thread display. 25. A system in accordance with claim 15, wherein the social media interface is configured to initiate user login to one or more social media sources. 26. A system in accordance with claim 25, wherein said social media interface is configured to automatically log a user into one or more social media sources. 27. A system in accordance with claim 15, further comprising presentation of media coinciding with an action in an event. 28. A system in accordance with claim 27, wherein such presentation of media is accompanied with a purchase command or icon, configured to allow a user to purchase the presented media. | 2,100 |
5,650 | 5,650 | 13,359,322 | 2,176 | Disclosed herein are systems, methods, and software that provide for dynamic form control. Aspects pertain to forms derived from base forms associated with content targets. User input is received into the forms, such as input data or object selections, as well as other types of user input. Control information within the content targets is identified and, in response to the user input, the forms are controlled based on the control information. | 1. A method for providing forms linked to content targets within productivity applications, the method comprising:
generating within a content target hosted by a productivity application a base form comprising a plurality of base components; rendering external to the content target a user form comprising a plurality of user components corresponding to the plurality of base components; and dynamically controlling the user form based on a plurality of events corresponding to the plurality of user components. 2. The method of claim 1 wherein the plurality of events comprises user input and wherein dynamically controlling the user form based on the plurality of events comprises validating the user input based on control information within the content target. 3. The method of claim 2 wherein the control information indicates at least a valid format or a valid range for input data entered into the user form via the user input through at least one of the plurality of user components. 4. The method of claim 1 wherein at least one of the plurality of events comprises user input and wherein dynamically controlling the user form comprises modifying a group of values selectable from at least one of the plurality of user components based on the user input. 5. The method of claim 1 wherein dynamically controlling the user form comprises running executable code embedded within the user form in response to at least one of the plurality of events to augment display of the user form. 6. The method of claim 1 wherein dynamically controlling the user form comprises running executable code linked to from within the user form in response to at least one of the plurality of events to augment display of the user form. 7. The method of claim 1 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor, and wherein the productivity application comprises one of at least the spreadsheet application or the document editor. 8. One or more computer readable media having program instructions stored thereon for providing forms linked to content targets within productivity applications, that when executed by a dynamic form system, direct the dynamic form system to:
generate within a content target hosted by a productivity application a base form comprising a plurality of base components; render external to the content target a user form comprising a plurality of user components corresponding to the plurality of base components; and dynamically control the user form based on a plurality of events corresponding to the plurality of user components. 9. The one or more computer readable media of claim 8 wherein the plurality of events comprises user input and wherein to dynamically control the user form based on the plurality of events the dynamic form system is further directed by the program instructions to validate the user input based on control information within the content target. 10. The one or more computer readable media of claim 9 wherein the control information indicates at least a valid format or a valid range for input data entered into the user form via the user input through at least one of the plurality of user components. 11. The one or more computer readable media of claim 8 wherein at least one of the events comprises user input and wherein to dynamically control the user form the dynamic form system is directed by the program instructions to modify a group of values selectable from at least one of the plurality of user components based on the user input. 12. The one or more computer readable media of claim 8 wherein to dynamically control the user form the dynamic form system is directed by the program instructions to run executable code embedded within the user form to augment display of the user form in response to at least one of the plurality of events. 13. The one or more computer readable media of claim 8 wherein to dynamically control the user form the dynamic form system is directed by the program instructions to run executable code linked to from within the user form to augment display of the user form in response to at least one of the plurality of events. 14. The one or more computer readable media of claim 8 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor, and wherein the productivity application comprises one of at least the spreadsheet application or the document editor. 15. One or more computer readable media having stored thereon program instructions for operating forms linked to content targets within productivity applications, that when executed by a computer system, direct the computer system to:
receive user input in a form derived from a base form associated with a content target; identify control information within the content target; control the form in response to the user input based on the control information identified within the content target. 16. The one or more computer readable media of claim 15 wherein the control information identifies a valid format for data entered into the content target, wherein the user input comprises input data, and wherein to control the form in response to the user input, the program instructions direct the computer system to accept or reject the input data for delivery to and entry in the content target depending on whether or not the input data is formatted in accordance with the valid format. 17. The one or more computer readable media of claim 15 wherein the control information identifies a valid group of data to enter into the content target, wherein the user input comprises a selection of an input graphic within the form, and wherein to control the form in response to the user input, the program instructions direct the computer system to populate the input graphic with the valid group of data. 18. The one or more computer readable media of claim 15 wherein the control information identifies a program module that resides within the form and that drives a display of the form, wherein the user input comprises input data, and wherein to control the form in response to the user input, the program instructions direct the computer system to call the program module to drive the display of the form based on the input data. 19. The one or more computer readable media of claim 15 wherein, to identify the control information within the content target, the program instructions direct the computer system to generate and transfer, for delivery from the form to the content target over a communication network, a request for the control information. 20. The one or more computer readable media of claim 15 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor. | Disclosed herein are systems, methods, and software that provide for dynamic form control. Aspects pertain to forms derived from base forms associated with content targets. User input is received into the forms, such as input data or object selections, as well as other types of user input. Control information within the content targets is identified and, in response to the user input, the forms are controlled based on the control information.1. A method for providing forms linked to content targets within productivity applications, the method comprising:
generating within a content target hosted by a productivity application a base form comprising a plurality of base components; rendering external to the content target a user form comprising a plurality of user components corresponding to the plurality of base components; and dynamically controlling the user form based on a plurality of events corresponding to the plurality of user components. 2. The method of claim 1 wherein the plurality of events comprises user input and wherein dynamically controlling the user form based on the plurality of events comprises validating the user input based on control information within the content target. 3. The method of claim 2 wherein the control information indicates at least a valid format or a valid range for input data entered into the user form via the user input through at least one of the plurality of user components. 4. The method of claim 1 wherein at least one of the plurality of events comprises user input and wherein dynamically controlling the user form comprises modifying a group of values selectable from at least one of the plurality of user components based on the user input. 5. The method of claim 1 wherein dynamically controlling the user form comprises running executable code embedded within the user form in response to at least one of the plurality of events to augment display of the user form. 6. The method of claim 1 wherein dynamically controlling the user form comprises running executable code linked to from within the user form in response to at least one of the plurality of events to augment display of the user form. 7. The method of claim 1 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor, and wherein the productivity application comprises one of at least the spreadsheet application or the document editor. 8. One or more computer readable media having program instructions stored thereon for providing forms linked to content targets within productivity applications, that when executed by a dynamic form system, direct the dynamic form system to:
generate within a content target hosted by a productivity application a base form comprising a plurality of base components; render external to the content target a user form comprising a plurality of user components corresponding to the plurality of base components; and dynamically control the user form based on a plurality of events corresponding to the plurality of user components. 9. The one or more computer readable media of claim 8 wherein the plurality of events comprises user input and wherein to dynamically control the user form based on the plurality of events the dynamic form system is further directed by the program instructions to validate the user input based on control information within the content target. 10. The one or more computer readable media of claim 9 wherein the control information indicates at least a valid format or a valid range for input data entered into the user form via the user input through at least one of the plurality of user components. 11. The one or more computer readable media of claim 8 wherein at least one of the events comprises user input and wherein to dynamically control the user form the dynamic form system is directed by the program instructions to modify a group of values selectable from at least one of the plurality of user components based on the user input. 12. The one or more computer readable media of claim 8 wherein to dynamically control the user form the dynamic form system is directed by the program instructions to run executable code embedded within the user form to augment display of the user form in response to at least one of the plurality of events. 13. The one or more computer readable media of claim 8 wherein to dynamically control the user form the dynamic form system is directed by the program instructions to run executable code linked to from within the user form to augment display of the user form in response to at least one of the plurality of events. 14. The one or more computer readable media of claim 8 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor, and wherein the productivity application comprises one of at least the spreadsheet application or the document editor. 15. One or more computer readable media having stored thereon program instructions for operating forms linked to content targets within productivity applications, that when executed by a computer system, direct the computer system to:
receive user input in a form derived from a base form associated with a content target; identify control information within the content target; control the form in response to the user input based on the control information identified within the content target. 16. The one or more computer readable media of claim 15 wherein the control information identifies a valid format for data entered into the content target, wherein the user input comprises input data, and wherein to control the form in response to the user input, the program instructions direct the computer system to accept or reject the input data for delivery to and entry in the content target depending on whether or not the input data is formatted in accordance with the valid format. 17. The one or more computer readable media of claim 15 wherein the control information identifies a valid group of data to enter into the content target, wherein the user input comprises a selection of an input graphic within the form, and wherein to control the form in response to the user input, the program instructions direct the computer system to populate the input graphic with the valid group of data. 18. The one or more computer readable media of claim 15 wherein the control information identifies a program module that resides within the form and that drives a display of the form, wherein the user input comprises input data, and wherein to control the form in response to the user input, the program instructions direct the computer system to call the program module to drive the display of the form based on the input data. 19. The one or more computer readable media of claim 15 wherein, to identify the control information within the content target, the program instructions direct the computer system to generate and transfer, for delivery from the form to the content target over a communication network, a request for the control information. 20. The one or more computer readable media of claim 15 wherein the content target comprises one of at least a spreadsheet editable by a spreadsheet application or a document editable by a document editor. | 2,100 |
5,651 | 5,651 | 13,376,151 | 2,137 | A tape storage system according to one embodiment includes two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, where a first of the tape storage apparatuses is configured to receive multiple data clusters and a synchronization request from a host, and, when one of the segments of the buffer is accumulated and filled with the data, to write the accumulated data onto a tape. A second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and being configured to write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. | 1. A tape storage system, comprising:
two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, wherein a first of the tape storage apparatuses is configured to receive multiple data clusters and a synchronization request from a host, and, when one of the segments of the buffer is accumulated and filled with the data, to write the accumulated data onto a tape, and wherein a second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and the second tape storage apparatus being configured to write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. 2. The tape storage system according to claim 1, wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 3. The tape storage system according to claim 2, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 4. The tape storage system according to claim 3, wherein the second tape storage apparatus is able to continuously and overwritably use an area of the second tape storing data already written by the first tape storage apparatus. 5. The tape storage system according to claim 4, wherein, if a data writing error occurs in the first tape storage apparatus, and the data has already been written by the second tape storage apparatus, the data writing error is not reported to the host. 6. The tape storage system according to claim 4, wherein, if a data writing error occurs in the second tape storage apparatus, and the data has already been written by the first tape storage apparatus, the data writing error is not reported to the host. 7. The tape storage system according to claim 6, wherein, if the data writing error occurs in the second tape storage apparatus, the data corresponding to the error is written again into an unused tape area which includes a tape storage area of the second tape that stores data already written in the first tape storage apparatus. 8. The tape storage system according to claim 5, wherein, if the data writing error occurs in the first tape storage apparatus, the data is written from the second tape in the second tape storage apparatus to restore data at an error position of the tape in the first tape storage apparatus via an inter-drive communication connection. 9. The tape storage system according to claim 8, wherein the first tape storage apparatus is configured to communicate with the host via Fibre Channel or SCSI, and the inter-drive communication connection between the two tape storage apparatuses is an Ethernet connection. 10. The tape storage system according to claim 1, further comprising the host. 11. A tape storage system, comprising:
two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, a first of the tape storage apparatuses being configured to receive multiple data clusters and a synchronization request sent from a host, and being configured to write a predetermined number of data clusters accumulated in the segments onto a tape at a timing corresponding to the synchronization request, and wherein a second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and, when the segment thereof is accumulated and filled with the data, writing the accumulated data onto a second tape. 12. The tape storage system according to claim 1 wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 13. The tape storage system according to claim 11, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 14. The tape storage system according to claim 13, wherein the second tape storage apparatus is able to continuously and overwritably use an area of the second tape storing data already written by the first tape storage apparatus. 15. The tape storage system according to claim 11, further comprising the host. 16. A method, comprising:
in a first tape storage apparatus having a buffer divided in fixed-length segments, receiving multiple data clusters and a synchronization request, and, when one of the segments of the buffer is accumulated and filled with the data, writing the accumulated data onto a tape; and in a second tape storage apparatus having a buffer divided in fixed-length segments and connected to the first tape storage apparatus, receiving the multiple data clusters via the first tape storage apparatus, and writing a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. 17. The method according to claim 16, wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 18. The method according to claim 16, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 19. 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 cause a first tape storage apparatus having a buffer divided in fixed-length segments to receive multiple data clusters and a synchronization request, and, when one of the segments of the buffer is accumulated and filled with the data, write the accumulated data onto a tape; and
computer readable program code configured to cause a second tape storage apparatus, having a buffer divided in fixed-length segments and connected to the first tape storage apparatus, to receive the multiple data clusters via the first tape storage apparatus, and write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. | A tape storage system according to one embodiment includes two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, where a first of the tape storage apparatuses is configured to receive multiple data clusters and a synchronization request from a host, and, when one of the segments of the buffer is accumulated and filled with the data, to write the accumulated data onto a tape. A second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and being configured to write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request.1. A tape storage system, comprising:
two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, wherein a first of the tape storage apparatuses is configured to receive multiple data clusters and a synchronization request from a host, and, when one of the segments of the buffer is accumulated and filled with the data, to write the accumulated data onto a tape, and wherein a second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and the second tape storage apparatus being configured to write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. 2. The tape storage system according to claim 1, wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 3. The tape storage system according to claim 2, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 4. The tape storage system according to claim 3, wherein the second tape storage apparatus is able to continuously and overwritably use an area of the second tape storing data already written by the first tape storage apparatus. 5. The tape storage system according to claim 4, wherein, if a data writing error occurs in the first tape storage apparatus, and the data has already been written by the second tape storage apparatus, the data writing error is not reported to the host. 6. The tape storage system according to claim 4, wherein, if a data writing error occurs in the second tape storage apparatus, and the data has already been written by the first tape storage apparatus, the data writing error is not reported to the host. 7. The tape storage system according to claim 6, wherein, if the data writing error occurs in the second tape storage apparatus, the data corresponding to the error is written again into an unused tape area which includes a tape storage area of the second tape that stores data already written in the first tape storage apparatus. 8. The tape storage system according to claim 5, wherein, if the data writing error occurs in the first tape storage apparatus, the data is written from the second tape in the second tape storage apparatus to restore data at an error position of the tape in the first tape storage apparatus via an inter-drive communication connection. 9. The tape storage system according to claim 8, wherein the first tape storage apparatus is configured to communicate with the host via Fibre Channel or SCSI, and the inter-drive communication connection between the two tape storage apparatuses is an Ethernet connection. 10. The tape storage system according to claim 1, further comprising the host. 11. A tape storage system, comprising:
two or more tape storage apparatuses each having a buffer divided in fixed-length segments, and being connectable to a host, a first of the tape storage apparatuses being configured to receive multiple data clusters and a synchronization request sent from a host, and being configured to write a predetermined number of data clusters accumulated in the segments onto a tape at a timing corresponding to the synchronization request, and wherein a second of the tape storage apparatuses is connected to the first tape storage apparatus, the second tape storage apparatus being configured to receive the multiple data clusters sent from the host via the first tape storage apparatus, and, when the segment thereof is accumulated and filled with the data, writing the accumulated data onto a second tape. 12. The tape storage system according to claim 1 wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 13. The tape storage system according to claim 11, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 14. The tape storage system according to claim 13, wherein the second tape storage apparatus is able to continuously and overwritably use an area of the second tape storing data already written by the first tape storage apparatus. 15. The tape storage system according to claim 11, further comprising the host. 16. A method, comprising:
in a first tape storage apparatus having a buffer divided in fixed-length segments, receiving multiple data clusters and a synchronization request, and, when one of the segments of the buffer is accumulated and filled with the data, writing the accumulated data onto a tape; and in a second tape storage apparatus having a buffer divided in fixed-length segments and connected to the first tape storage apparatus, receiving the multiple data clusters via the first tape storage apparatus, and writing a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. 17. The method according to claim 16, wherein the first tape storage apparatus does not write data in the buffer until at least one segment of the buffer is completely accumulated with data, ignoring the synchronization request corresponding to the data; and
when the predetermined number of data accumulated in the segments is to be dumped onto a tape at the timing corresponding to the synchronization request, the second tape storage apparatus pads an area of the segments which is unfilled with the data, to write out the data of the segments. 18. The method according to claim 16, wherein the tape on which writing has been performed by the first tape storage apparatus is treated as a regular writing tape to which data accumulated in the segments are written as data sets; and
on the second tape on which writing has been performed by the second tape storage apparatus, data accumulated in the segments are written as data sets, and the interval between the data sets on the second tape reflects the time interval of the synchronization request. 19. 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 cause a first tape storage apparatus having a buffer divided in fixed-length segments to receive multiple data clusters and a synchronization request, and, when one of the segments of the buffer is accumulated and filled with the data, write the accumulated data onto a tape; and
computer readable program code configured to cause a second tape storage apparatus, having a buffer divided in fixed-length segments and connected to the first tape storage apparatus, to receive the multiple data clusters via the first tape storage apparatus, and write a predetermined number of data clusters accumulated in the segments thereof onto a second tape at a timing corresponding to the synchronization request. | 2,100 |
5,652 | 5,652 | 12,732,190 | 2,198 | A multi-factor probabilistic model evaluates user input to determine if the user input was intended for an on-screen user interface control. When user input is received, a probability is computed that the user input was intended for each on-screen user interface control. The user input is then associated with the user interface control that has the highest computed probability. The probability that user input was intended for each user interface control may be computed utilizing a multitude of factors including the probability that the user input is near each user interface control, the probability that the motion of the user input is consistent with the user interface control, the probability that the shape of the user input is consistent with the user interface control, and that the size of the user input is consistent with the user interface control. | 1. A computer-implemented method for evaluating user input, the method comprising:
displaying one or more user interface controls; receiving the user input; for each user interface control, computing a probability that the user input was intended for the user interface control; and associating the user input with the user interface control having the highest computed probability. 2. The computer-implemented method of claim 1, wherein computing a probability that the user input was intended for a user interface control comprises computing a probability that the user input was intended for a user interface control based upon a plurality of factors. 3. The computer-implemented method of claim 1, wherein one of the plurality of factors comprises the probability that the user input is near the user interface control. 4. The computer-implemented method of claim 3, wherein one of the plurality of factors comprises the probability that a motion of the user input is consistent with the user interface control. 5. The computer-implemented method of claim 4, wherein one of the plurality of factors comprises the probability that a shape of the user input is consistent with the user interface control. 6. The computer-implemented method of claim 5, wherein one of the plurality of factors comprises the probability that a size of the user input is consistent with the user interface control. 7. The computer-implemented method of claim 6, wherein each of the plurality of factors has an associated weight. 8. The computer-implemented method of claim 7, wherein the user input is associated with the user interface control having the highest probability if the highest probability is greater than a threshold probability. 9. The computer-implemented method of claim 8, wherein the probability that the user input was intended for the user interface control is computed over time. 10. The computer-implemented method of claim 9, further comprising:
determining whether multiple user input controls have a high computed probability; and in response to determining that multiple user input controls have a high computed probability, providing a user interface through which a user can signify which of the multiple user interface controls the user input was intended for. 11. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
receive user input; and in response to receiving the user input, to identify one of a plurality of user interface controls for which the user input is intended by computing a probability for each of the user interface controls using a probabilistic multi-factor model. 12. The computer-readable storage medium of claim 11, wherein the probabilistic multi-factor model is configured to compute a probability for each user interface control that the user input was intended for the user interface control, and to associate the user input with the user interface control having the highest computed probability. 13. The computer-readable storage medium of claim 12, wherein computing a probability for each user interface control that the user input was intended for the user interface control comprises computing a probability that the user input was intended for the user interface control based upon a plurality of factors. 14. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that the user input is near the user interface control. 15. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a motion of the user input is consistent with the user interface control. 16. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a shape of the user input is consistent with the user interface control. 17. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a size of the user input is consistent with the user interface control. 18. The computer-readable storage medium of claim 13, wherein each of the plurality of factors has an associated weight. 19. The computer-readable storage medium of claim 13, wherein the probability that the user input was intended for the user interface control is computed over time. 20. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
display one or more user interface controls; receive user input; for each user interface control, compute a probability that the user input was intended for the user interface control utilizing a probabilistic multi-factor model configured to compute the probability for each user interface control based upon a plurality of weighted factors comprising one or more of the probability that the user input is near the user interface control, the probability that a motion of the user input is consistent with the user interface control, the probability that a shape of the user input is consistent with the user interface control, and the probability that a size of the user input is consistent with the user interface control; and to associate the user input with the user interface control having the highest computed probability that exceeds a threshold. | A multi-factor probabilistic model evaluates user input to determine if the user input was intended for an on-screen user interface control. When user input is received, a probability is computed that the user input was intended for each on-screen user interface control. The user input is then associated with the user interface control that has the highest computed probability. The probability that user input was intended for each user interface control may be computed utilizing a multitude of factors including the probability that the user input is near each user interface control, the probability that the motion of the user input is consistent with the user interface control, the probability that the shape of the user input is consistent with the user interface control, and that the size of the user input is consistent with the user interface control.1. A computer-implemented method for evaluating user input, the method comprising:
displaying one or more user interface controls; receiving the user input; for each user interface control, computing a probability that the user input was intended for the user interface control; and associating the user input with the user interface control having the highest computed probability. 2. The computer-implemented method of claim 1, wherein computing a probability that the user input was intended for a user interface control comprises computing a probability that the user input was intended for a user interface control based upon a plurality of factors. 3. The computer-implemented method of claim 1, wherein one of the plurality of factors comprises the probability that the user input is near the user interface control. 4. The computer-implemented method of claim 3, wherein one of the plurality of factors comprises the probability that a motion of the user input is consistent with the user interface control. 5. The computer-implemented method of claim 4, wherein one of the plurality of factors comprises the probability that a shape of the user input is consistent with the user interface control. 6. The computer-implemented method of claim 5, wherein one of the plurality of factors comprises the probability that a size of the user input is consistent with the user interface control. 7. The computer-implemented method of claim 6, wherein each of the plurality of factors has an associated weight. 8. The computer-implemented method of claim 7, wherein the user input is associated with the user interface control having the highest probability if the highest probability is greater than a threshold probability. 9. The computer-implemented method of claim 8, wherein the probability that the user input was intended for the user interface control is computed over time. 10. The computer-implemented method of claim 9, further comprising:
determining whether multiple user input controls have a high computed probability; and in response to determining that multiple user input controls have a high computed probability, providing a user interface through which a user can signify which of the multiple user interface controls the user input was intended for. 11. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
receive user input; and in response to receiving the user input, to identify one of a plurality of user interface controls for which the user input is intended by computing a probability for each of the user interface controls using a probabilistic multi-factor model. 12. The computer-readable storage medium of claim 11, wherein the probabilistic multi-factor model is configured to compute a probability for each user interface control that the user input was intended for the user interface control, and to associate the user input with the user interface control having the highest computed probability. 13. The computer-readable storage medium of claim 12, wherein computing a probability for each user interface control that the user input was intended for the user interface control comprises computing a probability that the user input was intended for the user interface control based upon a plurality of factors. 14. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that the user input is near the user interface control. 15. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a motion of the user input is consistent with the user interface control. 16. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a shape of the user input is consistent with the user interface control. 17. The computer-readable storage medium of claim 13, wherein one of the plurality of factors comprises the probability that a size of the user input is consistent with the user interface control. 18. The computer-readable storage medium of claim 13, wherein each of the plurality of factors has an associated weight. 19. The computer-readable storage medium of claim 13, wherein the probability that the user input was intended for the user interface control is computed over time. 20. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
display one or more user interface controls; receive user input; for each user interface control, compute a probability that the user input was intended for the user interface control utilizing a probabilistic multi-factor model configured to compute the probability for each user interface control based upon a plurality of weighted factors comprising one or more of the probability that the user input is near the user interface control, the probability that a motion of the user input is consistent with the user interface control, the probability that a shape of the user input is consistent with the user interface control, and the probability that a size of the user input is consistent with the user interface control; and to associate the user input with the user interface control having the highest computed probability that exceeds a threshold. | 2,100 |
5,653 | 5,653 | 13,872,899 | 2,139 | A computer-controlled method of handling proprietary features in a messaging system includes receiving an object from a requesting application, determining that the object invokes proprietary features of a messaging system, accessing a wrapper library and wrapping the object in an appropriate wrapper for the messaging system to produce a wrapped object, the wrapper to preserve the proprietary feature, and transmitting the wrapped object to the messaging system. | 1. A computer-controlled method of handling proprietary features in a messaging system, comprising:
receiving an object from a requesting application; determining that the object invokes proprietary features of a messaging system; accessing a wrapper library and wrapping the object in an appropriate wrapper for the messaging system to produce a wrapped object, the wrapper to preserve the proprietary feature; and transmitting the wrapped object to the messaging system. 2. The computer-controlled method of claim 1, wherein the object consists of one or either an administrative object or an operational object. 3. The computer-controlled method of claim 2, wherein the object is an administrative object and the method further comprises performing an administrative task contained in the administrative object. 4. The computer-controlled method of claim 2, wherein the object is an operational object and the method further comprises performing an operation contained in the operational object. 5. The computer-controlled method of claim 1, wherein accessing the wrapper library comprises determining that the appropriate wrapper does not exist in the wrapper library. 6. The computer-controlled method of claim 5, further comprising accessing a wrapper generation tool to generate the appropriate wrapper. 7. The computer-controlled method of claim 5, further comprising updating a configuration file for a resource adapter prior to accessing the wrapper generation tool. | A computer-controlled method of handling proprietary features in a messaging system includes receiving an object from a requesting application, determining that the object invokes proprietary features of a messaging system, accessing a wrapper library and wrapping the object in an appropriate wrapper for the messaging system to produce a wrapped object, the wrapper to preserve the proprietary feature, and transmitting the wrapped object to the messaging system.1. A computer-controlled method of handling proprietary features in a messaging system, comprising:
receiving an object from a requesting application; determining that the object invokes proprietary features of a messaging system; accessing a wrapper library and wrapping the object in an appropriate wrapper for the messaging system to produce a wrapped object, the wrapper to preserve the proprietary feature; and transmitting the wrapped object to the messaging system. 2. The computer-controlled method of claim 1, wherein the object consists of one or either an administrative object or an operational object. 3. The computer-controlled method of claim 2, wherein the object is an administrative object and the method further comprises performing an administrative task contained in the administrative object. 4. The computer-controlled method of claim 2, wherein the object is an operational object and the method further comprises performing an operation contained in the operational object. 5. The computer-controlled method of claim 1, wherein accessing the wrapper library comprises determining that the appropriate wrapper does not exist in the wrapper library. 6. The computer-controlled method of claim 5, further comprising accessing a wrapper generation tool to generate the appropriate wrapper. 7. The computer-controlled method of claim 5, further comprising updating a configuration file for a resource adapter prior to accessing the wrapper generation tool. | 2,100 |
5,654 | 5,654 | 13,077,619 | 2,156 | Methods and systems for garbage collection are described. In some embodiments, Garbage collector threads may maximize local accesses and minimize remote access by copying Young objects and Old objects differently. When copying a Young object, a garbage collector thread may determine the lgroup of the pool that contains the object and copy the object to a pool of the same lgroup. The garbage collector thread may spread Old objects among lgroups by copying Old objects to pools of the same lgroup as the respective garbage collector thread. Additional methods and systems are disclosed. | 1. A method comprising:
accessing a young object from a source region of a first pool by a garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory; allocating a space for the young object in a survivor region associated with a second pool, the second pool associated with the particular lgroup; and copying the young object to the allocated space in the survivor region associated with the second pool. 2. The method of claim 1, wherein allocating the space comprises:
allocating the space for the young object in a promotion local allocation buffer (PLAB) being within the survivor region associated with the second pool, the young object being within a thread local allocation buffer (TLAB) of the source region. 3. The method of claim 2, wherein the particular PLAB is among a plurality of PLABs associated with the particular lgroup. 4. The method of claim 2, wherein only the garbage collector thread is exclusively associated with the PLAB and further comprising:
exclusively associating the garbage collector thread with the PLAB such that objects cannot be copied by other threads into the PLAB exclusively associated with the garbage collector thread. 5. The method of claim 1, wherein the garbage collector thread is executing on the particular processing unit. 6. The method of claim 1, wherein the garbage collector thread is executing on a different processing unit, the different processing unit associated with a same lgroup of the plurality of lgroups. 7. The method of claim 1, wherein an execution thread that created the young object is executing on the particular processing unit. 8. The method of claim 1, wherein the garbage collector thread saves a plurality of objects that are to survive a garbage collection cycle in the survivor region, and the young object is an object that was created for use with an execution thread. 9. The method of claim 1, wherein the source region is an allocation region used by an execution thread to reserve memory for most newly created objects, the young object being an object that has not been promoted to an old region, the survivor region being a region where objects have survived garbage collection in the allocation region, and the memory being local to the processing unit by meeting a data communication speed and throughput that remote memory does not meet. 10. The method of claim 1, wherein the source region is a different survivor region than the survivor region in which the young object is copied. 11. A method comprising:
accessing an object from a source region of a first pool by a, garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory, the garbage collector thread associated with a second pool associated with a different lgroup among the plurality of lgroups; allocating a space for the object in an old region associated with the second pool; and copying the object to allocated space in the old region associated with the second pool. 12. The method of claim 11, wherein allocating the space comprises:
allocating the space for the object in a promotion local allocation buffer (PLAB), the allocated space of the PLAB being within the old region associated with the second pool, the old region being a region to which objects are promoted from the allocation region and the survivor region. 13. The method of claim 11, further comprising:
determining that a plurality of objects in the heap space are not evenly spread across the plurality of lgroups; and selecting the second pool among a plurality of pools according to a round-robin lgroup order based on a determination that the plurality of objects are not evenly spread, wherein allocation of the space for the object is based on selection of the second pool. 14. The method of claim 11, wherein accessing the object comprises:
wherein accessing the object from the source region of the first pool when there are no further objects to process in the second pool during garbage collection in the second pool. 15. The method of claim 11, wherein the old region is divided among the plurality of lgroups. 16. The method of claim 11, wherein the garbage collector thread saves a plurality of objects that are to survive a garbage collection cycle in the survivor region, the old region is a region where objects have survived a number of garbage collection cycles, and the object was created for use with an execution thread. 17. The method of claim 11, wherein the source region is an allocation region. 18. The method of claim 11, wherein the source region is a survivor region. 19. The method of claim 11, wherein the source region is a different old region than the old region in which the object is copied. 20. A non-transitory machine-readable medium comprising instructions, which when executed by one or more processors, cause the one or more processors to perform the following operations:
access a young object from a source region of a first pool by a garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory; allocating a space for the young object in a survivor region associated with a second pool, the second pool associated with the same particular lgroup; copying the young object to the allocated space in the survivor region associated with the second pool; accessing the object from the survivor region of the second pool by a garbage collector thread, the garbage collector thread associated with a third pool associated with a different lgroup among the plurality of lgroups; allocating a space for the object in an old region associated with the third pool; and copying the object to allocated space in the old region associated with the third pool. | Methods and systems for garbage collection are described. In some embodiments, Garbage collector threads may maximize local accesses and minimize remote access by copying Young objects and Old objects differently. When copying a Young object, a garbage collector thread may determine the lgroup of the pool that contains the object and copy the object to a pool of the same lgroup. The garbage collector thread may spread Old objects among lgroups by copying Old objects to pools of the same lgroup as the respective garbage collector thread. Additional methods and systems are disclosed.1. A method comprising:
accessing a young object from a source region of a first pool by a garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory; allocating a space for the young object in a survivor region associated with a second pool, the second pool associated with the particular lgroup; and copying the young object to the allocated space in the survivor region associated with the second pool. 2. The method of claim 1, wherein allocating the space comprises:
allocating the space for the young object in a promotion local allocation buffer (PLAB) being within the survivor region associated with the second pool, the young object being within a thread local allocation buffer (TLAB) of the source region. 3. The method of claim 2, wherein the particular PLAB is among a plurality of PLABs associated with the particular lgroup. 4. The method of claim 2, wherein only the garbage collector thread is exclusively associated with the PLAB and further comprising:
exclusively associating the garbage collector thread with the PLAB such that objects cannot be copied by other threads into the PLAB exclusively associated with the garbage collector thread. 5. The method of claim 1, wherein the garbage collector thread is executing on the particular processing unit. 6. The method of claim 1, wherein the garbage collector thread is executing on a different processing unit, the different processing unit associated with a same lgroup of the plurality of lgroups. 7. The method of claim 1, wherein an execution thread that created the young object is executing on the particular processing unit. 8. The method of claim 1, wherein the garbage collector thread saves a plurality of objects that are to survive a garbage collection cycle in the survivor region, and the young object is an object that was created for use with an execution thread. 9. The method of claim 1, wherein the source region is an allocation region used by an execution thread to reserve memory for most newly created objects, the young object being an object that has not been promoted to an old region, the survivor region being a region where objects have survived garbage collection in the allocation region, and the memory being local to the processing unit by meeting a data communication speed and throughput that remote memory does not meet. 10. The method of claim 1, wherein the source region is a different survivor region than the survivor region in which the young object is copied. 11. A method comprising:
accessing an object from a source region of a first pool by a, garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory, the garbage collector thread associated with a second pool associated with a different lgroup among the plurality of lgroups; allocating a space for the object in an old region associated with the second pool; and copying the object to allocated space in the old region associated with the second pool. 12. The method of claim 11, wherein allocating the space comprises:
allocating the space for the object in a promotion local allocation buffer (PLAB), the allocated space of the PLAB being within the old region associated with the second pool, the old region being a region to which objects are promoted from the allocation region and the survivor region. 13. The method of claim 11, further comprising:
determining that a plurality of objects in the heap space are not evenly spread across the plurality of lgroups; and selecting the second pool among a plurality of pools according to a round-robin lgroup order based on a determination that the plurality of objects are not evenly spread, wherein allocation of the space for the object is based on selection of the second pool. 14. The method of claim 11, wherein accessing the object comprises:
wherein accessing the object from the source region of the first pool when there are no further objects to process in the second pool during garbage collection in the second pool. 15. The method of claim 11, wherein the old region is divided among the plurality of lgroups. 16. The method of claim 11, wherein the garbage collector thread saves a plurality of objects that are to survive a garbage collection cycle in the survivor region, the old region is a region where objects have survived a number of garbage collection cycles, and the object was created for use with an execution thread. 17. The method of claim 11, wherein the source region is an allocation region. 18. The method of claim 11, wherein the source region is a survivor region. 19. The method of claim 11, wherein the source region is a different old region than the old region in which the object is copied. 20. A non-transitory machine-readable medium comprising instructions, which when executed by one or more processors, cause the one or more processors to perform the following operations:
access a young object from a source region of a first pool by a garbage collector thread, the first pool associated with a particular lgroup among a plurality of lgroups, a processing unit and a memory in communication with and local to the particular processing unit being grouped in the particular lgroup, the first pool deployed within heap space of the particular memory; allocating a space for the young object in a survivor region associated with a second pool, the second pool associated with the same particular lgroup; copying the young object to the allocated space in the survivor region associated with the second pool; accessing the object from the survivor region of the second pool by a garbage collector thread, the garbage collector thread associated with a third pool associated with a different lgroup among the plurality of lgroups; allocating a space for the object in an old region associated with the third pool; and copying the object to allocated space in the old region associated with the third pool. | 2,100 |
5,655 | 5,655 | 14,747,933 | 2,135 | A processor employs multiple prefetchers at a processor to identify patterns in memory accesses to different memory modules. The memory accesses can include transfers between the memory modules, and the prefetchers can prefetch data directly from one memory module to another based on patterns in the transfers. This allows the processor to efficiently organize data at the memory modules without direct intervention by software or by a processor core, thereby improving processing efficiency. | 1. A method comprising:
prefetching data to a first memory module by a first prefetcher of a processor based on the first history of accesses to a first memory module; and prefetching data to a second memory module by a second prefetcher of the processor based on a second history of accesses to the second memory module, the second history of accesses recorded independent of the first. 2. The method of claim 1, further comprising:
communicating one or more hints from the first prefetcher to the second prefetcher based on the first history of accesses; and wherein prefetching data to the second memory comprises prefetching data to the second memory based on the second history of accesses and the one or more hints. 3. The method of claim 1, wherein the first history of accesses comprises a history of transfers to the first memory module from a third memory module. 4. The method of claim 3, wherein the history of transfers comprises a history of direct transfers not based on demand requests from a processor core of the processor. 5. The method of claim 3, wherein prefetching data to the first memory module comprises transferring data from the third memory module to the first memory module. 6. The method of claim 3, wherein the second history of accesses comprises a history of transfers from the third memory module to the second memory module. 7. The method of claim 1, further comprising:
recording a third history of accesses at a third prefetcher of the processor, the third history of accesses comprising a history of accesses to the first memory module and a history of accesses to the second memory module. 8. The method of claim 7, further comprising:
prefetching data from the first memory module to a cache of the processor based on the third history of accesses; and prefetching data from the second memory module to the cache based on the third history of accesses. 9. The method of claim 1, wherein the first memory module is of a first memory type and the second memory module is of a second memory type different from the first memory type. 10. A method, comprising:
at a processor comprising a plurality of memory modules, recording a plurality of histories of data transfers between the memory modules; and independently prefetching data to each of the plurality of memory modules based on the plurality of histories. 11. The method of claim 10, wherein prefetching data comprises:
transferring first data from a first memory module of the plurality of memory modules to a second memory module of the plurality of memory modules, the first memory module having a greater access speed for a processor core than the second memory module. 12. The method of claim 11, wherein prefetching data comprises:
transferring second data from the second memory module to the first memory module. 13. A system, comprising:
a first prefetcher to prefetch data to a first memory module based on a first history of accesses; and a second prefetcher to prefetch data to a second memory module based on a second history of accesses. 14. The system of claim 13 wherein:
the first prefetcher is to communicate one or more hints to the second prefetcher based on the first history of accesses; and
the second prefetcher is to prefetch data to the second memory on the second history of accesses and the one or more hints. 15. The system of claim 13, further comprising:
a third memory module; and wherein the first history of accesses comprises a history of transfers to the first memory module from a third memory module. 16. The system of claim 15, wherein the first prefetcher is to prefetch data to the first memory module by transferring data from the third memory module to the first memory module. 17. The system of claim 15, wherein the second history of accesses comprises a history of transfers to the second memory module from the third memory module. 18. The system of claim 15, further comprising:
a processor; an operating system that communicates memory access requests to the processor. 19. The system of claim 15, wherein the first memory module is on a different semiconductor die than a processor that sends memory access requests to the first memory module, further comprising. 20. The system of claim 13, wherein the first memory module is of a first memory type and the second memory module is of a second memory type different from the first memory type. | A processor employs multiple prefetchers at a processor to identify patterns in memory accesses to different memory modules. The memory accesses can include transfers between the memory modules, and the prefetchers can prefetch data directly from one memory module to another based on patterns in the transfers. This allows the processor to efficiently organize data at the memory modules without direct intervention by software or by a processor core, thereby improving processing efficiency.1. A method comprising:
prefetching data to a first memory module by a first prefetcher of a processor based on the first history of accesses to a first memory module; and prefetching data to a second memory module by a second prefetcher of the processor based on a second history of accesses to the second memory module, the second history of accesses recorded independent of the first. 2. The method of claim 1, further comprising:
communicating one or more hints from the first prefetcher to the second prefetcher based on the first history of accesses; and wherein prefetching data to the second memory comprises prefetching data to the second memory based on the second history of accesses and the one or more hints. 3. The method of claim 1, wherein the first history of accesses comprises a history of transfers to the first memory module from a third memory module. 4. The method of claim 3, wherein the history of transfers comprises a history of direct transfers not based on demand requests from a processor core of the processor. 5. The method of claim 3, wherein prefetching data to the first memory module comprises transferring data from the third memory module to the first memory module. 6. The method of claim 3, wherein the second history of accesses comprises a history of transfers from the third memory module to the second memory module. 7. The method of claim 1, further comprising:
recording a third history of accesses at a third prefetcher of the processor, the third history of accesses comprising a history of accesses to the first memory module and a history of accesses to the second memory module. 8. The method of claim 7, further comprising:
prefetching data from the first memory module to a cache of the processor based on the third history of accesses; and prefetching data from the second memory module to the cache based on the third history of accesses. 9. The method of claim 1, wherein the first memory module is of a first memory type and the second memory module is of a second memory type different from the first memory type. 10. A method, comprising:
at a processor comprising a plurality of memory modules, recording a plurality of histories of data transfers between the memory modules; and independently prefetching data to each of the plurality of memory modules based on the plurality of histories. 11. The method of claim 10, wherein prefetching data comprises:
transferring first data from a first memory module of the plurality of memory modules to a second memory module of the plurality of memory modules, the first memory module having a greater access speed for a processor core than the second memory module. 12. The method of claim 11, wherein prefetching data comprises:
transferring second data from the second memory module to the first memory module. 13. A system, comprising:
a first prefetcher to prefetch data to a first memory module based on a first history of accesses; and a second prefetcher to prefetch data to a second memory module based on a second history of accesses. 14. The system of claim 13 wherein:
the first prefetcher is to communicate one or more hints to the second prefetcher based on the first history of accesses; and
the second prefetcher is to prefetch data to the second memory on the second history of accesses and the one or more hints. 15. The system of claim 13, further comprising:
a third memory module; and wherein the first history of accesses comprises a history of transfers to the first memory module from a third memory module. 16. The system of claim 15, wherein the first prefetcher is to prefetch data to the first memory module by transferring data from the third memory module to the first memory module. 17. The system of claim 15, wherein the second history of accesses comprises a history of transfers to the second memory module from the third memory module. 18. The system of claim 15, further comprising:
a processor; an operating system that communicates memory access requests to the processor. 19. The system of claim 15, wherein the first memory module is on a different semiconductor die than a processor that sends memory access requests to the first memory module, further comprising. 20. The system of claim 13, wherein the first memory module is of a first memory type and the second memory module is of a second memory type different from the first memory type. | 2,100 |
5,656 | 5,656 | 13,864,983 | 2,173 | The improved system and method for allowing the exchange of information regarding document content under review while remaining device agnostic. The system accesses a document repository where document content and metadata related to that content may be stored. The system is operable on a computing device and allows users to access the content using a communication device with or without display technology. Users may access document content, select points of interest therein, and instantly collaborate with other users regarding the points of interest, through the exchange of interaction messages. Message exchange may be instant or may be passive through emailed hyperlinks. All exchanged interaction messages become metadata that may be chronologically recalled to assist a user in determining the thought process of the user that created the messages. | 1. A device for providing device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said device comprising:
a computing device configured to retrieve one or more electronic documents and to present said documents to each of a plurality of users through each user's communication device, whereby each said user may interact with other said users over one or more points of interest within said documents, said interaction occurring through exchange of interaction messages containing text, audio, or video information, said exchange facilitated by said computing device, said interaction messages associated by said computing device with said one or more points of interest. 2. The device of claim 1, wherein said exchanged messages are presented to each interacting user through each user's communication device, in the chronological order in which said messages were associated with said points of interest. 3. The device of claim 1, said computing device further configured to store said associated messages as retrievable additional electronic document content that remains associated with corresponding said points of interest. 4. The device of claim 1, said computing device generating and storing metadata for subsequent retrieval for characterizing said interaction messages, said metadata to facilitate a contextual understanding of said interaction message exchange. 5. The device of claim 1, said computing device further configured to allow subsequent retrieval of all interaction messages exchanged with regard to an electronic document. 6. The device of claim 1, wherein said exchange between users occurs regardless of functionality disparities among said users' communication devices. 7. The device of claim 1, wherein said computing device presents said electronic documents and said interaction messages in an image format suitable for display on each of said user's communication device. 8. A system for providing device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said system comprising:
one or more computing devices configured to retrieve one or more electronic documents and to present said documents to each of a plurality of users through each user's communication device, whereby each said user may interact with other said users over one or more points of interest within said documents, said interaction occurring through exchange of interaction messages containing text, audio, or video information, said exchange facilitated by said computing device, said interaction messages associated by said computing device with said one or more points of interest; and an electronic document repository accessible by said one or more computing devices. 9. The system of claim 8, wherein said exchanged messages are presented to each interacting user through each user's communication device, in the chronological order in which said messages were associated with said points of interest. 10. The system of claim 8, said computing devices further configured to store said associated messages as retrievable additional electronic document content that remains associated with corresponding said points of interest. 11. The system of claim 8, said computing devices generating and storing metadata for subsequent retrieval for characterizing said interaction messages, said metadata to facilitate a contextual understanding of said interaction message exchange. 12. The system of claim 8, said computing device further configured to allow subsequent retrieval of all interaction messages exchanged with regard to an electronic document. 13. The system of claim 8, wherein said exchange between users occurs regardless of functionality disparities among said users' communication devices. 14. The device of claim 8, wherein said computing device presents said electronic documents and said interaction messages in an image format suitable for display on each of said user's communication device. 15. The system of claim 8, wherein said electronic document repository operates from said one or more computing devices. 16. A device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said method steps comprising:
presenting, from a first computing device, electronic document content to a first user through a first communication device, wherein said first computing device is configured to accept selection of one or more points of interest within said electronic document content; accepting, from said first user, at least one content interaction message related to said one or more points of interest; associating said at least one content interaction message with said one or more points of interest to which said message is related, and storing said message such that the association and chronological order in which the message was accepted is determinable; presenting, from said first computing device, said electronic document content and said at least one content interaction message to a second user through a second communication device, wherein said at least one content interaction message is presented to said second user with said associated point of interest; accepting, from said second user, at least one content interaction response message related to said one or more points of interest; associating said at least one content interaction response message with said one or more points of interest to which said response message is related, and storing said response message such that the association is determinable; and presenting, from said first computing device, said electronic document content and said content interaction message and said content interaction response message to said first user through said first communication device or through a third communication device, wherein said content interaction message and said content interaction response message is presented with said associated point of interest. 17. The method of claim 16, wherein said electronic document repository operates from said one or more computing devices. 18. The method of claim 16, wherein said content interaction messages and said content interaction response messages are presented to each user in chronological order in which said message was accepted. 19. The method of claim 16, the method steps further comprising:
accepting, from said second user, at least one content interaction message related to one or more points of interest, wherein said points of interest are not the subject of a content interaction message generated by said first user. 20. The method of claim 16, the method steps further comprising:
accepting, from said first user, at least one content interaction response message related to one or more points of interest. | The improved system and method for allowing the exchange of information regarding document content under review while remaining device agnostic. The system accesses a document repository where document content and metadata related to that content may be stored. The system is operable on a computing device and allows users to access the content using a communication device with or without display technology. Users may access document content, select points of interest therein, and instantly collaborate with other users regarding the points of interest, through the exchange of interaction messages. Message exchange may be instant or may be passive through emailed hyperlinks. All exchanged interaction messages become metadata that may be chronologically recalled to assist a user in determining the thought process of the user that created the messages.1. A device for providing device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said device comprising:
a computing device configured to retrieve one or more electronic documents and to present said documents to each of a plurality of users through each user's communication device, whereby each said user may interact with other said users over one or more points of interest within said documents, said interaction occurring through exchange of interaction messages containing text, audio, or video information, said exchange facilitated by said computing device, said interaction messages associated by said computing device with said one or more points of interest. 2. The device of claim 1, wherein said exchanged messages are presented to each interacting user through each user's communication device, in the chronological order in which said messages were associated with said points of interest. 3. The device of claim 1, said computing device further configured to store said associated messages as retrievable additional electronic document content that remains associated with corresponding said points of interest. 4. The device of claim 1, said computing device generating and storing metadata for subsequent retrieval for characterizing said interaction messages, said metadata to facilitate a contextual understanding of said interaction message exchange. 5. The device of claim 1, said computing device further configured to allow subsequent retrieval of all interaction messages exchanged with regard to an electronic document. 6. The device of claim 1, wherein said exchange between users occurs regardless of functionality disparities among said users' communication devices. 7. The device of claim 1, wherein said computing device presents said electronic documents and said interaction messages in an image format suitable for display on each of said user's communication device. 8. A system for providing device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said system comprising:
one or more computing devices configured to retrieve one or more electronic documents and to present said documents to each of a plurality of users through each user's communication device, whereby each said user may interact with other said users over one or more points of interest within said documents, said interaction occurring through exchange of interaction messages containing text, audio, or video information, said exchange facilitated by said computing device, said interaction messages associated by said computing device with said one or more points of interest; and an electronic document repository accessible by said one or more computing devices. 9. The system of claim 8, wherein said exchanged messages are presented to each interacting user through each user's communication device, in the chronological order in which said messages were associated with said points of interest. 10. The system of claim 8, said computing devices further configured to store said associated messages as retrievable additional electronic document content that remains associated with corresponding said points of interest. 11. The system of claim 8, said computing devices generating and storing metadata for subsequent retrieval for characterizing said interaction messages, said metadata to facilitate a contextual understanding of said interaction message exchange. 12. The system of claim 8, said computing device further configured to allow subsequent retrieval of all interaction messages exchanged with regard to an electronic document. 13. The system of claim 8, wherein said exchange between users occurs regardless of functionality disparities among said users' communication devices. 14. The device of claim 8, wherein said computing device presents said electronic documents and said interaction messages in an image format suitable for display on each of said user's communication device. 15. The system of claim 8, wherein said electronic document repository operates from said one or more computing devices. 16. A device-agnostic electronic document content interaction between each of a plurality of users, each user having a communication device, said method steps comprising:
presenting, from a first computing device, electronic document content to a first user through a first communication device, wherein said first computing device is configured to accept selection of one or more points of interest within said electronic document content; accepting, from said first user, at least one content interaction message related to said one or more points of interest; associating said at least one content interaction message with said one or more points of interest to which said message is related, and storing said message such that the association and chronological order in which the message was accepted is determinable; presenting, from said first computing device, said electronic document content and said at least one content interaction message to a second user through a second communication device, wherein said at least one content interaction message is presented to said second user with said associated point of interest; accepting, from said second user, at least one content interaction response message related to said one or more points of interest; associating said at least one content interaction response message with said one or more points of interest to which said response message is related, and storing said response message such that the association is determinable; and presenting, from said first computing device, said electronic document content and said content interaction message and said content interaction response message to said first user through said first communication device or through a third communication device, wherein said content interaction message and said content interaction response message is presented with said associated point of interest. 17. The method of claim 16, wherein said electronic document repository operates from said one or more computing devices. 18. The method of claim 16, wherein said content interaction messages and said content interaction response messages are presented to each user in chronological order in which said message was accepted. 19. The method of claim 16, the method steps further comprising:
accepting, from said second user, at least one content interaction message related to one or more points of interest, wherein said points of interest are not the subject of a content interaction message generated by said first user. 20. The method of claim 16, the method steps further comprising:
accepting, from said first user, at least one content interaction response message related to one or more points of interest. | 2,100 |
5,657 | 5,657 | 14,029,883 | 2,126 | One or more failure regions are determined for an electrical device by training a machine learning classifier, including analyzing data points for the device and recognizing patterns in the data points. Each data point indicates pass or fail of the device for a particular combination of factors relating to the operation of the device. The trained machine learning classifier is used to predict the pass/fail state of new data points for the electrical device. Each new data point corresponds to a new combination of the factors relating to the operation of the device not previously analyzed by the machine learning classifier. A pass/fail border region can be identified for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty. | 1. A method of determining failure regions of an electrical device, the method comprising:
training a machine learning classifier by analyzing data points for the electrical device and recognizing patterns in the data points, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and using the trained machine learning classifier to predict the pass/fail state of new data points for the electrical device, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. 2. The method of claim 1, further comprising identifying a pass/fail border region for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty. 3. The method of claim 2, wherein identifying the pass/fail border region comprises:
initially training the machine learning classifier based on randomly selected data points to roughly estimate the pass/fail border region; adaptively selecting data points which are in close proximity to the roughly estimated pass/fail border region; and re-training the machine learning classifier based on the adaptively selected data points to refine the pass/fail border region. 4. The method of claim 3, wherein the adaptively selected data points have a pass/fail probability of about 50%. 5. The method of claim 3, further comprising repeating the process of adaptively selecting data points which are in close proximity to the pass/fail border region and re-training the machine learning classifier based on the adaptively selected data points to further refine the pass/fail border region. 6. The method of claim 1, further comprising:
re-training the machine learning classifier with the failing data points masked as passing data points; and using the re-trained machine learning classifier to identify another pass/fail border region for the electrical device. 7. The method of claim 6, repeating the re-training of the machine learning classifier at least one additional time with the failing data points masked as passing data points, to identify at least one additional new pass/fail border region for the electrical device. 8. The method of claim 2, further comprising evaluating the design of the electrical device based on the pass/fail border region. 9. The method of claim 2, further comprising testing a plurality of devices having the same design as the electrical device based on the pass/fail border region. 10. The method of claim 1, wherein the machine learning classifier is a support vector machine, a neural network, a deep believe network or a random forest. 11. The method of claim 1, further comprising selecting the data points for training the machine learning classifier using Monte Carlo sampling. 12. The method of claim 1, wherein each data point used to train the machine learning classifier is a test data point for the electrical device or a simulation data point for the electrical device. 13. A computer system for determining failure regions of an electrical device, comprising:
a memory configured to store data points for the electrical device, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and a processing circuit configured to train a machine learning classifier loaded into the memory by analyzing the data points and recognizing patterns in the data points, and predict the pass/fail state of new data points for the electrical device using the trained machine learning classifier, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. 14. The computer system of claim 13, wherein the processing circuit is further configured to identify a pass/fail border region for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty. 15. The computer system of claim 14, wherein the processing circuit is configured to initially train the machine learning classifier based on randomly selected data points to roughly estimate the pass/fail border region, adaptively select data points which are in close proximity to the roughly estimated pass/fail border region, and re-train the machine learning classifier based on the adaptively selected data points to refine the pass/fail border region. 16. The computer system of claim 15, wherein the processing circuit is configured to repeat the process of adaptively selecting data points which are in close proximity to the pass/fail border region and re-training the machine learning classifier based on the adaptively selected data points to further refine the pass/fail border region. 17. The computer system of claim 13, wherein the processing circuit is further configured to re-train the machine learning classifier with the failing data points masked as passing data points, and use the re-trained machine learning classifier to identify another pass/fail border region for the electrical device. 18. The computer system of claim 17, wherein the processing circuit is configured to repeat the re-training of the machine learning classifier at least one additional time with the failing data points masked as passing data points, to identify at least one additional new pass/fail border region for the electrical device. 19. The computer system of claim 13, wherein the processing circuit is configured to select the data points for training the machine learning classifier using Monte Carlo sampling. 20. A non-transitory computer readable medium storing a computer program operable to determine failure regions of an electrical device, the computer program comprising:
program instructions to train a machine learning classifier by analyzing data points for the electrical device and recognizing patterns in the data points, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and program instructions to predict the pass/fail state of new data points for the electrical device using the trained machine learning classifier, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. | One or more failure regions are determined for an electrical device by training a machine learning classifier, including analyzing data points for the device and recognizing patterns in the data points. Each data point indicates pass or fail of the device for a particular combination of factors relating to the operation of the device. The trained machine learning classifier is used to predict the pass/fail state of new data points for the electrical device. Each new data point corresponds to a new combination of the factors relating to the operation of the device not previously analyzed by the machine learning classifier. A pass/fail border region can be identified for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty.1. A method of determining failure regions of an electrical device, the method comprising:
training a machine learning classifier by analyzing data points for the electrical device and recognizing patterns in the data points, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and using the trained machine learning classifier to predict the pass/fail state of new data points for the electrical device, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. 2. The method of claim 1, further comprising identifying a pass/fail border region for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty. 3. The method of claim 2, wherein identifying the pass/fail border region comprises:
initially training the machine learning classifier based on randomly selected data points to roughly estimate the pass/fail border region; adaptively selecting data points which are in close proximity to the roughly estimated pass/fail border region; and re-training the machine learning classifier based on the adaptively selected data points to refine the pass/fail border region. 4. The method of claim 3, wherein the adaptively selected data points have a pass/fail probability of about 50%. 5. The method of claim 3, further comprising repeating the process of adaptively selecting data points which are in close proximity to the pass/fail border region and re-training the machine learning classifier based on the adaptively selected data points to further refine the pass/fail border region. 6. The method of claim 1, further comprising:
re-training the machine learning classifier with the failing data points masked as passing data points; and using the re-trained machine learning classifier to identify another pass/fail border region for the electrical device. 7. The method of claim 6, repeating the re-training of the machine learning classifier at least one additional time with the failing data points masked as passing data points, to identify at least one additional new pass/fail border region for the electrical device. 8. The method of claim 2, further comprising evaluating the design of the electrical device based on the pass/fail border region. 9. The method of claim 2, further comprising testing a plurality of devices having the same design as the electrical device based on the pass/fail border region. 10. The method of claim 1, wherein the machine learning classifier is a support vector machine, a neural network, a deep believe network or a random forest. 11. The method of claim 1, further comprising selecting the data points for training the machine learning classifier using Monte Carlo sampling. 12. The method of claim 1, wherein each data point used to train the machine learning classifier is a test data point for the electrical device or a simulation data point for the electrical device. 13. A computer system for determining failure regions of an electrical device, comprising:
a memory configured to store data points for the electrical device, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and a processing circuit configured to train a machine learning classifier loaded into the memory by analyzing the data points and recognizing patterns in the data points, and predict the pass/fail state of new data points for the electrical device using the trained machine learning classifier, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. 14. The computer system of claim 13, wherein the processing circuit is further configured to identify a pass/fail border region for the electrical device based on the training of the machine learning classifier, the pass/fail border region excluding data points for which the electrical device is expected to pass or fail with a high degree of certainty. 15. The computer system of claim 14, wherein the processing circuit is configured to initially train the machine learning classifier based on randomly selected data points to roughly estimate the pass/fail border region, adaptively select data points which are in close proximity to the roughly estimated pass/fail border region, and re-train the machine learning classifier based on the adaptively selected data points to refine the pass/fail border region. 16. The computer system of claim 15, wherein the processing circuit is configured to repeat the process of adaptively selecting data points which are in close proximity to the pass/fail border region and re-training the machine learning classifier based on the adaptively selected data points to further refine the pass/fail border region. 17. The computer system of claim 13, wherein the processing circuit is further configured to re-train the machine learning classifier with the failing data points masked as passing data points, and use the re-trained machine learning classifier to identify another pass/fail border region for the electrical device. 18. The computer system of claim 17, wherein the processing circuit is configured to repeat the re-training of the machine learning classifier at least one additional time with the failing data points masked as passing data points, to identify at least one additional new pass/fail border region for the electrical device. 19. The computer system of claim 13, wherein the processing circuit is configured to select the data points for training the machine learning classifier using Monte Carlo sampling. 20. A non-transitory computer readable medium storing a computer program operable to determine failure regions of an electrical device, the computer program comprising:
program instructions to train a machine learning classifier by analyzing data points for the electrical device and recognizing patterns in the data points, each data point indicating pass or fail of the electrical device for a particular combination of factors relating to the operation of the electrical device; and program instructions to predict the pass/fail state of new data points for the electrical device using the trained machine learning classifier, each new data point corresponding to a new combination of the factors relating to the operation of the electrical device not previously analyzed by the machine learning classifier. | 2,100 |
5,658 | 5,658 | 14,211,305 | 2,121 | Methods and systems to test of web browser enabled applications are disclosed. In one embodiment, a browser application can allow a user to perform test and analysis processes on a candidate web browser enabled application. The test enabled browser can use special functions and facilities that are built into the test enabled browser. One implementation of the invention pertains to functional testing, and another implementation of the invention pertains to pertains to site analysis. | 1. A non-transitory computer readable medium including at least computer program code executable by a computer, said computer readable medium comprising:
computer program code for creating a playback program that senses document object model (DOM) events, the playback program being expressed in a programming language that supports function calls; and computer program code for providing a test-enabled browser capable of performing the playback program, wherein when the test-enabled browser performs the playback program, the test-enabled browser is controlled to implement testing specified by the playback program. 2. A non-transitory computer readable as recited in claim 1, wherein the testing by the playback program operates to test a web-based resource. 3. A non-transitory computer readable as recited in claim 1, wherein the remote resource comprises a web site or web application. 5. A non-transitory computer readable as recited in claim 1, wherein, on performing the playback program, the computer program code for providing the test-enabled browser is controlled by the playback program in a manner that mimics the same behavior as a predetermined behavior. 6. A non-transitory computer readable as recited in claim 5, wherein said computer readable medium comprises:
computer program code for capturing a user session, and wherein the predetermined behavior comprises a previously captured user session. 7. A non-transitory computer readable as recited in claim 1, wherein the remote resource is identified by a URL. 8. A non-transitory computer readable as recited in claim 1, wherein the remote resource is a webpage. 9. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page size for the webpage. 10. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure size of one or more objects within the webpage. 11. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page download time for the webpage. 12. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page component download times for the webpage. 13. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to confirm content using a matching operation. 14. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able to confirm that a specified URL is within the webpage. 15. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able to prevent download of a specified URL even though it is within the webpage. 16. A non-transitory computer readable as recited in claim 8 wherein the test-enabled web browser is configured to able to prevent download of a specified URL even though it is within the webpage. 17. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able replace an existing URL with a substitute URL from an alternative source even though it is within the webpage. 18. A non-transitory computer readable medium including at least computer program code, said computer readable medium comprising:
computer program code for providing a test-enabled browser capable of performing a playback program, wherein when the test-enabled browser performed the playback program, the test-enabled browser is controlled to implement testing specified by the playback program, wherein during playback of the playback program, one or more named parameters for the playback program can be retrieved from user-supplied values. 19. A non-transitory computer readable as recited in claim 18, wherein the user-supplied values are set dynamically from within the playback program. 20. A non-transitory computer readable as recited in claim 18, wherein the user-supplied values are set dynamically from a source external to the playback program. 21. A non-transitory computer readable as recited in claim 18, wherein the test-enabled browser performs the playback program to test a remote resource, and wherein the remote resource comprises a Document Object Model (DOM), and wherein at least one of the user-supplied values pertain to content of one or more properties of the DOM. 22. A non-transitory computer readable as recited in claim 18, wherein the test-enabled browser performs the playback program to test a remote resource, and wherein the remote resource comprises a Document Object Model (DOM), and wherein at least one of the user-supplied values pertain to changes to content of one or more properties of the DOM. | Methods and systems to test of web browser enabled applications are disclosed. In one embodiment, a browser application can allow a user to perform test and analysis processes on a candidate web browser enabled application. The test enabled browser can use special functions and facilities that are built into the test enabled browser. One implementation of the invention pertains to functional testing, and another implementation of the invention pertains to pertains to site analysis.1. A non-transitory computer readable medium including at least computer program code executable by a computer, said computer readable medium comprising:
computer program code for creating a playback program that senses document object model (DOM) events, the playback program being expressed in a programming language that supports function calls; and computer program code for providing a test-enabled browser capable of performing the playback program, wherein when the test-enabled browser performs the playback program, the test-enabled browser is controlled to implement testing specified by the playback program. 2. A non-transitory computer readable as recited in claim 1, wherein the testing by the playback program operates to test a web-based resource. 3. A non-transitory computer readable as recited in claim 1, wherein the remote resource comprises a web site or web application. 5. A non-transitory computer readable as recited in claim 1, wherein, on performing the playback program, the computer program code for providing the test-enabled browser is controlled by the playback program in a manner that mimics the same behavior as a predetermined behavior. 6. A non-transitory computer readable as recited in claim 5, wherein said computer readable medium comprises:
computer program code for capturing a user session, and wherein the predetermined behavior comprises a previously captured user session. 7. A non-transitory computer readable as recited in claim 1, wherein the remote resource is identified by a URL. 8. A non-transitory computer readable as recited in claim 1, wherein the remote resource is a webpage. 9. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page size for the webpage. 10. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure size of one or more objects within the webpage. 11. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page download time for the webpage. 12. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to measure page component download times for the webpage. 13. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to confirm content using a matching operation. 14. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able to confirm that a specified URL is within the webpage. 15. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able to prevent download of a specified URL even though it is within the webpage. 16. A non-transitory computer readable as recited in claim 8 wherein the test-enabled web browser is configured to able to prevent download of a specified URL even though it is within the webpage. 17. A non-transitory computer readable as recited in claim 8, wherein the test-enabled web browser is configured to able replace an existing URL with a substitute URL from an alternative source even though it is within the webpage. 18. A non-transitory computer readable medium including at least computer program code, said computer readable medium comprising:
computer program code for providing a test-enabled browser capable of performing a playback program, wherein when the test-enabled browser performed the playback program, the test-enabled browser is controlled to implement testing specified by the playback program, wherein during playback of the playback program, one or more named parameters for the playback program can be retrieved from user-supplied values. 19. A non-transitory computer readable as recited in claim 18, wherein the user-supplied values are set dynamically from within the playback program. 20. A non-transitory computer readable as recited in claim 18, wherein the user-supplied values are set dynamically from a source external to the playback program. 21. A non-transitory computer readable as recited in claim 18, wherein the test-enabled browser performs the playback program to test a remote resource, and wherein the remote resource comprises a Document Object Model (DOM), and wherein at least one of the user-supplied values pertain to content of one or more properties of the DOM. 22. A non-transitory computer readable as recited in claim 18, wherein the test-enabled browser performs the playback program to test a remote resource, and wherein the remote resource comprises a Document Object Model (DOM), and wherein at least one of the user-supplied values pertain to changes to content of one or more properties of the DOM. | 2,100 |
5,659 | 5,659 | 14,614,653 | 2,178 | Determining interactions between scripts and elements of a markup language document includes loading a markup language document into a browser. The markup language document includes a plurality of markup language elements. A call from within the markup language document to a method specified by a script is detected. The markup language element of the plurality of markup language elements that is modified by execution of the method is determined using the processor. Log data is stored that includes a name of the modified markup language element in association with a name of the method. | 1-8. (canceled) 9. A system, comprising:
a processor programmed to initiate executable operations comprising: loading a markup language document into a browser, wherein the markup language document comprises a plurality of markup language elements; detecting a call from within the markup language document to a method specified by a script; determining a markup language element of the markup language document modified by execution of the method; and storing log data comprising a name of the modified markup language element in association with a name of the method. 10. The system of claim 9, wherein storing log data is performed only responsive to determining that the markup language element is selected for monitoring. 11. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
storing an image comprising the markup language element. 12. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
storing a first state of the markup language element prior to execution of the method; and storing a second state of the markup language element subsequent to execution of the method. 13. The system of claim 12, wherein the processor is further programmed to initiate executable operations comprising:
determining a data item of the markup language element that changed from the first state to the second state. 14. The system of claim 14, wherein the first state and the second state are determined during loading of the markup language document into the browser. 15. The system of claim 14, wherein the first state and the second state are determined subsequent to loading the markup language document into the browser. 16. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
detecting a marker condition; and responsive to detecting the marker condition, inserting a marker into the log data. 17. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
loading, using the processor, a markup language document into a browser, wherein the markup language document comprises a plurality of markup language elements; detecting, using the processor, a call from within the markup language document to a method specified by a script; determining, using the processor, a markup language element of the plurality of markup language elements that is modified by execution of the method; and storing, using the processor, log data comprising a name of the modified markup language element in association with a name of the method. 18. The computer program product of claim 17, further comprising:
storing a first state of the markup language element prior to execution of the method; and storing a second state of the markup language element subsequent to execution of the method. 19. The computer program product of claim 18, further comprising:
determining a data item of the markup language element that changed from the first state to the second state. 20. The computer program product of claim 17, further comprising:
detecting a marker condition; and responsive to detecting the marker condition, inserting a marker into the log data. | Determining interactions between scripts and elements of a markup language document includes loading a markup language document into a browser. The markup language document includes a plurality of markup language elements. A call from within the markup language document to a method specified by a script is detected. The markup language element of the plurality of markup language elements that is modified by execution of the method is determined using the processor. Log data is stored that includes a name of the modified markup language element in association with a name of the method.1-8. (canceled) 9. A system, comprising:
a processor programmed to initiate executable operations comprising: loading a markup language document into a browser, wherein the markup language document comprises a plurality of markup language elements; detecting a call from within the markup language document to a method specified by a script; determining a markup language element of the markup language document modified by execution of the method; and storing log data comprising a name of the modified markup language element in association with a name of the method. 10. The system of claim 9, wherein storing log data is performed only responsive to determining that the markup language element is selected for monitoring. 11. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
storing an image comprising the markup language element. 12. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
storing a first state of the markup language element prior to execution of the method; and storing a second state of the markup language element subsequent to execution of the method. 13. The system of claim 12, wherein the processor is further programmed to initiate executable operations comprising:
determining a data item of the markup language element that changed from the first state to the second state. 14. The system of claim 14, wherein the first state and the second state are determined during loading of the markup language document into the browser. 15. The system of claim 14, wherein the first state and the second state are determined subsequent to loading the markup language document into the browser. 16. The system of claim 9, wherein the processor is further programmed to initiate executable operations comprising:
detecting a marker condition; and responsive to detecting the marker condition, inserting a marker into the log data. 17. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
loading, using the processor, a markup language document into a browser, wherein the markup language document comprises a plurality of markup language elements; detecting, using the processor, a call from within the markup language document to a method specified by a script; determining, using the processor, a markup language element of the plurality of markup language elements that is modified by execution of the method; and storing, using the processor, log data comprising a name of the modified markup language element in association with a name of the method. 18. The computer program product of claim 17, further comprising:
storing a first state of the markup language element prior to execution of the method; and storing a second state of the markup language element subsequent to execution of the method. 19. The computer program product of claim 18, further comprising:
determining a data item of the markup language element that changed from the first state to the second state. 20. The computer program product of claim 17, further comprising:
detecting a marker condition; and responsive to detecting the marker condition, inserting a marker into the log data. | 2,100 |
5,660 | 5,660 | 14,901,984 | 2,173 | Systems and methods for displaying a preferred well on a mobile device displaying data for another well and reconfiguring a system based on geographical coordinates for the mobile device and/or the system. | 1. A method for displaying data for a preferred well on a mobile device, which comprises:
determining geographical coordinates for the mobile device using the mobile device; locating the preferred well in a list of wells by comparing geographical coordinates for each well in the list of wells with the geographic coordinates for the mobile device and automatically designating a well with geographical coordinates closest to the geographical coordinates for the mobile device as the preferred well when the geological coordinates for the mobile device are determined; and displaying the data for the preferred well on the mobile device. 2. The method of claim 1, wherein a satellite system is used for determining the geographical coordinates for the mobile device. 3. The method of claim 1, wherein the data for the preferred well is displayed on the mobile device by automatically replacing data for another well displayed on the mobile device with the data for the preferred well. 4. The method of claim 1, wherein the preferred well is located in the list of wells based only on the geographical coordinates for each well in the list of wells and the geographical coordinates for the mobile device. 5. The method of claim 1, further comprising repeating the steps in claims 1 and 3 after the mobile device is moved to another location with new geographical coordinates. 6. A non-transitory program carrier device tangibly carrying computer executable instructions for displaying data for a preferred well on a mobile device, the instructions being executable to implement:
determining geographical coordinates for the mobile device using the mobile device; locating the preferred well in a list of wells by comparing geographical coordinates for each well in the list of wells with the geographic coordinates for the mobile device and automatically designating a well with geographical coordinates closest to the geographical coordinates for the mobile device as the preferred well when the geological coordinates for the mobile device are determined; and displaying the data for the preferred well on the mobile device. 7. The program carrier device of claim 6, wherein a satellite system is used for determining the geographical coordinates for the mobile device. 8. The program carrier device of claim 6, wherein the data for the preferred well is displayed on the mobile device by automatically replacing data for another well displayed on the mobile device with the data for the preferred well. 9. The program carrier device of claim 6, wherein the preferred well is located in the list of wells based only on the geographical coordinates for each well in the list of wells and the geographical coordinates for the mobile device. 10. The program carrier device of claim 6, further comprising repeating the steps in claims 6 and 8 after the mobile device is moved to another location with new geographical coordinates. 11. A method for reconfiguring a system on a computer, which comprises:
determining geographical coordinates for the system using the computer; and reconfiguring the system by automatically replacing at least one of a parameter, a data format and data for the system with at least one of a respective new parameter, new data format and new data when the geographical coordinates for the system are determined, the new parameter, the new data format and the new data being associated with the geographical coordinates for the system. 12. The method of claim 11, wherein a satellite system is used for determining the geographical coordinates for the system. 13. The method of claim 11, wherein the new parameter, the new data format and the new data are associated with a system phase. 14. The method of claim 13, wherein the geographical coordinates for the system represent a well location and the system phase represents a well activity. 15. The method of claim 11, wherein the new parameter represents rights to access or edit data or new data for the system and the new data format represents one or more custom formatted reports. 16. A non-transitory program carrier device tangibly carrying computer executable instructions for reconfiguring a system on a computer, the instructions being executable to implement:
determining geographical coordinates for the system; and reconfiguring the system by automatically replacing at least one of a parameter, a data format and data for the system with at least one of a respective new parameter, new data format and new data when the geographical coordinates for the system are determined, the new parameter, the new data format and the new data being associated with the geographical coordinates for the system. 17. The program carrier device of claim 16, wherein a satellite system is used for determining the geographical coordinates for the system. 18. The program carrier device of claim 16, wherein the new parameter, the new data format and the new data are associated with a system phase. 19. The program carrier device of method of claim 18, wherein the geographical coordinates for the system represent a well location and the system phase represents a well activity. 20. The program carrier device of claim 16, wherein the new parameter represents rights to access or edit data or new data for the system and the new data format represents one or more custom formatted reports. | Systems and methods for displaying a preferred well on a mobile device displaying data for another well and reconfiguring a system based on geographical coordinates for the mobile device and/or the system.1. A method for displaying data for a preferred well on a mobile device, which comprises:
determining geographical coordinates for the mobile device using the mobile device; locating the preferred well in a list of wells by comparing geographical coordinates for each well in the list of wells with the geographic coordinates for the mobile device and automatically designating a well with geographical coordinates closest to the geographical coordinates for the mobile device as the preferred well when the geological coordinates for the mobile device are determined; and displaying the data for the preferred well on the mobile device. 2. The method of claim 1, wherein a satellite system is used for determining the geographical coordinates for the mobile device. 3. The method of claim 1, wherein the data for the preferred well is displayed on the mobile device by automatically replacing data for another well displayed on the mobile device with the data for the preferred well. 4. The method of claim 1, wherein the preferred well is located in the list of wells based only on the geographical coordinates for each well in the list of wells and the geographical coordinates for the mobile device. 5. The method of claim 1, further comprising repeating the steps in claims 1 and 3 after the mobile device is moved to another location with new geographical coordinates. 6. A non-transitory program carrier device tangibly carrying computer executable instructions for displaying data for a preferred well on a mobile device, the instructions being executable to implement:
determining geographical coordinates for the mobile device using the mobile device; locating the preferred well in a list of wells by comparing geographical coordinates for each well in the list of wells with the geographic coordinates for the mobile device and automatically designating a well with geographical coordinates closest to the geographical coordinates for the mobile device as the preferred well when the geological coordinates for the mobile device are determined; and displaying the data for the preferred well on the mobile device. 7. The program carrier device of claim 6, wherein a satellite system is used for determining the geographical coordinates for the mobile device. 8. The program carrier device of claim 6, wherein the data for the preferred well is displayed on the mobile device by automatically replacing data for another well displayed on the mobile device with the data for the preferred well. 9. The program carrier device of claim 6, wherein the preferred well is located in the list of wells based only on the geographical coordinates for each well in the list of wells and the geographical coordinates for the mobile device. 10. The program carrier device of claim 6, further comprising repeating the steps in claims 6 and 8 after the mobile device is moved to another location with new geographical coordinates. 11. A method for reconfiguring a system on a computer, which comprises:
determining geographical coordinates for the system using the computer; and reconfiguring the system by automatically replacing at least one of a parameter, a data format and data for the system with at least one of a respective new parameter, new data format and new data when the geographical coordinates for the system are determined, the new parameter, the new data format and the new data being associated with the geographical coordinates for the system. 12. The method of claim 11, wherein a satellite system is used for determining the geographical coordinates for the system. 13. The method of claim 11, wherein the new parameter, the new data format and the new data are associated with a system phase. 14. The method of claim 13, wherein the geographical coordinates for the system represent a well location and the system phase represents a well activity. 15. The method of claim 11, wherein the new parameter represents rights to access or edit data or new data for the system and the new data format represents one or more custom formatted reports. 16. A non-transitory program carrier device tangibly carrying computer executable instructions for reconfiguring a system on a computer, the instructions being executable to implement:
determining geographical coordinates for the system; and reconfiguring the system by automatically replacing at least one of a parameter, a data format and data for the system with at least one of a respective new parameter, new data format and new data when the geographical coordinates for the system are determined, the new parameter, the new data format and the new data being associated with the geographical coordinates for the system. 17. The program carrier device of claim 16, wherein a satellite system is used for determining the geographical coordinates for the system. 18. The program carrier device of claim 16, wherein the new parameter, the new data format and the new data are associated with a system phase. 19. The program carrier device of method of claim 18, wherein the geographical coordinates for the system represent a well location and the system phase represents a well activity. 20. The program carrier device of claim 16, wherein the new parameter represents rights to access or edit data or new data for the system and the new data format represents one or more custom formatted reports. | 2,100 |
5,661 | 5,661 | 14,615,869 | 2,125 | A computer-implemented method of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and •) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . , •) at least one UIE.Y per LAC.Z, •) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells, “KR-UIE.Y” and “HI-UIE.Y”, and a “Global Bibliography, GloBi”, accessible to the processor, and •) IES being capable of running in a config-mode or a realtime-mode, and the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants: •) a given “First Order Logic Finite Legal Norm, FFLN” in some given notation, •) a given “Pair of a <Technical Teaching FFLN , Reference Set FFLN >, PTR FFLN ” —and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and •) a given “PTR Data Structure, PTR-DS” with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and •) a given “Arguable Subtest of this FSTP-Test of PTR, AST”, with AST stored by some KR-UIE.Y, for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES: A) the IES automatically prompts the user—to enable a UIE.Y to present in B) a LAC.Z in realtime mode—to invoke the IES to
i. automatically identify a KR-UIE.Y storing an AST to be transformed into a LAC.Z, and ii. automatically identify an unused HI-UIE.Y, into which to input by a user—as part of Action A)—what the content and the representations shall be of LAC.Z, then supposed to represent the transformation of the AST on an I/O device of the IES, and to iii. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y> into the GloBi.
B) i. the IES automatically prompts the user to identify a LAC.Z in the GloBi, and
ii. the IES automatically presents the LAC.Z as defined in A) iii. | 1. A computer-implemented method of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and
•) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . ,
•) at least one UIE.Y per LAC.Z,
•) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells, “KR-UIE.Y” and “HI-UIE.Y”, and a “Global Bibliography, GloBi”, accessible to the processor, and
•) IES being capable of running in a config-mode or a realtime-mode, and
the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants:
•) a given “First Order Logic Finite Legal Norm, FFLN” in some given notation,
•) a given “Pair of a <Technical TeachingFFLN, Reference SetFFLN>, PTRFFLN”
—and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and
•) a given “PTR Data Structure, PTR-DS”
with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and
•) a given “Arguable Subtest of this FSTP-Test of PTR, AST”,
with AST stored by some KR-UIE.Y,
for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES:
A) the IES automatically prompts the user—to enable a UIE.Y to present in B) a LAC.Z in realtime mode—to invoke the IES to
i. automatically identify a KR-UIE.Y storing an AST to be transformed into a LAC.Z, and
ii. automatically identify an unused HI-UIE.Y, into which to input by a user—as part of Action A)—what the content and the representations shall be of LAC.Z, then supposed to represent the transformation of the AST on an I/O device of the IES, and to
iii. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y> into the GloBi.
B) i. the IES automatically prompts the user to identify a LAC.Z in the GloBi, and
ii. the IES automatically presents the LAC.Z as defined in A) iii. 2. A computer-implemented method according to claim 1), with MEMEX containing also a set of storage cells, “IC-UIE.Y”, which comprises after A) ii. a step A) iii.:
“iii. an unused IC-UIE.Y and inputting into it what control commands as to presenting on an I/O device of the IES the content and the representations stored in ii. shall be available to the IES or a IES user, anytime while this LAC.Z is invoked in realtime-mode”, making the previous step A) iii. become step A) iv.,
“iv. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y, IC-UIE.Y>into the GloBi”. 3. A computer-implemented method according to claim 1), whereby the action B) is expanded by “, whereby when and while executing this presentation, the IES or an IES user may invoke anytime a control command as of A) iii.” 4. A computer-implemented method according to claim 1), whereby
•) a LAC.Z may be sub-structured into the components “Legal Argument Chain Steps, LACS.Z.SZ.S”, 1≦Z.S≦ZS, which each may comprise “Legal Argument Chain Moves, LACM.Z.MZ.S.M”, 1≦Z.S.M≦ZSM (ZS≧0 and ZSM≧0 given by a method's implementation), •) any UIE.Z.Y, Y=1,2,3, . . . , peer to a LAC.Z is sub-structured exactly the same way into the components UIES.Z.Y.SZ.S, UIEM.Z.Y.MZ.S.M, and •) this sub-structure may be determined by the IES or an IES user and •) any operation defined in A) and B) applies to all components of any LAC.Z and its UIE.Z.Ys. 5. A computer-implemented method according to claim 1), whereby at least one AST may be
•) completely input by the IES user, or •) automatically derived by the IES from a PTR-DS part identified by a IES user, or •) automatically derived by the IES from a PTR-DS by determining all the ASTs it comprises. 6. A computer-implemented method according to claim 1), whereby the PTR-DS or at least one of its determinants may be
•) completely input by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 7. A computer-implemented method according to one of the claim 2), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be determined:
•) completely by input provided by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 8. A computer-implemented method according to one of the claim 2), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be based on relations between parts of different instantiations of HI-UIE.Ys or IC-UIE.Ys or KR-UIE.Ys. 9. A computer-implemented method according to claim 1), whereby FFLN is a “Substantive Patent Law, SPL” or a “Substantive Copyright Law, SCL”. 10. A computer-implemented method according to claim 1), whereby FFLN is a conjunction of FFLNs. 11. A computer-implemented method according to claim 1), whereby its FFLN is augmented by the user preserving its finite FOL property. 12. A computer-implemented method according to claim 1), whereby the representation of the user input provided to the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 13. A computer-implemented method according to claim 1), whereby the output representation to be used by the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 14. A computer-implemented method according to claim 1), whereby the input into a HI-UIE.Y is automatically generated by the IES what the content and the representations shall be of the LAC.Z, representing part of the transformation of a given AST on an I/O device of the IES—whereby said representation is given by the IES implementation or to the IES by a user in some given notation. 15. A computer-implemented method according to claim 11), whereby its Action A) is begun by
“the IES automatically prompts the user to enable UIE.Ys to present in B) for any AST in PTR-DS its peer automatically generated LAC.Z in realtime mode to invoke o. the IES to repeatedly automatically identify in PTR-DS another non-translated AST and execute with it i.-iii.:” 16. A computer-implemented system of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and
•) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . ,
•) at least one UIE.Y per LAC.Z,
•) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells called “KR-UIE.Y”, “HI-UIE.Y”, and “IC-UIE.Y” and a “Global Bibliography, GB”, accessible to the processor, and
•) IES being capable of running in a config-mode or a realtime-mode, and
the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants:
•) a given “First Order Logic Finite Legal Norm, FOLLN alias FFLN” in some given notation,
•) a given “Pair of a <Technical TeachingFFLN, Reference SetFFLN>, PTRFFLN”
—and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and
•) a given “PTR Data Structure, PTR-DS”
with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and
•) a given “Arguable Subtest of this FSTP-Test of PTR, AST”,
with AST stored by some KR-UIE.Y,
for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES:
A) automatically prompting the user by the IES to enable a UIE.Y to present a LAC.Z in realtime mode, namely by identifying
i. a KR-UIE.Y storing an AST to be transformed into a LAC.Z,
ii. a HI-UIE.Y and inputting into it what the content and the representations shall be of the LAC.Z, representing the transformation of the AST on an I/O device of the IES,
iii. input into GB “LAC.Z::=<KR-UIE.Y, HI-UIE.Y>.
B) automatically prompting the user by the IES to identify a LAC.Z comprised by GB and then present LAC.Z as defined in A) iii. 17. A computer-implemented system according to claim 16), comprising after ii. a step iii.:
“iii. a IC-UIE.Y and inputting into it what control commands as to presenting on an I/O device of the IES the content and the representations stored in ii. shall be available to the IES or a IES user, anytime while this LAC.Z is invoked in realtime-mode”,
making the previous step iii. become step iv.,
“iv. input into GloBi “LAC.Z::=<KR-UIE.Y, HI-UIE.Y, CI-UIE.Y>. 18. A computer-implemented system according to claim 16), whereby the action B) is expanded by “, whereby when and while executing this presentation, the IES or an IES user may invoke anytime a control command as of A) iii.” 19. A computer-implemented system according to claim 16), whereby
•) a LAC.Z may be sub-structured into the components “Legal Argument Chain Steps, LACS.Z.SZ.S”, 1≦Z.S≦ZS, which each may comprise “Legal Argument Chain Moves, LACM.Z.MZ.S.M”, 1≦Z.S.M≦ZSM (ZS≧0 and ZSM≧0 given by a method's implementation), •) any UIE.Z.Y, Y=1,2,3, . . . , peer to a LAC.Z is sub-structured exactly the same way into the components UIES.Z.Y.SZ.S, UIEM.Z.Y.MZ.S.M, and •) this sub-structure may be determined by the IES or an IES user and •) any operation defined in A) and B) applies to all components of any LAC.Z and its UIE.Z.Ys. 20. A computer-implemented system according to claim 16), whereby at least one AST may be
•) completely input by the IES user, or •) automatically derived by the IES from a PTR-DS part identified by a IES user, or •) automatically derived by the IES from a PTR-DS by determining all the ASTs it comprises. 21. A computer-implemented system according to claim 16), whereby the PTR-DS or at least one of its determinants may be
•) completely input by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 22. A computer-implemented system according to one of the claim 17), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be determined:
•) completely by input provided by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 23. A computer-implemented system according to one of the claim 17), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be based on relations between parts of different instantiations of HI-UIE.Ys or IC-UIE.Ys or KR-UIE.Ys. 24. A computer-implemented system according to claim 16), whereby FFLN is a “Substantive Patent Law, SPL” or a “Substantive Copyright Law, SCL”. 25. A computer-implemented system according to claim 16), whereby FFLN is a conjunction of FFLNs. 26. A computer-implemented system according to claim 16), whereby its FFLN is augmented by the user preserving its finite FOL property. 27. A computer-implemented system according to claim 16), whereby the representation of the user input provided to the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 28. A computer-implemented system according to claim 16), whereby the output representation to be used by the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 29. A computer-implemented system according to claim 16), whereby the input into a HI-UIE.Y is automatically generated by the IES—what the content and the representations shall be of the LAC.Z, representing part of the transformation of a given AST on an I/O device of the IES—whereby said representation is given by the IES implementation or to the IES by a user in some given notation. 30. A computer-implemented system according to claim 16), whereby its Action A) is begun by
“the IES automatically prompts the user to enable UIE.Ys to present in B) for any AST in PTR-DS its peer automatically generated LAC.Z in realtime mode to invoke o. the IES to repeatedly automatically identify in PTR-DS another non-translated AST and execute with it i.-iii.:” | A computer-implemented method of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and •) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . , •) at least one UIE.Y per LAC.Z, •) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells, “KR-UIE.Y” and “HI-UIE.Y”, and a “Global Bibliography, GloBi”, accessible to the processor, and •) IES being capable of running in a config-mode or a realtime-mode, and the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants: •) a given “First Order Logic Finite Legal Norm, FFLN” in some given notation, •) a given “Pair of a <Technical Teaching FFLN , Reference Set FFLN >, PTR FFLN ” —and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and •) a given “PTR Data Structure, PTR-DS” with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and •) a given “Arguable Subtest of this FSTP-Test of PTR, AST”, with AST stored by some KR-UIE.Y, for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES: A) the IES automatically prompts the user—to enable a UIE.Y to present in B) a LAC.Z in realtime mode—to invoke the IES to
i. automatically identify a KR-UIE.Y storing an AST to be transformed into a LAC.Z, and ii. automatically identify an unused HI-UIE.Y, into which to input by a user—as part of Action A)—what the content and the representations shall be of LAC.Z, then supposed to represent the transformation of the AST on an I/O device of the IES, and to iii. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y> into the GloBi.
B) i. the IES automatically prompts the user to identify a LAC.Z in the GloBi, and
ii. the IES automatically presents the LAC.Z as defined in A) iii.1. A computer-implemented method of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and
•) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . ,
•) at least one UIE.Y per LAC.Z,
•) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells, “KR-UIE.Y” and “HI-UIE.Y”, and a “Global Bibliography, GloBi”, accessible to the processor, and
•) IES being capable of running in a config-mode or a realtime-mode, and
the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants:
•) a given “First Order Logic Finite Legal Norm, FFLN” in some given notation,
•) a given “Pair of a <Technical TeachingFFLN, Reference SetFFLN>, PTRFFLN”
—and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and
•) a given “PTR Data Structure, PTR-DS”
with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and
•) a given “Arguable Subtest of this FSTP-Test of PTR, AST”,
with AST stored by some KR-UIE.Y,
for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES:
A) the IES automatically prompts the user—to enable a UIE.Y to present in B) a LAC.Z in realtime mode—to invoke the IES to
i. automatically identify a KR-UIE.Y storing an AST to be transformed into a LAC.Z, and
ii. automatically identify an unused HI-UIE.Y, into which to input by a user—as part of Action A)—what the content and the representations shall be of LAC.Z, then supposed to represent the transformation of the AST on an I/O device of the IES, and to
iii. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y> into the GloBi.
B) i. the IES automatically prompts the user to identify a LAC.Z in the GloBi, and
ii. the IES automatically presents the LAC.Z as defined in A) iii. 2. A computer-implemented method according to claim 1), with MEMEX containing also a set of storage cells, “IC-UIE.Y”, which comprises after A) ii. a step A) iii.:
“iii. an unused IC-UIE.Y and inputting into it what control commands as to presenting on an I/O device of the IES the content and the representations stored in ii. shall be available to the IES or a IES user, anytime while this LAC.Z is invoked in realtime-mode”, making the previous step A) iii. become step A) iv.,
“iv. automatically input “LAC.Z::=<KR-UIE.Y, HI-UIE.Y, IC-UIE.Y>into the GloBi”. 3. A computer-implemented method according to claim 1), whereby the action B) is expanded by “, whereby when and while executing this presentation, the IES or an IES user may invoke anytime a control command as of A) iii.” 4. A computer-implemented method according to claim 1), whereby
•) a LAC.Z may be sub-structured into the components “Legal Argument Chain Steps, LACS.Z.SZ.S”, 1≦Z.S≦ZS, which each may comprise “Legal Argument Chain Moves, LACM.Z.MZ.S.M”, 1≦Z.S.M≦ZSM (ZS≧0 and ZSM≧0 given by a method's implementation), •) any UIE.Z.Y, Y=1,2,3, . . . , peer to a LAC.Z is sub-structured exactly the same way into the components UIES.Z.Y.SZ.S, UIEM.Z.Y.MZ.S.M, and •) this sub-structure may be determined by the IES or an IES user and •) any operation defined in A) and B) applies to all components of any LAC.Z and its UIE.Z.Ys. 5. A computer-implemented method according to claim 1), whereby at least one AST may be
•) completely input by the IES user, or •) automatically derived by the IES from a PTR-DS part identified by a IES user, or •) automatically derived by the IES from a PTR-DS by determining all the ASTs it comprises. 6. A computer-implemented method according to claim 1), whereby the PTR-DS or at least one of its determinants may be
•) completely input by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 7. A computer-implemented method according to one of the claim 2), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be determined:
•) completely by input provided by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 8. A computer-implemented method according to one of the claim 2), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be based on relations between parts of different instantiations of HI-UIE.Ys or IC-UIE.Ys or KR-UIE.Ys. 9. A computer-implemented method according to claim 1), whereby FFLN is a “Substantive Patent Law, SPL” or a “Substantive Copyright Law, SCL”. 10. A computer-implemented method according to claim 1), whereby FFLN is a conjunction of FFLNs. 11. A computer-implemented method according to claim 1), whereby its FFLN is augmented by the user preserving its finite FOL property. 12. A computer-implemented method according to claim 1), whereby the representation of the user input provided to the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 13. A computer-implemented method according to claim 1), whereby the output representation to be used by the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 14. A computer-implemented method according to claim 1), whereby the input into a HI-UIE.Y is automatically generated by the IES what the content and the representations shall be of the LAC.Z, representing part of the transformation of a given AST on an I/O device of the IES—whereby said representation is given by the IES implementation or to the IES by a user in some given notation. 15. A computer-implemented method according to claim 11), whereby its Action A) is begun by
“the IES automatically prompts the user to enable UIE.Ys to present in B) for any AST in PTR-DS its peer automatically generated LAC.Z in realtime mode to invoke o. the IES to repeatedly automatically identify in PTR-DS another non-translated AST and execute with it i.-iii.:” 16. A computer-implemented system of generating, customizing and providing “Legal Argument Chains, LAC.Z”, Z=1,2,3, . . . , by a “Innovation Expert System, IES”,
this IES comprising at least one of a processor, a memory for storing the method's executable code for the processor, an I/O device in particular for human interaction with an IES user, and
•) a “User Interface Entity, UIE”, composed of UIE.Y, Y=1,2,3, . . . ,
•) at least one UIE.Y per LAC.Z,
•) a “Memory of Method Execution, MEMEX”, comprising a set of storage cells called “KR-UIE.Y”, “HI-UIE.Y”, and “IC-UIE.Y” and a “Global Bibliography, GB”, accessible to the processor, and
•) IES being capable of running in a config-mode or a realtime-mode, and
the IES further comprising—since before starting the execution of this method or input to the IES during its execution via an I/O device of the IES—the “Test Set-UP, TSU” comprising the test determinants:
•) a given “First Order Logic Finite Legal Norm, FOLLN alias FFLN” in some given notation,
•) a given “Pair of a <Technical TeachingFFLN, Reference SetFFLN>, PTRFFLN”
—and leaving away the index “FFLN” here and for all terms in the rest of the claims, e.g. a “Pair of a <Technical Teaching, Reference Set>, PTR”—and
•) a given “PTR Data Structure, PTR-DS”
with “Some Innovation in FFLN, SI” is the “Technical Teaching in FFLN, TT.0” of the PTR and an FSTP-Test such that SI satisfies FFLN if and only if PTR passes this FSTP-Test and PTR-DS is the evidence that PTR satisfies FFLN by this FSTP-Test, and
•) a given “Arguable Subtest of this FSTP-Test of PTR, AST”,
with AST stored by some KR-UIE.Y,
for use by an IES user or the IES when executing the method, this execution comprising repeated invocations of the executions of the Action A) in a config-mode or B) in a realtime-mode of the IES:
A) automatically prompting the user by the IES to enable a UIE.Y to present a LAC.Z in realtime mode, namely by identifying
i. a KR-UIE.Y storing an AST to be transformed into a LAC.Z,
ii. a HI-UIE.Y and inputting into it what the content and the representations shall be of the LAC.Z, representing the transformation of the AST on an I/O device of the IES,
iii. input into GB “LAC.Z::=<KR-UIE.Y, HI-UIE.Y>.
B) automatically prompting the user by the IES to identify a LAC.Z comprised by GB and then present LAC.Z as defined in A) iii. 17. A computer-implemented system according to claim 16), comprising after ii. a step iii.:
“iii. a IC-UIE.Y and inputting into it what control commands as to presenting on an I/O device of the IES the content and the representations stored in ii. shall be available to the IES or a IES user, anytime while this LAC.Z is invoked in realtime-mode”,
making the previous step iii. become step iv.,
“iv. input into GloBi “LAC.Z::=<KR-UIE.Y, HI-UIE.Y, CI-UIE.Y>. 18. A computer-implemented system according to claim 16), whereby the action B) is expanded by “, whereby when and while executing this presentation, the IES or an IES user may invoke anytime a control command as of A) iii.” 19. A computer-implemented system according to claim 16), whereby
•) a LAC.Z may be sub-structured into the components “Legal Argument Chain Steps, LACS.Z.SZ.S”, 1≦Z.S≦ZS, which each may comprise “Legal Argument Chain Moves, LACM.Z.MZ.S.M”, 1≦Z.S.M≦ZSM (ZS≧0 and ZSM≧0 given by a method's implementation), •) any UIE.Z.Y, Y=1,2,3, . . . , peer to a LAC.Z is sub-structured exactly the same way into the components UIES.Z.Y.SZ.S, UIEM.Z.Y.MZ.S.M, and •) this sub-structure may be determined by the IES or an IES user and •) any operation defined in A) and B) applies to all components of any LAC.Z and its UIE.Z.Ys. 20. A computer-implemented system according to claim 16), whereby at least one AST may be
•) completely input by the IES user, or •) automatically derived by the IES from a PTR-DS part identified by a IES user, or •) automatically derived by the IES from a PTR-DS by determining all the ASTs it comprises. 21. A computer-implemented system according to claim 16), whereby the PTR-DS or at least one of its determinants may be
•) completely input by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 22. A computer-implemented system according to one of the claim 17), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be determined:
•) completely by input provided by the IES user, or •) partially input by the IES user and automatically complemented by the IES, or •) automatically suggested by the IES. 23. A computer-implemented system according to one of the claim 17), whereby the functionality of an HI-UIE.Y or IC-UIE.Y or KR-UIE.Y may be based on relations between parts of different instantiations of HI-UIE.Ys or IC-UIE.Ys or KR-UIE.Ys. 24. A computer-implemented system according to claim 16), whereby FFLN is a “Substantive Patent Law, SPL” or a “Substantive Copyright Law, SCL”. 25. A computer-implemented system according to claim 16), whereby FFLN is a conjunction of FFLNs. 26. A computer-implemented system according to claim 16), whereby its FFLN is augmented by the user preserving its finite FOL property. 27. A computer-implemented system according to claim 16), whereby the representation of the user input provided to the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 28. A computer-implemented system according to claim 16), whereby the output representation to be used by the IES may be identified by the user by either selecting such a representation from a given set of such representations or by describing it in a given notation. 29. A computer-implemented system according to claim 16), whereby the input into a HI-UIE.Y is automatically generated by the IES—what the content and the representations shall be of the LAC.Z, representing part of the transformation of a given AST on an I/O device of the IES—whereby said representation is given by the IES implementation or to the IES by a user in some given notation. 30. A computer-implemented system according to claim 16), whereby its Action A) is begun by
“the IES automatically prompts the user to enable UIE.Ys to present in B) for any AST in PTR-DS its peer automatically generated LAC.Z in realtime mode to invoke o. the IES to repeatedly automatically identify in PTR-DS another non-translated AST and execute with it i.-iii.:” | 2,100 |
5,662 | 5,662 | 13,929,475 | 2,154 | Systems and methods for just-in-time data quality assessment of best records created during data migration are disclosed. A data steward includes tools for creating and editing a best record creation strategy that defines how records from multiple systems will be integrated into target systems. At design time, the data steward can generate best record creation and validation rules based on the best record creation strategy. The data steward can apply the best record creation and validation rules to a sample of matched records from multiple data sources to generate a sample set of best records. The efficacy of the best record creation rules can be evaluated by assessing the number of fields in the sample set that fail the validation rules. During review, the validation rules can be applied to edits to the best records received from a human reviewer to ensure compliance with the best record creation strategy. | 1. A method comprising:
receiving, in a computer system, a best record strategy, wherein the best record strategy defines how to create best record data; generating, in the computer system, a plurality of best record creation rules based on the best record strategy; receiving, in the computer system, a first plurality of record data from a plurality of sources; applying, in the computer system, the plurality of best record creation rules to the first plurality of record data to generate the best record data; and generating, in the computer system, a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the level of quality of the best record data. 2. The method of claim 1 wherein the best record data comprises a plurality of data fields, and wherein generating the plurality of confidence scores comprises determining at least one data field in the plurality of data fields comprising inaccurate data. 3. The method of claim 1 further comprising:
determining, in the computer system, a comparison of the plurality of confidence scores against a threshold value, and
generating, in the computer system, an revised best record strategy based on the best record strategy and the comparison. 4. The method of claim 3 further comprising generating, in the computer system, a plurality of revised best record creation rules based on the revised best record strategy. 5. The method of claim 1 further comprising:
receiving, in the computer system, a second plurality of record data from the plurality of sources;
applying, in the computer system, the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receiving, in the computer system, user input comprising edits to at least some of the subset of the second plurality of record data. 6. The method of claim 5 further comprising applying, in the computer system, the plurality of best record creation rules to the user input to verify compliance with the best record strategy. 7. The method of claim 6 further comprising applying, in the computer system, edits to the at least some of the subset of the second plurality of record data to the best record data. 8. A non-transitory computer readable medium comprising instructions, that when executed by a computer processor cause the computer processor to be configured for:
receiving a best record strategy, wherein the best record strategy defines how to create best record data; generating a plurality of best record creation rules based on the best record strategy; receiving a first plurality of record data from a plurality of sources; applying the plurality of best record creation rules to the first plurality of record data to generate the best record data; and generating a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the estimated accuracy of the best record data. 9. The non-transitory computer readable medium of claim 8 wherein the best record data comprises a plurality of data fields, and wherein generating the plurality of confidence scores comprises determining at least one data field in the plurality of data fields comprising inaccurate data. 10. The non-transitory computer readable medium of claim 8 wherein the instructions further cause the computer processor to be configured for:
determining a comparison of the plurality of confidence scores against a threshold value, and
generating an revised best record strategy based on the best record strategy and the comparison. 11. The non-transitory computer readable medium of claim 10 wherein the instructions further cause the computer processor to be configured for generating a plurality of revised best record creation rules based on the revised best record strategy. 12. The non-transitory computer readable medium of claim 8 wherein the instructions further cause the computer processor to be configured for:
receiving a second plurality of record data from the plurality of sources;
applying the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receiving user input comprising edits to at least some of the subset of the second plurality of record data. 13. The non-transitory computer readable medium of claim 12 wherein the instructions further cause the computer processor to be configured for applying the plurality of best record creation rules to the user input to verify compliance with the best record strategy. 14. The non-transitory computer readable medium of claim 13 wherein the instructions further cause the computer processor to be configured for applying edits to the at least some of the subset of the second plurality of record data to the best record data. 15. A system comprising:
a computer processor; a non-transitory computer readable medium coupled to the processor and comprising instructions, that when executed by the computer processor cause the computer processor to be configured to:
receive a best record strategy, wherein the best record strategy defines how to create best record data;
generate a plurality of best record creation rules based on the best record strategy;
receive a first plurality of record data from a plurality of sources;
apply the plurality of best record creation rules to the first plurality of record data to generate the best record data; and
generate a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the estimated accuracy of the best record data. 16. The system of claim 15 wherein the best record data comprises a plurality of data fields, and wherein the instructions that cause the computer processor to be configured for to generate the plurality of confidence scores further cause the processor to be configured to determine at least one data field in the plurality of data fields comprising inaccurate data. 17. The system of claim 15 wherein the instructions further cause the computer processor to be configured to:
determine a comparison of the plurality of confidence scores against a threshold value, and
generate an revised best record strategy based on the best record strategy and the comparison. 18. The system of claim 17 wherein the instructions further cause the computer processor to be configured to generate a plurality of revised best record creation rules based on the revised best record strategy. 19. The system of claim 15 wherein the instructions further cause the computer processor to be configured to:
receive a second plurality of record data from the plurality of sources;
apply the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receive user input comprising edits to at least some of the subset of the second plurality of record data. 20. The system of claim 19 wherein the instructions further cause the computer processor to be configured to:
apply the plurality of best record creation rules to the user input to verify compliance with the best record strategy; and
apply edits to the at least some of the subset of the second plurality of record data to the best record data. | Systems and methods for just-in-time data quality assessment of best records created during data migration are disclosed. A data steward includes tools for creating and editing a best record creation strategy that defines how records from multiple systems will be integrated into target systems. At design time, the data steward can generate best record creation and validation rules based on the best record creation strategy. The data steward can apply the best record creation and validation rules to a sample of matched records from multiple data sources to generate a sample set of best records. The efficacy of the best record creation rules can be evaluated by assessing the number of fields in the sample set that fail the validation rules. During review, the validation rules can be applied to edits to the best records received from a human reviewer to ensure compliance with the best record creation strategy.1. A method comprising:
receiving, in a computer system, a best record strategy, wherein the best record strategy defines how to create best record data; generating, in the computer system, a plurality of best record creation rules based on the best record strategy; receiving, in the computer system, a first plurality of record data from a plurality of sources; applying, in the computer system, the plurality of best record creation rules to the first plurality of record data to generate the best record data; and generating, in the computer system, a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the level of quality of the best record data. 2. The method of claim 1 wherein the best record data comprises a plurality of data fields, and wherein generating the plurality of confidence scores comprises determining at least one data field in the plurality of data fields comprising inaccurate data. 3. The method of claim 1 further comprising:
determining, in the computer system, a comparison of the plurality of confidence scores against a threshold value, and
generating, in the computer system, an revised best record strategy based on the best record strategy and the comparison. 4. The method of claim 3 further comprising generating, in the computer system, a plurality of revised best record creation rules based on the revised best record strategy. 5. The method of claim 1 further comprising:
receiving, in the computer system, a second plurality of record data from the plurality of sources;
applying, in the computer system, the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receiving, in the computer system, user input comprising edits to at least some of the subset of the second plurality of record data. 6. The method of claim 5 further comprising applying, in the computer system, the plurality of best record creation rules to the user input to verify compliance with the best record strategy. 7. The method of claim 6 further comprising applying, in the computer system, edits to the at least some of the subset of the second plurality of record data to the best record data. 8. A non-transitory computer readable medium comprising instructions, that when executed by a computer processor cause the computer processor to be configured for:
receiving a best record strategy, wherein the best record strategy defines how to create best record data; generating a plurality of best record creation rules based on the best record strategy; receiving a first plurality of record data from a plurality of sources; applying the plurality of best record creation rules to the first plurality of record data to generate the best record data; and generating a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the estimated accuracy of the best record data. 9. The non-transitory computer readable medium of claim 8 wherein the best record data comprises a plurality of data fields, and wherein generating the plurality of confidence scores comprises determining at least one data field in the plurality of data fields comprising inaccurate data. 10. The non-transitory computer readable medium of claim 8 wherein the instructions further cause the computer processor to be configured for:
determining a comparison of the plurality of confidence scores against a threshold value, and
generating an revised best record strategy based on the best record strategy and the comparison. 11. The non-transitory computer readable medium of claim 10 wherein the instructions further cause the computer processor to be configured for generating a plurality of revised best record creation rules based on the revised best record strategy. 12. The non-transitory computer readable medium of claim 8 wherein the instructions further cause the computer processor to be configured for:
receiving a second plurality of record data from the plurality of sources;
applying the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receiving user input comprising edits to at least some of the subset of the second plurality of record data. 13. The non-transitory computer readable medium of claim 12 wherein the instructions further cause the computer processor to be configured for applying the plurality of best record creation rules to the user input to verify compliance with the best record strategy. 14. The non-transitory computer readable medium of claim 13 wherein the instructions further cause the computer processor to be configured for applying edits to the at least some of the subset of the second plurality of record data to the best record data. 15. A system comprising:
a computer processor; a non-transitory computer readable medium coupled to the processor and comprising instructions, that when executed by the computer processor cause the computer processor to be configured to:
receive a best record strategy, wherein the best record strategy defines how to create best record data;
generate a plurality of best record creation rules based on the best record strategy;
receive a first plurality of record data from a plurality of sources;
apply the plurality of best record creation rules to the first plurality of record data to generate the best record data; and
generate a plurality of confidence scores corresponding to the best record data, wherein the confidence scores describe the estimated accuracy of the best record data. 16. The system of claim 15 wherein the best record data comprises a plurality of data fields, and wherein the instructions that cause the computer processor to be configured for to generate the plurality of confidence scores further cause the processor to be configured to determine at least one data field in the plurality of data fields comprising inaccurate data. 17. The system of claim 15 wherein the instructions further cause the computer processor to be configured to:
determine a comparison of the plurality of confidence scores against a threshold value, and
generate an revised best record strategy based on the best record strategy and the comparison. 18. The system of claim 17 wherein the instructions further cause the computer processor to be configured to generate a plurality of revised best record creation rules based on the revised best record strategy. 19. The system of claim 15 wherein the instructions further cause the computer processor to be configured to:
receive a second plurality of record data from the plurality of sources;
apply the plurality of best record creation rules to the second plurality of record data to generate a subset of the second plurality of record data; and
receive user input comprising edits to at least some of the subset of the second plurality of record data. 20. The system of claim 19 wherein the instructions further cause the computer processor to be configured to:
apply the plurality of best record creation rules to the user input to verify compliance with the best record strategy; and
apply edits to the at least some of the subset of the second plurality of record data to the best record data. | 2,100 |
5,663 | 5,663 | 14,172,806 | 2,183 | Memory systems and memory control methods are described. According to one aspect, a memory system includes a plurality of memory cells individually configured to store data, program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and a plurality of second executable instructions which are ordered according to a second instruction sequence, substitution circuitry configured to replace one of the first executable instructions with a substitute executable instruction, and a control unit configured to execute the first and second executable instructions to control reading and writing of the data with respect to the memory, wherein the control unit is configured to execute the first executable instructions according to the first instruction sequence, to execute the substitute executable instruction after the execution of the first executable instructions, and to execute the second executable instructions according to the second instruction sequence as a result of execution of the substitute executable instruction. | 1. A memory system comprising:
a plurality of memory cells individually configured to store data; program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and a plurality of second executable instructions which are ordered according to a second instruction sequence; substitution circuitry configured to replace one of the first executable instructions with a substitute executable instruction; and a control unit configured to execute the first executable instructions to implement at least one operation with respect to the storage of the data using the memory cells, wherein the control unit is configured to execute the first executable instructions according to the first instruction sequence, to execute the substitute executable instruction after the execution of the first executable instructions, and to execute the second executable instructions according to the second instruction sequence as a result of the execution of the substitute executable instruction. 2. The system of claim 1 further comprising a program counter configured to generate a plurality of program counter values to fetch the first and second executable instructions 3. The system of claim 2 wherein the substitution circuitry is configured to replace the one first executable instruction with the substitute executable instruction as a result of the program counter generating a predefined one of the program counter values. 4. The system of claim 2 wherein the substitution circuitry is configured to control the program counter to replace one of the program counter values with a substitute program counter value as a result of the program counter generating a predefined one of the program counter values. 5. The system of claim 2 wherein the program counter values comprise a plurality of first program counter values to fetch the first executable instructions according to the first instruction sequence and wherein the substitution circuitry is configured to control the program counter to replace one of the first program counter values with one of a plurality of second program counter values to initiate fetching of the second executable instructions. 6. The system of claim 1 wherein the substitute executable instruction is a branch instruction configured to control the control unit to begin execution of the second executable instructions. 7. The system of claim 1 further comprising an input configured to receive the second executable instructions from externally of the memory system and to transfer the second executable instructions to the program memory. 8. The system of claim 1 wherein some of the memory cells store the second executable instructions and the program memory receives the second executable instructions from the some memory cells. 9. The system of claim 1 wherein the control unit comprises an instruction register, and wherein the substitution circuitry is configured to control provision of the substitute executable instruction to the instruction register to replace the one first executable instruction. 10. The system of claim 1 wherein the first executable instructions are stored in non-volatile memory and the second executable instructions are stored in volatile memory. 11. The system of claim 10 wherein the first and second executable instructions are stored within a continuous instruction set address space of the non-volatile memory and the volatile memory. 12. The system of claim 1 wherein the control unit is configured to test the execution of the first executable instructions during the execution of the second executable instructions. 13. A memory system comprising:
a plurality of memory cells individually configured to store data; a control unit configured to control reading and writing of the data with respect to the memory cells; program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and to store a plurality of second executable instructions which are ordered according to a second instruction sequence; a program counter configured to generate a plurality of first program counter values to fetch the first executable instructions according to the first instruction sequence and to generate a plurality of second program counter values to fetch the second executable instructions according to the second instruction sequence; substitution circuitry configured to replace one of the first program counter values with one of the second program counter values to initiate the fetching of the second executable instructions; and wherein the control unit is configured to execute the first executable instructions to implement at least one operation with respect to the storage of the data using the memory cells. 14. The system of claim 13 wherein the substitution circuitry is configured to replace one of the first executable instructions with a branch instruction configured to control the control unit to initiate execution of the second executable instructions. 15. The system of claim 13 wherein the substitution circuitry is configured to replace the one first program counter value with the one second program counter value as a result of the program counter generating a predefined first program counter value. 16. The system of claim 13 wherein the first executable instructions are stored in non-volatile memory and the second executable instructions are stored in volatile memory. 17. The system of claim 16 wherein the first and second executable instructions are stored within a continuous instruction set address space of the non-volatile memory and the volatile memory. 18. A memory system comprising:
a plurality of memory cells individually configured to store data; a first storage space configured to store a plurality of first executable instructions of a first instruction sequence; a second storage space configured to store a plurality of second executable instructions of a second instruction sequence; a control unit configured to execute the first executable instructions to implement at least one operation with respect to storage of the data using the memory cells; and logic circuitry configured to detect a predefined event during the execution of the first executable instructions by the control unit and to control the control unit to execute the second executable instructions as a result of the detection. 19. The system of claim 18 wherein the first storage space is non-volatile memory and the second storage space is volatile memory. 20. The system of claim 18 wherein the first and second executable instructions are stored within a continuous instruction set address space of the first and second storage spaces. 21. The system of claim 18 wherein the control unit comprises a program counter configured to generate a plurality of program counter values to fetch the first executable instructions, and wherein the logic circuitry is configured to detect the predefined event comprising generation of a predefined one of the program counter values. 22. The system of claim 21 wherein the logic circuitry is configured to provide a substitute program counter value to the program counter to initiate fetching of the second executable instructions as a result of the detection. 23. The system of claim 18 wherein the logic circuitry is configured to provide a branch instruction to the control unit to control the control unit to initiate the execution of the second executable instructions as a result of the detection. 24. A memory control method comprising:
first executing a plurality of first executable instructions according to a first instruction sequence to implement at least one operation with respect to storage of data using a plurality of memory cells of a memory system; during the executing of the first executable instructions, replacing one of the first executable instructions with a substitute executable instruction comprising a branch instruction configured to initiate execution of a plurality of second executable instructions; second executing the substitute executable instruction after the replacing; and third executing the second executable instructions according to a second instruction sequence as a result of the second executing. 25. The method of claim 24 further comprising generating a plurality of program counter values, and fetching the first and second executable instructions using the program counter values. 26. The method of claim 25 further comprising detecting the generation of a predefined one of the program counter values, and wherein the replacing comprises replacing as a result of the detecting. 27. The method of claim 26 further comprising replacing one of the program counter values with a substitute program counter value as a result of the detecting, the substitute program counter value initiating the fetching of the second executable instructions. 28. The method of claim 25 further comprising replacing one of the program counter values with a substitute program counter value, and further comprising initiating the fetching of the second executable instructions using the substitute program counter value. 29. The method of claim 24 further comprising receiving the second executable instructions from externally of the memory system, storing the second executable instructions within program memory of the memory system, and fetching the second executable instructions from the program memory. 30. The method of claim 24 further comprising transferring the second executable instructions from some of the memory cells to program memory of the memory system, and fetching the second executable instructions from the program memory. 31. The method of claim 24 further comprising storing the first executable instructions in non-volatile memory and storing the second executable instructions in volatile memory. 32. The method of claim 24 further comprising storing the first and second executable instructions within a continuous instruction set address space. 33. A memory control method comprising:
generating a plurality of program counter values; comparing the program counter values with a predefined program counter value; as a result of one of the program counter values not matching the predefined program counter value during the comparing, fetching one of a plurality of first executable instructions of a first instruction sequence using the one program counter value; executing the one first executable instruction to implement an operation with respect to storage of data using a plurality of memory cells of a memory system; as a result of another of the program counter values matching the predefined program counter value, replacing the another program counter value with a substitute program counter value; using the substitute program counter value, fetching one of a plurality of second executable instructions of a second instruction sequence; and executing the one second executable instruction. 34. The method of claim 33 further comprising replacing another of the first executable instructions with a substitute executable instruction as a result of the another program counter value matching the predefined program counter value. 35. The method of claim 34 wherein the substitute executable instruction comprises a branch instruction to begin execution of the second executable instructions. 36. The method of claim 33 wherein the one second executable instruction is the first instruction to be executed within the second instruction sequence following execution of the branch instruction. 37. The method of claim 33 further comprising storing the first executable instructions in non-volatile memory and storing the second executable instructions in volatile memory. 38. The method of claim 33 further comprising storing the first and second executable instructions within a continuous instruction set address space. | Memory systems and memory control methods are described. According to one aspect, a memory system includes a plurality of memory cells individually configured to store data, program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and a plurality of second executable instructions which are ordered according to a second instruction sequence, substitution circuitry configured to replace one of the first executable instructions with a substitute executable instruction, and a control unit configured to execute the first and second executable instructions to control reading and writing of the data with respect to the memory, wherein the control unit is configured to execute the first executable instructions according to the first instruction sequence, to execute the substitute executable instruction after the execution of the first executable instructions, and to execute the second executable instructions according to the second instruction sequence as a result of execution of the substitute executable instruction.1. A memory system comprising:
a plurality of memory cells individually configured to store data; program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and a plurality of second executable instructions which are ordered according to a second instruction sequence; substitution circuitry configured to replace one of the first executable instructions with a substitute executable instruction; and a control unit configured to execute the first executable instructions to implement at least one operation with respect to the storage of the data using the memory cells, wherein the control unit is configured to execute the first executable instructions according to the first instruction sequence, to execute the substitute executable instruction after the execution of the first executable instructions, and to execute the second executable instructions according to the second instruction sequence as a result of the execution of the substitute executable instruction. 2. The system of claim 1 further comprising a program counter configured to generate a plurality of program counter values to fetch the first and second executable instructions 3. The system of claim 2 wherein the substitution circuitry is configured to replace the one first executable instruction with the substitute executable instruction as a result of the program counter generating a predefined one of the program counter values. 4. The system of claim 2 wherein the substitution circuitry is configured to control the program counter to replace one of the program counter values with a substitute program counter value as a result of the program counter generating a predefined one of the program counter values. 5. The system of claim 2 wherein the program counter values comprise a plurality of first program counter values to fetch the first executable instructions according to the first instruction sequence and wherein the substitution circuitry is configured to control the program counter to replace one of the first program counter values with one of a plurality of second program counter values to initiate fetching of the second executable instructions. 6. The system of claim 1 wherein the substitute executable instruction is a branch instruction configured to control the control unit to begin execution of the second executable instructions. 7. The system of claim 1 further comprising an input configured to receive the second executable instructions from externally of the memory system and to transfer the second executable instructions to the program memory. 8. The system of claim 1 wherein some of the memory cells store the second executable instructions and the program memory receives the second executable instructions from the some memory cells. 9. The system of claim 1 wherein the control unit comprises an instruction register, and wherein the substitution circuitry is configured to control provision of the substitute executable instruction to the instruction register to replace the one first executable instruction. 10. The system of claim 1 wherein the first executable instructions are stored in non-volatile memory and the second executable instructions are stored in volatile memory. 11. The system of claim 10 wherein the first and second executable instructions are stored within a continuous instruction set address space of the non-volatile memory and the volatile memory. 12. The system of claim 1 wherein the control unit is configured to test the execution of the first executable instructions during the execution of the second executable instructions. 13. A memory system comprising:
a plurality of memory cells individually configured to store data; a control unit configured to control reading and writing of the data with respect to the memory cells; program memory configured to store a plurality of first executable instructions which are ordered according to a first instruction sequence and to store a plurality of second executable instructions which are ordered according to a second instruction sequence; a program counter configured to generate a plurality of first program counter values to fetch the first executable instructions according to the first instruction sequence and to generate a plurality of second program counter values to fetch the second executable instructions according to the second instruction sequence; substitution circuitry configured to replace one of the first program counter values with one of the second program counter values to initiate the fetching of the second executable instructions; and wherein the control unit is configured to execute the first executable instructions to implement at least one operation with respect to the storage of the data using the memory cells. 14. The system of claim 13 wherein the substitution circuitry is configured to replace one of the first executable instructions with a branch instruction configured to control the control unit to initiate execution of the second executable instructions. 15. The system of claim 13 wherein the substitution circuitry is configured to replace the one first program counter value with the one second program counter value as a result of the program counter generating a predefined first program counter value. 16. The system of claim 13 wherein the first executable instructions are stored in non-volatile memory and the second executable instructions are stored in volatile memory. 17. The system of claim 16 wherein the first and second executable instructions are stored within a continuous instruction set address space of the non-volatile memory and the volatile memory. 18. A memory system comprising:
a plurality of memory cells individually configured to store data; a first storage space configured to store a plurality of first executable instructions of a first instruction sequence; a second storage space configured to store a plurality of second executable instructions of a second instruction sequence; a control unit configured to execute the first executable instructions to implement at least one operation with respect to storage of the data using the memory cells; and logic circuitry configured to detect a predefined event during the execution of the first executable instructions by the control unit and to control the control unit to execute the second executable instructions as a result of the detection. 19. The system of claim 18 wherein the first storage space is non-volatile memory and the second storage space is volatile memory. 20. The system of claim 18 wherein the first and second executable instructions are stored within a continuous instruction set address space of the first and second storage spaces. 21. The system of claim 18 wherein the control unit comprises a program counter configured to generate a plurality of program counter values to fetch the first executable instructions, and wherein the logic circuitry is configured to detect the predefined event comprising generation of a predefined one of the program counter values. 22. The system of claim 21 wherein the logic circuitry is configured to provide a substitute program counter value to the program counter to initiate fetching of the second executable instructions as a result of the detection. 23. The system of claim 18 wherein the logic circuitry is configured to provide a branch instruction to the control unit to control the control unit to initiate the execution of the second executable instructions as a result of the detection. 24. A memory control method comprising:
first executing a plurality of first executable instructions according to a first instruction sequence to implement at least one operation with respect to storage of data using a plurality of memory cells of a memory system; during the executing of the first executable instructions, replacing one of the first executable instructions with a substitute executable instruction comprising a branch instruction configured to initiate execution of a plurality of second executable instructions; second executing the substitute executable instruction after the replacing; and third executing the second executable instructions according to a second instruction sequence as a result of the second executing. 25. The method of claim 24 further comprising generating a plurality of program counter values, and fetching the first and second executable instructions using the program counter values. 26. The method of claim 25 further comprising detecting the generation of a predefined one of the program counter values, and wherein the replacing comprises replacing as a result of the detecting. 27. The method of claim 26 further comprising replacing one of the program counter values with a substitute program counter value as a result of the detecting, the substitute program counter value initiating the fetching of the second executable instructions. 28. The method of claim 25 further comprising replacing one of the program counter values with a substitute program counter value, and further comprising initiating the fetching of the second executable instructions using the substitute program counter value. 29. The method of claim 24 further comprising receiving the second executable instructions from externally of the memory system, storing the second executable instructions within program memory of the memory system, and fetching the second executable instructions from the program memory. 30. The method of claim 24 further comprising transferring the second executable instructions from some of the memory cells to program memory of the memory system, and fetching the second executable instructions from the program memory. 31. The method of claim 24 further comprising storing the first executable instructions in non-volatile memory and storing the second executable instructions in volatile memory. 32. The method of claim 24 further comprising storing the first and second executable instructions within a continuous instruction set address space. 33. A memory control method comprising:
generating a plurality of program counter values; comparing the program counter values with a predefined program counter value; as a result of one of the program counter values not matching the predefined program counter value during the comparing, fetching one of a plurality of first executable instructions of a first instruction sequence using the one program counter value; executing the one first executable instruction to implement an operation with respect to storage of data using a plurality of memory cells of a memory system; as a result of another of the program counter values matching the predefined program counter value, replacing the another program counter value with a substitute program counter value; using the substitute program counter value, fetching one of a plurality of second executable instructions of a second instruction sequence; and executing the one second executable instruction. 34. The method of claim 33 further comprising replacing another of the first executable instructions with a substitute executable instruction as a result of the another program counter value matching the predefined program counter value. 35. The method of claim 34 wherein the substitute executable instruction comprises a branch instruction to begin execution of the second executable instructions. 36. The method of claim 33 wherein the one second executable instruction is the first instruction to be executed within the second instruction sequence following execution of the branch instruction. 37. The method of claim 33 further comprising storing the first executable instructions in non-volatile memory and storing the second executable instructions in volatile memory. 38. The method of claim 33 further comprising storing the first and second executable instructions within a continuous instruction set address space. | 2,100 |
5,664 | 5,664 | 14,541,633 | 2,194 | A lean product modeling system (LPM system). The LPM system includes a plurality of modeling objects representing multiple perspectives of the product, a plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and a plurality of corresponding modeling object property data items that define those characteristics and are reflected in product simulations and analyses. All product modeling objects may be linked in an integrated product knowledge model that reflects ontological characteristics of the product or the application as a service and a corresponding operational environment. The integrated product knowledge model defines an authoritative source for any specific corresponding modeling object within the plurality of corresponding modeling objects. The LPM system further includes a device for use in manufacturing the product or implementing the application as the service based on a product design created by the LPM system. | 1. A system for manufacturing a product or providing an application as a service, comprising:
a lean product or service modeling analysis and simulation system, comprising:
at least one non-transitory computer readable storage medium storing a plurality of modeling objects representing multiple perspectives of the product, a plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and a plurality of corresponding modeling object property data items that define those characteristics and are reflected in product simulations and analyses, wherein the modeling objects, the corresponding modeling object properties, and at least some of the plurality of corresponding modeling property data items are tailored for each lifecycle phase of the product, wherein at least some product modeling objects are linked in an integrated product knowledge model that reflects ontological characteristics of the product or the application as a service and a corresponding operational environment, and wherein the product knowledge model defines an authoritative source for any specific corresponding modeling object within the plurality of corresponding modeling objects;
at least one processor configured to execute a plurality of disparate tools for manipulating the plurality of modeling objects, each of the plurality of disparate tools comprising at least one corresponding element stored in the non-transitory computer readable storage medium, wherein at least some corresponding elements of the plurality of disparate tools are linked to at least one corresponding concept in the integrated product knowledge model, and wherein at least some given corresponding elements of a given tool are linked to a related element in a different tool through the integrated product knowledge model; and
at least one device for use in manufacturing the product or implementing the application as the service based on a product design created by the lean product or service modeling analysis and simulation system. 2. The system of claim 1, wherein at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model. 3. The system of claim 2, wherein the given tool and the different tool are incompatible with each other. 4. The system of claim 1, wherein the at least one processor is configured to perform cross tool engineering data analysis through the integrated product knowledge model. 5. The system of claim 1, wherein the plurality of modeling objects are discoverable by at least one product knowledge model query that traverses a hyperlink to a modeling object stored on a different non-transitory computer readable storage medium. 6. The system of claim 1, wherein the plurality of modeling objects are configured to be traced and analyzed throughout a lifecycle of a program through connections provided and maintained within the integrated product knowledge model. 7. The system of claim 6, wherein the lifecycle phase is selected from the group consisting of exploratory, conceptual, prototyping, developmental, manufacturing, operation, support, derivative product creation, and product disposition. 8. The system of claim 1, wherein a change to a given modeling object in the plurality of modeling objects will set a flag to validate every other related modeling object in the plurality of modeling objects linked to the given modeling object via the integrated product knowledge model. 9. The system of claim 1, wherein the integrated product knowledge model further includes data describing conditions of use for the product, the data including preconditions and constraints. 10. A method for manufacturing a product or implementing an application as a service, using a lean product modeling analysis and simulation system, the method comprising:
providing input to at least one non-transitory computer readable storage medium via manipulating at least one physical input device, the input comprising:
a plurality of modeling objects having a plurality of corresponding modeling object properties and a plurality of corresponding object property data items, the plurality of modeling objects representing multiple perspectives of the product or the application as the service, the plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and wherein the plurality of modeling objects, at least some of the plurality of corresponding modeling object properties, and the plurality of corresponding object property data items are tailored for each lifecycle phase of the product or the application as the service; and
an integrated product knowledge model that ontologically defines the product or the application as the service, wherein at least some of the plurality of modeling objects are linked to the integrated product knowledge model, and wherein the integrated product knowledge model identifies a corresponding authoritative source for corresponding modeling objects of the plurality of modeling objects; and
manufacturing the product or implementing the application as the service using at least one device based on a product design produced by the lean product modeling analysis and simulation system. 11. The method of claim 10, wherein a plurality of disparate tools for manipulating the plurality of modeling objects are stored in the at least one non-transitory computer readable storage medium, each of the plurality of disparate tools comprising at least one corresponding element, and wherein the method comprises:
linking, using at least one processor in communication with the non-transitory computer readable storage medium, corresponding elements of the plurality of disparate tools to at least one corresponding concept in the integrated product knowledge model. 12. The method of claim 11 further comprising:
linking, using at least one processor, a given corresponding element of a given tool to a related element in a different tool through the integrated product knowledge model. 13. The method of claim 12 further comprising:
creating, and storing on at least one non-transitory computer readable storage medium, a product design using the plurality of disparate tools, wherein using the plurality of disparate tools comprises at least one user manipulating at least one physical user input device. 14. The method of claim 12, wherein at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model. 15. The method of claim 12 further comprising:
performing, by the at least one processor, cross tool engineering data analysis through the integrated product knowledge model. 16. The method of claim 10 further comprising:
discovering the plurality of modeling objects by using at least one product knowledge model query that may traverse a hyperlink to a modeling object stored on a different non-transitory computer readable storage medium. 17. The method of claim 10 further comprising:
in response to changes on a given modeling object in the plurality of modeling objects, validating every related modeling object in the plurality of modeling objects that are linked to the given modeling object, wherein validating is performed via the integrated product knowledge model. 18. A system comprising:
a lean product modeling analysis and simulation system, comprising:
at least one non-transitory computer readable storage medium storing a plurality of modeling objects having a plurality of corresponding modeling object properties and a plurality of corresponding object property data items, the plurality of modeling objects representing multiple perspectives of a product or an application as a service, the plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, the plurality of corresponding object property data items that define those characteristics and are reflected in product simulations and analyses, these objects, properties, and data items being tailored for each lifecycle phase of the product, wherein at least some modeling objects are linked to an integrated product knowledge model that ontologically defines the product or the application as the service and identifies a corresponding authoritative source for corresponding modeling objects of the plurality of modeling objects;
at least one processor configured to execute a plurality of disparate tools for manipulating the plurality of modeling objects, at least some of the plurality of disparate tools comprising at least one corresponding element stored in the at least one non-transitory computer readable storage medium, wherein at least some corresponding elements of the plurality of disparate tools are linked to at least one corresponding concept in the integrated product knowledge model, and wherein at least one given corresponding element of a given tool is linked to a related element in a different tool through the integrated product knowledge model; and
at least one input system configured to receive input to create a design of the product or the application as the service using the lean product modeling analysis and simulation system; at least one communication system configured to communicate at least one command to at least one device to participate in manufacturing the product, or implementing the application as the service, using the design. 19. The system of claim 18, wherein:
at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model; and the given tool and the different tool are included in the at least some of the plurality of disparate tools that are incompatible with each other. 20. The system of claim 18, wherein the lean product modeling analysis and simulation system is further configured to perform cross tool engineering data analysis through the integrated product knowledge model. | A lean product modeling system (LPM system). The LPM system includes a plurality of modeling objects representing multiple perspectives of the product, a plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and a plurality of corresponding modeling object property data items that define those characteristics and are reflected in product simulations and analyses. All product modeling objects may be linked in an integrated product knowledge model that reflects ontological characteristics of the product or the application as a service and a corresponding operational environment. The integrated product knowledge model defines an authoritative source for any specific corresponding modeling object within the plurality of corresponding modeling objects. The LPM system further includes a device for use in manufacturing the product or implementing the application as the service based on a product design created by the LPM system.1. A system for manufacturing a product or providing an application as a service, comprising:
a lean product or service modeling analysis and simulation system, comprising:
at least one non-transitory computer readable storage medium storing a plurality of modeling objects representing multiple perspectives of the product, a plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and a plurality of corresponding modeling object property data items that define those characteristics and are reflected in product simulations and analyses, wherein the modeling objects, the corresponding modeling object properties, and at least some of the plurality of corresponding modeling property data items are tailored for each lifecycle phase of the product, wherein at least some product modeling objects are linked in an integrated product knowledge model that reflects ontological characteristics of the product or the application as a service and a corresponding operational environment, and wherein the product knowledge model defines an authoritative source for any specific corresponding modeling object within the plurality of corresponding modeling objects;
at least one processor configured to execute a plurality of disparate tools for manipulating the plurality of modeling objects, each of the plurality of disparate tools comprising at least one corresponding element stored in the non-transitory computer readable storage medium, wherein at least some corresponding elements of the plurality of disparate tools are linked to at least one corresponding concept in the integrated product knowledge model, and wherein at least some given corresponding elements of a given tool are linked to a related element in a different tool through the integrated product knowledge model; and
at least one device for use in manufacturing the product or implementing the application as the service based on a product design created by the lean product or service modeling analysis and simulation system. 2. The system of claim 1, wherein at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model. 3. The system of claim 2, wherein the given tool and the different tool are incompatible with each other. 4. The system of claim 1, wherein the at least one processor is configured to perform cross tool engineering data analysis through the integrated product knowledge model. 5. The system of claim 1, wherein the plurality of modeling objects are discoverable by at least one product knowledge model query that traverses a hyperlink to a modeling object stored on a different non-transitory computer readable storage medium. 6. The system of claim 1, wherein the plurality of modeling objects are configured to be traced and analyzed throughout a lifecycle of a program through connections provided and maintained within the integrated product knowledge model. 7. The system of claim 6, wherein the lifecycle phase is selected from the group consisting of exploratory, conceptual, prototyping, developmental, manufacturing, operation, support, derivative product creation, and product disposition. 8. The system of claim 1, wherein a change to a given modeling object in the plurality of modeling objects will set a flag to validate every other related modeling object in the plurality of modeling objects linked to the given modeling object via the integrated product knowledge model. 9. The system of claim 1, wherein the integrated product knowledge model further includes data describing conditions of use for the product, the data including preconditions and constraints. 10. A method for manufacturing a product or implementing an application as a service, using a lean product modeling analysis and simulation system, the method comprising:
providing input to at least one non-transitory computer readable storage medium via manipulating at least one physical input device, the input comprising:
a plurality of modeling objects having a plurality of corresponding modeling object properties and a plurality of corresponding object property data items, the plurality of modeling objects representing multiple perspectives of the product or the application as the service, the plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, and wherein the plurality of modeling objects, at least some of the plurality of corresponding modeling object properties, and the plurality of corresponding object property data items are tailored for each lifecycle phase of the product or the application as the service; and
an integrated product knowledge model that ontologically defines the product or the application as the service, wherein at least some of the plurality of modeling objects are linked to the integrated product knowledge model, and wherein the integrated product knowledge model identifies a corresponding authoritative source for corresponding modeling objects of the plurality of modeling objects; and
manufacturing the product or implementing the application as the service using at least one device based on a product design produced by the lean product modeling analysis and simulation system. 11. The method of claim 10, wherein a plurality of disparate tools for manipulating the plurality of modeling objects are stored in the at least one non-transitory computer readable storage medium, each of the plurality of disparate tools comprising at least one corresponding element, and wherein the method comprises:
linking, using at least one processor in communication with the non-transitory computer readable storage medium, corresponding elements of the plurality of disparate tools to at least one corresponding concept in the integrated product knowledge model. 12. The method of claim 11 further comprising:
linking, using at least one processor, a given corresponding element of a given tool to a related element in a different tool through the integrated product knowledge model. 13. The method of claim 12 further comprising:
creating, and storing on at least one non-transitory computer readable storage medium, a product design using the plurality of disparate tools, wherein using the plurality of disparate tools comprises at least one user manipulating at least one physical user input device. 14. The method of claim 12, wherein at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model. 15. The method of claim 12 further comprising:
performing, by the at least one processor, cross tool engineering data analysis through the integrated product knowledge model. 16. The method of claim 10 further comprising:
discovering the plurality of modeling objects by using at least one product knowledge model query that may traverse a hyperlink to a modeling object stored on a different non-transitory computer readable storage medium. 17. The method of claim 10 further comprising:
in response to changes on a given modeling object in the plurality of modeling objects, validating every related modeling object in the plurality of modeling objects that are linked to the given modeling object, wherein validating is performed via the integrated product knowledge model. 18. A system comprising:
a lean product modeling analysis and simulation system, comprising:
at least one non-transitory computer readable storage medium storing a plurality of modeling objects having a plurality of corresponding modeling object properties and a plurality of corresponding object property data items, the plurality of modeling objects representing multiple perspectives of a product or an application as a service, the plurality of corresponding modeling object properties identifying characteristics of those product modeling objects which are used to configure product simulations, the plurality of corresponding object property data items that define those characteristics and are reflected in product simulations and analyses, these objects, properties, and data items being tailored for each lifecycle phase of the product, wherein at least some modeling objects are linked to an integrated product knowledge model that ontologically defines the product or the application as the service and identifies a corresponding authoritative source for corresponding modeling objects of the plurality of modeling objects;
at least one processor configured to execute a plurality of disparate tools for manipulating the plurality of modeling objects, at least some of the plurality of disparate tools comprising at least one corresponding element stored in the at least one non-transitory computer readable storage medium, wherein at least some corresponding elements of the plurality of disparate tools are linked to at least one corresponding concept in the integrated product knowledge model, and wherein at least one given corresponding element of a given tool is linked to a related element in a different tool through the integrated product knowledge model; and
at least one input system configured to receive input to create a design of the product or the application as the service using the lean product modeling analysis and simulation system; at least one communication system configured to communicate at least one command to at least one device to participate in manufacturing the product, or implementing the application as the service, using the design. 19. The system of claim 18, wherein:
at least some of the plurality of disparate tools are incompatible with each other without use of the integrated product knowledge model; and the given tool and the different tool are included in the at least some of the plurality of disparate tools that are incompatible with each other. 20. The system of claim 18, wherein the lean product modeling analysis and simulation system is further configured to perform cross tool engineering data analysis through the integrated product knowledge model. | 2,100 |
5,665 | 5,665 | 15,011,480 | 2,196 | A method includes receiving a trace of a job in a distributed computing system and a topology of the system and determining performance indicators of each virtual node's (1) busyness from executing its share of local resource and network dependent tasks in the job, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks. The method includes aggregating performance indicators of each host's virtual nodes and determining if one of the hosts is least efficient in executing its share of the local resource and the network dependent tasks. If so, the method includes determining if the one host is less busy from executing it share of the local resource and the network dependent tasks than other hosts. If not, the method includes reporting the one host's busiest virtual node as a candidate of processor error. | 1: A method to identify a possible anomaly in a virtual distributed computing system comprising virtual nodes that are virtual machines on hosts, the method comprising:
receiving a trace of a job executed on the virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on the virtual nodes, the topology comprising virtual node-to-host mappings; for each virtual node, determining performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; for each host, aggregating performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; determining if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks; when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, reporting a busiest virtual node on the host as a candidate of processor error. 2: The method of claim 1, further comprises:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, reporting the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. 3: The method of claim 2, further comprises:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, reporting the one host as a candidate of disk configuration error. 4: The method of claim 3, further comprises, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determining if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determining if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, reporting the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. 5: The method of claim 4, further comprises:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, reporting the host as a candidate of network configuration error. 6: The method of claim 5, further comprises:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, reporting the host as a candidate of network configuration error. 7: The method of claim 1, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; and each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node. claim 8: The method of claim 7, wherein: each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; and each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes. 9: The method of claim 8, wherein determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determining a first host with the most of the slowest map tasks; determining a second host with the most of the slowest reduce tasks; and determining if the first host is the second host. 10: The method of claim 2, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks. claim 11: The method of claim 10, wherein each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations. 12: The method of claim 11, wherein:
determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. 13: A virtual distributed computing system, comprising:
virtual nodes implemented on hosts; a configuration analyzer implemented on one of the hosts or a separate host, the configuration analyzer being configured to:
receive a trace of a job executed on the virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on the virtual nodes, the topology comprising virtual node-to-host mappings;
for each virtual node, determine performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks;
for each host, aggregate performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks;
determine if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks;
when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, reporting a busiest virtual node on the host as a candidate of processor error. 14: The system of claim 13, wherein the configuration analyzer is configured to:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determine if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, report the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. claim 15: The system of claim 14, wherein the configuration analyzer is configured to:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, report the one host as a candidate of disk configuration error. 16: The system of claim 15, wherein the configuration analyzer is configured to, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determine if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, report the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. 17: The method of claim 16, wherein the configuration analyzer is configured to:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, report the host as a candidate of network configuration error. 18: The system of claim 17, wherein the configuration analyzer is configured to:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, report the host as a candidate of network configuration error. 19: The system of claim 13, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node; each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes; and determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determine a first host with the most of the slowest map tasks;
determine a second host with the most of the slowest reduce tasks; and
determine if the first host is the second host. 20: The system of claim 14, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks; each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations; determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. 21: A non-transitory computer-readable storage medium encoded with instructions executable by a processor to:
receive a trace of a job executed on a virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on virtual nodes that are virtual machines on hosts in the virtual distributed computing system, the topology comprising virtual node-to-host mappings; for each virtual node, determine performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; for each host, aggregate performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; determine if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks; when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, report a busiest virtual node on the host as a candidate of processor error. 22: The non-transitory computer-readable storage medium of claim 21, further comprising instructions executable by the processor to:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determine if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, report the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. 23: The non-transitory computer-readable storage medium of claim 22, further comprising instructions executable by the processor to:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, report the one host as a candidate of disk configuration error. 24: The non-transitory computer-readable storage medium of claim 23, further comprising instructions executable by the processor to, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determine if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, report the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. claim 25: The non-transitory computer-readable storage medium of claim 24, further encoded with instructions executable by the processor to:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, report the host as a candidate of network configuration error. 26: The non-transitory computer-readable storage medium of claim 25, further comprising instructions executable by the processor to:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, report the host as a candidate of network configuration error. 27: The non-transitory computer-readable storage medium of claim 21, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node; each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes; and determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determine a first host with the most of the slowest map tasks;
determine a second host with the most of the slowest reduce tasks; and
determine if the first host is the second host. 28: The non-transitory computer-readable storage medium of claim 22, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks; each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations; determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. | A method includes receiving a trace of a job in a distributed computing system and a topology of the system and determining performance indicators of each virtual node's (1) busyness from executing its share of local resource and network dependent tasks in the job, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks. The method includes aggregating performance indicators of each host's virtual nodes and determining if one of the hosts is least efficient in executing its share of the local resource and the network dependent tasks. If so, the method includes determining if the one host is less busy from executing it share of the local resource and the network dependent tasks than other hosts. If not, the method includes reporting the one host's busiest virtual node as a candidate of processor error.1: A method to identify a possible anomaly in a virtual distributed computing system comprising virtual nodes that are virtual machines on hosts, the method comprising:
receiving a trace of a job executed on the virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on the virtual nodes, the topology comprising virtual node-to-host mappings; for each virtual node, determining performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; for each host, aggregating performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; determining if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks; when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, reporting a busiest virtual node on the host as a candidate of processor error. 2: The method of claim 1, further comprises:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, reporting the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. 3: The method of claim 2, further comprises:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, reporting the one host as a candidate of disk configuration error. 4: The method of claim 3, further comprises, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determining if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determining if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, reporting the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. 5: The method of claim 4, further comprises:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, reporting the host as a candidate of network configuration error. 6: The method of claim 5, further comprises:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, reporting the host as a candidate of network configuration error. 7: The method of claim 1, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; and each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node. claim 8: The method of claim 7, wherein: each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; and each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes. 9: The method of claim 8, wherein determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determining a first host with the most of the slowest map tasks; determining a second host with the most of the slowest reduce tasks; and determining if the first host is the second host. 10: The method of claim 2, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks. claim 11: The method of claim 10, wherein each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations. 12: The method of claim 11, wherein:
determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. 13: A virtual distributed computing system, comprising:
virtual nodes implemented on hosts; a configuration analyzer implemented on one of the hosts or a separate host, the configuration analyzer being configured to:
receive a trace of a job executed on the virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on the virtual nodes, the topology comprising virtual node-to-host mappings;
for each virtual node, determine performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks;
for each host, aggregate performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks;
determine if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks;
when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, reporting a busiest virtual node on the host as a candidate of processor error. 14: The system of claim 13, wherein the configuration analyzer is configured to:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determine if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, report the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. claim 15: The system of claim 14, wherein the configuration analyzer is configured to:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, report the one host as a candidate of disk configuration error. 16: The system of claim 15, wherein the configuration analyzer is configured to, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determine if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, report the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. 17: The method of claim 16, wherein the configuration analyzer is configured to:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, report the host as a candidate of network configuration error. 18: The system of claim 17, wherein the configuration analyzer is configured to:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, report the host as a candidate of network configuration error. 19: The system of claim 13, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node; each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes; and determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determine a first host with the most of the slowest map tasks;
determine a second host with the most of the slowest reduce tasks; and
determine if the first host is the second host. 20: The system of claim 14, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks; each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations; determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. 21: A non-transitory computer-readable storage medium encoded with instructions executable by a processor to:
receive a trace of a job executed on a virtual distributed computing system and a topology of the virtual distributed computing system, the job comprising local resource tasks and network dependent tasks executed on virtual nodes that are virtual machines on hosts in the virtual distributed computing system, the topology comprising virtual node-to-host mappings; for each virtual node, determine performance indicators of the virtual node's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; for each host, aggregate performance indicators of the host's virtual nodes to determine the host's (1) busyness from executing its share of the local resource tasks and the network dependent tasks, (2) efficiency for executing its share of the local resource tasks, and (3) efficiency for executing its share of the network dependent tasks; determine if one of the hosts is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks; when one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts;
when the one host is not less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts, report a busiest virtual node on the host as a candidate of processor error. 22: The non-transitory computer-readable storage medium of claim 21, further comprising instructions executable by the processor to:
when the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts:
determine if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes; and
when the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes, report the one host's least efficient virtual node in executing its share of the local resource tasks as a candidate of disk configuration error. 23: The non-transitory computer-readable storage medium of claim 22, further comprising instructions executable by the processor to:
when the one host's virtual nodes do not have greater variation in their busyness than the other hosts' virtual nodes, report the one host as a candidate of disk configuration error. 24: The non-transitory computer-readable storage medium of claim 23, further comprising instructions executable by the processor to, when one host is not least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks:
determine if a host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variation in their busyness than other hosts' virtual nodes; when the host that is least efficient in executing its share of the local resource tasks has virtual nodes with greater variations in their busyness than other hosts' virtual nodes:
determine if the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts;
when the host that is least efficient in executing its share of the local resource tasks is less busy than other hosts, report the host's least efficient in executing its share of the local resource tasks as a candidate of network configuration error. claim 25: The non-transitory computer-readable storage medium of claim 24, further encoded with instructions executable by the processor to:
when the host that is least efficient in executing its share of the local resource tasks is not less busy than other hosts, report the host as a candidate of network configuration error. 26: The non-transitory computer-readable storage medium of claim 25, further comprising instructions executable by the processor to:
when the host that is least efficient in executing its share of the local resource tasks does not have virtual nodes with greater variation in their busyness than other hosts' virtual nodes, report the host as a candidate of network configuration error. 27: The non-transitory computer-readable storage medium of claim 21, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; each virtual node's performance indicator for efficiency in executing its share of the local resource tasks comprises a number of slowest map tasks on the virtual node; each virtual node's key performance indicator for efficiency in executing its share of the network dependent tasks comprises a number of slowest reduce tasks on the virtual node; each host's efficiency in executing its share of the local resource tasks is determined by determining the host's top two virtual nodes with most of the slowest map tasks and summing their numbers of the slowest map tasks on the two virtual nodes; each host's efficiency in executing its share of the network dependent tasks is determined by determining the host's top two virtual nodes with most of the number of slowest reduce tasks and summing their numbers of the slowest reduce tasks on the two virtual nodes; and determining if one host is least efficient in both executing its share of the local resource tasks and its share of the network dependent tasks comprises:
determine a first host with the most of the slowest map tasks;
determine a second host with the most of the slowest reduce tasks; and
determine if the first host is the second host. 28: The non-transitory computer-readable storage medium of claim 22, wherein:
the local resource tasks comprise map tasks; the network dependent tasks comprise reduce tasks; and each virtual node's performance indicator for busyness from executing its share of the local resource tasks and the network dependent tasks comprises a processor utilization for executing its share of the map tasks and the reduce tasks over a time duration for completing its share of the local resource tasks and the network dependent tasks; each host's busyness from executing its share of the local resource tasks and the network dependent tasks comprises an average processor utilization and magnitude and distribution of variances of its virtual nodes' processor utilizations; determining if the one host is less busy from executing it share of the local resource tasks and the network dependent tasks than other hosts comprises comparing their average processor utilizations; and determining if the one host's virtual nodes have greater variation in their busyness than the other hosts' virtual nodes comprises comparing their standards of deviation. | 2,100 |
5,666 | 5,666 | 14,860,127 | 2,119 | A method includes: receiving an electrical signal from a temperature sensor, wherein the temperature sensor is disposed within a package including a processor chip, further wherein the temperature sensor is thermally separated from the processor chip by materials within the package, generating temperature information from the electrical signal, processing the temperature information to determine that a performance of the processor chip should be mitigate, and mitigating the performance of the processor chip in response to the temperature information, wherein processing the temperature information and mitigating the performance of the processor are performed by the processor chip. | 1. A method comprising:
receiving an electrical signal from a temperature sensor, wherein the temperature sensor is disposed within a package including a processor chip, further wherein the temperature sensor is thermally separated from the processor chip by materials within the package; generating temperature information from the electrical signal; processing the temperature information to determine that a performance of the processor chip should be mitigated; and mitigating the performance of the processor chip in response to the temperature information, wherein processing the temperature information and mitigating the performance of the processor are performed by the processor chip. 2. The method of claim 1, wherein generating temperature information comprises:
generating digital signals from the received electrical signal from the temperature sensor, the digital signals being indicative of a temperature experienced by the temperature sensor. 3. The method of claim 1, wherein the electrical signal indicates a voltage associated with the temperature sensor. 4. The method of claim 1, wherein the temperature sensor comprises a thermistor. 5. The method of claim 1, wherein the temperature sensor is separated from the processor chip by a layer of dielectric in a substrate of the package. 6. The method of claim 1, wherein processing the temperature information comprises:
comparing the temperature information to a programmed threshold temperature. 7. The method of claim 1, wherein the method is performed by a software kernel of the processor chip. 8. The method of claim 1, wherein the package including the processor chip is incorporated into a handheld computing device, and wherein processing the temperature information comprises:
comparing the temperature information to a handheld computing device skin temperature limit. 9. The method of claim 1, wherein mitigating the performance of the processor chip comprises:
reducing an operating frequency of the processor chip. 10. The method of claim 9, further comprising:
increasing the operating frequency of the processor chip after determining that the temperature information indicates a temperature reduction of the package. 11. A system comprising:
a computer processor configured to execute machine-readable instructions and to consume power from a system battery, the computer processor being disposed within a package having a dielectric substrate and providing electrical communication between the computer processor and a plurality of electrical components of the system; a physical housing enclosing at least a portion of the system, the package being disposed within the system so that it is enclosed within the physical housing, the computer processor further being in thermal contact with the physical housing through the package; and a temperature measuring device disposed within the package and thermally separated from the computer processor by materials of the package, the temperature measuring device being in electrical communication with the computer processor, the computer processor configured to perform the following operation:
receive electrical signals from the temperature measuring device;
in response to the electrical signals from the temperature measuring device, determine that a thermal mitigation operation should be undertaken; and
reduce an operating parameter of the computer processor in accordance with the thermal mitigation operation. 12. The system of claim 11, wherein the system is at least one of a smart phone and a tablet computer. 13. The system of claim 11, wherein the operating parameter of the computer processor comprises an operating frequency. 14. The system of claim 11, wherein the computer processor is further configured to perform the following operation:
increase the operating parameter of the computer processor in response to determining that the temperature of the temperature measuring device has decreased. 15. The system of claim 11, wherein the computer processor is implemented in a system on chip (SOC) within the package, wherein the package is mounted to a printed circuit board and disposed within the physical housing. 16. The system of claim 11, wherein the electrical signals are indicative of a temperature experienced by the temperature measuring device. 17. The system of claim 11, wherein the temperature measuring device is disposed on a top layer of a substrate of the package. 18. The system of claim 11, wherein the temperature measuring device is disposed between two metal layers of a substrate of the package. 19. The system of claim 11, where the temperature measuring device is disposed at a bottom layer of a substrate of the package. 20. A system comprising:
means for providing information indicating a temperature of a chip package within the system; means for comparing the temperature of the chip package to a temperature threshold and for generating a control signal in response to determining that the temperature of the chip package exceeds the temperature threshold; means for reducing an operating parameter of the means for comparing in response to the control signal; and a physical housing enclosing at least the means for comparing and the means for providing, the means for comparing further being in thermal contact with the means for providing through a substrate of the chip package. 21. The system of claim 20, wherein the means for providing information comprises a thermistor. 22. The system of claim 20, wherein the means for reducing the operating parameter comprises a clock control circuit. 23. The system of claim 20, wherein the means for comparing the temperature of the chip package comprises a system on chip (SOC) with a thermal mitigation algorithm. 24. The system of claim 20, further comprising means for increasing the operating parameter of the means for comparing in response to determining that the temperature of the chip package has decreased. 25. A computer program product having a computer readable medium tangibly recording computer program logic for mitigating temperature of a chip, the computer program product comprising:
code to generate temperature information from a sensor within a chip package and at a location physically separate from the chip within the chip package; code to compare the temperature information to a programmed temperature threshold, wherein comparing the temperature information to the programmed temperature threshold is performed by the chip; code to reduce an operating parameter of the chip in response to comparing the temperature information to the programmed temperature threshold; and code to increase the operating parameter of the chip in response to determining that the temperature information indicates a reduction in temperature. 26. The computer program product of claim 25, wherein the code to reduce the operating parameter of the chip comprises code to reduce an operating frequency of the chip. 27. The computer program product of claim 25, wherein the code to reduce the operating parameter of the chip comprises code to reduce an operating voltage of the chip. 28. The computer program product of claim 25, wherein the temperature threshold corresponds to a temperature limit for an exterior surface of a physical housing of a computing device in which the chip package is disposed. 29. The computer program product of claim 25, wherein the sensor comprises a thermistor. 30. The computer program product of claim 25, wherein the programmed temperature threshold is stored to a memory of the chip. | A method includes: receiving an electrical signal from a temperature sensor, wherein the temperature sensor is disposed within a package including a processor chip, further wherein the temperature sensor is thermally separated from the processor chip by materials within the package, generating temperature information from the electrical signal, processing the temperature information to determine that a performance of the processor chip should be mitigate, and mitigating the performance of the processor chip in response to the temperature information, wherein processing the temperature information and mitigating the performance of the processor are performed by the processor chip.1. A method comprising:
receiving an electrical signal from a temperature sensor, wherein the temperature sensor is disposed within a package including a processor chip, further wherein the temperature sensor is thermally separated from the processor chip by materials within the package; generating temperature information from the electrical signal; processing the temperature information to determine that a performance of the processor chip should be mitigated; and mitigating the performance of the processor chip in response to the temperature information, wherein processing the temperature information and mitigating the performance of the processor are performed by the processor chip. 2. The method of claim 1, wherein generating temperature information comprises:
generating digital signals from the received electrical signal from the temperature sensor, the digital signals being indicative of a temperature experienced by the temperature sensor. 3. The method of claim 1, wherein the electrical signal indicates a voltage associated with the temperature sensor. 4. The method of claim 1, wherein the temperature sensor comprises a thermistor. 5. The method of claim 1, wherein the temperature sensor is separated from the processor chip by a layer of dielectric in a substrate of the package. 6. The method of claim 1, wherein processing the temperature information comprises:
comparing the temperature information to a programmed threshold temperature. 7. The method of claim 1, wherein the method is performed by a software kernel of the processor chip. 8. The method of claim 1, wherein the package including the processor chip is incorporated into a handheld computing device, and wherein processing the temperature information comprises:
comparing the temperature information to a handheld computing device skin temperature limit. 9. The method of claim 1, wherein mitigating the performance of the processor chip comprises:
reducing an operating frequency of the processor chip. 10. The method of claim 9, further comprising:
increasing the operating frequency of the processor chip after determining that the temperature information indicates a temperature reduction of the package. 11. A system comprising:
a computer processor configured to execute machine-readable instructions and to consume power from a system battery, the computer processor being disposed within a package having a dielectric substrate and providing electrical communication between the computer processor and a plurality of electrical components of the system; a physical housing enclosing at least a portion of the system, the package being disposed within the system so that it is enclosed within the physical housing, the computer processor further being in thermal contact with the physical housing through the package; and a temperature measuring device disposed within the package and thermally separated from the computer processor by materials of the package, the temperature measuring device being in electrical communication with the computer processor, the computer processor configured to perform the following operation:
receive electrical signals from the temperature measuring device;
in response to the electrical signals from the temperature measuring device, determine that a thermal mitigation operation should be undertaken; and
reduce an operating parameter of the computer processor in accordance with the thermal mitigation operation. 12. The system of claim 11, wherein the system is at least one of a smart phone and a tablet computer. 13. The system of claim 11, wherein the operating parameter of the computer processor comprises an operating frequency. 14. The system of claim 11, wherein the computer processor is further configured to perform the following operation:
increase the operating parameter of the computer processor in response to determining that the temperature of the temperature measuring device has decreased. 15. The system of claim 11, wherein the computer processor is implemented in a system on chip (SOC) within the package, wherein the package is mounted to a printed circuit board and disposed within the physical housing. 16. The system of claim 11, wherein the electrical signals are indicative of a temperature experienced by the temperature measuring device. 17. The system of claim 11, wherein the temperature measuring device is disposed on a top layer of a substrate of the package. 18. The system of claim 11, wherein the temperature measuring device is disposed between two metal layers of a substrate of the package. 19. The system of claim 11, where the temperature measuring device is disposed at a bottom layer of a substrate of the package. 20. A system comprising:
means for providing information indicating a temperature of a chip package within the system; means for comparing the temperature of the chip package to a temperature threshold and for generating a control signal in response to determining that the temperature of the chip package exceeds the temperature threshold; means for reducing an operating parameter of the means for comparing in response to the control signal; and a physical housing enclosing at least the means for comparing and the means for providing, the means for comparing further being in thermal contact with the means for providing through a substrate of the chip package. 21. The system of claim 20, wherein the means for providing information comprises a thermistor. 22. The system of claim 20, wherein the means for reducing the operating parameter comprises a clock control circuit. 23. The system of claim 20, wherein the means for comparing the temperature of the chip package comprises a system on chip (SOC) with a thermal mitigation algorithm. 24. The system of claim 20, further comprising means for increasing the operating parameter of the means for comparing in response to determining that the temperature of the chip package has decreased. 25. A computer program product having a computer readable medium tangibly recording computer program logic for mitigating temperature of a chip, the computer program product comprising:
code to generate temperature information from a sensor within a chip package and at a location physically separate from the chip within the chip package; code to compare the temperature information to a programmed temperature threshold, wherein comparing the temperature information to the programmed temperature threshold is performed by the chip; code to reduce an operating parameter of the chip in response to comparing the temperature information to the programmed temperature threshold; and code to increase the operating parameter of the chip in response to determining that the temperature information indicates a reduction in temperature. 26. The computer program product of claim 25, wherein the code to reduce the operating parameter of the chip comprises code to reduce an operating frequency of the chip. 27. The computer program product of claim 25, wherein the code to reduce the operating parameter of the chip comprises code to reduce an operating voltage of the chip. 28. The computer program product of claim 25, wherein the temperature threshold corresponds to a temperature limit for an exterior surface of a physical housing of a computing device in which the chip package is disposed. 29. The computer program product of claim 25, wherein the sensor comprises a thermistor. 30. The computer program product of claim 25, wherein the programmed temperature threshold is stored to a memory of the chip. | 2,100 |
5,667 | 5,667 | 13,892,934 | 2,177 | Presenting a link label for multiple hyperlinks includes presenting a layered data element in an electronic message with a link label that represents multiple hyperlinks in a display, designating an active hyperlink from the multiple hyperlinks based on specific criteria associated with a recipient of the electronic message, and directing the recipient of the electronic message to an online location of the active hyperlink in response to user input selecting the link label. | 1. A system for presenting a link label for multiple hyperlinks, comprising:
a presenting engine to present a layered data element in an electronic message with a link label that represents multiple hyperlinks; a designating engine to designate an active hyperlink from said multiple hyperlinks based on specific criteria associated with a recipient of said electronic message; and a directing engine to direct said recipient of said electronic message to an online location of said active hyperlink in response to user input selecting said link label. 2. The system of claim 1, further comprising a generating engine to generate said layered data element. 3. The system of claim 2, wherein said generating engine to further generate said layered data element based on non-programmatic user instructions. 4. The system of claim 3, wherein said non-programmatic user instructions include dragging and dropping instructions, key board instructions, click instructions, audible instructions, movement gesture instructions, or combinations thereof. 5. The system of claim 1, wherein said link label is a picture, block of text, quick response (QR) code, a symbol, a group of symbols, or combinations thereof. 6. The system of claim 1, wherein said specific criteria includes a geographic location of said recipient, a profession of said recipient, a language of said recipient, a preference of said recipient, profile data of said recipient, or combinations thereof. 7. The system of claim 1, wherein said active hyperlink points to a website, an image, a file, a document, audio file, a video, or combinations thereof. 8. The system of claim 1, wherein said active hyperlink is a single hyperlink. 9. The system of claim 1, wherein said active hyperlink is part of a subset of said multiple hyperlinks compatible with said recipient. 10. A computer program product for presenting a link label for multiple hyperlinks, comprising:
a tangible computer readable storage medium, said tangible computer readable storage medium comprising computer readable program code embodied therewith, said computer readable program code comprising program instructions that, when executed, causes a processor to: present a layered data element in an electronic message with a link label that represents multiple hyperlinks; designate an active hyperlink from said multiple hyperlinks based on specific criteria associated with a recipient of said electronic message; and display content to an online location of said active hyperlink in response to user input selecting said link label. 11. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to direct said recipient of said electronic message to an online location of said active hyperlink. 12. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to generate a layered data element based on user input. 13. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a geographic location factor. 14. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a profession factor. 15. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a language factor. 16. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a preference factor. 17. A system for presenting a link label for multiple hyperlinks, comprising:
a generating engine to generate a layered data element with a link label that represents multiple hyperlinks; a presenting engine to present said link label in an electronic message; and a designating engine to designate an active hyperlink from said multiple hyperlinks based on criteria about a recipient of said electronic message. 18. The system of claim 17, further comprising a directing engine to direct said recipient to an online location of said active hyperlink in response to user input selecting said link label. 19. The system of claim 17, further comprising a displaying engine to display content associated with said active hyperlink in response to user input selecting said link label. 20. The system of claim 17, wherein said active hyperlink is a single hyperlink. | Presenting a link label for multiple hyperlinks includes presenting a layered data element in an electronic message with a link label that represents multiple hyperlinks in a display, designating an active hyperlink from the multiple hyperlinks based on specific criteria associated with a recipient of the electronic message, and directing the recipient of the electronic message to an online location of the active hyperlink in response to user input selecting the link label.1. A system for presenting a link label for multiple hyperlinks, comprising:
a presenting engine to present a layered data element in an electronic message with a link label that represents multiple hyperlinks; a designating engine to designate an active hyperlink from said multiple hyperlinks based on specific criteria associated with a recipient of said electronic message; and a directing engine to direct said recipient of said electronic message to an online location of said active hyperlink in response to user input selecting said link label. 2. The system of claim 1, further comprising a generating engine to generate said layered data element. 3. The system of claim 2, wherein said generating engine to further generate said layered data element based on non-programmatic user instructions. 4. The system of claim 3, wherein said non-programmatic user instructions include dragging and dropping instructions, key board instructions, click instructions, audible instructions, movement gesture instructions, or combinations thereof. 5. The system of claim 1, wherein said link label is a picture, block of text, quick response (QR) code, a symbol, a group of symbols, or combinations thereof. 6. The system of claim 1, wherein said specific criteria includes a geographic location of said recipient, a profession of said recipient, a language of said recipient, a preference of said recipient, profile data of said recipient, or combinations thereof. 7. The system of claim 1, wherein said active hyperlink points to a website, an image, a file, a document, audio file, a video, or combinations thereof. 8. The system of claim 1, wherein said active hyperlink is a single hyperlink. 9. The system of claim 1, wherein said active hyperlink is part of a subset of said multiple hyperlinks compatible with said recipient. 10. A computer program product for presenting a link label for multiple hyperlinks, comprising:
a tangible computer readable storage medium, said tangible computer readable storage medium comprising computer readable program code embodied therewith, said computer readable program code comprising program instructions that, when executed, causes a processor to: present a layered data element in an electronic message with a link label that represents multiple hyperlinks; designate an active hyperlink from said multiple hyperlinks based on specific criteria associated with a recipient of said electronic message; and display content to an online location of said active hyperlink in response to user input selecting said link label. 11. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to direct said recipient of said electronic message to an online location of said active hyperlink. 12. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to generate a layered data element based on user input. 13. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a geographic location factor. 14. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a profession factor. 15. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a language factor. 16. The computer program product of claim 10, further comprising program instructions that, when executed, causes said processor to designate said active hyperlink based on a preference factor. 17. A system for presenting a link label for multiple hyperlinks, comprising:
a generating engine to generate a layered data element with a link label that represents multiple hyperlinks; a presenting engine to present said link label in an electronic message; and a designating engine to designate an active hyperlink from said multiple hyperlinks based on criteria about a recipient of said electronic message. 18. The system of claim 17, further comprising a directing engine to direct said recipient to an online location of said active hyperlink in response to user input selecting said link label. 19. The system of claim 17, further comprising a displaying engine to display content associated with said active hyperlink in response to user input selecting said link label. 20. The system of claim 17, wherein said active hyperlink is a single hyperlink. | 2,100 |
5,668 | 5,668 | 14,390,187 | 2,158 | When generating visual representations of gene activity pathways for clinical decision support, a validated pathway database that stores a plurality of validated pathways is accessed, wherein each pathway describes at least one interaction between a plurality of genes. A processor ( 18 ) is configured to execute computer-executable instructions stored in a memory ( 16 ), the instructions comprising visually representing gene activity level ( 28 ) for at least one gene across a plurality of populations, retrieving a pathway ( 32 ) from the validated pathway database, wherein the pathway includes the at least one gene, and visually representing gene activity levels for all genes in the pathway. The instructions further comprise a formal visual grammar representation visually representing information flow ( 36 ) through interactions between genes in pathway, linking the visual representation of the information flow to actionable information ( 42 ) for a clinician, and outputting the visual representation of the information flow and the linked actionable information to the to the clinician. | 1. A system that facilitates visualizing gene activity pathways, using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, for clinical decision support, including:
a validated pathway database that stores a plurality of validated pathways, each of which describes at least one interaction between a plurality of genes using the visual grammar; and a processor configured to execute computer-executable instructions stored in a memory, the instructions comprising:
visually representing gene activity level for at least one gene across a plurality of populations;
retrieving a pathway from the validated pathway database wherein the pathway includes the at least one gene;
visually representing gene activity levels for all genes in the pathway;
visually representing information flow through interactions between genes in the pathway;
linking the visual representation of the information flow to actionable information for a clinician;
outputting the visual representation of the information flow and the linked actionable information to the clinician. 2. The system according to claim 1, wherein the plurality of populations includes a normal population, a tumor population, and a current patient. 3. The system or the storage medium or the method according to claim 1, the instructions further comprising:
color coding gene activity level for the at least one gene across the plurality of populations such that each population is represented by different color. 4. The system or the storage medium or the method according to claim 1, the instructions further comprising:
texture coding gene activity level for the at least one gene across the plurality of populations such that each population is represented by different texture. 5. The system or the storage medium or the method according to claim 1, the instructions further comprising:
visually representing a temperature graph that shows gene activity level for the at least one gene in a patient as a function of mean gene activity level for a normal population and a tumor population mean gene activity level. 6. The system according to claim 1, the instructions further comprising:
visually representing gene activity using temporal aspects comprising at least one of flashing and motion, wherein the frequency of the at least one of flashing and motion is proportional to the gene activity level. 7. The system according to claim 1, wherein the actionable information includes at least one therapy plan for treating a patient. 8. (canceled) 9. The system or the storage medium or the method according to claim 1, the instructions further comprising:
visually representing gene activity levels using visual color in hue-saturation-brightness (HSB) space wherein different gene activity levels are assigned different visual colors, and wherein the visual representation is generated using a continuous function. 10. The system according to claim 9, wherein the continuous function is defined such that a given gene has a range of values r=[a,b] wherein values are assigned in the HSB space, and for each point ri ∈[a,b] a function is chosen to map the value in hi=f(ri). 11. (canceled) 12. The system according claim 1, wherein the information flow describes interactions between genes captured in the pathway as a function of a probability of one or more of over-expression, repression, and baseline expression genes in the pathway, an wherein the instructions further comprise determining whether one or more of the interactions in the pathway has been activated. 13. The system according to claim 12, the instructions further comprising generating a visual representation that omits node representation and emphasizes the information flow throughout the pathway. 14. A non-transitory computer-readable storage medium having stored thereon computer-readable instructions for visualizing gene activity pathways using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, for clinical decision support, the instructions comprising:
visually representing gene activity level for at least one gene across a plurality of populations; retrieving a pathway from a validated pathway database, wherein the pathway includes the at least one gene; visually representing gene activity levels for all genes in the pathway; visually representing information flow through interactions between genes in the retrieved pathway; linking the visual representation of the information flow to actionable information for a clinician; outputting the visual representation of the information flow and the linked actionable information to the clinician. 15. (canceled) 16. (canceled) 17. (canceled) 18. (canceled) 19. (canceled) 20. (canceled) 21. (canceled) 22. (canceled) 23. A method of visualizing gene activity pathways for clinical decision support using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, comprising:
visually representing gene activity level for at least one gene across a plurality of populations; retrieving a pathway from a validated pathway database, wherein the pathway includes the at least one gene; visually representing gene activity levels for all genes in the pathway; visually representing information flow through interactions between genes in the pathway; linking the visual representation of the information flow to actionable information for a clinician; outputting the visual representation of the information flow and the linked actionable information including at least one therapy plan to the clinician. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled) 28. (canceled) 29. (canceled) 30. A processor carrying a computer program that controls one or more processors to perform the method of claim 1. | When generating visual representations of gene activity pathways for clinical decision support, a validated pathway database that stores a plurality of validated pathways is accessed, wherein each pathway describes at least one interaction between a plurality of genes. A processor ( 18 ) is configured to execute computer-executable instructions stored in a memory ( 16 ), the instructions comprising visually representing gene activity level ( 28 ) for at least one gene across a plurality of populations, retrieving a pathway ( 32 ) from the validated pathway database, wherein the pathway includes the at least one gene, and visually representing gene activity levels for all genes in the pathway. The instructions further comprise a formal visual grammar representation visually representing information flow ( 36 ) through interactions between genes in pathway, linking the visual representation of the information flow to actionable information ( 42 ) for a clinician, and outputting the visual representation of the information flow and the linked actionable information to the to the clinician.1. A system that facilitates visualizing gene activity pathways, using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, for clinical decision support, including:
a validated pathway database that stores a plurality of validated pathways, each of which describes at least one interaction between a plurality of genes using the visual grammar; and a processor configured to execute computer-executable instructions stored in a memory, the instructions comprising:
visually representing gene activity level for at least one gene across a plurality of populations;
retrieving a pathway from the validated pathway database wherein the pathway includes the at least one gene;
visually representing gene activity levels for all genes in the pathway;
visually representing information flow through interactions between genes in the pathway;
linking the visual representation of the information flow to actionable information for a clinician;
outputting the visual representation of the information flow and the linked actionable information to the clinician. 2. The system according to claim 1, wherein the plurality of populations includes a normal population, a tumor population, and a current patient. 3. The system or the storage medium or the method according to claim 1, the instructions further comprising:
color coding gene activity level for the at least one gene across the plurality of populations such that each population is represented by different color. 4. The system or the storage medium or the method according to claim 1, the instructions further comprising:
texture coding gene activity level for the at least one gene across the plurality of populations such that each population is represented by different texture. 5. The system or the storage medium or the method according to claim 1, the instructions further comprising:
visually representing a temperature graph that shows gene activity level for the at least one gene in a patient as a function of mean gene activity level for a normal population and a tumor population mean gene activity level. 6. The system according to claim 1, the instructions further comprising:
visually representing gene activity using temporal aspects comprising at least one of flashing and motion, wherein the frequency of the at least one of flashing and motion is proportional to the gene activity level. 7. The system according to claim 1, wherein the actionable information includes at least one therapy plan for treating a patient. 8. (canceled) 9. The system or the storage medium or the method according to claim 1, the instructions further comprising:
visually representing gene activity levels using visual color in hue-saturation-brightness (HSB) space wherein different gene activity levels are assigned different visual colors, and wherein the visual representation is generated using a continuous function. 10. The system according to claim 9, wherein the continuous function is defined such that a given gene has a range of values r=[a,b] wherein values are assigned in the HSB space, and for each point ri ∈[a,b] a function is chosen to map the value in hi=f(ri). 11. (canceled) 12. The system according claim 1, wherein the information flow describes interactions between genes captured in the pathway as a function of a probability of one or more of over-expression, repression, and baseline expression genes in the pathway, an wherein the instructions further comprise determining whether one or more of the interactions in the pathway has been activated. 13. The system according to claim 12, the instructions further comprising generating a visual representation that omits node representation and emphasizes the information flow throughout the pathway. 14. A non-transitory computer-readable storage medium having stored thereon computer-readable instructions for visualizing gene activity pathways using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, for clinical decision support, the instructions comprising:
visually representing gene activity level for at least one gene across a plurality of populations; retrieving a pathway from a validated pathway database, wherein the pathway includes the at least one gene; visually representing gene activity levels for all genes in the pathway; visually representing information flow through interactions between genes in the retrieved pathway; linking the visual representation of the information flow to actionable information for a clinician; outputting the visual representation of the information flow and the linked actionable information to the clinician. 15. (canceled) 16. (canceled) 17. (canceled) 18. (canceled) 19. (canceled) 20. (canceled) 21. (canceled) 22. (canceled) 23. A method of visualizing gene activity pathways for clinical decision support using a visual grammar that defines visual elements associated with gene expression, gene activity level, and information flow, comprising:
visually representing gene activity level for at least one gene across a plurality of populations; retrieving a pathway from a validated pathway database, wherein the pathway includes the at least one gene; visually representing gene activity levels for all genes in the pathway; visually representing information flow through interactions between genes in the pathway; linking the visual representation of the information flow to actionable information for a clinician; outputting the visual representation of the information flow and the linked actionable information including at least one therapy plan to the clinician. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled) 28. (canceled) 29. (canceled) 30. A processor carrying a computer program that controls one or more processors to perform the method of claim 1. | 2,100 |
5,669 | 5,669 | 14,660,519 | 2,121 | Behavioral characteristics of at least a first machine component are monitored. A model that represents machine-to-machine interactions between at least the first machine component and at least a further machine component is generated. Using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions is computed, where the incongruity is predicted based on determining a discordance between an expectation of the system and the behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions. | 1. A method comprising:
monitoring, by a system including a processor and sensors, behavioral characteristics of at least a first machine component; generating, by the system through unsupervised learning, an endogenous and unsupervised Bayesian model that represents interrelations between local events and machine-to-machine interactions between at least the first machine component and at least a further machine component; predicting, by the system using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions, wherein the incongruity is predicted based on determining a singularity of the local events and the machine-to-machine interactions, and a discordance between a calculated expectation of the system and an observed behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions; and performing, by the system, an action with respect to at least the first machine component in response to the predicted incongruity. 2. The method of claim 1, wherein the predicting is performed without using a previously built normative pattern of behavior and data, or a previously built normative organization of behavior and data, and the predicting comprises continually discovering and automatically learning, using the sensors, the machine-to-machine interactions as the machine-to-machine interactions emerge, 3. The method of claim 1, wherein the predicting is based on an autonomous probabilistic weighting of relative and interrelated frequencies of behavioral occurrences, performed without human supervision, human teaching, or a priori taught model of interactions, and wherein the generating comprises generating the Bayesian model that records over time a probabilistic realization of a behavior, based on knowledge of characteristics, intensity and measures of other learned behaviors over time. 4. The method of claim 1, wherein monitoring the behavioral characteristics of at least the first machine component comprises monitoring the behavioral characteristics of a node in a network or the behavioral characteristics of a machine or a portion of the machine. 5. The method of claim 1, further comprising:
discovering a new machine component or a new behavior of an existing machine component; and predicting an incongruity of the new machine component or the new behavior of the existing machine component. 6. The method of claim 1, wherein the expectation of the system is based on learned endogenous logic of the system, the learned endogenous logic learned from previous operations of the system. 7. The method of claim 1, wherein predicting the incongruity is based on determining the singularity and an idiosyncrasy of a detected behavior, as determined and defined as a mathematical impossibility to explain the detected behavior with the Bayesian model, combined with a probabilistic distance between the detected behavior of at least the further machine component to an expected behavior of at least the further machine component, as expected by at least the first machine component given a behavior of at least the first machine component. 8. A system comprising:
a non-transitory storage medium storing instructions; and at least one processor, the instructions executable on the at least one processor to:
learn behaviors of machine components by auto-generating a Bayesian network from data associated with the machine components, without prior teaching, and without human intervention, the Bayesian network providing, at each stage of a continual observation by the Bayesian network, a predictive model of the behaviors of the machine components and interactions of the machine components, without accessing functions of the machine components that direct these behaviors;
compute, based on a predicting of a probable transformation of a behavior of a given machine component and based on the Bayesian network, a probabilistic prediction of an incongruity of the behavior of the given machine component;
identify a second machine component that likely caused the incongruity; and
perform an action to address the incongruity. 9. The system of claim 8, wherein the instructions are executable by the at least one processor to further:
update the Bayesian network concerning an endogenous behavior of the given machine component, and machine-to-machine interactions between the given machine component and further machine components; discover a model of behaviors of the further machine components that interact with the given machine component; and emulate an identified unknown behavior by the Bayesian network to determine whether the identified unknown behavior is a harmful, malevolent, or hazardous behavior. 10. The system of claim 8, wherein the instructions are executable by the at least one processor to further:
learn over time a persistence of incongruities and incongruous behaviors of machine components, to detect contrived incongruities and deliberate acclimatization to planned incongruous behavior in the system; record over time different learning states of the machine components; and encapsulating, for each learning state of the learning states, a calculated level of incongruity of each machine component of the machine components. 11. The system of claim 8, wherein the instructions are executable by the at least one processor to find a most probable machine component for a given behavior, and to find a probable behavior for the given machine component, by retrieving a recorded identification of a machine component or a process that has exhibited a highest cumulative incongruity over time, in comparison to other machine components or processes. 12. The system of claim 8, wherein the instructions are executable by the at least one processor is to:
find a most probable machine component, in a population of machine components, exhibiting symptoms of incongruity and/or an Advanced Persistent Threat (APT), and to isolate an incongruous or potentially APT behavior from characteristics of the most probable machine component; and based on highest scores of the APT intensity computed by probabilistic inferences over time, allowing a forensic analysis in real-time and over time, by tracing back the highest scores of incongruity in the machine components. 13. The system of claim 8, wherein the at least one processor is to:
receive a user request for identifying a most vulnerable machine component based on the incongruity; score a probability of multiple items selected from among incongruous behaviors, a persistent contriving incongruity behavior, a reconnaissance behavior, an intrusion, legitimating, dormant or delayed triggering of dormant intruder components, unauthorized access to assets and data; and present different scores regarding new interactions, before the new interactions or behaviors or events associated with the new behaviors are authorized to occur. 14. The system of claim 8, wherein the computing and the identifying do not rely on a pre-built model, but on a Bayesian network for each machine component of multiple machine components updated based on continual learning. 15. The system of claim 8, wherein the at least one processor is to further identify a self-incongruity of the given machine component 16. The system of claim 8, wherein the at least one processor is to further:
detect variations of behavior of interactions between the given machine component and a second machine component; in response to the detected variations at different times being within a specified threshold, determine a score of acclimatization of the given machine component to a behavior of the second machine component; in response to detecting an increase of scores over time of acclimatization of the given machine component to the behavior of the second machine component, declare detection of a persistent incongruity. 17. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a system to:
monitor behavioral characteristics of at least a first machine component; generate a Bayesian network that represents machine-to-machine interactions between at least the first machine component and at least a further machine component; predict, using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions, wherein the incongruity is predicted based on determining a discordance between an expectation of the system and the behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions; and perform an action to address the predicted incongruity. | Behavioral characteristics of at least a first machine component are monitored. A model that represents machine-to-machine interactions between at least the first machine component and at least a further machine component is generated. Using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions is computed, where the incongruity is predicted based on determining a discordance between an expectation of the system and the behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions.1. A method comprising:
monitoring, by a system including a processor and sensors, behavioral characteristics of at least a first machine component; generating, by the system through unsupervised learning, an endogenous and unsupervised Bayesian model that represents interrelations between local events and machine-to-machine interactions between at least the first machine component and at least a further machine component; predicting, by the system using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions, wherein the incongruity is predicted based on determining a singularity of the local events and the machine-to-machine interactions, and a discordance between a calculated expectation of the system and an observed behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions; and performing, by the system, an action with respect to at least the first machine component in response to the predicted incongruity. 2. The method of claim 1, wherein the predicting is performed without using a previously built normative pattern of behavior and data, or a previously built normative organization of behavior and data, and the predicting comprises continually discovering and automatically learning, using the sensors, the machine-to-machine interactions as the machine-to-machine interactions emerge, 3. The method of claim 1, wherein the predicting is based on an autonomous probabilistic weighting of relative and interrelated frequencies of behavioral occurrences, performed without human supervision, human teaching, or a priori taught model of interactions, and wherein the generating comprises generating the Bayesian model that records over time a probabilistic realization of a behavior, based on knowledge of characteristics, intensity and measures of other learned behaviors over time. 4. The method of claim 1, wherein monitoring the behavioral characteristics of at least the first machine component comprises monitoring the behavioral characteristics of a node in a network or the behavioral characteristics of a machine or a portion of the machine. 5. The method of claim 1, further comprising:
discovering a new machine component or a new behavior of an existing machine component; and predicting an incongruity of the new machine component or the new behavior of the existing machine component. 6. The method of claim 1, wherein the expectation of the system is based on learned endogenous logic of the system, the learned endogenous logic learned from previous operations of the system. 7. The method of claim 1, wherein predicting the incongruity is based on determining the singularity and an idiosyncrasy of a detected behavior, as determined and defined as a mathematical impossibility to explain the detected behavior with the Bayesian model, combined with a probabilistic distance between the detected behavior of at least the further machine component to an expected behavior of at least the further machine component, as expected by at least the first machine component given a behavior of at least the first machine component. 8. A system comprising:
a non-transitory storage medium storing instructions; and at least one processor, the instructions executable on the at least one processor to:
learn behaviors of machine components by auto-generating a Bayesian network from data associated with the machine components, without prior teaching, and without human intervention, the Bayesian network providing, at each stage of a continual observation by the Bayesian network, a predictive model of the behaviors of the machine components and interactions of the machine components, without accessing functions of the machine components that direct these behaviors;
compute, based on a predicting of a probable transformation of a behavior of a given machine component and based on the Bayesian network, a probabilistic prediction of an incongruity of the behavior of the given machine component;
identify a second machine component that likely caused the incongruity; and
perform an action to address the incongruity. 9. The system of claim 8, wherein the instructions are executable by the at least one processor to further:
update the Bayesian network concerning an endogenous behavior of the given machine component, and machine-to-machine interactions between the given machine component and further machine components; discover a model of behaviors of the further machine components that interact with the given machine component; and emulate an identified unknown behavior by the Bayesian network to determine whether the identified unknown behavior is a harmful, malevolent, or hazardous behavior. 10. The system of claim 8, wherein the instructions are executable by the at least one processor to further:
learn over time a persistence of incongruities and incongruous behaviors of machine components, to detect contrived incongruities and deliberate acclimatization to planned incongruous behavior in the system; record over time different learning states of the machine components; and encapsulating, for each learning state of the learning states, a calculated level of incongruity of each machine component of the machine components. 11. The system of claim 8, wherein the instructions are executable by the at least one processor to find a most probable machine component for a given behavior, and to find a probable behavior for the given machine component, by retrieving a recorded identification of a machine component or a process that has exhibited a highest cumulative incongruity over time, in comparison to other machine components or processes. 12. The system of claim 8, wherein the instructions are executable by the at least one processor is to:
find a most probable machine component, in a population of machine components, exhibiting symptoms of incongruity and/or an Advanced Persistent Threat (APT), and to isolate an incongruous or potentially APT behavior from characteristics of the most probable machine component; and based on highest scores of the APT intensity computed by probabilistic inferences over time, allowing a forensic analysis in real-time and over time, by tracing back the highest scores of incongruity in the machine components. 13. The system of claim 8, wherein the at least one processor is to:
receive a user request for identifying a most vulnerable machine component based on the incongruity; score a probability of multiple items selected from among incongruous behaviors, a persistent contriving incongruity behavior, a reconnaissance behavior, an intrusion, legitimating, dormant or delayed triggering of dormant intruder components, unauthorized access to assets and data; and present different scores regarding new interactions, before the new interactions or behaviors or events associated with the new behaviors are authorized to occur. 14. The system of claim 8, wherein the computing and the identifying do not rely on a pre-built model, but on a Bayesian network for each machine component of multiple machine components updated based on continual learning. 15. The system of claim 8, wherein the at least one processor is to further identify a self-incongruity of the given machine component 16. The system of claim 8, wherein the at least one processor is to further:
detect variations of behavior of interactions between the given machine component and a second machine component; in response to the detected variations at different times being within a specified threshold, determine a score of acclimatization of the given machine component to a behavior of the second machine component; in response to detecting an increase of scores over time of acclimatization of the given machine component to the behavior of the second machine component, declare detection of a persistent incongruity. 17. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a system to:
monitor behavioral characteristics of at least a first machine component; generate a Bayesian network that represents machine-to-machine interactions between at least the first machine component and at least a further machine component; predict, using the monitored behavioral characteristics and the generated model, an incongruity of a behavior of at least the first machine component and the machine-to-machine interactions, wherein the incongruity is predicted based on determining a discordance between an expectation of the system and the behavior and the machine-to-machine interactions, and wherein the predicting is performed without using a previously built normative rule of behavior and machine-to-machine interactions; and perform an action to address the predicted incongruity. | 2,100 |
5,670 | 5,670 | 14,213,332 | 2,178 | Technologies are described herein for displaying one or more visual indicators to assist users in identifying cells of a spreadsheet that are affected by an operation. In embodiments disclosed herein, an application is configured to receive a request to perform an operation on at least one cell of the spreadsheet. The application then identifies cells of the spreadsheet that are affected by the operation. The application then displays a visual indicator to emphasize the affected cells. By providing a timely displayed visual indicator that brings attention to affected cells, the user is able to gain a better perspective of the extent of the operation and how the operation applies to the cells of the spreadsheet. | 1. A computer-implemented method comprising computer-implemented operations for:
displaying a plurality of cells of a spreadsheet; receiving a request to perform an operation on at least one of the plurality of cells of the spreadsheet; identifying one or more of the plurality of cells of the spreadsheet affected by the operation; and displaying a visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 2. The computer-implemented method of claim 1, further comprising computer-implemented operations for:
performing the requested operation; and following performance of the requested operation, displaying a second visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 3. The computer-implemented method of claim 1, wherein the visual indicator is removed after a pre-determined time period after the request is received to perform the operation. 4. The computer-implemented method of claim 1, further comprising:
removing the visual indicator displayed to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation; performing the requested operation; and following performance of the requested operation, displaying the visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 5. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises highlighting a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 6. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation that varies in thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 7. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation which varies in color, wherein the animation highlights a border of one or more of the plurality of cells of the spreadsheet affected by the operation. 8. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation which varies in color and thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 9. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises shading the one or more of the plurality of cells of the spreadsheet affected by the operation. 10. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises shading one or more column and row headers associated with the one or more of the plurality of cells of the spreadsheet affected by the operation. 11. A computer, comprising:
a processor; and a computer-readable storage medium in communication with the processor, the computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to display a plurality of cells of a table, receive a request to perform an operation on at least one of the plurality of cells of the table, in response to receiving the request to perform the operation, identify one or more of the plurality of cells of the table affected by the operation, and display a visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 12. The computer of claim 11, wherein the computer-readable medium having further computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to:
perform the requested operation; and display a second visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 13. The computer of claim 11, wherein the visual indicator is removed after a pre-determined time period. 14. The computer of claim 11, wherein the computer-readable medium having further computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to:
remove visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation; perform the requested operation; and following performance of the requested operation, display the visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 15. The computer of claim 11, wherein the display of the visual indicator comprises highlighting a border of the one or more of the plurality of cells of the table affected by the operation. 16. The computer of claim 11, wherein the display of the visual indicator comprises generating an animation that varies in thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the table affected by the operation. 17. The computer of claim 11, wherein the display of the visual indicator comprises generating an animation which varies in color, wherein the animation highlights a border of one or more of the plurality of cells of the table affected by the operation. 18. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
display a spreadsheet comprising a plurality of cells and a table, wherein the table comprises a selection of cells of the plurality of cells, and wherein the selection of cells of the table have one or more associations that are independent from the plurality of cells of the spreadsheet; receive a request to perform an operation on at least one of the selection of cells of the table; in response to receiving the request to perform the operation, identify one or more of the plurality of cells affected by the operation, wherein the identification of the one or more of the plurality of cells affected by the operation is based on the one or more associations; and display a visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 19. The computer-readable storage medium of claim 18, wherein the display of the visual indicator comprises a border configured to graphically highlight the one or more of the plurality of cells affected by the operation. 20. The computer-readable storage medium of claim 18, wherein the display of the visual indicator comprises a shading of the one or more of the plurality of cells affected by the operation. | Technologies are described herein for displaying one or more visual indicators to assist users in identifying cells of a spreadsheet that are affected by an operation. In embodiments disclosed herein, an application is configured to receive a request to perform an operation on at least one cell of the spreadsheet. The application then identifies cells of the spreadsheet that are affected by the operation. The application then displays a visual indicator to emphasize the affected cells. By providing a timely displayed visual indicator that brings attention to affected cells, the user is able to gain a better perspective of the extent of the operation and how the operation applies to the cells of the spreadsheet.1. A computer-implemented method comprising computer-implemented operations for:
displaying a plurality of cells of a spreadsheet; receiving a request to perform an operation on at least one of the plurality of cells of the spreadsheet; identifying one or more of the plurality of cells of the spreadsheet affected by the operation; and displaying a visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 2. The computer-implemented method of claim 1, further comprising computer-implemented operations for:
performing the requested operation; and following performance of the requested operation, displaying a second visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 3. The computer-implemented method of claim 1, wherein the visual indicator is removed after a pre-determined time period after the request is received to perform the operation. 4. The computer-implemented method of claim 1, further comprising:
removing the visual indicator displayed to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation; performing the requested operation; and following performance of the requested operation, displaying the visual indicator to emphasize the one or more of the plurality of cells of the spreadsheet affected by the operation. 5. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises highlighting a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 6. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation that varies in thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 7. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation which varies in color, wherein the animation highlights a border of one or more of the plurality of cells of the spreadsheet affected by the operation. 8. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises generating an animation which varies in color and thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the spreadsheet affected by the operation. 9. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises shading the one or more of the plurality of cells of the spreadsheet affected by the operation. 10. The computer-implemented method of claim 1, wherein displaying the visual indicator comprises shading one or more column and row headers associated with the one or more of the plurality of cells of the spreadsheet affected by the operation. 11. A computer, comprising:
a processor; and a computer-readable storage medium in communication with the processor, the computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to display a plurality of cells of a table, receive a request to perform an operation on at least one of the plurality of cells of the table, in response to receiving the request to perform the operation, identify one or more of the plurality of cells of the table affected by the operation, and display a visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 12. The computer of claim 11, wherein the computer-readable medium having further computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to:
perform the requested operation; and display a second visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 13. The computer of claim 11, wherein the visual indicator is removed after a pre-determined time period. 14. The computer of claim 11, wherein the computer-readable medium having further computer-executable instructions stored thereupon which, when executed by the processor, cause the processor to:
remove visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation; perform the requested operation; and following performance of the requested operation, display the visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 15. The computer of claim 11, wherein the display of the visual indicator comprises highlighting a border of the one or more of the plurality of cells of the table affected by the operation. 16. The computer of claim 11, wherein the display of the visual indicator comprises generating an animation that varies in thickness, wherein the animation highlights a border of the one or more of the plurality of cells of the table affected by the operation. 17. The computer of claim 11, wherein the display of the visual indicator comprises generating an animation which varies in color, wherein the animation highlights a border of one or more of the plurality of cells of the table affected by the operation. 18. A computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to:
display a spreadsheet comprising a plurality of cells and a table, wherein the table comprises a selection of cells of the plurality of cells, and wherein the selection of cells of the table have one or more associations that are independent from the plurality of cells of the spreadsheet; receive a request to perform an operation on at least one of the selection of cells of the table; in response to receiving the request to perform the operation, identify one or more of the plurality of cells affected by the operation, wherein the identification of the one or more of the plurality of cells affected by the operation is based on the one or more associations; and display a visual indicator to emphasize the one or more of the plurality of cells of the table affected by the operation. 19. The computer-readable storage medium of claim 18, wherein the display of the visual indicator comprises a border configured to graphically highlight the one or more of the plurality of cells affected by the operation. 20. The computer-readable storage medium of claim 18, wherein the display of the visual indicator comprises a shading of the one or more of the plurality of cells affected by the operation. | 2,100 |
5,671 | 5,671 | 15,655,610 | 2,184 | A host device can download a firmware update to a peripheral device having previously enumerated with the host device. The host device can perform link training with the peripheral device in response to a re-enumeration indication received from the peripheral device. The link training can include switching a Link Training and Status State Machine (LTSSM) in the host device from an active state (U0) to an RX.Detect state and synchronizing with the peripheral device in the RX.Detect state. The host device can re-enumerate with the peripheral device utilizing the firmware update after the host device completes link training with the peripheral device. | 1-20. (canceled) 21. A universal serial bus (USB) host system comprising:
a central processing unit (CPU) for controlling communication with a USB device over a bus coupled to the USB host system, the CPU configured initiate an enumeration in response to detection of device on the bus; a memory coupled to the CPU, the memory for storing sampled USB response data from the CPU; a serializer/deserializer coupled to the CPU, the serializer/deserializer for processing outgoing and incoming data from the USB host system; a USB interface coupled to the serializer/deserializer, to the CPU, and to the bus; a universal asynchronous receiver/transmitter (UART) coupled to the USB interface and to the CPU. 22. The USB host system of claim 21, wherein the UART is for over-sampling data received by the USB interface and providing over-sampled data to the CPU. 23. The USB host system of claim 22, wherein the over-sampled data is provided to the CPU from the UART through the serializer/deserializer. 24. The USB host system of claim 21, wherein the memory is for storing pre-count USB data and sampled USB response data. 25. The USB host system of claim 24, wherein the pre-count USB data is transferred to the bus through the USB interface without alteration. | A host device can download a firmware update to a peripheral device having previously enumerated with the host device. The host device can perform link training with the peripheral device in response to a re-enumeration indication received from the peripheral device. The link training can include switching a Link Training and Status State Machine (LTSSM) in the host device from an active state (U0) to an RX.Detect state and synchronizing with the peripheral device in the RX.Detect state. The host device can re-enumerate with the peripheral device utilizing the firmware update after the host device completes link training with the peripheral device.1-20. (canceled) 21. A universal serial bus (USB) host system comprising:
a central processing unit (CPU) for controlling communication with a USB device over a bus coupled to the USB host system, the CPU configured initiate an enumeration in response to detection of device on the bus; a memory coupled to the CPU, the memory for storing sampled USB response data from the CPU; a serializer/deserializer coupled to the CPU, the serializer/deserializer for processing outgoing and incoming data from the USB host system; a USB interface coupled to the serializer/deserializer, to the CPU, and to the bus; a universal asynchronous receiver/transmitter (UART) coupled to the USB interface and to the CPU. 22. The USB host system of claim 21, wherein the UART is for over-sampling data received by the USB interface and providing over-sampled data to the CPU. 23. The USB host system of claim 22, wherein the over-sampled data is provided to the CPU from the UART through the serializer/deserializer. 24. The USB host system of claim 21, wherein the memory is for storing pre-count USB data and sampled USB response data. 25. The USB host system of claim 24, wherein the pre-count USB data is transferred to the bus through the USB interface without alteration. | 2,100 |
5,672 | 5,672 | 13,197,552 | 2,179 | Methods and apparatuses for controlling application programs arc described. A first item and a docking interface having a second item are displayed on a screen space. A selection of the first item is received. A proxy of the first item is positioned over the second item. Next, a window is displayed in response positioning. An application is executing to display the window. In another embodiment, synchronizing a first docking interface on a first screen space of a first machine to a second docking interface on a second screen space of a second machine is performed. The first docking interface has an item that identifies a first application supported by the first machine and the second docking interface has another item that identifies a second application supported by the second machine. | 1. A machine implemented method, comprising:
displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; and displaying a window in response to the positioning, wherein an application is executing to display the window. 2. The method of claim 1, wherein the positioning includes dragging the proxy of the first item. 3. The method of claim 1, wherein the second item represents an application. 4. The method of claim 1, wherein the second item represents a folder. 5. The method of claim 1, wherein the second item represents an Uniform Address Locator (“URL”). 6. The method of claim 1, wherein the displaying the window is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 7. The method of claim 1, wherein the displaying the window includes bringing the window from a back of the screen space to a front of the screen space. 8. The method of claim 1, wherein the displaying the window includes launching the application. 9. The method of claim 1, wherein the displayed interface is a dock, a toolbar, or a dashboard. 10. A machine implemented method, comprising:
displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; positioning the proxy of the first item over the third item; and performing an action identified by the third item. 11. The method of claim 10, wherein the positioning includes dragging the proxy of the first item. 12. The method of claim 10, wherein the action is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 13. The method of claim 10, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item into the second window; and releasing the first item. 14. The method of claim 10, wherein the third item is a menu item. 15. The method of claim 10, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item outside the second window; and removing the second window from the screen space. 16. The method of claim 10, wherein the third item includes a system control interface. 17. The method of claim 10, wherein the third item includes a hidden interface. 18. The method of claim 10, wherein the displayed interface is a dock, a toolbar, or a dashboard. 19. An article of manufacture comprising:
a machine-accessible medium including data that, when accessed by a machine, cause the machine to perform operations comprising,
displaying a first item and a displayed interface having a second item on a screen space;
receiving a selection of the first item;
positioning a proxy of the first item over the second item; and
displaying a window in response to the positioning, wherein an application is executing to display the window. 20. The article of manufacture of claim 19, wherein the positioning includes dragging the proxy of the first item. 21. The article of manufacture of claim 19, wherein the second item represents an application. 22. The article of manufacture of claim 19, wherein the second item represents a folder. 23. The article of manufacture of claim 19, wherein the second item represents an Uniform Address Locator (“URL”). 24. The article of manufacture of claim 19, is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 25. The article of manufacture of claim 19, wherein the displaying the window includes bringing the window from a back of the screen space to a front of the screen space. 26. The article of manufacture of claim 19, wherein the displaying the window includes launching the application. 27. The article of manufacture of claim 19, wherein the displayed interface is a dock, a toolbar, or a dashboard. 28. An article of manufacture comprising:
a machine-accessible medium including data that, when accessed by a machine, cause the machine to perform operations comprising, displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; and displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; positioning the proxy of the first item over the third item; and performing an action identified by the third item. 29. The article of manufacture of c aim 28, wherein the positioning includes dragging the proxy of the first item. 30. The article of manufacture of claim 28, wherein the action is performed when the proxy of the first item is positioned over the third item for a predetermined amount of time. 31. The article of manufacture of claim 28, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item into the second window, and releasing the first item. 32. The article of manufacture of claim 28, wherein the third item is a menu item. 33. The article of manufacture of claim 28, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item outside the second window; and removing the second window from the screen space. 34. The article of manufacture of claim 28, wherein the third item includes a system control interface. 35. The article of manufacture of claim 28, wherein the third item includes a hidden interface. 36. The article of manufacture of claim 28, wherein the displayed interface is a dock, a toolbar, or a dashboard. 37. A system, comprising:
means for displaying a first item and a displayed interface having a second item on a screen space; means for receiving a selection of the first item; means for positioning a proxy of the first item over the second item; and means for displaying a window in response to the positioning, wherein an application is executing to display the window. 38. A system, comprising:
means for displaying a first item and a displayed interface having a second item on a screen space; means for receiving a selection of the first item; means for positioning a proxy of the first item over the second item; and means for displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; means for positioning the proxy of the first item over the third item; and means for performing an action identified by the third item. | Methods and apparatuses for controlling application programs arc described. A first item and a docking interface having a second item are displayed on a screen space. A selection of the first item is received. A proxy of the first item is positioned over the second item. Next, a window is displayed in response positioning. An application is executing to display the window. In another embodiment, synchronizing a first docking interface on a first screen space of a first machine to a second docking interface on a second screen space of a second machine is performed. The first docking interface has an item that identifies a first application supported by the first machine and the second docking interface has another item that identifies a second application supported by the second machine.1. A machine implemented method, comprising:
displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; and displaying a window in response to the positioning, wherein an application is executing to display the window. 2. The method of claim 1, wherein the positioning includes dragging the proxy of the first item. 3. The method of claim 1, wherein the second item represents an application. 4. The method of claim 1, wherein the second item represents a folder. 5. The method of claim 1, wherein the second item represents an Uniform Address Locator (“URL”). 6. The method of claim 1, wherein the displaying the window is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 7. The method of claim 1, wherein the displaying the window includes bringing the window from a back of the screen space to a front of the screen space. 8. The method of claim 1, wherein the displaying the window includes launching the application. 9. The method of claim 1, wherein the displayed interface is a dock, a toolbar, or a dashboard. 10. A machine implemented method, comprising:
displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; positioning the proxy of the first item over the third item; and performing an action identified by the third item. 11. The method of claim 10, wherein the positioning includes dragging the proxy of the first item. 12. The method of claim 10, wherein the action is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 13. The method of claim 10, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item into the second window; and releasing the first item. 14. The method of claim 10, wherein the third item is a menu item. 15. The method of claim 10, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item outside the second window; and removing the second window from the screen space. 16. The method of claim 10, wherein the third item includes a system control interface. 17. The method of claim 10, wherein the third item includes a hidden interface. 18. The method of claim 10, wherein the displayed interface is a dock, a toolbar, or a dashboard. 19. An article of manufacture comprising:
a machine-accessible medium including data that, when accessed by a machine, cause the machine to perform operations comprising,
displaying a first item and a displayed interface having a second item on a screen space;
receiving a selection of the first item;
positioning a proxy of the first item over the second item; and
displaying a window in response to the positioning, wherein an application is executing to display the window. 20. The article of manufacture of claim 19, wherein the positioning includes dragging the proxy of the first item. 21. The article of manufacture of claim 19, wherein the second item represents an application. 22. The article of manufacture of claim 19, wherein the second item represents a folder. 23. The article of manufacture of claim 19, wherein the second item represents an Uniform Address Locator (“URL”). 24. The article of manufacture of claim 19, is performed after the proxy of the first item is positioned over the third item for a predetermined amount of time. 25. The article of manufacture of claim 19, wherein the displaying the window includes bringing the window from a back of the screen space to a front of the screen space. 26. The article of manufacture of claim 19, wherein the displaying the window includes launching the application. 27. The article of manufacture of claim 19, wherein the displayed interface is a dock, a toolbar, or a dashboard. 28. An article of manufacture comprising:
a machine-accessible medium including data that, when accessed by a machine, cause the machine to perform operations comprising, displaying a first item and a displayed interface having a second item on a screen space; receiving a selection of the first item; positioning a proxy of the first item over the second item; and displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; positioning the proxy of the first item over the third item; and performing an action identified by the third item. 29. The article of manufacture of c aim 28, wherein the positioning includes dragging the proxy of the first item. 30. The article of manufacture of claim 28, wherein the action is performed when the proxy of the first item is positioned over the third item for a predetermined amount of time. 31. The article of manufacture of claim 28, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item into the second window, and releasing the first item. 32. The article of manufacture of claim 28, wherein the third item is a menu item. 33. The article of manufacture of claim 28, wherein the performing the action includes
displaying a second window on the screen space; positioning the proxy of the first item outside the second window; and removing the second window from the screen space. 34. The article of manufacture of claim 28, wherein the third item includes a system control interface. 35. The article of manufacture of claim 28, wherein the third item includes a hidden interface. 36. The article of manufacture of claim 28, wherein the displayed interface is a dock, a toolbar, or a dashboard. 37. A system, comprising:
means for displaying a first item and a displayed interface having a second item on a screen space; means for receiving a selection of the first item; means for positioning a proxy of the first item over the second item; and means for displaying a window in response to the positioning, wherein an application is executing to display the window. 38. A system, comprising:
means for displaying a first item and a displayed interface having a second item on a screen space; means for receiving a selection of the first item; means for positioning a proxy of the first item over the second item; and means for displaying a first window having a third item when the proxy of the first item is positioned over the second item, wherein an application is executing to display the first window; means for positioning the proxy of the first item over the third item; and means for performing an action identified by the third item. | 2,100 |
5,673 | 5,673 | 13,485,810 | 2,112 | Generating data checksum for a data object including multiple data units comprises, for each data unit, obtaining a corresponding address of the data unit, and rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit. A checksum value for the data object is determined based on said rotated data units. | 1. A method of generating a checksum for a data object including multiple data units, comprising:
for each data unit:
obtaining a corresponding address of the data unit;
rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit; and
generating a checksum value for the data object based on said rotated data units. 2. The method of claim 1, wherein rotating a data unit comprises:
generating a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 3. The method of claim 2, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 4. The method of claim 2, wherein:
generating a checksum value for the data object comprises generating an exclusive OR of the rotated data units. 5. The method of claim 2, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 6. The method of claim 2, further comprising re-computing a checksum value for the data object when a data segment of the data object is to be modified, said re-computing comprising:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 7. The method of claim 6, wherein:
effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum comprises performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum for the data object comprises performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 8. A system for generating a checksum for a data object including multiple data units, comprising:
a rotation module the rotates a data unit based on a corresponding address of the data unit to generate a rotated data unit; and a checksum module that generates a checksum value for the data object based on said rotated data units. 9. The system of claim 8, wherein the rotation module rotates the data unit by:
utilizing a hash module to generate a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 10. The system of claim 9, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 11. The system of claim 9, wherein:
The checksum module generates a checksum value for the data object by generating an exclusive OR of the rotated data units. 12. The system of claim 9, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 13. The system of claim 9, wherein the checksum module re-computes a checksum value for the data object when a data segment of the data object is to be modified, by:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 14. The system of claim 13, wherein the checksum module:
effectively subtracts the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum by performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adds the first and the second intermediate checksums to generate a re-computed checksum for the data object by performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 15. A computer program product for generating a checksum for a data object including multiple data units, the computer program product comprising:
a tangible storage medium readable by a computer system and storing instructions for execution by the computer system for performing a method comprising: for each data unit:
obtaining a corresponding address of the data unit;
rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit; and
generating a checksum value for the data object based on said rotated data units. 16. The computer program product of claim 15, comprising:
generating a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 17. The computer program product of claim 16, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 18. The computer program product of claim 16, wherein:
generating a checksum value for the data object comprises generating an exclusive OR of the rotated data units. 19. The computer program product of claim 16, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 20. The computer program product of claim 16, further comprising re-computing a checksum value for the data object when a data segment of the data object is to be modified, said re-computing comprising:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 21. The computer program product of claim 20, wherein:
effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum comprises performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum for the data object comprises performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. | Generating data checksum for a data object including multiple data units comprises, for each data unit, obtaining a corresponding address of the data unit, and rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit. A checksum value for the data object is determined based on said rotated data units.1. A method of generating a checksum for a data object including multiple data units, comprising:
for each data unit:
obtaining a corresponding address of the data unit;
rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit; and
generating a checksum value for the data object based on said rotated data units. 2. The method of claim 1, wherein rotating a data unit comprises:
generating a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 3. The method of claim 2, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 4. The method of claim 2, wherein:
generating a checksum value for the data object comprises generating an exclusive OR of the rotated data units. 5. The method of claim 2, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 6. The method of claim 2, further comprising re-computing a checksum value for the data object when a data segment of the data object is to be modified, said re-computing comprising:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 7. The method of claim 6, wherein:
effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum comprises performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum for the data object comprises performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 8. A system for generating a checksum for a data object including multiple data units, comprising:
a rotation module the rotates a data unit based on a corresponding address of the data unit to generate a rotated data unit; and a checksum module that generates a checksum value for the data object based on said rotated data units. 9. The system of claim 8, wherein the rotation module rotates the data unit by:
utilizing a hash module to generate a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 10. The system of claim 9, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 11. The system of claim 9, wherein:
The checksum module generates a checksum value for the data object by generating an exclusive OR of the rotated data units. 12. The system of claim 9, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 13. The system of claim 9, wherein the checksum module re-computes a checksum value for the data object when a data segment of the data object is to be modified, by:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 14. The system of claim 13, wherein the checksum module:
effectively subtracts the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum by performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adds the first and the second intermediate checksums to generate a re-computed checksum for the data object by performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 15. A computer program product for generating a checksum for a data object including multiple data units, the computer program product comprising:
a tangible storage medium readable by a computer system and storing instructions for execution by the computer system for performing a method comprising: for each data unit:
obtaining a corresponding address of the data unit;
rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit; and
generating a checksum value for the data object based on said rotated data units. 16. The computer program product of claim 15, comprising:
generating a hash value from the corresponding address of the data unit using a hashing function; and rotating the data unit by the hash value to generate a rotated data unit. 17. The computer program product of claim 16, wherein:
the hashed value output is in a range between 0 and the bit size of said data unit. 18. The computer program product of claim 16, wherein:
generating a checksum value for the data object comprises generating an exclusive OR of the rotated data units. 19. The computer program product of claim 16, wherein:
the address of each data unit comprises relative offset of the data unit within the data object. 20. The computer program product of claim 16, further comprising re-computing a checksum value for the data object when a data segment of the data object is to be modified, said re-computing comprising:
generating a checksum for said data segment to be modified; effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; generating a checksum for said data segment as modified to generate a second intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum value for the data object. 21. The computer program product of claim 20, wherein:
effectively subtracting the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum comprises performing an exclusive OR of the checksum of said data segment from the checksum of the data object to generate a first intermediate checksum; and adding the first and the second intermediate checksums to generate a re-computed checksum for the data object comprises performing an exclusive OR of the first and the second intermediate checksums to generate a re-computed checksum value for the data object. | 2,100 |
5,674 | 5,674 | 13,781,663 | 2,163 | The subject disclosure is directed towards predicting compressibility of a data block, and using the predicted compressibility in determining whether a data block if compressed will be sufficiently compressible to justify compression. In one aspect, data of the data block is processed to obtain an entropy estimate of the data block, e.g., based upon distinct value estimation. The compressibility prediction may be used in conjunction with a chunking mechanism of a data deduplication system. | 1. In a computing environment, a method, comprising, processing data of a data block to predict compressibility of the data block, including obtaining an entropy estimate corresponding to the data block, determining whether the entropy estimate of the data block is high, and if not, outputting compressibility information that indicates that the data block is predicted to be sufficiently compressible. 2. The method of claim 1 wherein obtaining the entropy estimate comprises estimating a number of distinct values in the data block, and wherein determining whether the entropy estimate of the data block is high comprises evaluating the number of distinct values against a threshold level. 3. The method of claim 2 wherein estimating the number of distinct values comprises performing at least one hash function on at least some of the data of the data block to obtain the number of distinct values. 4. The method of claim 1 further comprising, obtaining the entropy estimate by generating hash values via a plurality of hash functions on at least some of the data of the data block, maintaining representations of the hash values, and processing the representations of the hash values to estimate the number of distinct values in the data block. 5. The method of claim 4 wherein maintaining representations of the hash values comprises maintaining a structure that holds an approximation of accumulated information. 6. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises sampling less than all of the data of the data block. 7. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises performing uniform sampling or non-uniform sampling, or a combination of uniform sampling and non-uniform sampling. 8. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises inferring the compressibility of a chunk based on interpolation or extrapolation of sampled entropy. 9. The method of claim 1 further comprising, determining sampling parameters based at least in part on a file format. 10. The method of claim 1 further comprising, selecting a compression algorithm or no compression based at least in part upon the compressibility information. 11. In a computing environment, a system comprising, a chunking mechanism of a deduplication system, the chunking mechanism configured to chunk data for storage in a chunk store, the chunking mechanism coupled to or incorporating a compression prediction mechanism, the compression prediction mechanism configured to process at least some of the data in a chunk to obtain an estimate of compressibility of the chunk based upon a data entropy estimation. 12. The system of claim 11 wherein the compression prediction mechanism performs entropy estimation based upon distinct value estimation via at least one hash algorithm that hashes the at least some of the data in the chunk into representative values maintained in at least one data structure, and wherein the compression prediction mechanism uses the representative values in each data structure to obtain the estimate of compressibility of the chunk. 13. The system of claim 12 wherein at least one data structure comprises a bitmap, Bloom filter or Bloomier filter. 14. The system of claim 11 wherein the deduplication system includes a compression mechanism that compresses the chunk if the estimate of the compressibility of the chunk achieves a threshold value. 15. The system of claim 14 wherein the compression mechanism uses the estimate of the compressibility of the chunk at least in part as a hint to select a compression algorithm. 16. One or more computer-readable media having computer-executable instructions, which when executed perform steps, comprising, estimating compressibility of a data block, including hashing at least some of the data of the data block into values in a data structure, using the data structure to obtain an estimated data entropy of the data block, and using the estimated data entropy to determine whether to compress the data block. 17. The one or more computer-readable media of claim 16 having further computer-executable instructions comprising, determining from the estimated data entropy that the data block is to be compressed, and compressing the data block. 18. The one or more computer-readable media of claim 17 having further computer-executable instructions comprising, using the estimated data entropy, and zero or more other estimated data entropies, as at least one factor in selecting a compression algorithm for compressing the data block. 19. The one or more computer-readable media of claim 16 wherein using the data structure to obtain an estimated data entropy of the data block comprises tracking distinct values in the data structure, and using a count of the distinct values relative as part of obtaining estimated data entropy. 20. The one or more computer-readable media of claim 16 having further computer-executable instructions comprising sampling data in the data block based upon a sliding window size parameter and a sampling parameter. | The subject disclosure is directed towards predicting compressibility of a data block, and using the predicted compressibility in determining whether a data block if compressed will be sufficiently compressible to justify compression. In one aspect, data of the data block is processed to obtain an entropy estimate of the data block, e.g., based upon distinct value estimation. The compressibility prediction may be used in conjunction with a chunking mechanism of a data deduplication system.1. In a computing environment, a method, comprising, processing data of a data block to predict compressibility of the data block, including obtaining an entropy estimate corresponding to the data block, determining whether the entropy estimate of the data block is high, and if not, outputting compressibility information that indicates that the data block is predicted to be sufficiently compressible. 2. The method of claim 1 wherein obtaining the entropy estimate comprises estimating a number of distinct values in the data block, and wherein determining whether the entropy estimate of the data block is high comprises evaluating the number of distinct values against a threshold level. 3. The method of claim 2 wherein estimating the number of distinct values comprises performing at least one hash function on at least some of the data of the data block to obtain the number of distinct values. 4. The method of claim 1 further comprising, obtaining the entropy estimate by generating hash values via a plurality of hash functions on at least some of the data of the data block, maintaining representations of the hash values, and processing the representations of the hash values to estimate the number of distinct values in the data block. 5. The method of claim 4 wherein maintaining representations of the hash values comprises maintaining a structure that holds an approximation of accumulated information. 6. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises sampling less than all of the data of the data block. 7. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises performing uniform sampling or non-uniform sampling, or a combination of uniform sampling and non-uniform sampling. 8. The method of claim 1 wherein obtaining the entropy estimate of the data block comprises inferring the compressibility of a chunk based on interpolation or extrapolation of sampled entropy. 9. The method of claim 1 further comprising, determining sampling parameters based at least in part on a file format. 10. The method of claim 1 further comprising, selecting a compression algorithm or no compression based at least in part upon the compressibility information. 11. In a computing environment, a system comprising, a chunking mechanism of a deduplication system, the chunking mechanism configured to chunk data for storage in a chunk store, the chunking mechanism coupled to or incorporating a compression prediction mechanism, the compression prediction mechanism configured to process at least some of the data in a chunk to obtain an estimate of compressibility of the chunk based upon a data entropy estimation. 12. The system of claim 11 wherein the compression prediction mechanism performs entropy estimation based upon distinct value estimation via at least one hash algorithm that hashes the at least some of the data in the chunk into representative values maintained in at least one data structure, and wherein the compression prediction mechanism uses the representative values in each data structure to obtain the estimate of compressibility of the chunk. 13. The system of claim 12 wherein at least one data structure comprises a bitmap, Bloom filter or Bloomier filter. 14. The system of claim 11 wherein the deduplication system includes a compression mechanism that compresses the chunk if the estimate of the compressibility of the chunk achieves a threshold value. 15. The system of claim 14 wherein the compression mechanism uses the estimate of the compressibility of the chunk at least in part as a hint to select a compression algorithm. 16. One or more computer-readable media having computer-executable instructions, which when executed perform steps, comprising, estimating compressibility of a data block, including hashing at least some of the data of the data block into values in a data structure, using the data structure to obtain an estimated data entropy of the data block, and using the estimated data entropy to determine whether to compress the data block. 17. The one or more computer-readable media of claim 16 having further computer-executable instructions comprising, determining from the estimated data entropy that the data block is to be compressed, and compressing the data block. 18. The one or more computer-readable media of claim 17 having further computer-executable instructions comprising, using the estimated data entropy, and zero or more other estimated data entropies, as at least one factor in selecting a compression algorithm for compressing the data block. 19. The one or more computer-readable media of claim 16 wherein using the data structure to obtain an estimated data entropy of the data block comprises tracking distinct values in the data structure, and using a count of the distinct values relative as part of obtaining estimated data entropy. 20. The one or more computer-readable media of claim 16 having further computer-executable instructions comprising sampling data in the data block based upon a sliding window size parameter and a sampling parameter. | 2,100 |
5,675 | 5,675 | 15,359,829 | 2,136 | A processor applies a software hint policy to a portion of a cache based on access metrics for different test regions of the cache, wherein each test region applies a different software hint policy for data associated with cache entries in each region of the cache. One test region applies a software hint policy under which software hints are followed. The other test region applies a software hint policy under which software hints are ignored. One of the software hint policies is selected for application to a non-test region of the cache. | 1. A method, comprising:
in response to receiving a first request for data associated with a software hint at a first region of a cache, following the software hint based on a first hint policy associated with the first region of the cache; in response to receiving a second request for data associated with a software hint at a second region of the cache, ignoring the software hint based on a second hint policy associated with the second region of the cache; selecting one of the first hint policy and the second hint policy as a software hint policy for a third region of the cache; and in response to receiving a third request for data associated with a software hint at the third region of the cache, selectively following or ignoring the software hint based on the software hint policy selected for the third region of the cache. 2. The method of claim 1, further comprising:
measuring a first performance characteristic for the first region of the cache and a second performance characteristic for the second region of the cache; and selecting the software hint policy for a third region of the cache based on the first performance characteristic and the second performance characteristic. 3. The method of claim 2, wherein the software hint is to prefetch data to the cache based on a prediction that the data will be subsequently requested within a threshold period of time. 4. The method of claim 2, wherein the software hint is to bypass the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 5. The method of claim 2, wherein the software hint is to store data in a designated entry of the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 6. The method of claim 2, wherein:
data is selected for replacement from the cache based on an age of the data; and the software hint is to assign an older age to data that is predicted to be subsequently requested after a threshold period of time. 7. The method of claim 2, wherein:
the first performance characteristic comprises a cache hit rate at the first region of the cache; and the second performance characteristic comprises a cache hit rate at the second region of the cache. 8. The method of claim 2, wherein:
the first performance characteristic comprises a cache miss rate at the first region of the cache; and the second performance characteristic comprises a cache miss rate at the second region of the cache. 9. The method of claim 2, wherein:
the first performance characteristic comprises a first weighted sum of a cache hit rate at the first region of the cache and a cache miss rate at the first region of the cache; and the second performance characteristic comprises a second weighted sum of a cache hit rate at the second region of the cache and a cache miss rate at the second region of the cache. 10. A method, comprising:
at a first region of a cache, applying a first software hint policy of following a software hint associated with a request for data; at a second region of the cache, applying a second software hint policy of ignoring a software hint associated with a request for data; and at a third region of the cache, selecting between the applying the first software hint policy and the second software hint policy based on performance characteristics for the first region and the second region. 11. The method of claim 10, wherein the software hint is to prefetch data to the cache based on a prediction that the data will be subsequently requested within a threshold period of time. 12. The method of claim 10, wherein the software hint is to bypass the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 13. The method of claim 10, wherein the software hint is to store data in a designated entry of the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 14. The method of claim 10, wherein:
data is selected for replacement from the cache based on an age of the data; and the software hint is to assign an older age to data that is predicted to be subsequently requested after a threshold period of time. 15. A processor, comprising:
a processor core; a cache comprising a first region, a second region, and a third region; a performance monitor to measure a first performance characteristic for the first region and a second performance characteristic for the second region; and a cache controller configured to:
at the first region, apply a first software hint policy of following a software hint associated with a request for data;
at a second region, apply a second software hint policy of ignoring a software hint associated with a request for data; and
at the third region, apply a third software hint policy of following or ignoring a software hint based on the first performance characteristic and the second performance characteristic. 16. The processor of claim 15, wherein the software hint is to:
prefetch data to the cache based on a prediction that the data will be subsequently requested by the processor core within a threshold period of time. 17. The processor of claim 15, wherein the software hint is to:
bypass the cache based on a prediction that the data will be subsequently requested by the processor core after a threshold period of time. 18. The processor of claim 15, wherein the software hint is to:
store data at a designated cache entry based on a prediction that the data will be subsequently requested by the processor core after a threshold period of time. 19. The processor of claim 15, wherein:
the first performance characteristic comprises a cache hit rate at the first region; and the second performance characteristic comprises a cache hit rate at the second region. 20. The processor of claim 15, wherein:
the first performance characteristic comprises a cache miss rate at the first region; and the second performance characteristic comprises a cache miss rate at the second region. | A processor applies a software hint policy to a portion of a cache based on access metrics for different test regions of the cache, wherein each test region applies a different software hint policy for data associated with cache entries in each region of the cache. One test region applies a software hint policy under which software hints are followed. The other test region applies a software hint policy under which software hints are ignored. One of the software hint policies is selected for application to a non-test region of the cache.1. A method, comprising:
in response to receiving a first request for data associated with a software hint at a first region of a cache, following the software hint based on a first hint policy associated with the first region of the cache; in response to receiving a second request for data associated with a software hint at a second region of the cache, ignoring the software hint based on a second hint policy associated with the second region of the cache; selecting one of the first hint policy and the second hint policy as a software hint policy for a third region of the cache; and in response to receiving a third request for data associated with a software hint at the third region of the cache, selectively following or ignoring the software hint based on the software hint policy selected for the third region of the cache. 2. The method of claim 1, further comprising:
measuring a first performance characteristic for the first region of the cache and a second performance characteristic for the second region of the cache; and selecting the software hint policy for a third region of the cache based on the first performance characteristic and the second performance characteristic. 3. The method of claim 2, wherein the software hint is to prefetch data to the cache based on a prediction that the data will be subsequently requested within a threshold period of time. 4. The method of claim 2, wherein the software hint is to bypass the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 5. The method of claim 2, wherein the software hint is to store data in a designated entry of the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 6. The method of claim 2, wherein:
data is selected for replacement from the cache based on an age of the data; and the software hint is to assign an older age to data that is predicted to be subsequently requested after a threshold period of time. 7. The method of claim 2, wherein:
the first performance characteristic comprises a cache hit rate at the first region of the cache; and the second performance characteristic comprises a cache hit rate at the second region of the cache. 8. The method of claim 2, wherein:
the first performance characteristic comprises a cache miss rate at the first region of the cache; and the second performance characteristic comprises a cache miss rate at the second region of the cache. 9. The method of claim 2, wherein:
the first performance characteristic comprises a first weighted sum of a cache hit rate at the first region of the cache and a cache miss rate at the first region of the cache; and the second performance characteristic comprises a second weighted sum of a cache hit rate at the second region of the cache and a cache miss rate at the second region of the cache. 10. A method, comprising:
at a first region of a cache, applying a first software hint policy of following a software hint associated with a request for data; at a second region of the cache, applying a second software hint policy of ignoring a software hint associated with a request for data; and at a third region of the cache, selecting between the applying the first software hint policy and the second software hint policy based on performance characteristics for the first region and the second region. 11. The method of claim 10, wherein the software hint is to prefetch data to the cache based on a prediction that the data will be subsequently requested within a threshold period of time. 12. The method of claim 10, wherein the software hint is to bypass the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 13. The method of claim 10, wherein the software hint is to store data in a designated entry of the cache based on a prediction that the data will be subsequently requested after a threshold period of time. 14. The method of claim 10, wherein:
data is selected for replacement from the cache based on an age of the data; and the software hint is to assign an older age to data that is predicted to be subsequently requested after a threshold period of time. 15. A processor, comprising:
a processor core; a cache comprising a first region, a second region, and a third region; a performance monitor to measure a first performance characteristic for the first region and a second performance characteristic for the second region; and a cache controller configured to:
at the first region, apply a first software hint policy of following a software hint associated with a request for data;
at a second region, apply a second software hint policy of ignoring a software hint associated with a request for data; and
at the third region, apply a third software hint policy of following or ignoring a software hint based on the first performance characteristic and the second performance characteristic. 16. The processor of claim 15, wherein the software hint is to:
prefetch data to the cache based on a prediction that the data will be subsequently requested by the processor core within a threshold period of time. 17. The processor of claim 15, wherein the software hint is to:
bypass the cache based on a prediction that the data will be subsequently requested by the processor core after a threshold period of time. 18. The processor of claim 15, wherein the software hint is to:
store data at a designated cache entry based on a prediction that the data will be subsequently requested by the processor core after a threshold period of time. 19. The processor of claim 15, wherein:
the first performance characteristic comprises a cache hit rate at the first region; and the second performance characteristic comprises a cache hit rate at the second region. 20. The processor of claim 15, wherein:
the first performance characteristic comprises a cache miss rate at the first region; and the second performance characteristic comprises a cache miss rate at the second region. | 2,100 |
5,676 | 5,676 | 15,866,174 | 2,153 | Systems, methods and devices are provided for suppressing and utilizing a SERP. Upon generating and sending a search query to a search engine, a browser will receive search results from the search engine based on the search query, the search results comprising a SERP (search engine result page). Then, prior to and without rendering the SERP, the browser will identify a particular webpage identified in the search results. That webpage will be accessed and displayed automatically, prior to displaying the SERP, while a one input link to the SERP will also be displayed concurrently with the webpage. | 1. A computer-implemented method implemented by a browser for suppressing and utilizing a SERP (search engine results page), the method comprising:
generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 2. The method of claim 1, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 3. The method of claim 1, wherein the one input link comprises an undisplayed swipe gesture link. 4. The method of claim 1, wherein the one input link comprises a displayed object. 5. The method of claim 1, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 6. The method of claim 1, wherein the method further includes parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP. 7. The method of claim 6, wherein the method further includes navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. 8. A computer program product comprising one or more storage devices having stored computer-executable instructions which are executable by one or more processors of a computing system for causing the computing system to implement a method for suppressing and utilizing a SERP (search engine results page), wherein the method comprises the computing system:
generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 9. The computer program product of claim 8, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 10. The computer program product of claim 8, wherein the one input link comprises an undisplayed swipe gesture link. 11. The computer program product of claim 8, wherein the one input link comprises a displayed object. 12. The computer program product of claim 8, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 13. The computer program product of claim 8, wherein the method further includes:
parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP; and navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. 14. A computing system comprising:
one or more processors; and one or more storage devices having stored computer-executable instructions which are executable by the one or more processors for causing the computing system to implement a method for suppressing and utilizing a SERP (search engine results page), the method comprising: generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 15. The computing system of claim 14, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 16. The computing system of claim 14, wherein the one input link comprises an undisplayed swipe gesture link. 17. The computing system of claim 14, wherein the one input link comprises a 18. The computing system of claim 14, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 19. The computing system of claim 14, wherein the method further includes parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP. 20. The computing system of claim 19, wherein the method further includes navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. | Systems, methods and devices are provided for suppressing and utilizing a SERP. Upon generating and sending a search query to a search engine, a browser will receive search results from the search engine based on the search query, the search results comprising a SERP (search engine result page). Then, prior to and without rendering the SERP, the browser will identify a particular webpage identified in the search results. That webpage will be accessed and displayed automatically, prior to displaying the SERP, while a one input link to the SERP will also be displayed concurrently with the webpage.1. A computer-implemented method implemented by a browser for suppressing and utilizing a SERP (search engine results page), the method comprising:
generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 2. The method of claim 1, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 3. The method of claim 1, wherein the one input link comprises an undisplayed swipe gesture link. 4. The method of claim 1, wherein the one input link comprises a displayed object. 5. The method of claim 1, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 6. The method of claim 1, wherein the method further includes parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP. 7. The method of claim 6, wherein the method further includes navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. 8. A computer program product comprising one or more storage devices having stored computer-executable instructions which are executable by one or more processors of a computing system for causing the computing system to implement a method for suppressing and utilizing a SERP (search engine results page), wherein the method comprises the computing system:
generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 9. The computer program product of claim 8, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 10. The computer program product of claim 8, wherein the one input link comprises an undisplayed swipe gesture link. 11. The computer program product of claim 8, wherein the one input link comprises a displayed object. 12. The computer program product of claim 8, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 13. The computer program product of claim 8, wherein the method further includes:
parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP; and navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. 14. A computing system comprising:
one or more processors; and one or more storage devices having stored computer-executable instructions which are executable by the one or more processors for causing the computing system to implement a method for suppressing and utilizing a SERP (search engine results page), the method comprising: generating and sending a search query to a search engine; receiving search results from the search engine based on the search query, the search results comprising a SERP (search engine result page); prior to and without rendering the SERP, identifying a particular webpage identified in the search results; and accessing and displaying the particular webpage automatically while also providing a one input link to the SERP from a display of the particular webpage. 15. The computing system of claim 14, wherein the search query is based on user input entered at an interface of the search engine hosted by a first domain and wherein the particular webpage is rendered independently from the first domain and by a second domain. 16. The computing system of claim 14, wherein the one input link comprises an undisplayed swipe gesture link. 17. The computing system of claim 14, wherein the one input link comprises a 18. The computing system of claim 14, wherein the method further includes presenting a link to one or more different webpages identified in the particular listing of webpages while simultaneously displaying the particular webpage and the one input link to the SERP. 19. The computing system of claim 14, wherein the method further includes parsing the SERP and generating a new parsed index of webpage links that comprises a subset webpage links from a listing of webpage links identified by the SERP and which omits at least one webpage link identified by the SERP. 20. The computing system of claim 19, wherein the method further includes navigating forward or backward between different webpages associated with the webpage links in response to user input entered at the browser based on a sequence of the listing of webpage links defined by the new parsed index, rather than a different sequence of the listing of webpage links defined by the SERP, while refraining from displaying the new parsed index. | 2,100 |
5,677 | 5,677 | 14,706,760 | 2,183 | A plurality of storage nodes communicating as a storage cluster is provided. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage, wherein the plurality of storage nodes is configured as a plurality of logical arrays. At least one storage node of the plurality of storage nodes is designated as able to be removed from one of the plurality of logical arrays and at least one storage node of the plurality of storage nodes is designated as prevented from being removed from one of the plurality of logical arrays. | 1. A plurality of storage nodes communicating as a storage cluster, comprising:
each of the plurality of storage nodes having nonvolatile solid-state memory, wherein the plurality of storage nodes are configured as a plurality of logical arrays; at least one storage node of the plurality of storage nodes designated as able to be removed from one of the plurality of logical arrays; and at least one storage node of the plurality of storage nodes designated as prevented from being removed from one of the plurality of logical arrays. 2. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is assigned to a differing logical array of the plurality of logical arrays. 3. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is maintained in an unassigned state upon removal. 4. The plurality of storage nodes of claim 1, wherein the storage cluster is contained in a single chassis. 5. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is configured so that data and metadata of the at least one storage node is evacuated prior to removal from the one of the plurality of arrays and wherein the data and the metadata evacuated from the at least one storage node is redistributed into the storage cluster. 6. The plurality of storage nodes of claim 1, wherein the plurality of storage nodes is configured to determine when any of the storage nodes is removed from the storage cluster and when a storage node is added to the storage cluster. 7. The plurality of storage nodes of claim 1, wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. 8. A storage cluster, comprising:
a plurality of storage nodes configured as at least one logical storage cluster; each of the plurality of storage nodes having nonvolatile solid-state memory; a first portion of storage nodes of the plurality of storage nodes configured with capability of each storage node of the first portion of storage nodes being removable as a logical construct from the at least one logical storage cluster; and a second portion of storage nodes of the plurality of storage nodes identified as being prevented from being removed from the at least one logical storage cluster. 9. The storage cluster of claim 8, further comprising:
the plurality of storage nodes distributed within multiple chassis and wherein the capability of being removed as a logical construct from the plurality of storage nodes includes capability of being coupled to the plurality of storage nodes in an unassigned state as reserve physical capacity. 10. The storage cluster of claim 8, wherein the storage cluster is housed within a single chassis and wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. 11. The storage cluster of claim 10, wherein the single chassis is an enclosure with internal power distribution and an internal communication bus coupling the plurality of storage nodes. 12. The storage cluster of claim 8, wherein the plurality of storage nodes is configured to evacuate at least one storage node, of the first portion of storage nodes, of data or metadata prior to removal of the at least one storage node as a logical construct from the at least one logical storage cluster. 13. The storage cluster of claim 8, wherein the plurality of storage nodes is configured to determine when one of the plurality of storage nodes is removed as a logical construct from the at least one logical storage cluster and when a storage node is added as a logical construct to the at least one logical storage cluster. 14. The storage cluster of claim 8, wherein removal of at least one storage node as a logical construct from the at least one logical storage cluster triggers discontinuing billing to an account for any storage nodes removed as a logical construct from the at least one logical storage cluster and associated with the account. 15. A method, performed by at least one processor, for managing physical capacity in a plurality of storage nodes having nonvolatile solid-state memory, comprising:
coupling the plurality of storage nodes as a storage cluster; assigning a first portion of storage nodes of the plurality of storage nodes as removable as a logical construct from the plurality of storage nodes; and assigning a second portion of storage nodes of the plurality of storage nodes as unable to be removed as a logical construct from the plurality of storage nodes. 16. The method of claim 15, wherein the coupling further comprises:
assigning the plurality of storage nodes to at least two logical arrays. 17. The method of claim 15, further comprising:
evacuating data and metadata from a storage node of the first portion of storage nodes; and designating the storage node of the first portion of storage nodes as unassigned to the storage cluster. 18. The method of claim 15, further comprising:
receiving a request to remove one of the plurality of storage nodes, as a logical construct, from the plurality of storage nodes; and determining if the one of the plurality of storage nodes is assigned to the first portion or assigned to the second portion. 19. The method of claim 15, further comprising:
receiving a request to remove a storage node of the first portion of storage nodes, as a logical construct, from the plurality of storage nodes; and adjusting a billing plan of a client associated with the storage node of the first portion of storage nodes to reflect removal of the storage node. 20. The method of claim 15, wherein the storage cluster is contained within a single chassis and wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. | A plurality of storage nodes communicating as a storage cluster is provided. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage, wherein the plurality of storage nodes is configured as a plurality of logical arrays. At least one storage node of the plurality of storage nodes is designated as able to be removed from one of the plurality of logical arrays and at least one storage node of the plurality of storage nodes is designated as prevented from being removed from one of the plurality of logical arrays.1. A plurality of storage nodes communicating as a storage cluster, comprising:
each of the plurality of storage nodes having nonvolatile solid-state memory, wherein the plurality of storage nodes are configured as a plurality of logical arrays; at least one storage node of the plurality of storage nodes designated as able to be removed from one of the plurality of logical arrays; and at least one storage node of the plurality of storage nodes designated as prevented from being removed from one of the plurality of logical arrays. 2. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is assigned to a differing logical array of the plurality of logical arrays. 3. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is maintained in an unassigned state upon removal. 4. The plurality of storage nodes of claim 1, wherein the storage cluster is contained in a single chassis. 5. The plurality of storage nodes of claim 1, wherein the at least one storage node of the plurality of storage nodes designated as able to be removed is configured so that data and metadata of the at least one storage node is evacuated prior to removal from the one of the plurality of arrays and wherein the data and the metadata evacuated from the at least one storage node is redistributed into the storage cluster. 6. The plurality of storage nodes of claim 1, wherein the plurality of storage nodes is configured to determine when any of the storage nodes is removed from the storage cluster and when a storage node is added to the storage cluster. 7. The plurality of storage nodes of claim 1, wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. 8. A storage cluster, comprising:
a plurality of storage nodes configured as at least one logical storage cluster; each of the plurality of storage nodes having nonvolatile solid-state memory; a first portion of storage nodes of the plurality of storage nodes configured with capability of each storage node of the first portion of storage nodes being removable as a logical construct from the at least one logical storage cluster; and a second portion of storage nodes of the plurality of storage nodes identified as being prevented from being removed from the at least one logical storage cluster. 9. The storage cluster of claim 8, further comprising:
the plurality of storage nodes distributed within multiple chassis and wherein the capability of being removed as a logical construct from the plurality of storage nodes includes capability of being coupled to the plurality of storage nodes in an unassigned state as reserve physical capacity. 10. The storage cluster of claim 8, wherein the storage cluster is housed within a single chassis and wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. 11. The storage cluster of claim 10, wherein the single chassis is an enclosure with internal power distribution and an internal communication bus coupling the plurality of storage nodes. 12. The storage cluster of claim 8, wherein the plurality of storage nodes is configured to evacuate at least one storage node, of the first portion of storage nodes, of data or metadata prior to removal of the at least one storage node as a logical construct from the at least one logical storage cluster. 13. The storage cluster of claim 8, wherein the plurality of storage nodes is configured to determine when one of the plurality of storage nodes is removed as a logical construct from the at least one logical storage cluster and when a storage node is added as a logical construct to the at least one logical storage cluster. 14. The storage cluster of claim 8, wherein removal of at least one storage node as a logical construct from the at least one logical storage cluster triggers discontinuing billing to an account for any storage nodes removed as a logical construct from the at least one logical storage cluster and associated with the account. 15. A method, performed by at least one processor, for managing physical capacity in a plurality of storage nodes having nonvolatile solid-state memory, comprising:
coupling the plurality of storage nodes as a storage cluster; assigning a first portion of storage nodes of the plurality of storage nodes as removable as a logical construct from the plurality of storage nodes; and assigning a second portion of storage nodes of the plurality of storage nodes as unable to be removed as a logical construct from the plurality of storage nodes. 16. The method of claim 15, wherein the coupling further comprises:
assigning the plurality of storage nodes to at least two logical arrays. 17. The method of claim 15, further comprising:
evacuating data and metadata from a storage node of the first portion of storage nodes; and designating the storage node of the first portion of storage nodes as unassigned to the storage cluster. 18. The method of claim 15, further comprising:
receiving a request to remove one of the plurality of storage nodes, as a logical construct, from the plurality of storage nodes; and determining if the one of the plurality of storage nodes is assigned to the first portion or assigned to the second portion. 19. The method of claim 15, further comprising:
receiving a request to remove a storage node of the first portion of storage nodes, as a logical construct, from the plurality of storage nodes; and adjusting a billing plan of a client associated with the storage node of the first portion of storage nodes to reflect removal of the storage node. 20. The method of claim 15, wherein the storage cluster is contained within a single chassis and wherein the plurality of storage nodes is configured to distribute user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data, via erasure coding, with a failure of one of the plurality of storage nodes. | 2,100 |
5,678 | 5,678 | 13,671,626 | 2,163 | Methods and systems for sourcing supplemental content are disclosed. Secondary devices may be used to identify content streaming on first screen devices and to generate supplemental data for the content. In this manner, users may be leveraged to create various data for a variety of content. The data may be collected and organized so that users watching content at a later time may have access to the data. Methods and systems for using second screen devices to access metadata created by the crowd are also disclosed. | 1. A method, comprising:
receiving, from a user device, supplemental data associated with primary content, wherein said supplemental data is related to a particular portion of the primary content by associating said supplemental data with audio data from said primary content; and providing data tags to associate said supplemental data to particular portions of said primary content. 2. The method of claim 1, wherein the user device is configured to allow a user to enter said supplemental data and to detect the audio data from audio, which is output through another user device configured to present the primary content. 3. The method of claim 1, wherein the audio data includes an audio profile, representing audio of the primary content, detected at a time to which the supplemental data applies. 4. The method of claim 1, wherein the audio data includes an audio sampling of the primary content taken at a time to which the supplemental data applies. 5. The method of claim 1, further comprising identifying the primary content to which the supplemental data applies based on the audio data. 6. The method of claim 1, further comprising filtering the supplemental data based on identity of the users submitting the supplemental data. 7. The method of claim 1, further comprising filtering the supplemental data based on comparisons of textual comment data included in the supplemental data. 8. The method of claim 1, further comprising ranking the data tags based on identity of the users submitting the corresponding supplemental data. 9. The method of claim 1, further comprising storing genre information specifying a genre for each of the data tags. 10. A method, comprising:
detecting, by a second device, an audio profile from an audio portion of content being presented on a first device; receiving, by the second device, a user input including secondary information related to the content; correlating the user input with the audio profile to associate the secondary information with a particular portion of the content; and generating a message to represent said association. 11. The method of claim 10, wherein the message includes metadata of the content and the detected audio profile. 12. The method of claim 10, further comprising:
identifying the content based on the detected audio profile to generate content identification information; and determining a time point in the content at which the user input is received, wherein the message includes the content identification information, the time point, and the secondary information. 13. The method of claim 12, wherein the identifying of the content comprises:
transmitting the detected audio profile to a third device; and receiving the content identification information from the third device in response to transmitting the detected audio profile. 14. The method of claim 10, further comprising:
identifying the content based on the detected audio profile to generate content identification information; and determining a real time point at which the user input is received, wherein the message includes the content identification information, the real time point, and the secondary information. 15. The method of claim 10, further comprising receiving a response indicating whether the message was accepted or rejected. 16. A method, comprising:
providing content to a first user device; receiving, from a second user device, a message comprising audio profile data and supplemental data, wherein said audio profile data correlates said supplemental data to a particular portion of said content; identifying the content based on the audio profile data; and associating said supplemental data with the particular portion of said content. 17. The method of claim 16, further comprising:
receiving, from the second user device, a metadata request comprising an audio profile representing audio of the content at a specific time point within the content; retrieving one or more metadata tags based on the audio profile of the metadata request; and transmitting the one or more retrieved metadata tags to the second user device, wherein the one or more transmitted metadata tags include metadata for the specific time point within the content. 18. The method of claim 17, wherein the one or more transmitted metadata tags are ordered based on a user profile associated with the second user device. 19. The method of claim 17, wherein the one or more transmitted metadata tags are ordered based on priority levels of users who provided the metadata. 20. The method of claim 17, wherein the one or more transmitted metadata tags are transmitted in synchronization with the content playing on the first user device. | Methods and systems for sourcing supplemental content are disclosed. Secondary devices may be used to identify content streaming on first screen devices and to generate supplemental data for the content. In this manner, users may be leveraged to create various data for a variety of content. The data may be collected and organized so that users watching content at a later time may have access to the data. Methods and systems for using second screen devices to access metadata created by the crowd are also disclosed.1. A method, comprising:
receiving, from a user device, supplemental data associated with primary content, wherein said supplemental data is related to a particular portion of the primary content by associating said supplemental data with audio data from said primary content; and providing data tags to associate said supplemental data to particular portions of said primary content. 2. The method of claim 1, wherein the user device is configured to allow a user to enter said supplemental data and to detect the audio data from audio, which is output through another user device configured to present the primary content. 3. The method of claim 1, wherein the audio data includes an audio profile, representing audio of the primary content, detected at a time to which the supplemental data applies. 4. The method of claim 1, wherein the audio data includes an audio sampling of the primary content taken at a time to which the supplemental data applies. 5. The method of claim 1, further comprising identifying the primary content to which the supplemental data applies based on the audio data. 6. The method of claim 1, further comprising filtering the supplemental data based on identity of the users submitting the supplemental data. 7. The method of claim 1, further comprising filtering the supplemental data based on comparisons of textual comment data included in the supplemental data. 8. The method of claim 1, further comprising ranking the data tags based on identity of the users submitting the corresponding supplemental data. 9. The method of claim 1, further comprising storing genre information specifying a genre for each of the data tags. 10. A method, comprising:
detecting, by a second device, an audio profile from an audio portion of content being presented on a first device; receiving, by the second device, a user input including secondary information related to the content; correlating the user input with the audio profile to associate the secondary information with a particular portion of the content; and generating a message to represent said association. 11. The method of claim 10, wherein the message includes metadata of the content and the detected audio profile. 12. The method of claim 10, further comprising:
identifying the content based on the detected audio profile to generate content identification information; and determining a time point in the content at which the user input is received, wherein the message includes the content identification information, the time point, and the secondary information. 13. The method of claim 12, wherein the identifying of the content comprises:
transmitting the detected audio profile to a third device; and receiving the content identification information from the third device in response to transmitting the detected audio profile. 14. The method of claim 10, further comprising:
identifying the content based on the detected audio profile to generate content identification information; and determining a real time point at which the user input is received, wherein the message includes the content identification information, the real time point, and the secondary information. 15. The method of claim 10, further comprising receiving a response indicating whether the message was accepted or rejected. 16. A method, comprising:
providing content to a first user device; receiving, from a second user device, a message comprising audio profile data and supplemental data, wherein said audio profile data correlates said supplemental data to a particular portion of said content; identifying the content based on the audio profile data; and associating said supplemental data with the particular portion of said content. 17. The method of claim 16, further comprising:
receiving, from the second user device, a metadata request comprising an audio profile representing audio of the content at a specific time point within the content; retrieving one or more metadata tags based on the audio profile of the metadata request; and transmitting the one or more retrieved metadata tags to the second user device, wherein the one or more transmitted metadata tags include metadata for the specific time point within the content. 18. The method of claim 17, wherein the one or more transmitted metadata tags are ordered based on a user profile associated with the second user device. 19. The method of claim 17, wherein the one or more transmitted metadata tags are ordered based on priority levels of users who provided the metadata. 20. The method of claim 17, wherein the one or more transmitted metadata tags are transmitted in synchronization with the content playing on the first user device. | 2,100 |
5,679 | 5,679 | 15,336,018 | 2,184 | At least one example embodiment provides a method for transferring a request in a storage device. The method includes generating an asynchronous command completion that corresponds to an asynchronous event request command and has a wall clock time request, receiving a set features command having a timestamp, the set features command corresponding to the asynchronous command completion, and updating the wall clock time using the timestamp. | 1. A method for transferring a request in a storage device, the method comprising:
generating an asynchronous command completion corresponding to at least one asynchronous event request command, the asynchronous command completion including a wall clock time request; receiving a set features command corresponding to the asynchronous command completion, the set features command having a timestamp; and updating a wall clock time using the timestamp. 2. The method of claim 1, further comprising:
receiving the at least one asynchronous event request command. 3. The method of claim 1, further comprising:
determining whether to use the wall clock time. 4. The method of claim 3, wherein the determining is based on an internal policy of the storage device. 5. The method of claim 3, wherein the determining is based on a wake-up command received from a host. 6. The method of claim 3, wherein the determining determines whether to use the wall clock time at a power-up of the storage device. 7. The method of claim 1, wherein the generating:
generates the asynchronous command completion after (i) determination of whether a host includes a function of parsing the asynchronous command completion having the wall clock time or (ii) an authentication of the host. 8. The method of claim 1, wherein the asynchronous command completion includes three bits indicating a type, five bits of a first reserved area, seven bits indicating a timestamp request corresponding to the wall clock time request, eight bits indicating a log page identifier, and eight bits of a second reserved area. 9. The method of claim 1, further comprising:
determining whether to request the at least one asynchronous event request command. 10. The method of claim 9, further comprising:
requesting a host to issue the at least one asynchronous event request command when a number of other asynchronous event request commands stored in the storage device is smaller than a reference value, the requesting including, sending a request associated with an issue of the at least one asynchronous event request command to the host through another asynchronous command completion. 11. The method of claim 10, further comprising:
fetching the at least one asynchronous event request command from the host in response to the another asynchronous command completion. 12. A method for transferring a request in a storage device, the method comprising:
receiving an asynchronous event request command; determining whether to obtain a protocol version about the storage device; generating an asynchronous command completion, based on the determining, the asynchronous command completion corresponding to the asynchronous event request command, the asynchronous command completion including a protocol version request; receiving a set features command having protocol version information, the set features command corresponding to the asynchronous command completion; and operating the storage device using the protocol version information. 13. The method of claim 12, wherein the determining determines whether to obtain the protocol version at a power-up of the storage device. 14. The method of claim 12, wherein the asynchronous command completion includes three bits indicating a type, five bits of a first reserved area, seven bits indicating the protocol version request, eight bits indicating a log page identifier, and eight bits of a second reserved area. 15. A method for issuing a command by a host, the method comprising:
receiving an asynchronous command completion, the asynchronous command completion having a device request from a storage device; parsing the device request in response to the asynchronous command completion and issuing a synchronous command corresponding to the device request; and receiving a synchronous command completion corresponding to the synchronous command. 16. The method of claim 15, wherein an asynchronous command is an asynchronous event request command. 17. The method of claim 16, further comprising:
maintaining a number of asynchronous event request commands issued at a reference value. 18. The method of claim 15, wherein the synchronous command is a set features command. 19. The method of claim 15, wherein the storage device is a solid state drive (SSD), and
the SSD includes at least one NAND flash memory device. 20. The method of claim 15, wherein the host and the storage device are interconnected through a peripheral component interconnect express (PCIe) interface. 21-25. (canceled) | At least one example embodiment provides a method for transferring a request in a storage device. The method includes generating an asynchronous command completion that corresponds to an asynchronous event request command and has a wall clock time request, receiving a set features command having a timestamp, the set features command corresponding to the asynchronous command completion, and updating the wall clock time using the timestamp.1. A method for transferring a request in a storage device, the method comprising:
generating an asynchronous command completion corresponding to at least one asynchronous event request command, the asynchronous command completion including a wall clock time request; receiving a set features command corresponding to the asynchronous command completion, the set features command having a timestamp; and updating a wall clock time using the timestamp. 2. The method of claim 1, further comprising:
receiving the at least one asynchronous event request command. 3. The method of claim 1, further comprising:
determining whether to use the wall clock time. 4. The method of claim 3, wherein the determining is based on an internal policy of the storage device. 5. The method of claim 3, wherein the determining is based on a wake-up command received from a host. 6. The method of claim 3, wherein the determining determines whether to use the wall clock time at a power-up of the storage device. 7. The method of claim 1, wherein the generating:
generates the asynchronous command completion after (i) determination of whether a host includes a function of parsing the asynchronous command completion having the wall clock time or (ii) an authentication of the host. 8. The method of claim 1, wherein the asynchronous command completion includes three bits indicating a type, five bits of a first reserved area, seven bits indicating a timestamp request corresponding to the wall clock time request, eight bits indicating a log page identifier, and eight bits of a second reserved area. 9. The method of claim 1, further comprising:
determining whether to request the at least one asynchronous event request command. 10. The method of claim 9, further comprising:
requesting a host to issue the at least one asynchronous event request command when a number of other asynchronous event request commands stored in the storage device is smaller than a reference value, the requesting including, sending a request associated with an issue of the at least one asynchronous event request command to the host through another asynchronous command completion. 11. The method of claim 10, further comprising:
fetching the at least one asynchronous event request command from the host in response to the another asynchronous command completion. 12. A method for transferring a request in a storage device, the method comprising:
receiving an asynchronous event request command; determining whether to obtain a protocol version about the storage device; generating an asynchronous command completion, based on the determining, the asynchronous command completion corresponding to the asynchronous event request command, the asynchronous command completion including a protocol version request; receiving a set features command having protocol version information, the set features command corresponding to the asynchronous command completion; and operating the storage device using the protocol version information. 13. The method of claim 12, wherein the determining determines whether to obtain the protocol version at a power-up of the storage device. 14. The method of claim 12, wherein the asynchronous command completion includes three bits indicating a type, five bits of a first reserved area, seven bits indicating the protocol version request, eight bits indicating a log page identifier, and eight bits of a second reserved area. 15. A method for issuing a command by a host, the method comprising:
receiving an asynchronous command completion, the asynchronous command completion having a device request from a storage device; parsing the device request in response to the asynchronous command completion and issuing a synchronous command corresponding to the device request; and receiving a synchronous command completion corresponding to the synchronous command. 16. The method of claim 15, wherein an asynchronous command is an asynchronous event request command. 17. The method of claim 16, further comprising:
maintaining a number of asynchronous event request commands issued at a reference value. 18. The method of claim 15, wherein the synchronous command is a set features command. 19. The method of claim 15, wherein the storage device is a solid state drive (SSD), and
the SSD includes at least one NAND flash memory device. 20. The method of claim 15, wherein the host and the storage device are interconnected through a peripheral component interconnect express (PCIe) interface. 21-25. (canceled) | 2,100 |
5,680 | 5,680 | 15,413,392 | 2,176 | A method and system is provided for customizing a web page of an application of an application provider. A host (e.g., cloud service), which hosts the application, provides the web page to a user of the application provider on behalf of the application provider. A customization system receives from a user of the application provider a request for the web page, which has content. The customization system identifies a preferred language for the content of the web page. When the application provider has specified content for the preferred language for the web page, the customization system adds to the web page the specified content. When the application provider has not specified content for the preferred language for the web page, the customization system adds to the web page default content in the preferred language provided by the host. | 1. A method performed by a computing system for localization of a user interface provided by a host to applications of application providers for presentation to users of the applications, the method comprising:
accessing default content provided by the host in a plurality of languages, the default content for a default language having content for content identifiers for the default language; accessing overriding content provided by the application providers, the overriding content for an application provider for a language having content for content identifiers for that language; receiving from a user of a target application provider a request for a document, the document having one or more content identifiers for content to be included in the document; identifying a preferred language for content of the document; and for each content identifier of the document,
when overriding content for the target application provider includes content for the content identifier in the preferred language, selecting for the document the content for the content identifier of the overriding content for the preferred language for the target application provider; and
when overriding content for the target application provider does not include content for the content identifier in the preferred language, selecting for the document the content for the content identifier of default content. 2. The method of claim 1 wherein the document is a display page provided by the host as a service to application providers. 3. The method of claim 1 wherein the preferred language is identified based on a link provided to the user of the target application provider by the target application provider. 4. The method of claim 1 further comprising receiving an indication of a custom content identifier for custom content of an application provider for the document wherein the overriding content for the application provider includes the custom content for the custom content identifier. 5. The method of claim 1 further comprising accessing a priority ordering of different languages such that content for a content identifier of the document is selected from the content of the language with the highest priority. 6. The method of claim 5 further comprising, when overriding content for an application provider and default content are provided in the same language, giving priority to the overriding content. 7. The method of claim 1 wherein at least one language is a variant of another language. 8. The method of claim 1 wherein the overriding content for an application provider is provided by a third party. 9. The method of claim 9 wherein the overriding content for an application provider that is provided by a third party is hosted by the third party. 10. The method of claim 1 wherein the overriding content is stored on multiple data sources and wherein the selecting of the content for the content identifier of the overriding content for the preferred language for the target application provider includes searching multiple data sources. 11. The method of claim 1 wherein the default content is stored on multiple data sources and wherein the selecting of the content for the content identifier of the default content includes searching multiple data sources. 12. The method of claim 1 further comprising accessing a specification of acceptable languages of an application provider such that content is presented to users of the application provider in an acceptable language. 13. The method of claim 1 wherein the overriding content provided by an application provider reflects a policy specified by the application provider for overriding default content. 14. The method of claim 1 wherein the accessing, receiving, identifying, and selecting are performed by a client-side component. 15. The method of claim 1 wherein the accessing, receiving, identifying, and selecting are performed by a server-side component. 16. A method performed by a computing system for localization of a web page of an application provider of a host, the web page provided by the host to a user of the application provider on behalf of the application provider, the method comprising:
receiving from a user of the application provider a request for the web page, the web page having content; identifying a preferred language for content of the web page; and for content of the web page,
when the application provider has specified content for the preferred language for the web page, adding to the web page the specified content; and
when the application provider has not specified content for the preferred language for the web page, adding to the web page default content in the preferred language provided by the host. 17. The method of claim 16 wherein the application provider provides a priority order of languages for searching for content for the web page. 18. The method of claim 16 wherein the content for a language includes content for content identifiers and the web page is to include content for a target content identifier and wherein the content for the languages is searched in a priority order of language for first content that includes content for the target content identifier. 19. A computing system for customization of a web page provided by a service of a host, the computing system comprising:
a computer-readable storage medium storing computer-executable instructions for controlling the computing system to:
receive an indication to provide the web page to a user of an application provider of the host; and
for each of a plurality of content identifiers of content to be included in the web page,
when the application provider has specified application provider-specific content for the content identifier of the web page, indicate to add to the web page the application provider-specific content for the content identifier; and
when the application provider has not specified application provider-specific content for the content identifier of the web page, indicate to add to the web page default content for the content identifier provided by the host; and
a processor that executes the computer-executable instructions stored in the computer-readable storage medium. 20. The computing system of claim 19 wherein the computer-executable instructions further control the computing system to: access multiple data sources to identify application provider-specific content for the content of the web page that the application provider has specified. | A method and system is provided for customizing a web page of an application of an application provider. A host (e.g., cloud service), which hosts the application, provides the web page to a user of the application provider on behalf of the application provider. A customization system receives from a user of the application provider a request for the web page, which has content. The customization system identifies a preferred language for the content of the web page. When the application provider has specified content for the preferred language for the web page, the customization system adds to the web page the specified content. When the application provider has not specified content for the preferred language for the web page, the customization system adds to the web page default content in the preferred language provided by the host.1. A method performed by a computing system for localization of a user interface provided by a host to applications of application providers for presentation to users of the applications, the method comprising:
accessing default content provided by the host in a plurality of languages, the default content for a default language having content for content identifiers for the default language; accessing overriding content provided by the application providers, the overriding content for an application provider for a language having content for content identifiers for that language; receiving from a user of a target application provider a request for a document, the document having one or more content identifiers for content to be included in the document; identifying a preferred language for content of the document; and for each content identifier of the document,
when overriding content for the target application provider includes content for the content identifier in the preferred language, selecting for the document the content for the content identifier of the overriding content for the preferred language for the target application provider; and
when overriding content for the target application provider does not include content for the content identifier in the preferred language, selecting for the document the content for the content identifier of default content. 2. The method of claim 1 wherein the document is a display page provided by the host as a service to application providers. 3. The method of claim 1 wherein the preferred language is identified based on a link provided to the user of the target application provider by the target application provider. 4. The method of claim 1 further comprising receiving an indication of a custom content identifier for custom content of an application provider for the document wherein the overriding content for the application provider includes the custom content for the custom content identifier. 5. The method of claim 1 further comprising accessing a priority ordering of different languages such that content for a content identifier of the document is selected from the content of the language with the highest priority. 6. The method of claim 5 further comprising, when overriding content for an application provider and default content are provided in the same language, giving priority to the overriding content. 7. The method of claim 1 wherein at least one language is a variant of another language. 8. The method of claim 1 wherein the overriding content for an application provider is provided by a third party. 9. The method of claim 9 wherein the overriding content for an application provider that is provided by a third party is hosted by the third party. 10. The method of claim 1 wherein the overriding content is stored on multiple data sources and wherein the selecting of the content for the content identifier of the overriding content for the preferred language for the target application provider includes searching multiple data sources. 11. The method of claim 1 wherein the default content is stored on multiple data sources and wherein the selecting of the content for the content identifier of the default content includes searching multiple data sources. 12. The method of claim 1 further comprising accessing a specification of acceptable languages of an application provider such that content is presented to users of the application provider in an acceptable language. 13. The method of claim 1 wherein the overriding content provided by an application provider reflects a policy specified by the application provider for overriding default content. 14. The method of claim 1 wherein the accessing, receiving, identifying, and selecting are performed by a client-side component. 15. The method of claim 1 wherein the accessing, receiving, identifying, and selecting are performed by a server-side component. 16. A method performed by a computing system for localization of a web page of an application provider of a host, the web page provided by the host to a user of the application provider on behalf of the application provider, the method comprising:
receiving from a user of the application provider a request for the web page, the web page having content; identifying a preferred language for content of the web page; and for content of the web page,
when the application provider has specified content for the preferred language for the web page, adding to the web page the specified content; and
when the application provider has not specified content for the preferred language for the web page, adding to the web page default content in the preferred language provided by the host. 17. The method of claim 16 wherein the application provider provides a priority order of languages for searching for content for the web page. 18. The method of claim 16 wherein the content for a language includes content for content identifiers and the web page is to include content for a target content identifier and wherein the content for the languages is searched in a priority order of language for first content that includes content for the target content identifier. 19. A computing system for customization of a web page provided by a service of a host, the computing system comprising:
a computer-readable storage medium storing computer-executable instructions for controlling the computing system to:
receive an indication to provide the web page to a user of an application provider of the host; and
for each of a plurality of content identifiers of content to be included in the web page,
when the application provider has specified application provider-specific content for the content identifier of the web page, indicate to add to the web page the application provider-specific content for the content identifier; and
when the application provider has not specified application provider-specific content for the content identifier of the web page, indicate to add to the web page default content for the content identifier provided by the host; and
a processor that executes the computer-executable instructions stored in the computer-readable storage medium. 20. The computing system of claim 19 wherein the computer-executable instructions further control the computing system to: access multiple data sources to identify application provider-specific content for the content of the web page that the application provider has specified. | 2,100 |
5,681 | 5,681 | 15,136,775 | 2,132 | A memory device includes: a plurality of volatile memories for storing data; a non-volatile memory buffer configured to store data associated with workloads received from a host computer; and a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node. The non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node. | 1. A memory device comprising:
a plurality of volatile memories for storing data; a non-volatile memory buffer configured to store data associated with workloads received from a host computer; and a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node, wherein the non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node. 2. The memory device of claim 1, wherein the non-volatile memory buffer is DRAM powered by a battery or backed by a capacitor during a power failure event. 3. The memory device of claim 1, wherein the non-volatile memory buffer is one of a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). 4. The memory device of claim 1, wherein the memory device and the remote node are connected to each other over a Transmission Control Protocol/Internet Protocol (TCP/IP) network, and wherein the remote node sends the acknowledgement bit to the memory device in a TCP/IP packet. 5. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via remote direct memory access (RDMA), and wherein the host computer polls a data replication status of the remote node and updates the acknowledgement bit associated with the data in the non-volatile memory buffer of the memory device. 6. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via an RDMA over Infiniband protocol including a SCSI RDMA Protocol (SRP), a Socket Direct Protocol (SDP), and a native RDMA protocol. 7. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via an RDMA over Ethernet protocol including an RDMA over Converged Ethernet (ROCE) and an Internet Wide Area RDMA (iWARP) protocol. 8. The memory device of claim 1, wherein the table includes a plurality of data entries, and each data entry includes a logical block address (LBA), a valid bit, the acknowledgement bit, a priority bit, and the data. 9. The memory device of claim 1, wherein the mapping information of the memory device and the remote node is stored in the host computer. 10. The memory device of claim 1, wherein the non-volatile memory buffer stores frequently requested data by the host computer, and wherein the memory controller flushes less-frequently requested data from the non-volatile memory buffer. 11. A memory system comprising:
a host computer; a plurality of memory devices coupled to each other over a network, wherein each of the plurality of memory devices comprises:
a plurality of volatile memories for storing data;
a non-volatile memory buffer configured to store data associated with workloads received from the host computer; and
a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node,
wherein the non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node. 12. The memory system of claim 11, wherein the non-volatile memory buffer is DRAM powered by a battery or backed by a capacitor during a power failure event. 13. The memory system of claim 11, wherein the non-volatile memory buffer is one or more of a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). 14. The memory system of claim 11, wherein the table includes a plurality of data entries, and each data entry includes a logical block address (LBA), a valid bit, the acknowledgement bit, a priority bit, and the data. 15. A method comprising:
receiving a data write request including data and a logical block address (LBA) from a host computer; writing the data to one of a plurality of volatile memories of a memory device based on the LBA; creating a data entry for the data write request in a non-volatile memory buffer of the memory device, wherein the data entry includes the LBA, a valid bit, an acknowledgement bit, and the data; setting the valid bit of the data entry; replicating the data to a remote node; receiving an acknowledgement that indicates a successful data replication to the remote node; updating the acknowledgement bit of the data entry based on the acknowledgement; and updating the valid bit of the data entry. 16. The method of claim 15, further comprising:
receiving a data read request for the data from the host computer; determining that the data is locally available from the memory device; and sending the data stored in the memory device to the host computer. 17. The method of claim 16, wherein the data stored in the non-volatile memory buffer is sent to the host computer. 18. The method of claim 15, further comprising:
receiving a data read request for the data from the host computer; determining that the data is not locally available from the memory device; identifying the remote node that stores the replicated data; sending the data stored in the remote node to the host computer; and updating the data stored in one of the volatile memories and the non-volatile memory buffer of the memory device. 19. The method of claim 15, further comprising:
determining that the memory device has entered a recover mode from a failure; identifying the remote node for a read request for the data; sending the data from the remote node; and replicate the data from the remote node to the memory device. 20. The method of claim 15, further comprising receiving the acknowledgement bit in a TCP/IP packet from the remote node. 21. The method of claim 15, wherein the memory device and the remote node communicate with each other via remote direct memory access (RDMA), and the method further comprising polling a data replication status of the remote node and updating the acknowledgement bit of the data associated with the data in the non-volatile memory buffer of the memory device. 22. The method of claim 15, wherein the memory device and the remote node communicate with each other via an RDMA over Infiniband protocol including a SCSI RDMA Protocol (SRP), a Socket Direct Protocol (SDP), and a native RDMA protocol. 23. The method of claim 15, wherein the memory device and the remote node communicate with each other via an RDMA over Ethernet protocol including an RDMA over Converged Ethernet (ROCE) and an Internet Wide Area RDMA (iWARP) protocol. 24. The method of claim 15, wherein the non-volatile memory buffer is battery-powered or a capacitor-backed or selected from a group comprising a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). | A memory device includes: a plurality of volatile memories for storing data; a non-volatile memory buffer configured to store data associated with workloads received from a host computer; and a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node. The non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node.1. A memory device comprising:
a plurality of volatile memories for storing data; a non-volatile memory buffer configured to store data associated with workloads received from a host computer; and a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node, wherein the non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node. 2. The memory device of claim 1, wherein the non-volatile memory buffer is DRAM powered by a battery or backed by a capacitor during a power failure event. 3. The memory device of claim 1, wherein the non-volatile memory buffer is one of a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). 4. The memory device of claim 1, wherein the memory device and the remote node are connected to each other over a Transmission Control Protocol/Internet Protocol (TCP/IP) network, and wherein the remote node sends the acknowledgement bit to the memory device in a TCP/IP packet. 5. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via remote direct memory access (RDMA), and wherein the host computer polls a data replication status of the remote node and updates the acknowledgement bit associated with the data in the non-volatile memory buffer of the memory device. 6. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via an RDMA over Infiniband protocol including a SCSI RDMA Protocol (SRP), a Socket Direct Protocol (SDP), and a native RDMA protocol. 7. The memory device of claim 1, wherein the memory device and the remote node communicate with each other via an RDMA over Ethernet protocol including an RDMA over Converged Ethernet (ROCE) and an Internet Wide Area RDMA (iWARP) protocol. 8. The memory device of claim 1, wherein the table includes a plurality of data entries, and each data entry includes a logical block address (LBA), a valid bit, the acknowledgement bit, a priority bit, and the data. 9. The memory device of claim 1, wherein the mapping information of the memory device and the remote node is stored in the host computer. 10. The memory device of claim 1, wherein the non-volatile memory buffer stores frequently requested data by the host computer, and wherein the memory controller flushes less-frequently requested data from the non-volatile memory buffer. 11. A memory system comprising:
a host computer; a plurality of memory devices coupled to each other over a network, wherein each of the plurality of memory devices comprises:
a plurality of volatile memories for storing data;
a non-volatile memory buffer configured to store data associated with workloads received from the host computer; and
a memory controller configured to store the data to both the plurality of volatile memories and the non-volatile memory buffer and replicate the data to a remote node,
wherein the non-volatile memory buffer is configured to store the data in a table including an acknowledgement bit that is set by the remote node. 12. The memory system of claim 11, wherein the non-volatile memory buffer is DRAM powered by a battery or backed by a capacitor during a power failure event. 13. The memory system of claim 11, wherein the non-volatile memory buffer is one or more of a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). 14. The memory system of claim 11, wherein the table includes a plurality of data entries, and each data entry includes a logical block address (LBA), a valid bit, the acknowledgement bit, a priority bit, and the data. 15. A method comprising:
receiving a data write request including data and a logical block address (LBA) from a host computer; writing the data to one of a plurality of volatile memories of a memory device based on the LBA; creating a data entry for the data write request in a non-volatile memory buffer of the memory device, wherein the data entry includes the LBA, a valid bit, an acknowledgement bit, and the data; setting the valid bit of the data entry; replicating the data to a remote node; receiving an acknowledgement that indicates a successful data replication to the remote node; updating the acknowledgement bit of the data entry based on the acknowledgement; and updating the valid bit of the data entry. 16. The method of claim 15, further comprising:
receiving a data read request for the data from the host computer; determining that the data is locally available from the memory device; and sending the data stored in the memory device to the host computer. 17. The method of claim 16, wherein the data stored in the non-volatile memory buffer is sent to the host computer. 18. The method of claim 15, further comprising:
receiving a data read request for the data from the host computer; determining that the data is not locally available from the memory device; identifying the remote node that stores the replicated data; sending the data stored in the remote node to the host computer; and updating the data stored in one of the volatile memories and the non-volatile memory buffer of the memory device. 19. The method of claim 15, further comprising:
determining that the memory device has entered a recover mode from a failure; identifying the remote node for a read request for the data; sending the data from the remote node; and replicate the data from the remote node to the memory device. 20. The method of claim 15, further comprising receiving the acknowledgement bit in a TCP/IP packet from the remote node. 21. The method of claim 15, wherein the memory device and the remote node communicate with each other via remote direct memory access (RDMA), and the method further comprising polling a data replication status of the remote node and updating the acknowledgement bit of the data associated with the data in the non-volatile memory buffer of the memory device. 22. The method of claim 15, wherein the memory device and the remote node communicate with each other via an RDMA over Infiniband protocol including a SCSI RDMA Protocol (SRP), a Socket Direct Protocol (SDP), and a native RDMA protocol. 23. The method of claim 15, wherein the memory device and the remote node communicate with each other via an RDMA over Ethernet protocol including an RDMA over Converged Ethernet (ROCE) and an Internet Wide Area RDMA (iWARP) protocol. 24. The method of claim 15, wherein the non-volatile memory buffer is battery-powered or a capacitor-backed or selected from a group comprising a phase-change RAM (PCM), a resistive RAM (ReRAM), and a magnetic random access memory (MRAM). | 2,100 |
5,682 | 5,682 | 13,919,293 | 2,154 | An aspect provides a method, including: storing an object; obtaining data associated with the object; analyzing, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and storing the one or more tags in a searchable format. Other aspects are described and claimed. | 1. A method, comprising:
storing an object; obtaining data associated with the object; analyzing, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and storing the one or more tags in a searchable format. 2. The method of claim 1, wherein obtaining data associated with the object comprises one or more of prompting a user to input data; and accessing the object to mine for data. 3. The method of claim 2, wherein prompting the user to input data comprises prompting the user for speech input. 4. The method of claim 2, wherein prompting the user to input data comprises one or more of prompting the user prior to storing the object and prompting the user after storing the object. 5. The method of claim 1, wherein analyzing, using one or more processors, the data associated with the object to create one or more tags comprises:
determining a frequency of the one or more key words; and ranking the one or more key words. 6. The method of claim 5, further comprising identifying a group of objects to which the object belongs. 7. The method of claim 6, wherein the group of objects to which the object belongs comprises objects stored and associated with a device containing a device memory in which the object is stored. 8. The method of claim 6, wherein the group of objects to which the object belongs comprises objects stored in a device selected from a cloud device and a device containing a device memory in which the object is stored. 9. The method of claim 8, wherein the group of objects and the object are associated via a cloud-based linkage. 10. The method of claim 7, wherein the determining a frequency of the one or more key words and ranking the one or more key words comprises:
determining a frequency of one or more key words in data associated with the group of objects; and ranking one or more key words taking into account the one or more key words in the data associated with the group of objects. 11. An information handling device, comprising:
one or more processors; a memory device storing instructions accessible to the one or more processors, the instructions being executable by the one or more processors to: store an object; obtain data associated with the object; analyze, using the one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and store the one or more tags in a searchable format. 12. The information handling device of claim 10, wherein to obtain data associated with the object comprises one or more of prompting a user to input data; and accessing the object to mine for data. 13. The information handling device of claim 12, wherein prompting the user to input data comprises prompting the user for speech input. 14. The information handling device of claim 12, wherein prompting the user to input data comprises one or more of prompting the user prior to storing the object and prompting the user after storing the object. 15. The information handling device of claim 11, wherein to analyze, using the one or more processors, the data associated with the object to create one or more tags comprises:
determining a frequency of the one or more key words; and ranking the one or more key words. 16. The information handling device of claim 15, wherein the instructions are further executable by the one or more processors to identify a group of objects to which the object belongs. 17. The information handling device of claim 16, wherein the group of objects to which the object belongs comprises objects stored and associated with a device containing a device memory in which the object is stored. 18. The information handling device of claim 16, wherein the group of objects to which the object belongs comprises objects stored in a device selected from a cloud device and a device containing a device memory in which the object is stored. 19. The information handling device of claim 18, wherein the group of objects and the object are associated via a cloud-based linkage. 20. The information handling device of claim 17, wherein the determining a frequency of the one or more key words and ranking the one or more key words comprises:
determining a frequency of one or more key words in data associated with the group of objects; and ranking one or more key words taking into account the one or more key words in the data associated with the group of objects. 21. A computer program product, comprising:
a storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to store an object; computer readable program code configured to obtain data associated with the object; computer readable program code configured to analyze, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and computer readable program code configured to store the one or more tags in a searchable format. 22. A method, comprising:
storing an object; obtaining, using one or more processors, data associated with the object; analyzing, using one or more processors, the data associated with the object to create one or more tags; storing, in a device memory, the one or more tags in a searchable format; and ranking, using one or more processors, two or more tags for the object based on an analysis of tags associated with the object. 23. The method of claim 22, further comprising:
grouping the object with one or more similar objects; and accessing a repository of searchable tags of a group of objects associated with the object; wherein ranking the one or more tags comprises selecting a strongest tag for the object based on an analysis of the one or more tags associated with the object via analyzing the repository of searchable tags of a group of objects associated with the object. 24. The method of claim 23, wherein the strongest tag is not included in the one or more tags created initially for the object. 25. The method of claim 22, wherein the ranking comprises:
identifying a particular user associated with the one or more tags associated with the object. 26. The method of claim 22, wherein the device memory is a cloud storage device memory. | An aspect provides a method, including: storing an object; obtaining data associated with the object; analyzing, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and storing the one or more tags in a searchable format. Other aspects are described and claimed.1. A method, comprising:
storing an object; obtaining data associated with the object; analyzing, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and storing the one or more tags in a searchable format. 2. The method of claim 1, wherein obtaining data associated with the object comprises one or more of prompting a user to input data; and accessing the object to mine for data. 3. The method of claim 2, wherein prompting the user to input data comprises prompting the user for speech input. 4. The method of claim 2, wherein prompting the user to input data comprises one or more of prompting the user prior to storing the object and prompting the user after storing the object. 5. The method of claim 1, wherein analyzing, using one or more processors, the data associated with the object to create one or more tags comprises:
determining a frequency of the one or more key words; and ranking the one or more key words. 6. The method of claim 5, further comprising identifying a group of objects to which the object belongs. 7. The method of claim 6, wherein the group of objects to which the object belongs comprises objects stored and associated with a device containing a device memory in which the object is stored. 8. The method of claim 6, wherein the group of objects to which the object belongs comprises objects stored in a device selected from a cloud device and a device containing a device memory in which the object is stored. 9. The method of claim 8, wherein the group of objects and the object are associated via a cloud-based linkage. 10. The method of claim 7, wherein the determining a frequency of the one or more key words and ranking the one or more key words comprises:
determining a frequency of one or more key words in data associated with the group of objects; and ranking one or more key words taking into account the one or more key words in the data associated with the group of objects. 11. An information handling device, comprising:
one or more processors; a memory device storing instructions accessible to the one or more processors, the instructions being executable by the one or more processors to: store an object; obtain data associated with the object; analyze, using the one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and store the one or more tags in a searchable format. 12. The information handling device of claim 10, wherein to obtain data associated with the object comprises one or more of prompting a user to input data; and accessing the object to mine for data. 13. The information handling device of claim 12, wherein prompting the user to input data comprises prompting the user for speech input. 14. The information handling device of claim 12, wherein prompting the user to input data comprises one or more of prompting the user prior to storing the object and prompting the user after storing the object. 15. The information handling device of claim 11, wherein to analyze, using the one or more processors, the data associated with the object to create one or more tags comprises:
determining a frequency of the one or more key words; and ranking the one or more key words. 16. The information handling device of claim 15, wherein the instructions are further executable by the one or more processors to identify a group of objects to which the object belongs. 17. The information handling device of claim 16, wherein the group of objects to which the object belongs comprises objects stored and associated with a device containing a device memory in which the object is stored. 18. The information handling device of claim 16, wherein the group of objects to which the object belongs comprises objects stored in a device selected from a cloud device and a device containing a device memory in which the object is stored. 19. The information handling device of claim 18, wherein the group of objects and the object are associated via a cloud-based linkage. 20. The information handling device of claim 17, wherein the determining a frequency of the one or more key words and ranking the one or more key words comprises:
determining a frequency of one or more key words in data associated with the group of objects; and ranking one or more key words taking into account the one or more key words in the data associated with the group of objects. 21. A computer program product, comprising:
a storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to store an object; computer readable program code configured to obtain data associated with the object; computer readable program code configured to analyze, using one or more processors, the data associated with the object to identify one or more key words in the data associated with the object to create one or more tags; and computer readable program code configured to store the one or more tags in a searchable format. 22. A method, comprising:
storing an object; obtaining, using one or more processors, data associated with the object; analyzing, using one or more processors, the data associated with the object to create one or more tags; storing, in a device memory, the one or more tags in a searchable format; and ranking, using one or more processors, two or more tags for the object based on an analysis of tags associated with the object. 23. The method of claim 22, further comprising:
grouping the object with one or more similar objects; and accessing a repository of searchable tags of a group of objects associated with the object; wherein ranking the one or more tags comprises selecting a strongest tag for the object based on an analysis of the one or more tags associated with the object via analyzing the repository of searchable tags of a group of objects associated with the object. 24. The method of claim 23, wherein the strongest tag is not included in the one or more tags created initially for the object. 25. The method of claim 22, wherein the ranking comprises:
identifying a particular user associated with the one or more tags associated with the object. 26. The method of claim 22, wherein the device memory is a cloud storage device memory. | 2,100 |
5,683 | 5,683 | 15,252,323 | 2,125 | Replay of partially executed instruction blocks in a processor-based system employing a block-atomic execution model is disclosed. In one aspect, a partial replay controller is provided in a processor(s) of a central processing unit (CPU). If an instruction is detected in the instruction block associated with a potential architectural state modification, or an exception occurs during execution of instructions, the instruction block is re-executed. During re-execution of the instruction block, the partial replay controller is configured to record produced results from load/store instructions. Thus, if an exception occurs during re-execution of the instruction block, previously recorded produced results for the executed load/store instructions before the exception occurred are replayed during re-execution of the instruction block after the exception is resolved. Thus, execution of instructions leading up to side-effect operations in the instruction block can be deterministically repeated with previously produced results, without repeating the side-effects. | 1. A partial replay controller for controlling execution replay of an instruction block executed in a processor, comprising:
a detection circuit configured to set a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification or an occurrence of an exception in the processor; and a record/replay circuit configured to, in response to the record/replay state being an active state for the instruction block:
inspect an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
record produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
execute the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. 2. The partial replay controller of claim 1, wherein the detection circuit is further configured to detect an instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 3. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising a load/store instruction having a potential side-effect, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the load/store instruction having the potential side-effect, set the record/replay state to the active state for the instruction block. 4. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising a write system configuration register instruction, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the write system configuration register instruction, set the record/replay state to the active state for the instruction block. 5. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising an instruction having an expected exception, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the instruction having the expected exception, set the record/replay state to the active state for the instruction block. 6. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with an operation causing a static block exception. 7. The partial replay controller of claim 6, wherein the static block exception is comprised from the group consisting of: an instruction page fault; an invalid block header; and an invalid instruction encoding. 8. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a watchpoint. 9. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a breakpoint. 10. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a debug step point. 11. The partial replay controller of claim 1 further configured to:
determine if all instructions in the instruction block have been executed; and
commit external produced values by the executed instructions in the instruction block in response to determining all the instructions in the instruction block have been executed. 12. The partial replay controller of claim 1, wherein the record/replay circuit is further configured to record the record/replay state for the produced data of the executed next load/store instruction in the record/replay log file. 13. The partial replay controller of claim 1, wherein the record/replay circuit is further configured to record a virtual address addressed by the executed next load/store instruction in association with the produced data of the executed next load/store instruction in the record/replay log file. 14. The partial replay controller of claim 1, wherein, in response to the record/replay state being an idle execution state for the instruction block, the detection circuit is configured to detect the instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 15. The partial replay controller of claim 14 configured to, in response to an exception occurring during the execution of the instruction block when the record/replay state is in the idle execution state, cause the instruction block to be re-executed. 16. The partial replay controller of claim 1, wherein, in response to an exception occurring during execution of the instruction block when the record/replay state is in the active state, the record/replay circuit is further configured to:
set the record/replay state for the instruction block to a locked state; and suspend recording of the produced data of the executed next load/store instruction in the record/replay log file, and suspend executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 17. The partial replay controller of claim 16, wherein, in response to the record/replay state for the instruction block returning to an active state from a previous locked state, the record/replay circuit is further configured to resume recording the produced data of the executed next load/store instruction in the record/replay log file and executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 18. The partial replay controller of claim 17, wherein, in response to the occurrence of the exception during the execution of the instruction block when the record/replay state is in the active state, the record/replay circuit is further configured to commit external produced values by executed instructions in the instruction block prior to the occurrence of the exception. 19. The partial replay controller of claim 18, wherein the record/replay circuit is further configured to commit the external produced values by the executed instructions in the instruction block executed after resuming execution of the next load/store instruction using the previously produced data recorded for the next load/store instruction in response to the record/replay state for the instruction block returning to the active state from the previous locked state. 20. The partial replay controller of claim 1 integrated into a system-on-a-chip (SoC). 21. The partial replay controller of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a smart phone; a tablet; a phablet; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; and an automobile. 22. A partial replay controller for controlling execution replay of an instruction block executed in a processor, comprising:
a means for setting a means for storing a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; a means for inspecting an entry state in a means for storing a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction, in response to the means for storing the record/replay state to an active state for the instruction block: a means for recording produced data of the executed next load/store instruction in the means for storing the record/replay log file, in response to the previously produced data not being recorded in the means for storing the record/replay log file for the next load/store instruction; and a means for executing the next load/store instruction using the previously produced data recorded for the next load/store instruction in the means for storing the record/replay log file, in response to the previously produced data being recorded in the means for storing the record/replay log file for the next load/store instruction. 23. A method of replaying an instruction block in a processor, comprising:
setting a record/replay state to an active state for an instruction block in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; and in response to the record/replay state being an active state for the instruction block:
inspecting an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
recording produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
executing the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. 24. The method of claim 23, comprising a detection circuit configured to detect the instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 25. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising a load/store instruction having a potential side-effect, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the load/store instruction having the potential side-effect. 26. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising a write system configuration register instruction, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the write system configuration register instruction. 27. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising an instruction having an expected exception, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the instruction having the expected exception. 28. The method of claim 23, wherein, in response to an exception occurring during execution of the instruction block when the record/replay state is in the active state, further comprises:
setting the record/replay state for the instruction block to a locked state; and suspending recording the produced data of the executed next load/store instruction in the record/replay log file, and suspending executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 29. The method of claim 23, further comprising committing external produced values by executed instructions in the instruction block prior to the occurrence of the exception, in response to the occurrence of the exception during the execution of instruction block when the record/replay state is in the active state. 30. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a processor, cause the processor to:
set a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; and in response to the record/replay state being an active state for the instruction block:
inspect an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
record produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
execute the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. | Replay of partially executed instruction blocks in a processor-based system employing a block-atomic execution model is disclosed. In one aspect, a partial replay controller is provided in a processor(s) of a central processing unit (CPU). If an instruction is detected in the instruction block associated with a potential architectural state modification, or an exception occurs during execution of instructions, the instruction block is re-executed. During re-execution of the instruction block, the partial replay controller is configured to record produced results from load/store instructions. Thus, if an exception occurs during re-execution of the instruction block, previously recorded produced results for the executed load/store instructions before the exception occurred are replayed during re-execution of the instruction block after the exception is resolved. Thus, execution of instructions leading up to side-effect operations in the instruction block can be deterministically repeated with previously produced results, without repeating the side-effects.1. A partial replay controller for controlling execution replay of an instruction block executed in a processor, comprising:
a detection circuit configured to set a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification or an occurrence of an exception in the processor; and a record/replay circuit configured to, in response to the record/replay state being an active state for the instruction block:
inspect an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
record produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
execute the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. 2. The partial replay controller of claim 1, wherein the detection circuit is further configured to detect an instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 3. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising a load/store instruction having a potential side-effect, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the load/store instruction having the potential side-effect, set the record/replay state to the active state for the instruction block. 4. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising a write system configuration register instruction, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the write system configuration register instruction, set the record/replay state to the active state for the instruction block. 5. The partial replay controller of claim 2, wherein the detection circuit comprises a side-effect detection circuit configured to:
detect the instruction in the instruction block comprising an instruction having an expected exception, during the execution of the instruction block by the processor; and in response to detection of the instruction comprising the instruction having the expected exception, set the record/replay state to the active state for the instruction block. 6. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with an operation causing a static block exception. 7. The partial replay controller of claim 6, wherein the static block exception is comprised from the group consisting of: an instruction page fault; an invalid block header; and an invalid instruction encoding. 8. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a watchpoint. 9. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a breakpoint. 10. The partial replay controller of claim 5, wherein the instruction having the expected exception comprises an instruction associated with a debug step point. 11. The partial replay controller of claim 1 further configured to:
determine if all instructions in the instruction block have been executed; and
commit external produced values by the executed instructions in the instruction block in response to determining all the instructions in the instruction block have been executed. 12. The partial replay controller of claim 1, wherein the record/replay circuit is further configured to record the record/replay state for the produced data of the executed next load/store instruction in the record/replay log file. 13. The partial replay controller of claim 1, wherein the record/replay circuit is further configured to record a virtual address addressed by the executed next load/store instruction in association with the produced data of the executed next load/store instruction in the record/replay log file. 14. The partial replay controller of claim 1, wherein, in response to the record/replay state being an idle execution state for the instruction block, the detection circuit is configured to detect the instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 15. The partial replay controller of claim 14 configured to, in response to an exception occurring during the execution of the instruction block when the record/replay state is in the idle execution state, cause the instruction block to be re-executed. 16. The partial replay controller of claim 1, wherein, in response to an exception occurring during execution of the instruction block when the record/replay state is in the active state, the record/replay circuit is further configured to:
set the record/replay state for the instruction block to a locked state; and suspend recording of the produced data of the executed next load/store instruction in the record/replay log file, and suspend executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 17. The partial replay controller of claim 16, wherein, in response to the record/replay state for the instruction block returning to an active state from a previous locked state, the record/replay circuit is further configured to resume recording the produced data of the executed next load/store instruction in the record/replay log file and executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 18. The partial replay controller of claim 17, wherein, in response to the occurrence of the exception during the execution of the instruction block when the record/replay state is in the active state, the record/replay circuit is further configured to commit external produced values by executed instructions in the instruction block prior to the occurrence of the exception. 19. The partial replay controller of claim 18, wherein the record/replay circuit is further configured to commit the external produced values by the executed instructions in the instruction block executed after resuming execution of the next load/store instruction using the previously produced data recorded for the next load/store instruction in response to the record/replay state for the instruction block returning to the active state from the previous locked state. 20. The partial replay controller of claim 1 integrated into a system-on-a-chip (SoC). 21. The partial replay controller of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a smart phone; a tablet; a phablet; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; and an automobile. 22. A partial replay controller for controlling execution replay of an instruction block executed in a processor, comprising:
a means for setting a means for storing a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; a means for inspecting an entry state in a means for storing a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction, in response to the means for storing the record/replay state to an active state for the instruction block: a means for recording produced data of the executed next load/store instruction in the means for storing the record/replay log file, in response to the previously produced data not being recorded in the means for storing the record/replay log file for the next load/store instruction; and a means for executing the next load/store instruction using the previously produced data recorded for the next load/store instruction in the means for storing the record/replay log file, in response to the previously produced data being recorded in the means for storing the record/replay log file for the next load/store instruction. 23. A method of replaying an instruction block in a processor, comprising:
setting a record/replay state to an active state for an instruction block in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; and in response to the record/replay state being an active state for the instruction block:
inspecting an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
recording produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
executing the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. 24. The method of claim 23, comprising a detection circuit configured to detect the instruction in the instruction block associated with the potential architectural state modification, during execution of the instruction block by the processor. 25. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising a load/store instruction having a potential side-effect, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the load/store instruction having the potential side-effect. 26. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising a write system configuration register instruction, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the write system configuration register instruction. 27. The method of claim 24, comprising:
detecting an instruction in the instruction block comprising an instruction having an expected exception, during the execution of the instruction block by the processor; and setting the record/replay state to the active state for the instruction block in response to detection of the instruction comprising the instruction having the expected exception. 28. The method of claim 23, wherein, in response to an exception occurring during execution of the instruction block when the record/replay state is in the active state, further comprises:
setting the record/replay state for the instruction block to a locked state; and suspending recording the produced data of the executed next load/store instruction in the record/replay log file, and suspending executing the next load/store instruction using the previously produced data recorded for the next load/store instruction. 29. The method of claim 23, further comprising committing external produced values by executed instructions in the instruction block prior to the occurrence of the exception, in response to the occurrence of the exception during the execution of instruction block when the record/replay state is in the active state. 30. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a processor, cause the processor to:
set a record/replay state to an active state for an instruction block, in response to detection of an instruction associated with a potential architectural state modification, or an occurrence of an exception in the processor; and in response to the record/replay state being an active state for the instruction block:
inspect an entry state in a record/replay log file corresponding to a next load/store instruction to be executed in the instruction block to determine if previously produced data is recorded for the next load/store instruction;
record produced data of the executed next load/store instruction in the record/replay log file, in response to the previously produced data not being recorded in the record/replay log file for the next load/store instruction; and
execute the next load/store instruction using the previously produced data recorded for the next load/store instruction in the record/replay log file, in response to the previously produced data being recorded in the record/replay log file for the next load/store instruction. | 2,100 |
5,684 | 5,684 | 15,163,017 | 2,181 | Dynamic interface management for interference mitigation is disclosed. In one aspect, an integrated circuit (IC) is provided that employs a control system configured to mitigate interference caused by an aggressor communications bus. The control system is configured to receive information related to interference conditions and adjust a data/clock mode of an interface corresponding to the aggressor communications bus. In this manner, the interface is configured to couple to the aggressor communications bus. The interface is configured to transmit signals to and receive signals from the aggressor communications bus. The control system is configured to use the information related to the interference conditions to set the data/clock mode of the interface to mitigate the interference experienced by a victim receiver, whether the victim receiver is wired or wireless. Thus, the control system provides designers with an additional tool that may reduce performance degradation of the victim receiver attributable to the interference. | 1. An application processor, comprising:
an interface configured to:
couple to an aggressor communications bus;
transmit one or more application processor signals to the aggressor communications bus; and
receive one or more transceiver signals from the aggressor communications bus; and
a control system configured to:
receive information from a coexistence manager, the information related to interference at a victim receiver as a result of the aggressor communications bus;
process a determination of a data/clock mode of the interface that mitigates a performance impact corresponding to the interference; and
set the data/clock mode of the interface to mitigate the interference. 2. The application processor of claim 1, wherein the control system is configured to process the determination of the data/clock mode by being configured to determine the data/clock mode to which to set the interface to mitigate the interference experienced by the victim receiver. 3. The application processor of claim 1, wherein the coexistence manager is configured to:
receive information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; determine an acceptable performance level of the victim receiver; and determine the data/clock mode to which to set the interface to mitigate the interference experienced by the victim receiver and allow the victim receiver to operate at or above the acceptable performance level. 4. The application processor of claim 1, wherein the information received from the coexistence manager comprises:
information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; and an acceptable performance level of the victim receiver. 5. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a data rate of one or more lanes associated with the interface to mitigate the interference. 6. The application processor of claim 5, wherein the control system is configured to set the data rate of the interface by being configured to multiplex a plurality of application processor signals associated with a plurality of the one or more lanes associated with the interface onto one lane associated with the interface. 7. The application processor of claim 5, wherein the control system is configured to set the data rate of the interface by being configured to demultiplex one application processor signal associated with one lane of the one or more lanes associated with the interface onto a plurality of lanes of the one or more lanes associated with the interface. 8. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a data scrambling mode of one or more lanes associated with the interface. 9. The application processor of claim 8, wherein the control system is configured to set the data scrambling mode by being configured to assign one or more data scrambling polynomial functions to the one or more lanes associated with the interface. 10. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a clock mode of one or more lanes associated with the interface. 11. The application processor of claim 10, wherein the control system is configured to set the data/clock mode by being configured to set the clock mode of the one or more lanes associated with the interface to a single data rate (SDR) mode. 12. The application processor of claim 10, wherein the control system is configured to set the data/clock mode by being configured to set the clock mode of the one or more lanes associated with the interface to a double data rate (DDR) mode. 13. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a clock scrambling mode of one or more lanes associated with the interface. 14. The application processor of claim 13, wherein the control system is configured to set the clock scrambling mode by being configured to assign a clock scrambling function to the one or more lanes associated with the interface. 15. The application processor of claim 1, wherein:
the one or more application processor signals comprise one or more data signals; and the one or more transceiver signals comprise one or more data signals. 16. The application processor of claim 1, wherein:
the one or more application processor signals comprise one or more clock signals; and the one or more transceiver signals comprise one or more clock signals. 17. The application processor of claim 1, further comprising the coexistence manager. 18. The application processor of claim 1, wherein the application processor receives the information from the coexistence manager positioned remotely from the application processor. 19. The application processor of claim 1, wherein the control system configured to receive the information related to the interference at the victim receiver is configured to receive the information related to the interference at a wired victim receiver. 20. The application processor of claim 19, wherein the interference is interference in a time domain. 21. The application processor of claim 1, wherein the control system configured to receive the information related to the interference at the victim receiver is configured to receive the information related to the interference at a wireless victim receiver. 22. The application processor of claim 21, wherein the interference is interference in a frequency domain. 23. A method for mitigating interference experienced by a victim receiver as a result of an aggressor communications bus, comprising:
receiving information from a coexistence manager, the information related to interference at a victim receiver as a result of an aggressor communications bus; processing a determination of a data/clock mode of an interface that mitigates a performance impact corresponding to the interference; and setting the data/clock mode of the interface to mitigate the interference. 24. The method of claim 23, further comprising:
receiving information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; determining an acceptable performance level of the victim receiver; and determining the data/clock mode of which to set the interface to mitigate the interference experienced by the victim receiver and allow the victim receiver to operate at or above the acceptable performance level. 25. The method of claim 23, wherein setting the data/clock mode comprises setting a data rate of one or more lanes associated with the interface to mitigate the interference. 26. The method of claim 23, wherein setting the data/clock mode comprises setting a data scrambling mode of one or more lanes associated with the interface. 27. The method of claim 23, wherein setting the data/clock mode comprises setting a clock mode of one or more lanes associated with the interface. 28. The method of claim 23, wherein setting the data/clock mode comprises setting a clock scrambling mode of one or more lanes associated with the interface. 29. A transceiver comprising:
an interface configured to:
couple to an aggressor communications bus;
transmit one or more transceiver signals to the aggressor communications bus; and
receive one or more application processor signals from the aggressor communications bus; and
a control system configured to:
receive information from a coexistence manager, the information related to interference at a victim receiver as a result of the aggressor communications bus;
process a determination of a data/clock mode of the interface that mitigates a performance impact corresponding to the interference; and
set the data/clock mode of the interface to mitigate the interference. 30. The transceiver of claim 29 integrated into a device selected from the group consisting of: a system-on-a-chip (SoC), a peripheral, and an electronic component that includes an interface to a bus. | Dynamic interface management for interference mitigation is disclosed. In one aspect, an integrated circuit (IC) is provided that employs a control system configured to mitigate interference caused by an aggressor communications bus. The control system is configured to receive information related to interference conditions and adjust a data/clock mode of an interface corresponding to the aggressor communications bus. In this manner, the interface is configured to couple to the aggressor communications bus. The interface is configured to transmit signals to and receive signals from the aggressor communications bus. The control system is configured to use the information related to the interference conditions to set the data/clock mode of the interface to mitigate the interference experienced by a victim receiver, whether the victim receiver is wired or wireless. Thus, the control system provides designers with an additional tool that may reduce performance degradation of the victim receiver attributable to the interference.1. An application processor, comprising:
an interface configured to:
couple to an aggressor communications bus;
transmit one or more application processor signals to the aggressor communications bus; and
receive one or more transceiver signals from the aggressor communications bus; and
a control system configured to:
receive information from a coexistence manager, the information related to interference at a victim receiver as a result of the aggressor communications bus;
process a determination of a data/clock mode of the interface that mitigates a performance impact corresponding to the interference; and
set the data/clock mode of the interface to mitigate the interference. 2. The application processor of claim 1, wherein the control system is configured to process the determination of the data/clock mode by being configured to determine the data/clock mode to which to set the interface to mitigate the interference experienced by the victim receiver. 3. The application processor of claim 1, wherein the coexistence manager is configured to:
receive information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; determine an acceptable performance level of the victim receiver; and determine the data/clock mode to which to set the interface to mitigate the interference experienced by the victim receiver and allow the victim receiver to operate at or above the acceptable performance level. 4. The application processor of claim 1, wherein the information received from the coexistence manager comprises:
information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; and an acceptable performance level of the victim receiver. 5. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a data rate of one or more lanes associated with the interface to mitigate the interference. 6. The application processor of claim 5, wherein the control system is configured to set the data rate of the interface by being configured to multiplex a plurality of application processor signals associated with a plurality of the one or more lanes associated with the interface onto one lane associated with the interface. 7. The application processor of claim 5, wherein the control system is configured to set the data rate of the interface by being configured to demultiplex one application processor signal associated with one lane of the one or more lanes associated with the interface onto a plurality of lanes of the one or more lanes associated with the interface. 8. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a data scrambling mode of one or more lanes associated with the interface. 9. The application processor of claim 8, wherein the control system is configured to set the data scrambling mode by being configured to assign one or more data scrambling polynomial functions to the one or more lanes associated with the interface. 10. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a clock mode of one or more lanes associated with the interface. 11. The application processor of claim 10, wherein the control system is configured to set the data/clock mode by being configured to set the clock mode of the one or more lanes associated with the interface to a single data rate (SDR) mode. 12. The application processor of claim 10, wherein the control system is configured to set the data/clock mode by being configured to set the clock mode of the one or more lanes associated with the interface to a double data rate (DDR) mode. 13. The application processor of claim 1, wherein the control system is configured to set the data/clock mode by being configured to set a clock scrambling mode of one or more lanes associated with the interface. 14. The application processor of claim 13, wherein the control system is configured to set the clock scrambling mode by being configured to assign a clock scrambling function to the one or more lanes associated with the interface. 15. The application processor of claim 1, wherein:
the one or more application processor signals comprise one or more data signals; and the one or more transceiver signals comprise one or more data signals. 16. The application processor of claim 1, wherein:
the one or more application processor signals comprise one or more clock signals; and the one or more transceiver signals comprise one or more clock signals. 17. The application processor of claim 1, further comprising the coexistence manager. 18. The application processor of claim 1, wherein the application processor receives the information from the coexistence manager positioned remotely from the application processor. 19. The application processor of claim 1, wherein the control system configured to receive the information related to the interference at the victim receiver is configured to receive the information related to the interference at a wired victim receiver. 20. The application processor of claim 19, wherein the interference is interference in a time domain. 21. The application processor of claim 1, wherein the control system configured to receive the information related to the interference at the victim receiver is configured to receive the information related to the interference at a wireless victim receiver. 22. The application processor of claim 21, wherein the interference is interference in a frequency domain. 23. A method for mitigating interference experienced by a victim receiver as a result of an aggressor communications bus, comprising:
receiving information from a coexistence manager, the information related to interference at a victim receiver as a result of an aggressor communications bus; processing a determination of a data/clock mode of an interface that mitigates a performance impact corresponding to the interference; and setting the data/clock mode of the interface to mitigate the interference. 24. The method of claim 23, further comprising:
receiving information indicating if the victim receiver experiences the interference as the result of the aggressor communications bus; determining an acceptable performance level of the victim receiver; and determining the data/clock mode of which to set the interface to mitigate the interference experienced by the victim receiver and allow the victim receiver to operate at or above the acceptable performance level. 25. The method of claim 23, wherein setting the data/clock mode comprises setting a data rate of one or more lanes associated with the interface to mitigate the interference. 26. The method of claim 23, wherein setting the data/clock mode comprises setting a data scrambling mode of one or more lanes associated with the interface. 27. The method of claim 23, wherein setting the data/clock mode comprises setting a clock mode of one or more lanes associated with the interface. 28. The method of claim 23, wherein setting the data/clock mode comprises setting a clock scrambling mode of one or more lanes associated with the interface. 29. A transceiver comprising:
an interface configured to:
couple to an aggressor communications bus;
transmit one or more transceiver signals to the aggressor communications bus; and
receive one or more application processor signals from the aggressor communications bus; and
a control system configured to:
receive information from a coexistence manager, the information related to interference at a victim receiver as a result of the aggressor communications bus;
process a determination of a data/clock mode of the interface that mitigates a performance impact corresponding to the interference; and
set the data/clock mode of the interface to mitigate the interference. 30. The transceiver of claim 29 integrated into a device selected from the group consisting of: a system-on-a-chip (SoC), a peripheral, and an electronic component that includes an interface to a bus. | 2,100 |
5,685 | 5,685 | 13,488,184 | 2,139 | A content management system has at least two content server computers, a cache memory corresponding to each content server, the cache memory having a page cache to store cache objects for pages displayed by the content server, a dependency cache to store dependency information for the cache objects, and a notifier cache to replicate changes in dependency information to other caches. | 1. A content management system, comprising:
at least two content server computers; a cache memory corresponding to each content server, the cache memory comprising:
a page cache to store cache objects for pages displayed by the content server;
a dependency cache to store dependency information for the cache objects; and
a notifier cache to replicate changes in dependency information to other caches. 2. The content management system of claim 1, further comprising at least one satellite server, the satellite server having a local cache. 3. The content management system of claim 1, wherein the cache memories corresponding to the content server computers are clustered. 4. The content management system of claim 1, wherein the page cache, dependency cache and notifier caches comprise partitions of the cache memory. 5. A computer-implemented method of managing a distributed memory system, comprising:
maintaining at least two cache memories, each cache memory containing at least one cache object and a dependency associated with the cache object; receiving, at one of the cache memories updated information with regard to a cache object in another of the cache memories; invalidating the cache object in the one cache memory; and using the dependency to determine if other cache objects in the one memory are to be invalidated in a lazy manner, at the time of their subsequent access. 6. The method of claim 5 wherein the cache memories comprise a local cache of a content server and a local cache of a satellite server. 7. The method of claim 6, wherein the cache memories employ double buffering where a web page resides in both memories simultaneously. 8. The method of claim 5, further comprising:
receiving a request for a web page; and determining if the web page has any invalid cache objects. 9. The method of claim 8, wherein determining if the web page has any invalid cache objects comprises checking a flag associated with the cache objects. 10. The method of claim 9, further comprising removing the web page from the cache if the page has invalid cache objects. 11. The method of claim 10, further comprising:
generating a new page; serving the new page; recording the new page in a page cache; and recording dependencies associated with the new page in a dependency cache. 12. One or more non-transitory computer-readable media storing instructions that, when executed by a processor, cause the processor to perform a method comprising:
maintaining at least two cache memories, each cache memory containing at least one cache object and a dependency associated with the cache object; receiving, at one of the cache memories updated information with regard to a cache object in another of the cache memories; invalidating the cache object in the one cache memory; and using the dependency to determine if other cache objects in the one memory are to be invalidated in a lazy manner, at the time of their subsequent access. 13. The one or more non-transitory computer-readable media of claim 12, wherein the cache memories comprise a local cache of a content server and a local cache of a satellite server. 14. The one or more non-transitory computer-readable media of claim 12, wherein the cache memories employ double buffering where a web page resides in both memories simultaneously. 15. The one or more non-transitory computer-readable media of claim 12, further comprising:
receiving a request for a web page; and determining if the web page has any invalid cache objects. 16. The one or more non-transitory computer-readable media of claim 12, wherein determining if the web page has any invalid cache objects comprises checking a flag associated with the cache objects. 17. The one or more non-transitory computer-readable media of claim 16, further comprising removing the web page from the cache if the page has invalid cache objects. | A content management system has at least two content server computers, a cache memory corresponding to each content server, the cache memory having a page cache to store cache objects for pages displayed by the content server, a dependency cache to store dependency information for the cache objects, and a notifier cache to replicate changes in dependency information to other caches.1. A content management system, comprising:
at least two content server computers; a cache memory corresponding to each content server, the cache memory comprising:
a page cache to store cache objects for pages displayed by the content server;
a dependency cache to store dependency information for the cache objects; and
a notifier cache to replicate changes in dependency information to other caches. 2. The content management system of claim 1, further comprising at least one satellite server, the satellite server having a local cache. 3. The content management system of claim 1, wherein the cache memories corresponding to the content server computers are clustered. 4. The content management system of claim 1, wherein the page cache, dependency cache and notifier caches comprise partitions of the cache memory. 5. A computer-implemented method of managing a distributed memory system, comprising:
maintaining at least two cache memories, each cache memory containing at least one cache object and a dependency associated with the cache object; receiving, at one of the cache memories updated information with regard to a cache object in another of the cache memories; invalidating the cache object in the one cache memory; and using the dependency to determine if other cache objects in the one memory are to be invalidated in a lazy manner, at the time of their subsequent access. 6. The method of claim 5 wherein the cache memories comprise a local cache of a content server and a local cache of a satellite server. 7. The method of claim 6, wherein the cache memories employ double buffering where a web page resides in both memories simultaneously. 8. The method of claim 5, further comprising:
receiving a request for a web page; and determining if the web page has any invalid cache objects. 9. The method of claim 8, wherein determining if the web page has any invalid cache objects comprises checking a flag associated with the cache objects. 10. The method of claim 9, further comprising removing the web page from the cache if the page has invalid cache objects. 11. The method of claim 10, further comprising:
generating a new page; serving the new page; recording the new page in a page cache; and recording dependencies associated with the new page in a dependency cache. 12. One or more non-transitory computer-readable media storing instructions that, when executed by a processor, cause the processor to perform a method comprising:
maintaining at least two cache memories, each cache memory containing at least one cache object and a dependency associated with the cache object; receiving, at one of the cache memories updated information with regard to a cache object in another of the cache memories; invalidating the cache object in the one cache memory; and using the dependency to determine if other cache objects in the one memory are to be invalidated in a lazy manner, at the time of their subsequent access. 13. The one or more non-transitory computer-readable media of claim 12, wherein the cache memories comprise a local cache of a content server and a local cache of a satellite server. 14. The one or more non-transitory computer-readable media of claim 12, wherein the cache memories employ double buffering where a web page resides in both memories simultaneously. 15. The one or more non-transitory computer-readable media of claim 12, further comprising:
receiving a request for a web page; and determining if the web page has any invalid cache objects. 16. The one or more non-transitory computer-readable media of claim 12, wherein determining if the web page has any invalid cache objects comprises checking a flag associated with the cache objects. 17. The one or more non-transitory computer-readable media of claim 16, further comprising removing the web page from the cache if the page has invalid cache objects. | 2,100 |
5,686 | 5,686 | 14,581,813 | 2,161 | Techniques are described for efficient execution of analytical queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware. | 1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database; computing a maximal and a minimal error for each partial aggregation function result; distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys; computing a lower and an upper bound for each decoded partial aggregation function result; generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys; performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and returning a result, the result comprising determined k-th highest total sums across the processing nodes. 2. A computer program product as in claim 1, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 3. A computer program product as in claim 1, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 4. A computer program product as in claim 1, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 5. A computer program product as in claim 1, wherein the operations further comprise distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 6. A computer program product as in claim 1, wherein the operations further comprise:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 7. A computer-implemented method comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database; computing a maximal and a minimal error for each partial aggregation function result; distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys; computing a lower and an upper bound for each decoded partial aggregation function result; generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys; performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and returning a result, the result comprising determined k-th highest total sums across the processing nodes. 8. A computer-implemented method as in claim 7, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 9. A computer-implemented method as in claim 7, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 10. A computer-implemented method as in claim 7, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 11. A computer-implemented method as in claim 7, further comprising distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 12. A computer-implemented method as in claim 7, further comprising:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 13. A system comprising:
computer hardware configured to perform operations comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database;
computing a maximal and a minimal error for each partial aggregation function result;
distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys;
computing a lower and an upper bound for each decoded partial aggregation function result;
generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys;
performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and
returning a result, the result comprising determined k-th highest total sums across the processing nodes. 14. A system as in claim 13, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 15. A system as in claim 13, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 16. A system as in claim 13, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 17. A system as in claim 13, wherein the operations further comprise distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 18. A system as in claim 13, wherein the operations further comprise:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 19. A system as in claim 15, wherein the computer hardware comprises a programmable processor and a machine-readable medium storing instructions, when executed by the programmable processor, cause the at least one programmable processor to perform at least some of the operations. | Techniques are described for efficient execution of analytical queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware.1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database; computing a maximal and a minimal error for each partial aggregation function result; distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys; computing a lower and an upper bound for each decoded partial aggregation function result; generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys; performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and returning a result, the result comprising determined k-th highest total sums across the processing nodes. 2. A computer program product as in claim 1, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 3. A computer program product as in claim 1, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 4. A computer program product as in claim 1, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 5. A computer program product as in claim 1, wherein the operations further comprise distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 6. A computer program product as in claim 1, wherein the operations further comprise:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 7. A computer-implemented method comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database; computing a maximal and a minimal error for each partial aggregation function result; distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys; computing a lower and an upper bound for each decoded partial aggregation function result; generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys; performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and returning a result, the result comprising determined k-th highest total sums across the processing nodes. 8. A computer-implemented method as in claim 7, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 9. A computer-implemented method as in claim 7, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 10. A computer-implemented method as in claim 7, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 11. A computer-implemented method as in claim 7, further comprising distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 12. A computer-implemented method as in claim 7, further comprising:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 13. A system comprising:
computer hardware configured to perform operations comprising:
approximating a plurality of partial aggregation function results for data distributed across a cluster of processing nodes, the cluster of processing nodes comprising a plurality of computing systems, each storing a subset of data in a database; the approximating comprising determining a partial aggregation function result of the partial aggregation function results at each processing node based on an offset shared by a group of keys for data records in the database;
computing a maximal and a minimal error for each partial aggregation function result;
distributing a range of keys of the group of keys to each processing node, the distributing comprising each processing node receiving all encoded sums for its respective range of keys and being responsible for that respective range of keys;
computing a lower and an upper bound for each decoded partial aggregation function result;
generating an upper bound and a lower bound for a total sum per key of the group of keys, the generating comprising summing the lower bounds and upper bounds per key in the group of keys;
performing a collective reduce operation at each node based on a determined a global k-th highest lower bound; and
returning a result, the result comprising determined k-th highest total sums across the processing nodes. 14. A system as in claim 13, wherein the collective reduce operation comprises each node discarding keys from its range of keys that have an upper bound below the k-th highest lower bound. 15. A system as in claim 13, wherein each partial aggregation function result is approximated by only m bits, and wherein the m bits begin at the offset. 16. A system as in claim 13, wherein the offset is equal to a position of a highest one-bit of all numbers within the group. 17. A system as in claim 13, wherein the operations further comprise distributing the range of keys for each processing node to the other processing nodes via personalized all-to-all messages such that each processing node receives all encoded sums for its range of keys. 18. A system as in claim 13, wherein the operations further comprise:
translating a query into native code, the native code being optimized for inter-node parallelism compiling the native code to a binary module; and executing the compiled native code to optimize use of parallelism within one core, intra-node parallelism, and inter-node parallelism among the cluster of processing nodes. 19. A system as in claim 15, wherein the computer hardware comprises a programmable processor and a machine-readable medium storing instructions, when executed by the programmable processor, cause the at least one programmable processor to perform at least some of the operations. | 2,100 |
5,687 | 5,687 | 14,994,448 | 2,184 | A vehicle subsystem includes a first signal including a first master value is transmitted from a first failsafe device and a third failsafe device. A first, signal is transmitted via a primary bus. A second signal including a second master value is transmitted from a second failsafe device to a fourth failsafe device. The first and second master values indicate whether the first and second signals are authoritative on the primary bus, the secondary bus, both, or neither. | 1. A vehicle subsystem, comprising:
first and second failsafe devices, having a processor and a memory, the memory storing instructions executable by the processor to transmit information; and a first arbitration bus connecting the first and second failsafe devices, wherein the first arbitration bus transmits information between the first and second failsafe devices; wherein the first failsafe device is programmed to communicate with a third failsafe device over a primary bus and wherein the second failsafe device is programmed to communicate with a fourth failsafe device over a secondary bus; wherein the first failsafe device is programmed to transmit a first signal including a first master value to the third failsafe device via the primary bus and the second failsafe device is programmed to transmit a second signal including a second master value to the fourth failsafe device via the secondary bus, wherein the first master value and the second master value each indicate one of:
the first signal on the primary bus being authoritative,
the second signal on the secondary bus being authoritative,
the first and second signals on both the primary and secondary buses, respectively, being authoritative and
neither the first and second signals on neither the primary and secondary buses, respectively, being authoritative. 2. The system of claim 1, further comprising a second arbitration bus communicatively connecting the third and fourth failsafe devices, wherein the third failsafe device is programmed to transmit the first signal to the fourth failsafe device via the second arbitration bus and the fourth failsafe device is programmed to transmit the second signal to the third failsafe device via the second arbitration bus. 3. The, system of claim 1, wherein the first failsafe device is programmed to receive a third signal with a third master value from the third failsafe device via the primary bus and the second failsafe device is programmed to receive a fourth signal with a fourth master value via the secondary bus, wherein the third master value and the fourth master value each indicate one of:
the third signal on the primary bus being authoritative, the fourth signal on the secondary bus being authoritative, the third and fourth signals on both the primary and secondary buses, respectively, being authoritative and neither the third and fourth signals on neither the primary and secondary buses, respectively, being authoritative. 4. The system of claim 1, wherein the first failsafe device is powered by a first power source and the second failsafe device is powered by a second power source. 5. The system of claim 1, wherein the subsystem is one of an autonomous vehicle control subsystem, a powertrain subsystem, a brake subsystem, a steering subsystem, and a lighting subsystem. 6. The system of claim 1, wherein the third and fourth failsafe devices are included a second vehicle subsystem. 7. The system of claim 1, wherein the third failsafe device is programmed to determine whether the first signal is aged and the fourth failsafe device is programmed to determine whether the second signal is aged. 8. The system of claim 7, wherein the third failsafe device is programmed to indicate that the first signal is not authoritative on the primary bus when the first signal is aged and the fourth failsafe device is programmed to indicate that the second signal is not authoritative on the secondary bus when the second signal is aged. 9. The system of claim 1, wherein the third and fourth failsafe devices are programmed to declare a fault when the either the first or second master values indicate that one of the first and second signals is not authoritative on one of the primary and secondary buses. 10. The system of claim 1, wherein the first and second failsafe devices are each programmed to arbitrate both the first and second master values. 11. A method, comprising:
transmitting a first signal including a first master value from a first failsafe device to a third failsafe device via a primary bus and transmitting a second signal including a second master value from a second failsafe device to a fourth failsafe device via a secondary bus, wherein the first master value and the second master value each indicate one of:
the first signal on the primary bus being authoritative,
the second signal on the secondary bus being authoritative,
the first and second signals on both the primary and secondary buses, respectively, being authoritative and
neither the first and second signals on neither the primary and secondary buses, respectively, being authoritative. 12. The method of claim 11, further comprising a second arbitration bus communicatively connecting the third and fourth failsafe devices, wherein the third failsafe device transmits the first signal to the fourth failsafe device via the second arbitration bus and the fourth fail safe device transmits the second signal to the third failsafe device via the second arbitration bus. 13. The method of claim 11, further comprising:
receiving a third signal with a third master value transmitted from the third failsafe device to the first failsafe device via a third network path that includes the primary bus and a fourth network path that includes the first and second arbitration buses and the secondary bus, wherein the third master value indicates one of:
the third signal on the primary bus being authoritative,
the fourth signal on the secondary bus being authoritative,
the third and fourth signals on both the primary and secondary buses, respectively, being authoritative and
neither the third and fourth signals on neither the primary and secondary buses, respectively, being authoritative. 14. The method of claim 11, wherein the first failsafe device is powered by a first power source and the second failsafe device is powered by a second power source. 15. The method of claim 11, wherein the subsystem is one of an autonomous vehicle control subsystem, a powertrain subsystem, a brake subsystem, a steering subsystem, and a lighting subsystem. 16. The method of claim 11, wherein the d and fourth failsafe devices are included in a second vehicle subsystem. 17. The method of claim 11, further comprising determining whether the first signal is aged with the third failsafe device and determining whether the second signal is aged with the fourth failsafe device. 18. The method of claim 17, further comprising indicating with the third failsafe device that the first signal is not authoritative on the primary bus when the first signal is aged and indicating with the fourth failsafe device that the second signal is not authoritative on the secondary bus when the second signal is aged. 19. The method of claim 11, further comprising declaring a fault with one of the third and fourth failsafe devices when the either the first or second master values indicate that one of the first and second signals is not authoritative on one of the primary and secondary buses. 20. The method of claim 11, further comprising arbitrate both the first and second master values with one of the first and second failsafe devices. | A vehicle subsystem includes a first signal including a first master value is transmitted from a first failsafe device and a third failsafe device. A first, signal is transmitted via a primary bus. A second signal including a second master value is transmitted from a second failsafe device to a fourth failsafe device. The first and second master values indicate whether the first and second signals are authoritative on the primary bus, the secondary bus, both, or neither.1. A vehicle subsystem, comprising:
first and second failsafe devices, having a processor and a memory, the memory storing instructions executable by the processor to transmit information; and a first arbitration bus connecting the first and second failsafe devices, wherein the first arbitration bus transmits information between the first and second failsafe devices; wherein the first failsafe device is programmed to communicate with a third failsafe device over a primary bus and wherein the second failsafe device is programmed to communicate with a fourth failsafe device over a secondary bus; wherein the first failsafe device is programmed to transmit a first signal including a first master value to the third failsafe device via the primary bus and the second failsafe device is programmed to transmit a second signal including a second master value to the fourth failsafe device via the secondary bus, wherein the first master value and the second master value each indicate one of:
the first signal on the primary bus being authoritative,
the second signal on the secondary bus being authoritative,
the first and second signals on both the primary and secondary buses, respectively, being authoritative and
neither the first and second signals on neither the primary and secondary buses, respectively, being authoritative. 2. The system of claim 1, further comprising a second arbitration bus communicatively connecting the third and fourth failsafe devices, wherein the third failsafe device is programmed to transmit the first signal to the fourth failsafe device via the second arbitration bus and the fourth failsafe device is programmed to transmit the second signal to the third failsafe device via the second arbitration bus. 3. The, system of claim 1, wherein the first failsafe device is programmed to receive a third signal with a third master value from the third failsafe device via the primary bus and the second failsafe device is programmed to receive a fourth signal with a fourth master value via the secondary bus, wherein the third master value and the fourth master value each indicate one of:
the third signal on the primary bus being authoritative, the fourth signal on the secondary bus being authoritative, the third and fourth signals on both the primary and secondary buses, respectively, being authoritative and neither the third and fourth signals on neither the primary and secondary buses, respectively, being authoritative. 4. The system of claim 1, wherein the first failsafe device is powered by a first power source and the second failsafe device is powered by a second power source. 5. The system of claim 1, wherein the subsystem is one of an autonomous vehicle control subsystem, a powertrain subsystem, a brake subsystem, a steering subsystem, and a lighting subsystem. 6. The system of claim 1, wherein the third and fourth failsafe devices are included a second vehicle subsystem. 7. The system of claim 1, wherein the third failsafe device is programmed to determine whether the first signal is aged and the fourth failsafe device is programmed to determine whether the second signal is aged. 8. The system of claim 7, wherein the third failsafe device is programmed to indicate that the first signal is not authoritative on the primary bus when the first signal is aged and the fourth failsafe device is programmed to indicate that the second signal is not authoritative on the secondary bus when the second signal is aged. 9. The system of claim 1, wherein the third and fourth failsafe devices are programmed to declare a fault when the either the first or second master values indicate that one of the first and second signals is not authoritative on one of the primary and secondary buses. 10. The system of claim 1, wherein the first and second failsafe devices are each programmed to arbitrate both the first and second master values. 11. A method, comprising:
transmitting a first signal including a first master value from a first failsafe device to a third failsafe device via a primary bus and transmitting a second signal including a second master value from a second failsafe device to a fourth failsafe device via a secondary bus, wherein the first master value and the second master value each indicate one of:
the first signal on the primary bus being authoritative,
the second signal on the secondary bus being authoritative,
the first and second signals on both the primary and secondary buses, respectively, being authoritative and
neither the first and second signals on neither the primary and secondary buses, respectively, being authoritative. 12. The method of claim 11, further comprising a second arbitration bus communicatively connecting the third and fourth failsafe devices, wherein the third failsafe device transmits the first signal to the fourth failsafe device via the second arbitration bus and the fourth fail safe device transmits the second signal to the third failsafe device via the second arbitration bus. 13. The method of claim 11, further comprising:
receiving a third signal with a third master value transmitted from the third failsafe device to the first failsafe device via a third network path that includes the primary bus and a fourth network path that includes the first and second arbitration buses and the secondary bus, wherein the third master value indicates one of:
the third signal on the primary bus being authoritative,
the fourth signal on the secondary bus being authoritative,
the third and fourth signals on both the primary and secondary buses, respectively, being authoritative and
neither the third and fourth signals on neither the primary and secondary buses, respectively, being authoritative. 14. The method of claim 11, wherein the first failsafe device is powered by a first power source and the second failsafe device is powered by a second power source. 15. The method of claim 11, wherein the subsystem is one of an autonomous vehicle control subsystem, a powertrain subsystem, a brake subsystem, a steering subsystem, and a lighting subsystem. 16. The method of claim 11, wherein the d and fourth failsafe devices are included in a second vehicle subsystem. 17. The method of claim 11, further comprising determining whether the first signal is aged with the third failsafe device and determining whether the second signal is aged with the fourth failsafe device. 18. The method of claim 17, further comprising indicating with the third failsafe device that the first signal is not authoritative on the primary bus when the first signal is aged and indicating with the fourth failsafe device that the second signal is not authoritative on the secondary bus when the second signal is aged. 19. The method of claim 11, further comprising declaring a fault with one of the third and fourth failsafe devices when the either the first or second master values indicate that one of the first and second signals is not authoritative on one of the primary and secondary buses. 20. The method of claim 11, further comprising arbitrate both the first and second master values with one of the first and second failsafe devices. | 2,100 |
5,688 | 5,688 | 15,198,952 | 2,186 | A trigger can relate to power usage of a computing device that a computer program to be run or running on the computing device causes. Detection of the trigger causes performance of a power-saving action. The power-saving action relates to the computer program to reduce the power usage of the computing device. The power-saving action is a strictly software-oriented action. An amount of power of the computing device used in detecting the trigger and performing the power-saving action is less than a reduction of the power usage of the computing device that results from performing the power-saving action, resulting in a net power usage reduction. | 1. A system comprising:
a processor; a storage device to store a computer program that is executable by a processor, and to store power management computer code that is executable by the processor, where the power-management computer code is to:
detect a trigger comprising detecting that the computer program is causing the system to use more power than the computer program is expected to use; and
responsive to the trigger being detected, perform a power-saving action in relation to the computer program to reduce the power usage of the system without placing the system as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the system to use more power than expected. 2. The system of claim 1, wherein the power management code is part of the computer program itself. 3. The system of claim 1, wherein the power management code is part of another, different computer program than the computer program. 4. The system of claim 1, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 5. The system of claim 1, wherein the power-saving action is the recommendation to reinstall the computer program. 6. The system of claim 1, wherein the power-saving action is the recommendation to install the patch for the computer program. 7. A method comprising:
detecting, by a computing device executing power-management code, a first trigger comprising detecting that a computer program running on the computing device is causing the computing device to use more power than the computer program is expected to use; and responsive to the first trigger being detected, performing, by the computing device executing the power-management code, a power-saving action in relation to the computer program to reduce the power usage of the computing device without placing the computing device as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the computing device to use more power than expected. 8. The method of claim 7, wherein the power management code is part of the computer program itself. 9. The method of claim 7, wherein the power management code is part of another, different computer program than the computer program. 10. The method of claim 7, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 11. The method of claim 7, wherein the power-saving action is the recommendation to reinstall the computer program. 12. The method of claim 7, wherein the power-saving action is the recommendation to install the patch for the computer program. 13. A storage device storing computer-readable power management code executable by a processor of a computing device to cause the computing device to:
detect a trigger comprising detecting that a computer program running on the computing device is causing the computing device to use more power than the computer program is expected to use; and responsive to the trigger being detected, perform a power-saving action in relation to the computer program to reduce the power usage of the computing device without placing the computing device as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the computing device to use more power than expected. 14. The storage device of claim 13, wherein the power management code is part of the computer program itself. 15. The storage device of claim 13, wherein the power management code is part of another, different computer program than the computer program. 16. The storage device of claim 13, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 17. The storage device of claim 13, wherein the power-saving action is the recommendation to reinstall the computer program. 18. The storage device of claim 13, wherein the power-saving action is the recommendation to install the patch for the computer program. | A trigger can relate to power usage of a computing device that a computer program to be run or running on the computing device causes. Detection of the trigger causes performance of a power-saving action. The power-saving action relates to the computer program to reduce the power usage of the computing device. The power-saving action is a strictly software-oriented action. An amount of power of the computing device used in detecting the trigger and performing the power-saving action is less than a reduction of the power usage of the computing device that results from performing the power-saving action, resulting in a net power usage reduction.1. A system comprising:
a processor; a storage device to store a computer program that is executable by a processor, and to store power management computer code that is executable by the processor, where the power-management computer code is to:
detect a trigger comprising detecting that the computer program is causing the system to use more power than the computer program is expected to use; and
responsive to the trigger being detected, perform a power-saving action in relation to the computer program to reduce the power usage of the system without placing the system as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the system to use more power than expected. 2. The system of claim 1, wherein the power management code is part of the computer program itself. 3. The system of claim 1, wherein the power management code is part of another, different computer program than the computer program. 4. The system of claim 1, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 5. The system of claim 1, wherein the power-saving action is the recommendation to reinstall the computer program. 6. The system of claim 1, wherein the power-saving action is the recommendation to install the patch for the computer program. 7. A method comprising:
detecting, by a computing device executing power-management code, a first trigger comprising detecting that a computer program running on the computing device is causing the computing device to use more power than the computer program is expected to use; and responsive to the first trigger being detected, performing, by the computing device executing the power-management code, a power-saving action in relation to the computer program to reduce the power usage of the computing device without placing the computing device as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the computing device to use more power than expected. 8. The method of claim 7, wherein the power management code is part of the computer program itself. 9. The method of claim 7, wherein the power management code is part of another, different computer program than the computer program. 10. The method of claim 7, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 11. The method of claim 7, wherein the power-saving action is the recommendation to reinstall the computer program. 12. The method of claim 7, wherein the power-saving action is the recommendation to install the patch for the computer program. 13. A storage device storing computer-readable power management code executable by a processor of a computing device to cause the computing device to:
detect a trigger comprising detecting that a computer program running on the computing device is causing the computing device to use more power than the computer program is expected to use; and responsive to the trigger being detected, perform a power-saving action in relation to the computer program to reduce the power usage of the computing device without placing the computing device as a whole into a shutoff, sleep, standby, or hibernation state, the power-saving action being a strictly software-oriented action, the power-saving action being a recommendation to one or more of: reinstall the computer program, and install a patch for the computer program, so that the computer program does not cause the computing device to use more power than expected. 14. The storage device of claim 13, wherein the power management code is part of the computer program itself. 15. The storage device of claim 13, wherein the power management code is part of another, different computer program than the computer program. 16. The storage device of claim 13, wherein the trigger is defined pursuant to a policy comprising an override condition in which performing the power-saving action in response to detecting the trigger can be overridden so that the power-saving action is not performed even when the trigger has been detected. 17. The storage device of claim 13, wherein the power-saving action is the recommendation to reinstall the computer program. 18. The storage device of claim 13, wherein the power-saving action is the recommendation to install the patch for the computer program. | 2,100 |
5,689 | 5,689 | 14,826,868 | 2,162 | In one embodiment, a method includes receiving a search query. The method includes generating query commands based on the search query. The of query commands include a first query command comprising a query constraint for objects having a first privacy setting, and a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting. The method includes searching to identify a first set of objects that match the first query command, and a second set of objects associated that match the second query command. The method includes generating one or more search results and sending a search-results page to the client system of the first user for display. | 1. A method comprising:
receiving a search query from a client system of a first user of an online social network; generating a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
searching one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generating one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and sending, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. 2. The method of claim 1, wherein each object is of a particular object-type, and wherein the object-type of each object is selected from a group consisting of: users, photos, videos, pages, applications, events, locations, and user groups. 3. The method of claim 1, wherein generating the plurality of query commands is further based on information provided by the online social network. 4. The method of claim 3, wherein the information provided by the social network is one or more of location information associated with the first user, language information associated with the first user, or user preferences of the first user. 5. The method of claim 1, wherein the first query command is generated based on a first set of information provided by the online social network and the second query command is generated based on a second set of information provided by the online social network. 6. The method of claim 1, wherein searching comprises searching a plurality of verticals to identify the plurality of sets of objects that match the plurality of query commands, and wherein each vertical stores one or more objects associated with the online social network, each object corresponding to a second node of the plurality of second nodes, and wherein each vertical of the plurality of verticals stores objects of a particular object-type, at least one object-type being posts. 7. The method of claim 1, further comprising calculating a score for each identified object of the plurality of objects. 8. The method of claim 7, wherein calculating a score for each identified object is based at least on an author of the object, a number of times the object has been engaged with, a quality of text matching, a phrase associated with the object that is trending, a topic associated with the object, or a date associated with the object. 9. The method of claim 7 further comprising identifying objects in the first set of objects authored by key-authors, and wherein calculating a score for each object in the first set of objects is based at least on the objected authored by key-authors. 10. The method of claim 7, wherein calculating a score for each object in the first set of objects is based at least on a quality of text matching, wherein each object in the first set of objects matches the search query. 11. The method of claim 7, wherein calculating a score for each object in the second set of objects is based at least on a quality of text matching, wherein each object in the second set of objects substantially matches the search query. 12. The method of claim 7, wherein calculating a score for each object in the second set of objects is based at least on an affinity between the querying user and the author of the object or affinity between the querying user and one or more commenters of the object. 13. The method of claim 7, wherein each generated search result corresponds to an identified object having a score greater than a threshold score. 14. The method of claim 1, further comprising:
determining for each identified object a visibility of the object with respect to the first user; and excluding each identified object that is not visible to the first user from the generated search results. 15. The method of claim 1, wherein the search-results page comprises a plurality of search-results modules, at least one search-results module comprising search results corresponding to objects from the first set of objects, and at least one search-results module comprising search results corresponding to objects from the second set of objects. 16. The method of claim 1, further comprising blending the first and second sets of identified objects to form a set of blended search results comprising a threshold number of identified objects from each set. 17. The method of claim 1, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user; and a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively. 18. The method of claim 1, wherein the plurality of query commands are generated by a sub-request generator of the online social network. 19. The method of claim 1, wherein the first privacy setting is a public privacy setting. 20. The method of claim 1, wherein the second privacy setting is for objects associated with second users within a threshold degree of separation from the first user with in the online social network. 21. The method of claim 1, wherein the second privacy setting is for objects associated with second users included in a list. 22. The method of claim 1, wherein the second privacy setting is for objects associated with second users that are connected to the first user by a friend edge. 23. The method of claim 1, wherein the second privacy setting is for objects associated with groups that are connected to the first user. 24. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive a search query from a client system of a first user of an online social network; generate a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
search one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generate one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and send, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. 25. A system comprising: one or more processors; and a non-transitory memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive a search query from a client system of a first user of an online social network; generate a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
search one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generate one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and send, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. | In one embodiment, a method includes receiving a search query. The method includes generating query commands based on the search query. The of query commands include a first query command comprising a query constraint for objects having a first privacy setting, and a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting. The method includes searching to identify a first set of objects that match the first query command, and a second set of objects associated that match the second query command. The method includes generating one or more search results and sending a search-results page to the client system of the first user for display.1. A method comprising:
receiving a search query from a client system of a first user of an online social network; generating a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
searching one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generating one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and sending, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. 2. The method of claim 1, wherein each object is of a particular object-type, and wherein the object-type of each object is selected from a group consisting of: users, photos, videos, pages, applications, events, locations, and user groups. 3. The method of claim 1, wherein generating the plurality of query commands is further based on information provided by the online social network. 4. The method of claim 3, wherein the information provided by the social network is one or more of location information associated with the first user, language information associated with the first user, or user preferences of the first user. 5. The method of claim 1, wherein the first query command is generated based on a first set of information provided by the online social network and the second query command is generated based on a second set of information provided by the online social network. 6. The method of claim 1, wherein searching comprises searching a plurality of verticals to identify the plurality of sets of objects that match the plurality of query commands, and wherein each vertical stores one or more objects associated with the online social network, each object corresponding to a second node of the plurality of second nodes, and wherein each vertical of the plurality of verticals stores objects of a particular object-type, at least one object-type being posts. 7. The method of claim 1, further comprising calculating a score for each identified object of the plurality of objects. 8. The method of claim 7, wherein calculating a score for each identified object is based at least on an author of the object, a number of times the object has been engaged with, a quality of text matching, a phrase associated with the object that is trending, a topic associated with the object, or a date associated with the object. 9. The method of claim 7 further comprising identifying objects in the first set of objects authored by key-authors, and wherein calculating a score for each object in the first set of objects is based at least on the objected authored by key-authors. 10. The method of claim 7, wherein calculating a score for each object in the first set of objects is based at least on a quality of text matching, wherein each object in the first set of objects matches the search query. 11. The method of claim 7, wherein calculating a score for each object in the second set of objects is based at least on a quality of text matching, wherein each object in the second set of objects substantially matches the search query. 12. The method of claim 7, wherein calculating a score for each object in the second set of objects is based at least on an affinity between the querying user and the author of the object or affinity between the querying user and one or more commenters of the object. 13. The method of claim 7, wherein each generated search result corresponds to an identified object having a score greater than a threshold score. 14. The method of claim 1, further comprising:
determining for each identified object a visibility of the object with respect to the first user; and excluding each identified object that is not visible to the first user from the generated search results. 15. The method of claim 1, wherein the search-results page comprises a plurality of search-results modules, at least one search-results module comprising search results corresponding to objects from the first set of objects, and at least one search-results module comprising search results corresponding to objects from the second set of objects. 16. The method of claim 1, further comprising blending the first and second sets of identified objects to form a set of blended search results comprising a threshold number of identified objects from each set. 17. The method of claim 1, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user; and a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively. 18. The method of claim 1, wherein the plurality of query commands are generated by a sub-request generator of the online social network. 19. The method of claim 1, wherein the first privacy setting is a public privacy setting. 20. The method of claim 1, wherein the second privacy setting is for objects associated with second users within a threshold degree of separation from the first user with in the online social network. 21. The method of claim 1, wherein the second privacy setting is for objects associated with second users included in a list. 22. The method of claim 1, wherein the second privacy setting is for objects associated with second users that are connected to the first user by a friend edge. 23. The method of claim 1, wherein the second privacy setting is for objects associated with groups that are connected to the first user. 24. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive a search query from a client system of a first user of an online social network; generate a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
search one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generate one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and send, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. 25. A system comprising: one or more processors; and a non-transitory memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive a search query from a client system of a first user of an online social network; generate a plurality of query commands based on the search query, wherein the plurality of query commands comprises:
a first query command comprising a query constraint for objects having a first privacy setting; and
a second query command comprising a query constraint for objects having a second privacy setting, wherein the second privacy setting is more restrictive than the first privacy setting;
search one or more data stores to identify a plurality of objects matching the plurality of query commands, wherein the identified objects comprise:
a first set of objects associated with the online social network that match the first query command; and
a second set of objects associated with the online social network that match the second query command;
generate one or more search results corresponding to one or more of the identified objects, respectively, each search result comprising a reference to the corresponding identified object, wherein at least one of the search results corresponds to an object from the first set of objects, and wherein at least one of the search results corresponds to an object from the second set of objects; and send, responsive to the search query, a search-results page to the client system of the first user for display, the search-results page comprising one or more of the generated search results. | 2,100 |
5,690 | 5,690 | 12,887,248 | 2,165 | Disclosed herein are systems, methods, and non-transitory computer-readable storage media for classifying a live media tag into a type. A system configured to practice the method receives a group of tags generated in real time and associated with at least a portion of a live media event, identifies a tag type for at least one tag in the group of tags, and classifies the at least one tag as the tag type. Tag types can include system-defined types, user-entered types, categories, media categories, and text labels. More than one user can generate tags for the media event via more than one tagging platform. The system can further identify the tag type by sending to a user a list of suggested tag types, receiving from the user a selection of a suggested tag type from the list, and identifying the tag type as the suggested tag type. | 1. A method of classifying a live media tag into a type, the method comprising:
receiving a group of tags generated in real time and associated with at least a portion of a live media event; identifying a tag type for at least one tag in the group of tags; and classifying the at least one tag as the tag type. 2. The method of claim 1, wherein the tag type is at least one of a system-defined type, a user-entered type, a category, a media category, and a text label. 3. The method of claim 1, wherein the group of tags is generated in real time by a plurality of users. 4. The method of claim 3, wherein the group of tags is generated via a plurality of tagging platforms. 5. The method of claim 1, wherein identifying and classifying are performed based on additional user input. 6. The method of claim 1, wherein identifying the tag type further comprises:
sending to a user a list of suggested tag types for the at least one tag in the group of tags; receiving from the user a selection of a suggested tag type from the list of suggested tag types; and identifying the tag type as the suggested tag type. 7. The method of claim 1, wherein identifying the tag type is based on at least one of tag content, tag context, tag metadata, an associated position in the media content, and similarity of the at least one tag to other tags. 8. The method of claim 7, wherein identifying the tag type is further based on a tag type likelihood. 9. The method of claim 1, further comprising:
receiving a tag type criterion; filtering the group of tags based on their respective tag types to yield a filtered group of tags; and outputting the filtered group of tags. 10. The method of claim 1, further comprising:
preparing a summary of at least part of the live media event based on at least part of the group of tags and their respective tag types; and displaying the summary to a user. 11. The method of claim 10, wherein displaying the summary to the user further comprises simultaneously playing back the at least part of the live media event and the at least part of the group of tags and their respective tag types. 12. The method of claim 1, further comprising:
adjusting how the at least one tag is associated with the live media event based on the tag type. 13. The method of claim 12, wherein adjusting how the at least one tag is associated with the live media event comprises at least one of moving a start point of the at least one tag, moving an end point of the at least one tag, changing a duration of the at least one tag, and updating at least part of metadata associated with the at least one tag. 14. The method of claim 1, further comprising classifying the at least one tag as more than one tag type. 15. The method of claim 1, wherein classifying the at least one tag as the tag type triggers an automated action based on the tag type. 16. A system for classifying a live media tag into a type, the system comprising:
a processor; a first module configured to control the processor to receive, from a user, a tag associated with a live media event; a second module configured to control the processor to transmit the tag to a tag server; a third module configured to control the processor to receive from the tag server at least one suggested tag type for the tag; a fourth module configured to control the processor to display the at least one suggested tag type to the user. 17. The system of claim 16, further comprising:
a fifth module configured to control the processor to receive, from the user, a selected tag type from the at least one suggested tag type; and a sixth module configured to assign the selected tag type to the tag. 18. The system of claim 16, 19. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to classify a live media tag under a tag type, the instructions comprising:
receiving a group of tags generated in real time and associated with at least a portion of a live media event; identifying a tag type for at least one tag in the group of tags; and classifying the at least one tag as the tag type. 20. The non-transitory computer-readable storage medium of claim 19, the instructions further comprising:
preparing a summary of at least part of the live media event based on at least part of the group of tags and their respective tag types; and displaying the summary to a user. | Disclosed herein are systems, methods, and non-transitory computer-readable storage media for classifying a live media tag into a type. A system configured to practice the method receives a group of tags generated in real time and associated with at least a portion of a live media event, identifies a tag type for at least one tag in the group of tags, and classifies the at least one tag as the tag type. Tag types can include system-defined types, user-entered types, categories, media categories, and text labels. More than one user can generate tags for the media event via more than one tagging platform. The system can further identify the tag type by sending to a user a list of suggested tag types, receiving from the user a selection of a suggested tag type from the list, and identifying the tag type as the suggested tag type.1. A method of classifying a live media tag into a type, the method comprising:
receiving a group of tags generated in real time and associated with at least a portion of a live media event; identifying a tag type for at least one tag in the group of tags; and classifying the at least one tag as the tag type. 2. The method of claim 1, wherein the tag type is at least one of a system-defined type, a user-entered type, a category, a media category, and a text label. 3. The method of claim 1, wherein the group of tags is generated in real time by a plurality of users. 4. The method of claim 3, wherein the group of tags is generated via a plurality of tagging platforms. 5. The method of claim 1, wherein identifying and classifying are performed based on additional user input. 6. The method of claim 1, wherein identifying the tag type further comprises:
sending to a user a list of suggested tag types for the at least one tag in the group of tags; receiving from the user a selection of a suggested tag type from the list of suggested tag types; and identifying the tag type as the suggested tag type. 7. The method of claim 1, wherein identifying the tag type is based on at least one of tag content, tag context, tag metadata, an associated position in the media content, and similarity of the at least one tag to other tags. 8. The method of claim 7, wherein identifying the tag type is further based on a tag type likelihood. 9. The method of claim 1, further comprising:
receiving a tag type criterion; filtering the group of tags based on their respective tag types to yield a filtered group of tags; and outputting the filtered group of tags. 10. The method of claim 1, further comprising:
preparing a summary of at least part of the live media event based on at least part of the group of tags and their respective tag types; and displaying the summary to a user. 11. The method of claim 10, wherein displaying the summary to the user further comprises simultaneously playing back the at least part of the live media event and the at least part of the group of tags and their respective tag types. 12. The method of claim 1, further comprising:
adjusting how the at least one tag is associated with the live media event based on the tag type. 13. The method of claim 12, wherein adjusting how the at least one tag is associated with the live media event comprises at least one of moving a start point of the at least one tag, moving an end point of the at least one tag, changing a duration of the at least one tag, and updating at least part of metadata associated with the at least one tag. 14. The method of claim 1, further comprising classifying the at least one tag as more than one tag type. 15. The method of claim 1, wherein classifying the at least one tag as the tag type triggers an automated action based on the tag type. 16. A system for classifying a live media tag into a type, the system comprising:
a processor; a first module configured to control the processor to receive, from a user, a tag associated with a live media event; a second module configured to control the processor to transmit the tag to a tag server; a third module configured to control the processor to receive from the tag server at least one suggested tag type for the tag; a fourth module configured to control the processor to display the at least one suggested tag type to the user. 17. The system of claim 16, further comprising:
a fifth module configured to control the processor to receive, from the user, a selected tag type from the at least one suggested tag type; and a sixth module configured to assign the selected tag type to the tag. 18. The system of claim 16, 19. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to classify a live media tag under a tag type, the instructions comprising:
receiving a group of tags generated in real time and associated with at least a portion of a live media event; identifying a tag type for at least one tag in the group of tags; and classifying the at least one tag as the tag type. 20. The non-transitory computer-readable storage medium of claim 19, the instructions further comprising:
preparing a summary of at least part of the live media event based on at least part of the group of tags and their respective tag types; and displaying the summary to a user. | 2,100 |
5,691 | 5,691 | 14,490,857 | 2,179 | A system and method for monitoring viewed content is provided. The method includes: monitoring for loading of electronic content on a user device; receiving periodic updates at a network device from the user device related to user actions associated with the electronic content; and monitoring a viewed status of the electronic content based on the user actions. The system includes: a content module configured to monitor for loading of electronic content on a user device; a tracking module configured to receive periodic updates from the user device related to user actions associated with the electronic content; and a status module configured to monitor a viewed status of the electronic content based on the user actions. | 1. A method for monitoring viewed content comprising:
monitoring for loading of electronic content on a user device; receiving periodic updates at a network device from the user device related to user actions associated with the electronic content; and monitoring a viewed status of the electronic content based on the user actions. 2. The method of claim 1 further comprising:
retrieving user conditions associated with the electronic content; and
modifying the viewed status based on the user conditions. 3. The method of claim 1 wherein the user action comprises scrolling of the electronic content within a viewing area. 4. The method of claim 1 wherein the electronic content comprises scrolling points and the viewed status is determined based on the scrolling points. 5. The method of claim 1 wherein the receiving periodic updates of the user actions associated with the electronic content comprises:
receiving periodic updates from the user device at predetermined time intervals. 6. The method of claim 1 wherein the receiving periodic updates of the user actions associated with the electronic content comprises:
receiving periodic updates from the user device on a triggering event. 7. The method of claim 1 further comprising:
determining analytics based on a user's viewing of the electronic content. 8. The method of claim 7 further comprising:
aggregating the analytics over a plurality of users for the electronic content. 9. The method of claim 1 wherein the receiving periodic updates comprises:
receiving whether a user is using assistive technology; and
determining the assistive technology's access of the electronic content. 10. A system for monitoring viewed content comprising:
a content module configured to monitor for loading of electronic content on a user device; a tracking module configured to receive periodic updates from the user device related to user actions associated with the electronic content; and a status module configured to monitor a viewed status of the electronic content based on the user actions. 11. The system of claim 10 further comprising:
a user module configured to retrieve user conditions associated with the electronic content; and
wherein the status module is further configured to modify the viewed status based on the user conditions. 12. The system of claim 10 wherein the user action comprises scrolling of the electronic content within a viewing area. 13. The system of claim 10 wherein the electronic content comprises scrolling points and the viewed status is determined based on the scrolling points. 14. The system of claim 10 wherein the tracking module is configured to receive periodic updates of the user actions associated with the electronic content at predetermined time intervals. 15. The system of claim 10 wherein the tracking module is configured to receive periodic updates of the user actions associated with the electronic content on a triggering event. 16. The system of claim 10 further comprising:
an analytics module configured to determine analytics based on a user's viewing of the electronic content. 17. The system of claim 16 further comprising:
a reporting module configured to aggregate the analytics over a plurality of users for the electronic content. 18. The system of claim 10 wherein the system further includes a user tracking module configured to:
determine whether a user is using assistive technology; and
determine the assistive technology's access of the electronic content. 19. A method for monitoring viewed content in a learning management system, the method comprising:
monitoring for loading of electronic content from the learning management system onto a student's user device; receiving periodic updates from the student's user device related to user actions associated with the electronic content; monitoring a viewed status of the electronic content based on the user actions; determining analytics based on a student's viewing of the electronic content; and aggregating the analytics over a plurality of students for the electronic content. | A system and method for monitoring viewed content is provided. The method includes: monitoring for loading of electronic content on a user device; receiving periodic updates at a network device from the user device related to user actions associated with the electronic content; and monitoring a viewed status of the electronic content based on the user actions. The system includes: a content module configured to monitor for loading of electronic content on a user device; a tracking module configured to receive periodic updates from the user device related to user actions associated with the electronic content; and a status module configured to monitor a viewed status of the electronic content based on the user actions.1. A method for monitoring viewed content comprising:
monitoring for loading of electronic content on a user device; receiving periodic updates at a network device from the user device related to user actions associated with the electronic content; and monitoring a viewed status of the electronic content based on the user actions. 2. The method of claim 1 further comprising:
retrieving user conditions associated with the electronic content; and
modifying the viewed status based on the user conditions. 3. The method of claim 1 wherein the user action comprises scrolling of the electronic content within a viewing area. 4. The method of claim 1 wherein the electronic content comprises scrolling points and the viewed status is determined based on the scrolling points. 5. The method of claim 1 wherein the receiving periodic updates of the user actions associated with the electronic content comprises:
receiving periodic updates from the user device at predetermined time intervals. 6. The method of claim 1 wherein the receiving periodic updates of the user actions associated with the electronic content comprises:
receiving periodic updates from the user device on a triggering event. 7. The method of claim 1 further comprising:
determining analytics based on a user's viewing of the electronic content. 8. The method of claim 7 further comprising:
aggregating the analytics over a plurality of users for the electronic content. 9. The method of claim 1 wherein the receiving periodic updates comprises:
receiving whether a user is using assistive technology; and
determining the assistive technology's access of the electronic content. 10. A system for monitoring viewed content comprising:
a content module configured to monitor for loading of electronic content on a user device; a tracking module configured to receive periodic updates from the user device related to user actions associated with the electronic content; and a status module configured to monitor a viewed status of the electronic content based on the user actions. 11. The system of claim 10 further comprising:
a user module configured to retrieve user conditions associated with the electronic content; and
wherein the status module is further configured to modify the viewed status based on the user conditions. 12. The system of claim 10 wherein the user action comprises scrolling of the electronic content within a viewing area. 13. The system of claim 10 wherein the electronic content comprises scrolling points and the viewed status is determined based on the scrolling points. 14. The system of claim 10 wherein the tracking module is configured to receive periodic updates of the user actions associated with the electronic content at predetermined time intervals. 15. The system of claim 10 wherein the tracking module is configured to receive periodic updates of the user actions associated with the electronic content on a triggering event. 16. The system of claim 10 further comprising:
an analytics module configured to determine analytics based on a user's viewing of the electronic content. 17. The system of claim 16 further comprising:
a reporting module configured to aggregate the analytics over a plurality of users for the electronic content. 18. The system of claim 10 wherein the system further includes a user tracking module configured to:
determine whether a user is using assistive technology; and
determine the assistive technology's access of the electronic content. 19. A method for monitoring viewed content in a learning management system, the method comprising:
monitoring for loading of electronic content from the learning management system onto a student's user device; receiving periodic updates from the student's user device related to user actions associated with the electronic content; monitoring a viewed status of the electronic content based on the user actions; determining analytics based on a student's viewing of the electronic content; and aggregating the analytics over a plurality of students for the electronic content. | 2,100 |
5,692 | 5,692 | 15,099,756 | 2,133 | Embodiments of the invention relate to a para-virtual I/O system. A state of a filesystem associated with a para-virtual I/O system is updated, which includes performing semantic journaling in support of the update. The semantic journaling includes writing one or more data blocks and logging metadata updates to a journal. A cache flush request is received and classified based on semantic information of the system. The classification provides an order of commands for processing the received request. The classification is converted into an order of committed writes, and the order of committed writes is processed. The processing includes enforcing the order of committed writes to provide a consistent virtual disk image. | 1. A method comprising:
updating a state of a filesystem associated with a para-virtual I/O system, including performing semantic journaling in support of the update, the semantic journaling comprising writing one or more data blocks and logging metadata updates to a journal; receiving a cache flush request; classifying the received request based on semantic information, wherein the classification provides an order of commands for processing the received request; converting the classification into an order of committed writes; and processing the order of committed writes, including enforcing the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 2. The method of claim 1, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 3. The method of claim 1, further comprising writing a commit record to the journal, and classifying the received flush request with a journal transaction commit. 4. The method of claim 1, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 5. The method of claim 1, further comprising recovering from a crash associated with the para-virtual I/O system, including bringing the filesystem to a consistent state. 6. The method of claim 5, wherein the recovery from the crash further comprises replaying the journal to a most recent committed transaction, wherein the replay brings the filesystem to the consistent state. 7. The method of claim 1, wherein the filesystem is a guest filesystem. 8. A computer program product for a para-virtual I/O system, the computer program product comprising a computer readable storage device having program code embodied therewith, the program code executable by a processing unit to:
update a state of a filesystem associated with the para-virtual I/O system, including program code to perform semantic journaling in support of the update, the semantic journaling comprising program code to write one or more data blocks and log metadata updates to a journal; receive a cache flush request; classify the received request based on semantic information, wherein the classification provides an order of commands for processing the received request; convert the classification into an order of committed writes; and process the order of committed writes, including enforcing the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 9. The computer program product of claim 8, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 10. The computer program product of claim 8, further comprising program code to write a commit record to the journal, and classify the received flush request with a journal transaction commit. 11. The computer program product of claim 8, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 12. The computer program product of claim 8, further comprising program code to recover from a crash associated with the para-virtual I/O system, including program code to bring the filesystem to a consistent state. 13. The computer program product of claim 12, wherein the recovery from the crash further comprises program code to replay the journal to a most recent committed transaction, wherein the replay brings the filesystem to the consistent state. 14. The computer program product of claim 8, wherein the filesystem is a guest filesystem. 15. A system comprising:
a para-virtual I/O system comprising a processor in communication with memory, wherein the para-virtual I/O system is associated with a filesystem; a journal manager to, update a state of the filesystem, including the journal manager to perform semantic journaling in support of the update, the semantic journaling comprising the journal manager to write one or more data blocks and log metadata updates to a journal; a classifier to classify a received flush request based on semantic information, wherein the classification provides an order of commands for processing the received request; a cache manager to convert the classification into an order of committed writes, and process the order of committed writes, including enforcement of the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 16. The system of claim 13, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 17. The system of claim 13, further comprising the journal manager to write a commit record to the journal, and the classifier to classify the received flush request with a journal transaction commit. 18. The system of claim 13, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 19. The system of claim 13, further comprising the journal manager to replay the journal to a most recent committed transaction in response to a crash associated with the para-virtual I/O system, wherein the filesystem is brought to a consistent state based on the replay. 20. The system of claim 20, wherein the filesystem is a guest filesystem. | Embodiments of the invention relate to a para-virtual I/O system. A state of a filesystem associated with a para-virtual I/O system is updated, which includes performing semantic journaling in support of the update. The semantic journaling includes writing one or more data blocks and logging metadata updates to a journal. A cache flush request is received and classified based on semantic information of the system. The classification provides an order of commands for processing the received request. The classification is converted into an order of committed writes, and the order of committed writes is processed. The processing includes enforcing the order of committed writes to provide a consistent virtual disk image.1. A method comprising:
updating a state of a filesystem associated with a para-virtual I/O system, including performing semantic journaling in support of the update, the semantic journaling comprising writing one or more data blocks and logging metadata updates to a journal; receiving a cache flush request; classifying the received request based on semantic information, wherein the classification provides an order of commands for processing the received request; converting the classification into an order of committed writes; and processing the order of committed writes, including enforcing the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 2. The method of claim 1, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 3. The method of claim 1, further comprising writing a commit record to the journal, and classifying the received flush request with a journal transaction commit. 4. The method of claim 1, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 5. The method of claim 1, further comprising recovering from a crash associated with the para-virtual I/O system, including bringing the filesystem to a consistent state. 6. The method of claim 5, wherein the recovery from the crash further comprises replaying the journal to a most recent committed transaction, wherein the replay brings the filesystem to the consistent state. 7. The method of claim 1, wherein the filesystem is a guest filesystem. 8. A computer program product for a para-virtual I/O system, the computer program product comprising a computer readable storage device having program code embodied therewith, the program code executable by a processing unit to:
update a state of a filesystem associated with the para-virtual I/O system, including program code to perform semantic journaling in support of the update, the semantic journaling comprising program code to write one or more data blocks and log metadata updates to a journal; receive a cache flush request; classify the received request based on semantic information, wherein the classification provides an order of commands for processing the received request; convert the classification into an order of committed writes; and process the order of committed writes, including enforcing the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 9. The computer program product of claim 8, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 10. The computer program product of claim 8, further comprising program code to write a commit record to the journal, and classify the received flush request with a journal transaction commit. 11. The computer program product of claim 8, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 12. The computer program product of claim 8, further comprising program code to recover from a crash associated with the para-virtual I/O system, including program code to bring the filesystem to a consistent state. 13. The computer program product of claim 12, wherein the recovery from the crash further comprises program code to replay the journal to a most recent committed transaction, wherein the replay brings the filesystem to the consistent state. 14. The computer program product of claim 8, wherein the filesystem is a guest filesystem. 15. A system comprising:
a para-virtual I/O system comprising a processor in communication with memory, wherein the para-virtual I/O system is associated with a filesystem; a journal manager to, update a state of the filesystem, including the journal manager to perform semantic journaling in support of the update, the semantic journaling comprising the journal manager to write one or more data blocks and log metadata updates to a journal; a classifier to classify a received flush request based on semantic information, wherein the classification provides an order of commands for processing the received request; a cache manager to convert the classification into an order of committed writes, and process the order of committed writes, including enforcement of the order of committed writes, wherein the enforcement provides a consistent virtual disk image. 16. The system of claim 13, wherein the semantic journaling is performed in a mode selected from the group consisting of: data, ordered, and write back. 17. The system of claim 13, further comprising the journal manager to write a commit record to the journal, and the classifier to classify the received flush request with a journal transaction commit. 18. The system of claim 13, wherein the semantic information comprises ordering and durability requirements to provide the consistent virtual disk image. 19. The system of claim 13, further comprising the journal manager to replay the journal to a most recent committed transaction in response to a crash associated with the para-virtual I/O system, wherein the filesystem is brought to a consistent state based on the replay. 20. The system of claim 20, wherein the filesystem is a guest filesystem. | 2,100 |
5,693 | 5,693 | 15,346,865 | 2,184 | Described examples include USB port controllers with a control circuit configured to switch from a normal first power mode to a second power mode for reduced power consumption in response a command from a port manager circuit, and to switch from the second power mode to the first power mode in response to detected activity on a communications connection, or a detected connection of a USB device to a USB port connector. After switching back to the first power mode in response to detected communications activity, the control circuit automatically switches operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode. | 1. A universal serial bus (USB) port controller for interfacing a USB device through a USB port connector, comprising:
a communications interface circuit to communicate with a port manager circuit over a communications connection; and a control circuit configured to:
switch operation of the USB port controller from a first power mode for normal operation of the USB port controller, to a second power mode for reduced power consumption by the USB port controller, in response to the communications interface circuit receiving a command from the port manager circuit,
switch operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on the communications connection, or (ii) a detected connection of a USB device to the USB port connector, and
after switching from the second power mode to the first power mode in response to detected activity on the communications connection, to automatically switch operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode. 2. The USB port controller of claim 1, further comprising:
a power circuit configurable by the port manager circuit to selectively operate in a configured port mode including one of:
a first port mode in which the power circuit delivers power to a power line of the USB port connector,
a second port mode in which the power circuit receives power from the power line, and
a third port mode in which the power circuit refrains from delivering power to, or receiving power from, the power line pending connection of the USB device to the USB port connector;
wherein the power circuit continues to operate in the configured port mode after switching from the second power mode to the first power mode. 3. The USB port controller of claim 2, wherein, in the second power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and a disabled state in which the USB port controller monitors the configuration channel line to detect connection of a power sourcing USB device to the USB port connector. 4. The USB port controller of claim 3, further comprising:
a comparator operative in the second power mode to compare a voltage of the configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line when the power circuit operates in the third port mode in the disabled state and when the power circuit operates in the second port mode, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector. 5. The USB port controller of claim 4, wherein, in the first power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and an unattached sink state in which the USB port controller monitors the communication channel line to detect connection of a power sourcing USB device to the USB port connector. 6. The USB port controller of claim 4, wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 7. The USB port controller of claim 3, wherein, in the first power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and an unattached sink state in which the USB port controller monitors the communication channel line to detect connection of a power sourcing USB device to the USB port connector. 8. The USB port controller of claim 2, further comprising:
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector; wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 9. The USB port controller of claim 8, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 10. The USB port controller of claim 1, further comprising:
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector; wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 11. The USB port controller of claim 10, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 12. The USB port controller of claim 1, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 13. The USB port controller of claim 1, wherein the communications interface circuit and the control circuit are fabricated in an integrated circuit. 14. A universal serial bus (USB) port controller for interfacing a USB device through a USB port connector, comprising:
a communications interface circuit to communicate with a port manager circuit over a communications connection; a control circuit configured to:
selectively operate the USB port controller in a first power mode for normal operation of the USB port controller or a second power mode for reduced power consumption by the USB port controller, and
switch operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on the communications connection, or (ii) a detected connection of a USB device to the USB port connector;
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance higher than a pull-down resistance applied in the first power mode. 15. The USB port controller of claim 14, wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 16. The USB port controller of claim 15, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 17. The USB port controller of claim 14, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 18. The USB port controller of claim 14, wherein the communications interface circuit and the control circuit are fabricated in an integrated circuit. 19. A method of to operate a universal serial bus (USB) port controller, the method comprising:
selectively operating the USB port controller in a first power mode for normal operation of the USB port controller or a second power mode for reduced power consumption by the USB port controller; switching operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on a communications connection, or (ii) a detected connection of a USB device to a USB port connector; and after switching from the second power mode to the first power mode in response to detected activity on the communications connection, automatically switching operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode. 20. The method of claim 19, further comprising:
operating a power circuit of the USB port controller to selectively operate in a configured port mode according to a configuration setting from the port manager circuit, the configured port mode including one of:
a first port mode in which the power circuit delivers power to a power line of the USB port connector,
a second port mode in which the power circuit receives power from the power line, and
a third port mode in which the power circuit refrains from delivering power to, or receiving power from, the power line pending connection of the USB device to the USB port connector;
wherein the power circuit continues to operate in the configured port mode after switching from the second power mode to the first power mode. | Described examples include USB port controllers with a control circuit configured to switch from a normal first power mode to a second power mode for reduced power consumption in response a command from a port manager circuit, and to switch from the second power mode to the first power mode in response to detected activity on a communications connection, or a detected connection of a USB device to a USB port connector. After switching back to the first power mode in response to detected communications activity, the control circuit automatically switches operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode.1. A universal serial bus (USB) port controller for interfacing a USB device through a USB port connector, comprising:
a communications interface circuit to communicate with a port manager circuit over a communications connection; and a control circuit configured to:
switch operation of the USB port controller from a first power mode for normal operation of the USB port controller, to a second power mode for reduced power consumption by the USB port controller, in response to the communications interface circuit receiving a command from the port manager circuit,
switch operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on the communications connection, or (ii) a detected connection of a USB device to the USB port connector, and
after switching from the second power mode to the first power mode in response to detected activity on the communications connection, to automatically switch operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode. 2. The USB port controller of claim 1, further comprising:
a power circuit configurable by the port manager circuit to selectively operate in a configured port mode including one of:
a first port mode in which the power circuit delivers power to a power line of the USB port connector,
a second port mode in which the power circuit receives power from the power line, and
a third port mode in which the power circuit refrains from delivering power to, or receiving power from, the power line pending connection of the USB device to the USB port connector;
wherein the power circuit continues to operate in the configured port mode after switching from the second power mode to the first power mode. 3. The USB port controller of claim 2, wherein, in the second power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and a disabled state in which the USB port controller monitors the configuration channel line to detect connection of a power sourcing USB device to the USB port connector. 4. The USB port controller of claim 3, further comprising:
a comparator operative in the second power mode to compare a voltage of the configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line when the power circuit operates in the third port mode in the disabled state and when the power circuit operates in the second port mode, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector. 5. The USB port controller of claim 4, wherein, in the first power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and an unattached sink state in which the USB port controller monitors the communication channel line to detect connection of a power sourcing USB device to the USB port connector. 6. The USB port controller of claim 4, wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 7. The USB port controller of claim 3, wherein, in the first power mode, the power circuit operates in the third port mode to toggle between:
an unattached source state in which the USB port controller monitors a configuration channel line of the USB port connector to detect connection of a power sinking USB device to the USB port connector, and an unattached sink state in which the USB port controller monitors the communication channel line to detect connection of a power sourcing USB device to the USB port connector. 8. The USB port controller of claim 2, further comprising:
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector; wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 9. The USB port controller of claim 8, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 10. The USB port controller of claim 1, further comprising:
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance large enough so that the pull-down resistor is not detected by a sourcing USB device connected to the USB port connector; wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 11. The USB port controller of claim 10, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 12. The USB port controller of claim 1, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 13. The USB port controller of claim 1, wherein the communications interface circuit and the control circuit are fabricated in an integrated circuit. 14. A universal serial bus (USB) port controller for interfacing a USB device through a USB port connector, comprising:
a communications interface circuit to communicate with a port manager circuit over a communications connection; a control circuit configured to:
selectively operate the USB port controller in a first power mode for normal operation of the USB port controller or a second power mode for reduced power consumption by the USB port controller, and
switch operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on the communications connection, or (ii) a detected connection of a USB device to the USB port connector;
a comparator operative in the second power mode to compare a voltage of a configuration channel line of the USB port connector to detect connection of a USB device to the USB port connector, the comparator including an output to provide a port connection detection signal in response to the voltage of the configuration channel line exceeding a threshold voltage; and a bias control circuit, including a switch operative in the second power mode to connect a pull-down resistor to the configuration channel line, the pull-down resistor having a resistance higher than a pull-down resistance applied in the first power mode. 15. The USB port controller of claim 14, wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the port connection detection signal from the comparator indicating the voltage of the configuration channel line exceeding the threshold voltage in response to connection of the USB device to the USB port connector. 16. The USB port controller of claim 15, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 17. The USB port controller of claim 14, wherein the control circuit includes a comparator operative in the second power mode to provide a communication detection signal in response to a detected signal edge of the communications connection; and
wherein the control circuit is configured to switch operation of the USB port controller from the second power mode to the first power mode in response to the communication detection signal indicating the detected signal edge of the communications connection. 18. The USB port controller of claim 14, wherein the communications interface circuit and the control circuit are fabricated in an integrated circuit. 19. A method of to operate a universal serial bus (USB) port controller, the method comprising:
selectively operating the USB port controller in a first power mode for normal operation of the USB port controller or a second power mode for reduced power consumption by the USB port controller; switching operation of the USB port controller from the second power mode to the first power mode in response to (i) detected activity on a communications connection, or (ii) a detected connection of a USB device to a USB port connector; and after switching from the second power mode to the first power mode in response to detected activity on the communications connection, automatically switching operation of the USB port controller back to the second power mode unless a communications transaction addressed to the USB port controller is received within a non-zero certain time after switching from the second power mode to the first power mode. 20. The method of claim 19, further comprising:
operating a power circuit of the USB port controller to selectively operate in a configured port mode according to a configuration setting from the port manager circuit, the configured port mode including one of:
a first port mode in which the power circuit delivers power to a power line of the USB port connector,
a second port mode in which the power circuit receives power from the power line, and
a third port mode in which the power circuit refrains from delivering power to, or receiving power from, the power line pending connection of the USB device to the USB port connector;
wherein the power circuit continues to operate in the configured port mode after switching from the second power mode to the first power mode. | 2,100 |
5,694 | 5,694 | 15,848,137 | 2,136 | A method for implementing an overdrive in a dispersed storage network begins by a processing module receiving an access request for a set of encoded data slices and continues with the processing module determining whether a level of access requests for the DSN meets a predetermined threshold. When the level of access requests for the DSN meets the predetermined threshold, the method continues with the processing module transitioning from a first operational mode to a second operational mode. The method continues with the processing module determining whether the level of access requests for the DSN is below the predetermined threshold, and when it is, transitioning back to the first operational mode. | 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:
receiving, by the one or more processing modules, an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs, determining, by the one or more processing modules, whether a level of access requests for the DSN meets a predetermined threshold; in response to determining that the level of access requests for the DSN meets the predetermined threshold, transitioning, by the one or more processing modules, from a first operational mode to a second operational mode; determining, by the one or more processing modules, whether the level of access requests for the DSN is below the predetermined threshold; and in response to determining that the level of access requests for the DSN is below the predetermined threshold, transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 2. The method of claim 1, wherein the first operational mode involves processing of access requests for EDSs and processing of one or more maintenance functions. 3. The method of claim 2, wherein the maintenance functions include at least one of rebuilding EDSs, migrating EDSs, balancing data load across memory devices, recording DSN statistics, and recording DSN debugging information. 4. The method of claim 2, wherein the maintenance functions include one or more functions that degrade performance of one or more access requests. 5. The method of claim 1, wherein the predetermined threshold is at least partially based on a probability of data loss, and further wherein the second operational mode has a higher probability of data loss than the first operational mode. 6. The method of claim 1, wherein the second operational mode includes processing of access requests for EDSs and queueing at least one maintenance function. 7. The method of claim 1, further comprising:
determining, by the one or more processing modules, whether a probability of data loss is above another predetermined threshold; and in response to a determination that a probability of data loss is above another predetermined threshold, transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 8. The method of claim 7, wherein the probability of data loss is based on another probability that the DSN includes unrecoverable EDSs when less than a decode threshold number of EDSs of the set of EDSs is available. 9. The method of claim 1, wherein the level of access requests includes at least one of number of access requests for EDSs, a unit time to store requests for EDSs, and a unit time to retrieve requests for EDSs. 10. The method of claim 1, further comprising:
determining, by the one or more processing modules, whether one or more memory devices of the DSN is above predetermined storage threshold; and in response to determining that the one or more memory devices of the DSN is above the predetermined storage threshold; transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 11. A computer readable storage medium comprises:
at least one memory section that stores operational instructions that, when executed by one or more processing resources of a plurality of processing resources of one or more computing devices of a distributed network, causes the one or more computing devices to:
receive, by the plurality of processing resources, an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs,
determine, by the plurality of processing resources, whether a level of access requests for the DSN meets a predetermined threshold;
when the level of access for the DSN meets a predetermined threshold, transitioning, by the plurality of processing resources, from a first operational mode to a second operational mode;
determine, by the plurality of processing resources, whether the level of access requests for the DSN is below the predetermined threshold; and
when the level of access requests for the DSN is below the predetermined threshold, transition, by the plurality of processing resources, from the second operational mode to the first operational mode. 12. The computer readable storage medium of claim 11, wherein the first operational mode involves processing of access requests for EDSs and processing of one or more maintenance functions. 13. The computer readable storage medium of claim 12, wherein the maintenance functions include at least one of rebuilding EDSs, migrating EDSs, balancing data load across memory devices, recording DSN statistics, and recording DSN debugging information. 14. The computer readable storage medium of claim 12, wherein the maintenance functions include one or more functions that degrade performance of one or more access requests. 15. The computer readable storage medium of claim 11, wherein the predetermined threshold is at least partially based on a probability of data loss, and further wherein the second operational mode has a higher probability of data loss than the first operational mode. 16. The computer readable storage medium of claim 11, wherein the second operational mode includes processing of access requests for EDSs and queueing at least one maintenance function. 17. The computer readable storage medium of claim 11, wherein the level of access requests includes at least one of number of access requests for EDSs, a unit time to store requests for EDSs, and a unit time to retrieve requests for EDSs. 18. The computer readable storage medium of claim 11, wherein the plurality of processing resources further causes the one or more computing devices to:
determine, whether one or more memory devices of the DSN is above predetermined storage threshold; and when the one or more memory devices of the DSN is above the predetermined storage threshold; transition from the second operational mode to the first operational mode. 19. A computing device of a group of computing devices of a distributed network, the computing device comprises:
an interface; a local memory; and a processing resource of a plurality of processing resources of the distributed network, wherein the processing resource is operably coupled to the interface and the local memory, and wherein the processing resource functions to:
receive an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs,
determine whether a level of access requests for the DSN meets a predetermined threshold;
when the level of access for the DSN meets a predetermined threshold, transition from a first operational mode to a second operational mode;
determine whether the level of access requests for the DSN is below the predetermined threshold; and
when the level of access requests for the DSN is below the predetermined threshold, transition from the second operational mode to the first operational mode. 20. The computing device of claim 19, wherein the second operational mode includes access request processing and maintenance function queueing. | A method for implementing an overdrive in a dispersed storage network begins by a processing module receiving an access request for a set of encoded data slices and continues with the processing module determining whether a level of access requests for the DSN meets a predetermined threshold. When the level of access requests for the DSN meets the predetermined threshold, the method continues with the processing module transitioning from a first operational mode to a second operational mode. The method continues with the processing module determining whether the level of access requests for the DSN is below the predetermined threshold, and when it is, transitioning back to the first operational mode.1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:
receiving, by the one or more processing modules, an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs, determining, by the one or more processing modules, whether a level of access requests for the DSN meets a predetermined threshold; in response to determining that the level of access requests for the DSN meets the predetermined threshold, transitioning, by the one or more processing modules, from a first operational mode to a second operational mode; determining, by the one or more processing modules, whether the level of access requests for the DSN is below the predetermined threshold; and in response to determining that the level of access requests for the DSN is below the predetermined threshold, transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 2. The method of claim 1, wherein the first operational mode involves processing of access requests for EDSs and processing of one or more maintenance functions. 3. The method of claim 2, wherein the maintenance functions include at least one of rebuilding EDSs, migrating EDSs, balancing data load across memory devices, recording DSN statistics, and recording DSN debugging information. 4. The method of claim 2, wherein the maintenance functions include one or more functions that degrade performance of one or more access requests. 5. The method of claim 1, wherein the predetermined threshold is at least partially based on a probability of data loss, and further wherein the second operational mode has a higher probability of data loss than the first operational mode. 6. The method of claim 1, wherein the second operational mode includes processing of access requests for EDSs and queueing at least one maintenance function. 7. The method of claim 1, further comprising:
determining, by the one or more processing modules, whether a probability of data loss is above another predetermined threshold; and in response to a determination that a probability of data loss is above another predetermined threshold, transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 8. The method of claim 7, wherein the probability of data loss is based on another probability that the DSN includes unrecoverable EDSs when less than a decode threshold number of EDSs of the set of EDSs is available. 9. The method of claim 1, wherein the level of access requests includes at least one of number of access requests for EDSs, a unit time to store requests for EDSs, and a unit time to retrieve requests for EDSs. 10. The method of claim 1, further comprising:
determining, by the one or more processing modules, whether one or more memory devices of the DSN is above predetermined storage threshold; and in response to determining that the one or more memory devices of the DSN is above the predetermined storage threshold; transitioning, by the one or more processing modules, from the second operational mode to the first operational mode. 11. A computer readable storage medium comprises:
at least one memory section that stores operational instructions that, when executed by one or more processing resources of a plurality of processing resources of one or more computing devices of a distributed network, causes the one or more computing devices to:
receive, by the plurality of processing resources, an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs,
determine, by the plurality of processing resources, whether a level of access requests for the DSN meets a predetermined threshold;
when the level of access for the DSN meets a predetermined threshold, transitioning, by the plurality of processing resources, from a first operational mode to a second operational mode;
determine, by the plurality of processing resources, whether the level of access requests for the DSN is below the predetermined threshold; and
when the level of access requests for the DSN is below the predetermined threshold, transition, by the plurality of processing resources, from the second operational mode to the first operational mode. 12. The computer readable storage medium of claim 11, wherein the first operational mode involves processing of access requests for EDSs and processing of one or more maintenance functions. 13. The computer readable storage medium of claim 12, wherein the maintenance functions include at least one of rebuilding EDSs, migrating EDSs, balancing data load across memory devices, recording DSN statistics, and recording DSN debugging information. 14. The computer readable storage medium of claim 12, wherein the maintenance functions include one or more functions that degrade performance of one or more access requests. 15. The computer readable storage medium of claim 11, wherein the predetermined threshold is at least partially based on a probability of data loss, and further wherein the second operational mode has a higher probability of data loss than the first operational mode. 16. The computer readable storage medium of claim 11, wherein the second operational mode includes processing of access requests for EDSs and queueing at least one maintenance function. 17. The computer readable storage medium of claim 11, wherein the level of access requests includes at least one of number of access requests for EDSs, a unit time to store requests for EDSs, and a unit time to retrieve requests for EDSs. 18. The computer readable storage medium of claim 11, wherein the plurality of processing resources further causes the one or more computing devices to:
determine, whether one or more memory devices of the DSN is above predetermined storage threshold; and when the one or more memory devices of the DSN is above the predetermined storage threshold; transition from the second operational mode to the first operational mode. 19. A computing device of a group of computing devices of a distributed network, the computing device comprises:
an interface; a local memory; and a processing resource of a plurality of processing resources of the distributed network, wherein the processing resource is operably coupled to the interface and the local memory, and wherein the processing resource functions to:
receive an access request for a set of encoded data slices (EDSs), wherein a data segment is encoded using an error coding dispersal storage function to produce the set of EDSs,
determine whether a level of access requests for the DSN meets a predetermined threshold;
when the level of access for the DSN meets a predetermined threshold, transition from a first operational mode to a second operational mode;
determine whether the level of access requests for the DSN is below the predetermined threshold; and
when the level of access requests for the DSN is below the predetermined threshold, transition from the second operational mode to the first operational mode. 20. The computing device of claim 19, wherein the second operational mode includes access request processing and maintenance function queueing. | 2,100 |
5,695 | 5,695 | 14,098,372 | 2,176 | A method and system is provided for testing and analyzing websites via a test-enabled web browser. In the representative embodiment a user controls a test-enabled web browser via a set of pull-down menus, thereby choosing between alternative testing and analysis functional capabilities, selecting files in which to store recordings (scripts), choosing files into which to place test results and messages, and setting various parameters that affect how the testing and analysis functions are performed. The general result of systematic use of the test-enabled browser on websites is improved content quality, demonstrated website server behavior for deep tests, quicker delivery by the website server, and better serviceability for e-business. | 1. A non-transitory computer readable medium including at least computer program code stored therein for providing a test-enabled browser for testing a website residing on a network, said computer readable medium comprising:
computer program code for interfacing with a code base library that provides at least Document Object Model (DOM) access methods; computer program code for accessing the website to be tested using the test-enabled browser; computer program code for retrieving a test script for use in testing at least one web page of the website; and computer program code for performing a validation test using at least one of the DOM access methods of the code base library, wherein during the validation test, the at least one web page is newly rendered and details of elements for the at least one web page as newly rendered are accessed via the at least one of the DOM access methods and compared to details in the test script. 2. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for rendering and examining at least one web page of the website so as to at least extract details of elements of the web page; and computer program code for forming the test script based such that the test script includes at least the extracted details of the elements of the web page. 3. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for inducing a timing check based on validating DOM element content as part of a test instructed by the test script. 4. A non-transitory computer readable medium as recited in claim 3, wherein said computer readable medium comprises:
computer program code for causing notification of an alarm condition based on the timing check. 5. A non-transitory computer readable medium as recited in claim 1, wherein the computer program code for performing a validation test is configured to replace a value at one DOM location for the at least one web page with a value at another DOM location for the at least one web page. 6. A non-transitory computer readable medium as recited in claim 1, wherein the computer program code for performing a validation test is configured to render the at least one web page using the test enabled browser and to interrogate the at least one web page for a user-specified set of DOM properties and display the user-specified set of properties in a format appropriate for manual validation. 7. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for caching of web pages is allowed or prevented according to user instructions. 8. A method for testing a website residing on a network, said method:
rendering a web page having a Document Object Model (DOM) associated herewith, the web page being part of the website; examining the DOM of the rendered web page to identify a plurality of linked-to web pages; subsequently rendering one or more of the linked-to web pages; examining the DOM of each of the one or more rendered linked-to web pages to discover link relationships; and presenting an illustration that indicates the web page and the one or more linked-to web pages and indicates link relationships with the one or more of the linked-to web pages. 9. A method as recited in claim 8, wherein the rendering of the one or more rendered linked-to web pages and the examining of the DOM of each of the one or more rendered linked-to web pages are performed with a recursive process. 10. A method as recited in claim 9, wherein said method comprises:
limiting an extent of the recursive process based on at least one user supplied restriction. 11. A method as recited in claim 8, wherein the testing of the website by the method is performed by a test-enabled browser. 12. A method as recited in claim 8, wherein the illustration is a dependence map. 13. A computer system for testing a website, comprising:
a memory for storing computer program code; and a processing unit configured to execute the stored computer program code, wherein the stored computer program code supports testing of a website by implementing a test-enabled browser, and wherein the stored computer program code includes at least:
computer program code for interfacing with a code base library that provides at least Document Object Model (DOM) access methods;
computer program code for accessing the website to be tested using the test-enabled browser;
computer program code for retrieving a test script for use in testing at least one web page of the website; and
computer program code for performing a validation test using at least one of the DOM access methods of the code base library, wherein during the validation test, the at least one web page is newly rendered and details of elements for the at least one web page as newly rendered are accessed via the at least one of the DOM access methods and compared to details in the test script. | A method and system is provided for testing and analyzing websites via a test-enabled web browser. In the representative embodiment a user controls a test-enabled web browser via a set of pull-down menus, thereby choosing between alternative testing and analysis functional capabilities, selecting files in which to store recordings (scripts), choosing files into which to place test results and messages, and setting various parameters that affect how the testing and analysis functions are performed. The general result of systematic use of the test-enabled browser on websites is improved content quality, demonstrated website server behavior for deep tests, quicker delivery by the website server, and better serviceability for e-business.1. A non-transitory computer readable medium including at least computer program code stored therein for providing a test-enabled browser for testing a website residing on a network, said computer readable medium comprising:
computer program code for interfacing with a code base library that provides at least Document Object Model (DOM) access methods; computer program code for accessing the website to be tested using the test-enabled browser; computer program code for retrieving a test script for use in testing at least one web page of the website; and computer program code for performing a validation test using at least one of the DOM access methods of the code base library, wherein during the validation test, the at least one web page is newly rendered and details of elements for the at least one web page as newly rendered are accessed via the at least one of the DOM access methods and compared to details in the test script. 2. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for rendering and examining at least one web page of the website so as to at least extract details of elements of the web page; and computer program code for forming the test script based such that the test script includes at least the extracted details of the elements of the web page. 3. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for inducing a timing check based on validating DOM element content as part of a test instructed by the test script. 4. A non-transitory computer readable medium as recited in claim 3, wherein said computer readable medium comprises:
computer program code for causing notification of an alarm condition based on the timing check. 5. A non-transitory computer readable medium as recited in claim 1, wherein the computer program code for performing a validation test is configured to replace a value at one DOM location for the at least one web page with a value at another DOM location for the at least one web page. 6. A non-transitory computer readable medium as recited in claim 1, wherein the computer program code for performing a validation test is configured to render the at least one web page using the test enabled browser and to interrogate the at least one web page for a user-specified set of DOM properties and display the user-specified set of properties in a format appropriate for manual validation. 7. A non-transitory computer readable medium as recited in claim 1, wherein said computer readable medium comprises:
computer program code for caching of web pages is allowed or prevented according to user instructions. 8. A method for testing a website residing on a network, said method:
rendering a web page having a Document Object Model (DOM) associated herewith, the web page being part of the website; examining the DOM of the rendered web page to identify a plurality of linked-to web pages; subsequently rendering one or more of the linked-to web pages; examining the DOM of each of the one or more rendered linked-to web pages to discover link relationships; and presenting an illustration that indicates the web page and the one or more linked-to web pages and indicates link relationships with the one or more of the linked-to web pages. 9. A method as recited in claim 8, wherein the rendering of the one or more rendered linked-to web pages and the examining of the DOM of each of the one or more rendered linked-to web pages are performed with a recursive process. 10. A method as recited in claim 9, wherein said method comprises:
limiting an extent of the recursive process based on at least one user supplied restriction. 11. A method as recited in claim 8, wherein the testing of the website by the method is performed by a test-enabled browser. 12. A method as recited in claim 8, wherein the illustration is a dependence map. 13. A computer system for testing a website, comprising:
a memory for storing computer program code; and a processing unit configured to execute the stored computer program code, wherein the stored computer program code supports testing of a website by implementing a test-enabled browser, and wherein the stored computer program code includes at least:
computer program code for interfacing with a code base library that provides at least Document Object Model (DOM) access methods;
computer program code for accessing the website to be tested using the test-enabled browser;
computer program code for retrieving a test script for use in testing at least one web page of the website; and
computer program code for performing a validation test using at least one of the DOM access methods of the code base library, wherein during the validation test, the at least one web page is newly rendered and details of elements for the at least one web page as newly rendered are accessed via the at least one of the DOM access methods and compared to details in the test script. | 2,100 |
5,696 | 5,696 | 14,111,380 | 2,145 | A method comprising: performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture; detecting using at least a second detector a predefined second phase of the predefined user gesture; and responsive to detecting both the predefined first phase and the predefined second phase of the predefined user gesture, switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state. | 1. A method comprising:
performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture; detecting using at least a second detector a predefined second phase of the predefined user gesture; and responsive to detecting both the predefined first phase and the predefined second phase of the predefined user gesture, switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state. 2. (canceled) 3. (canceled) 4. A method as claimed in claim 1, comprising stopping detecting the predefined second phase of the predefined user gesture after a timeout period without detecting the predefined second phase of the predefined user gesture. 5. A method as claimed in claim 1, comprising stopping detecting the predefined second phase of the predefined user gesture after detecting using at least the first detector a user gesture subsequent to the predefined first phase of a predefined user gesture that is not part of the predefined first phase of the predefined user gesture. 6. (canceled) 7. A method as claimed in claim 1, wherein the first detector is a touch sensitive display configured to detect touch on a two-dimensional surface of a display. 8. A method as claimed in claim 1, wherein the second detector is selected from the group comprising:
a device configured to measure user movement at least in a direction perpendicular to the two-dimensional surface; a camera; a proximity detector; a device comprising a transmitter, a receiver and a frequency shift detector. 9-11. (canceled) 12. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises movement substantially in a first plane and wherein the predefined second phase of the predefined user gesture comprises movement substantially outside of the first plane. 13. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises movement of at least one point of contact on a touch sensitive device. 14. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises a plurality of simultaneous points of contact on a touch sensitive device. 15. A method as claimed in claim 14, wherein the predefined first phase of the predefined user gesture comprises relative movement of the plurality of simultaneous points of contact on the touch sensitive device. 16. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises a pinch gesture on a touch sensitive device. 17. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture is user programmable. 18-19. (canceled) 20. A method as claimed in claim 1, wherein the predefined second phase of the predefined user gesture is user programmable. 21. (canceled) 22. A method as claimed in claim 1, wherein performing user input detection using at least a first detector but not using a second detector comprises performing user input detection using the first detector and an additional detector but not using a second detector;
wherein detecting using at least the first detector the predefined first phase of the predefined user gesture, comprises detecting using the first detector and the additional detector the predefined first phase of the predefined user gesture; and wherein performing user input detection using at least the second detector is responsive to detecting, using the first detector and the second detector, the predefined first phase of the predefined user gesture. 23. A method as claimed in claim 22, wherein the additional detector detects movement in an additional dimension to movement detected by the first detector. 24. A method as claimed in claim 23, wherein the second detector detects movement at least in the additional dimension to movement detected by the first detector but more accurately than the additional detector. 25. A method as claimed in claim 1, comprising:
operating in the three-dimensional user interface state; performing user input detection using at least the second detector; detecting using at least the second detector a predefined initial phase of an additional predefined user gesture detecting using at least the first detector a predefined final phase of the additional predefined user gesture; and responsive to detecting using at least the first detector the predefined final phase of the additional predefined user gesture, switching from operating in the three-dimensional user interface state to operating in the two-dimensional user interface state. 26. A method as claimed in claim 25, further comprising:
responsive to detecting using at least the first detector the predefined first phase of the predefined user gesture, starting user input detection using at least the second detector. 27. A method comprising:
enabling a first user gesture detector; enabling a second user gesture detector; and switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state only after the first detector has detected a predefined first phase of a predefined user gesture and the second detector has detected the predefined second phase of the predefined user gesture. 28-30. (canceled) 31. 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 at least one processor, cause the apparatus at least to enable: performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture;
detecting using at least a second detector a predefined second phase of the predefined user gesture; and 32-40. (canceled) | A method comprising: performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture; detecting using at least a second detector a predefined second phase of the predefined user gesture; and responsive to detecting both the predefined first phase and the predefined second phase of the predefined user gesture, switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state.1. A method comprising:
performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture; detecting using at least a second detector a predefined second phase of the predefined user gesture; and responsive to detecting both the predefined first phase and the predefined second phase of the predefined user gesture, switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state. 2. (canceled) 3. (canceled) 4. A method as claimed in claim 1, comprising stopping detecting the predefined second phase of the predefined user gesture after a timeout period without detecting the predefined second phase of the predefined user gesture. 5. A method as claimed in claim 1, comprising stopping detecting the predefined second phase of the predefined user gesture after detecting using at least the first detector a user gesture subsequent to the predefined first phase of a predefined user gesture that is not part of the predefined first phase of the predefined user gesture. 6. (canceled) 7. A method as claimed in claim 1, wherein the first detector is a touch sensitive display configured to detect touch on a two-dimensional surface of a display. 8. A method as claimed in claim 1, wherein the second detector is selected from the group comprising:
a device configured to measure user movement at least in a direction perpendicular to the two-dimensional surface; a camera; a proximity detector; a device comprising a transmitter, a receiver and a frequency shift detector. 9-11. (canceled) 12. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises movement substantially in a first plane and wherein the predefined second phase of the predefined user gesture comprises movement substantially outside of the first plane. 13. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises movement of at least one point of contact on a touch sensitive device. 14. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises a plurality of simultaneous points of contact on a touch sensitive device. 15. A method as claimed in claim 14, wherein the predefined first phase of the predefined user gesture comprises relative movement of the plurality of simultaneous points of contact on the touch sensitive device. 16. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture comprises a pinch gesture on a touch sensitive device. 17. A method as claimed in claim 1, wherein the predefined first phase of the predefined user gesture is user programmable. 18-19. (canceled) 20. A method as claimed in claim 1, wherein the predefined second phase of the predefined user gesture is user programmable. 21. (canceled) 22. A method as claimed in claim 1, wherein performing user input detection using at least a first detector but not using a second detector comprises performing user input detection using the first detector and an additional detector but not using a second detector;
wherein detecting using at least the first detector the predefined first phase of the predefined user gesture, comprises detecting using the first detector and the additional detector the predefined first phase of the predefined user gesture; and wherein performing user input detection using at least the second detector is responsive to detecting, using the first detector and the second detector, the predefined first phase of the predefined user gesture. 23. A method as claimed in claim 22, wherein the additional detector detects movement in an additional dimension to movement detected by the first detector. 24. A method as claimed in claim 23, wherein the second detector detects movement at least in the additional dimension to movement detected by the first detector but more accurately than the additional detector. 25. A method as claimed in claim 1, comprising:
operating in the three-dimensional user interface state; performing user input detection using at least the second detector; detecting using at least the second detector a predefined initial phase of an additional predefined user gesture detecting using at least the first detector a predefined final phase of the additional predefined user gesture; and responsive to detecting using at least the first detector the predefined final phase of the additional predefined user gesture, switching from operating in the three-dimensional user interface state to operating in the two-dimensional user interface state. 26. A method as claimed in claim 25, further comprising:
responsive to detecting using at least the first detector the predefined first phase of the predefined user gesture, starting user input detection using at least the second detector. 27. A method comprising:
enabling a first user gesture detector; enabling a second user gesture detector; and switching between operating in a two-dimensional user interface state and operating in a three-dimensional user interface state only after the first detector has detected a predefined first phase of a predefined user gesture and the second detector has detected the predefined second phase of the predefined user gesture. 28-30. (canceled) 31. 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 at least one processor, cause the apparatus at least to enable: performing user input detection using at least a first detector; detecting using at least the first detector a predefined first phase of a predefined user gesture;
detecting using at least a second detector a predefined second phase of the predefined user gesture; and 32-40. (canceled) | 2,100 |
5,697 | 5,697 | 15,284,684 | 2,154 | A mechanism is provided for adding software signatures to a software catalog may be provided. The software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section. The mechanism scans a system using a software asset management tool. The mechanism adds a new software signature to the community-maintained software catalog section via a Blockchain transaction. An acceptance of the signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. | 1. A method for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section, the method comprising:
scanning a system using a software asset management tool; and adding a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. 2. The method of claim 1, wherein the Blockchain transaction comprises:
creating the new software signature related to a non-matching software component identified during the scanning of the system; and sending the new software signature as a Blockchain challenge as part of the Blockchain transaction. 3. The method of claim 1, wherein the Blockchain proof-of-work message is generated by the software asset management tool if the scanning of the system results in a lower number of unmatched software components when using the new software signature, which was received, in addition to the community-maintained software catalog not comprising the new software signature. 4. The method of claim 3, further comprising:
sending the Blockchain proof-of-work message after a separate confirmation. 5. The method of claim 1, wherein the adding of the new software signature to the community-maintained software catalog section is performed only if the Blockchain proof-of-work message is received within a predefined time-period after an initiation of the Blockchain transaction. 6. The method of claim 1, wherein the adding the new software signature to the community-maintained software catalog section is performed only after a predefined number of Blockchain proof-of-work messages have been received. 7. The method of claim 1, wherein the Blockchain transaction comprises:
receiving the new software signature, and putting the new software signature in quarantine. 8. The method of claim 1, wherein the Blockchain transaction is initiated after a plurality of new software signatures are combined in a block of new software signatures. 9. The method of claim 8, wherein the Blockchain proof-of-work block message is generated by the software asset management tool if software components are found, during the scanning of the system, relating to a predefined number of software signatures out of the block of new software signatures using the software asset management tool. 10. The method of claim 8, wherein an individual Blockchain proof-of-work message is generated by the software asset management tool if a software component is found relating to a new software signature out of the block of new software signatures by scanning of the system using the software asset management tool. 11. The method of claim 8, wherein the acceptance of each new software signature in the block of new software signatures to the community-maintained software catalog section is performed after a predefined number of Blockchain proof-of-work block messages has been received. 12. A system for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section, the system 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: scan a system using a software asset management tool; and add a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. 13. The system of claim 12, wherein the instructions add the new software signature to the community-maintained software catalog section via the Blockchain transaction further causes the processor to:
create the new software signature related to a non-matching software component identified during the scanning of the system; and send the new software signature as a Blockchain challenge as part of the Blockchain transaction. 14. The system of claim 12, wherein the Blockchain proof-of-work message is generated by the software asset management tool if the scanning of the system results in a lower number of unmatched software components when using the new software signature, which was received, in addition to the community-maintained software catalog not comprising the new software signature. 15. The system of claim 12, wherein the instructions to add the new software signature to the community-maintained software catalog section is performed only if either the Blockchain proof-of-work message is received within a predefined time-period after an initiation of the Blockchain transaction or after a predefined number of Blockchain proof-of-work messages have been received. 16. The system of claim 12, wherein the instructions cause the processor to initiate the Blockchain transaction after a plurality of new software signatures are combined in a block of new software signatures. 17. The system of claim 16, wherein the instructions cause the processor to generate the Blockchain proof-of-work block message by the software asset management tool if software components are found, during the scanning of the system, relating to a predefined number of software signatures out of the block of new software signatures using the software asset management tool. 18. The system of claim 16, wherein the instructions cause the processor to generate an individual Blockchain proof-of-work message by the software asset management tool if a software component is found relating to a new software signature out of the block of new software signatures by scanning of the system using the software asset management tool. 19. The system of claim 16, wherein the instructions cause the processor to perform the acceptance of each new software signature in the block of new software signatures to the community-maintained software catalog after a predefined number of Blockchain proof-of-work block messages has been received. 20. A computer program product comprising a computer readable storage medium having a computer readable program for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
scan a system using a software asset management tool; and add a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. | A mechanism is provided for adding software signatures to a software catalog may be provided. The software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section. The mechanism scans a system using a software asset management tool. The mechanism adds a new software signature to the community-maintained software catalog section via a Blockchain transaction. An acceptance of the signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message.1. A method for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section, the method comprising:
scanning a system using a software asset management tool; and adding a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. 2. The method of claim 1, wherein the Blockchain transaction comprises:
creating the new software signature related to a non-matching software component identified during the scanning of the system; and sending the new software signature as a Blockchain challenge as part of the Blockchain transaction. 3. The method of claim 1, wherein the Blockchain proof-of-work message is generated by the software asset management tool if the scanning of the system results in a lower number of unmatched software components when using the new software signature, which was received, in addition to the community-maintained software catalog not comprising the new software signature. 4. The method of claim 3, further comprising:
sending the Blockchain proof-of-work message after a separate confirmation. 5. The method of claim 1, wherein the adding of the new software signature to the community-maintained software catalog section is performed only if the Blockchain proof-of-work message is received within a predefined time-period after an initiation of the Blockchain transaction. 6. The method of claim 1, wherein the adding the new software signature to the community-maintained software catalog section is performed only after a predefined number of Blockchain proof-of-work messages have been received. 7. The method of claim 1, wherein the Blockchain transaction comprises:
receiving the new software signature, and putting the new software signature in quarantine. 8. The method of claim 1, wherein the Blockchain transaction is initiated after a plurality of new software signatures are combined in a block of new software signatures. 9. The method of claim 8, wherein the Blockchain proof-of-work block message is generated by the software asset management tool if software components are found, during the scanning of the system, relating to a predefined number of software signatures out of the block of new software signatures using the software asset management tool. 10. The method of claim 8, wherein an individual Blockchain proof-of-work message is generated by the software asset management tool if a software component is found relating to a new software signature out of the block of new software signatures by scanning of the system using the software asset management tool. 11. The method of claim 8, wherein the acceptance of each new software signature in the block of new software signatures to the community-maintained software catalog section is performed after a predefined number of Blockchain proof-of-work block messages has been received. 12. A system for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section, the system 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: scan a system using a software asset management tool; and add a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. 13. The system of claim 12, wherein the instructions add the new software signature to the community-maintained software catalog section via the Blockchain transaction further causes the processor to:
create the new software signature related to a non-matching software component identified during the scanning of the system; and send the new software signature as a Blockchain challenge as part of the Blockchain transaction. 14. The system of claim 12, wherein the Blockchain proof-of-work message is generated by the software asset management tool if the scanning of the system results in a lower number of unmatched software components when using the new software signature, which was received, in addition to the community-maintained software catalog not comprising the new software signature. 15. The system of claim 12, wherein the instructions to add the new software signature to the community-maintained software catalog section is performed only if either the Blockchain proof-of-work message is received within a predefined time-period after an initiation of the Blockchain transaction or after a predefined number of Blockchain proof-of-work messages have been received. 16. The system of claim 12, wherein the instructions cause the processor to initiate the Blockchain transaction after a plurality of new software signatures are combined in a block of new software signatures. 17. The system of claim 16, wherein the instructions cause the processor to generate the Blockchain proof-of-work block message by the software asset management tool if software components are found, during the scanning of the system, relating to a predefined number of software signatures out of the block of new software signatures using the software asset management tool. 18. The system of claim 16, wherein the instructions cause the processor to generate an individual Blockchain proof-of-work message by the software asset management tool if a software component is found relating to a new software signature out of the block of new software signatures by scanning of the system using the software asset management tool. 19. The system of claim 16, wherein the instructions cause the processor to perform the acceptance of each new software signature in the block of new software signatures to the community-maintained software catalog after a predefined number of Blockchain proof-of-work block messages has been received. 20. A computer program product comprising a computer readable storage medium having a computer readable program for adding software signatures to a software catalog, wherein the software catalog comprises a vendor-maintained software catalog section, a user-maintained software catalog section, and a community-maintained software catalog section stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
scan a system using a software asset management tool; and add a new software signature to the community-maintained software catalog section via a Blockchain transaction, wherein an acceptance of the new software signature into the community-maintained software catalog section is based on a received Blockchain proof-of-work message. | 2,100 |
5,698 | 5,698 | 12,138,585 | 2,194 | A method for preferential reply routing, the method includes: receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application. | 1. A method for preferential reply routing, wherein the method comprises:
receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application. 2. The method of claim 1, wherein in the event the local partition is unavailable:
routing the reply message to an alternate partition; directing the requesting application to the alternate partition; and retrieving the reply message from the alternate partition in response to the requesting application. 3. The method of claim 1, wherein the preferred partition is explicitly chosen by the requesting application. 4. The method of claim 1, wherein the preferred partition is implicitly selected by a messaging system that receives the request-reply message from the requesting application. 5. An article comprising one or more computer-readable storage media containing instructions that when executed by a computer enables preferential reply routing; wherein the method further comprises:
receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application. 6. The article of claim 5, wherein in the event the local partition is unavailable:
routing the reply message to an alternate partition; directing the requesting application to the alternate partition; and retrieving the reply message from the alternate partition in response to the requesting application. 7. The article of claim 5, wherein the preferred partition is explicitly chosen by the requesting application. 8. The article of claim 5, wherein the preferred partition is implicitly selected by a messaging system that receives the request-reply message from the requesting application. 9. A system for preferential reply routing, the system comprising:
one or more server devices in communication with one or more client devices through a network; wherein the one or more client devices are configured to allow an originating user to do the following: compose a request-reply message with a requesting application on the one or more client devices; send the request-reply message to the one or more servers; and wherein the one or more server devices form a messaging system configured to do the following: receive a request-reply message from a requesting application; detect whether there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualify a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determine whether the local partition is available; wherein in the event the local partition is available: a reply message is stored in the local partition; and the reply message is retrieved from the local partition in response to the requesting application. 10. The system of claim 9, wherein in the event the local partition is unavailable the messaging system:
routes the reply message to an alternate partition; directs the requesting application to the alternate partition; and retrieves the reply message from the alternate partition in response to the requesting application. 11. The system of claim 9, wherein the preferred partition is explicitly chosen by the requesting application. 12. The system of claim 9, wherein the preferred partition is implicitly selected by the messaging system that receives the request-reply message from the requesting application. | A method for preferential reply routing, the method includes: receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application.1. A method for preferential reply routing, wherein the method comprises:
receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application. 2. The method of claim 1, wherein in the event the local partition is unavailable:
routing the reply message to an alternate partition; directing the requesting application to the alternate partition; and retrieving the reply message from the alternate partition in response to the requesting application. 3. The method of claim 1, wherein the preferred partition is explicitly chosen by the requesting application. 4. The method of claim 1, wherein the preferred partition is implicitly selected by a messaging system that receives the request-reply message from the requesting application. 5. An article comprising one or more computer-readable storage media containing instructions that when executed by a computer enables preferential reply routing; wherein the method further comprises:
receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application. 6. The article of claim 5, wherein in the event the local partition is unavailable:
routing the reply message to an alternate partition; directing the requesting application to the alternate partition; and retrieving the reply message from the alternate partition in response to the requesting application. 7. The article of claim 5, wherein the preferred partition is explicitly chosen by the requesting application. 8. The article of claim 5, wherein the preferred partition is implicitly selected by a messaging system that receives the request-reply message from the requesting application. 9. A system for preferential reply routing, the system comprising:
one or more server devices in communication with one or more client devices through a network; wherein the one or more client devices are configured to allow an originating user to do the following: compose a request-reply message with a requesting application on the one or more client devices; send the request-reply message to the one or more servers; and wherein the one or more server devices form a messaging system configured to do the following: receive a request-reply message from a requesting application; detect whether there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualify a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determine whether the local partition is available; wherein in the event the local partition is available: a reply message is stored in the local partition; and the reply message is retrieved from the local partition in response to the requesting application. 10. The system of claim 9, wherein in the event the local partition is unavailable the messaging system:
routes the reply message to an alternate partition; directs the requesting application to the alternate partition; and retrieves the reply message from the alternate partition in response to the requesting application. 11. The system of claim 9, wherein the preferred partition is explicitly chosen by the requesting application. 12. The system of claim 9, wherein the preferred partition is implicitly selected by the messaging system that receives the request-reply message from the requesting application. | 2,100 |
5,699 | 5,699 | 15,258,376 | 2,143 | A system and computer implemented method of personal monitoring is provided. The method includes allowing a user to engage in a number of on-line activities, determining, on a computer, if the user engaged in on-line activities, and if the determination is negative, then performing, on a computer, a number of responsive actions. The system and method further provide for an investigation of external modules; that is, the system and method investigate external sites such as, but not limited to, social networks, forums, weblogs (blogs), that are not associated with the personal monitoring module. The system and method further allow a proxy to respond for the user. | 1. A computer implemented method of personal monitoring comprising the steps of:
determining if a user is responsive; if the determination is negative, performing, on a computer, a number of responsive actions; wherein said step of determining if a user is responsive includes the steps of:
allowing said user to engage in a number of on-line activities;
determining, on a computer, if said user engaged in on-line activities;
if said determination that said user engaged in on-line activities is negative, then performing, on a computer, a number of responsive actions;
wherein said step of allowing a user to engage in a number of on-line activities includes:
initializing a personal monitoring module, said monitoring module structured to monitor external on-line activity; and
allowing said user to engage in a number of on-line activities external to said personal monitoring module. 2. The computer implemented method of claim 1 wherein said step of determining, on a computer, if said user engaged in on-line activities includes the step of checking said user's on-line activities external to said personal monitoring module. 3. The computer implemented method of claim 2 wherein said step of performing, on a computer, a number of responsive actions includes the steps of:
alerting said user of the lack of on-line activities;
requesting a response from said user; and
if said user responds, then identifying said response as an on-line activity. 4. The computer implemented method of claim 3 wherein said user response is selected from the group consisting of an active verification response or a passive verification response. 5. The computer implemented method of claim 3 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a proxy;
alerting said proxy of the lack of on-line activities by the user;
requesting a response from a proxy; and
if said proxy responds, then identifying said response as an on-line activity. 6. The computer implemented method of claim 5 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a number of scripted actions;
allowing said user to establish a user response time;
requesting a user response within said user response time;
determining if said user response has been provided within said user response time;
if no user response has been provided within said user response time, then performing, on a computer, the scripted actions identified by the user. 7. The computer implemented method of claim 1 wherein said step of checking said user's on-line activities external to said personal monitoring module includes the step of checking on said user's public on-line activities. 8. The computer implemented method of claim 1 wherein said steps of initializing a personal monitoring module and checking said user's on-line activities external to said personal monitoring module includes the steps of:
accessing the user's identification data; and
checking on said user's private on-line activities. 9. The computer implemented method of claim 1 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a number of scripted actions;
allowing said user to establish a user response time;
requesting a user response within said user response time;
determining if a said user response has been provided within said user response time; and
if no user response has been provided within said user response time, then performing, on a computer, the scripted actions identified by the user. 10. The computer implemented method of claim 1 wherein said step of determining if a user is responsive includes the step of receiving an instruction indicating the user is nonresponsive. 11. The computer implemented method of claim 10 wherein said step of receiving an instruction indicating the user is nonresponsive includes the steps of:
allowing a proxy to log-in;
verifying the proxy's identity;
determining that a request to initiate a responsive action has been made; and
performing a number of scripted actions. 12. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing a number of modules including:
an investigation module structured to investigate a user and to determine if the user has engaged in an on-line activity within an investigation period;
a response module structured to perform a number of selected scripted actions; and
wherein said investigation module is structured to perform a passive investigation. 13. The system of claim 12 wherein said investigation module is structured to check a user's external on-line activities. 14. The system of claim 13 wherein said investigation module is structured to check one of said user's public on-line activities or said user's private on-line activities. 15. The system of claim 12 wherein:
said response module includes a verification module;
said verification module structured to contact a user; and
said verification module structured to contact a proxy. 16. The system of claim 15 wherein:
if said verification module does not contact said user, said response module is structured to perform a number of primary scripted actions; and
if said verification module does not contact said proxy, said response module is structured to perform a number of secondary scripted actions. 17. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing number of modules including:
an administrative module structured to receive a user's identification data;
a database module structured to store said user's identification data
an investigation module structured to investigate a user and to determine if the user has engaged in an external on-line activity within an investigation period; and
a response module structured to perform a number of selected scripted actions. 18. The system of claim 17 wherein:
said administrative module structured to receive the identification data for a proxy; and
said database module structured to store said identification data for a proxy. 19. The system of claim 17 wherein:
said administrative module structured to receive a user response time;
said database module structured to store said user response time;
said administrative module structured to receive a proxy response time; and
said database module structured to store said proxy response time. 20. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing a number of modules including:
an investigation module structured to investigate a user and to determine if the user has engaged in an on-line activity within an investigation period;
a response module structured to perform a number of selected scripted actions;
said response module structured to allow said user to identify a proxy, allow said user to identify a number of scripted actions, including a number of primary actions and a number of secondary actions, and allow said user to establish a proxy response time;
said selected scripted actions including alerting said proxy of the lack of on-line activities by the user, requesting a proxy response within said proxy response time, determining if a proxy response has been provided within said proxy response time, if said proxy responds, then identifying said response as an on-line activity, if no proxy response has been provided within said user response time, then performing, on a computer, the secondary actions identified by the user; and
wherein said investigation module is structured to perform a passive investigation. | A system and computer implemented method of personal monitoring is provided. The method includes allowing a user to engage in a number of on-line activities, determining, on a computer, if the user engaged in on-line activities, and if the determination is negative, then performing, on a computer, a number of responsive actions. The system and method further provide for an investigation of external modules; that is, the system and method investigate external sites such as, but not limited to, social networks, forums, weblogs (blogs), that are not associated with the personal monitoring module. The system and method further allow a proxy to respond for the user.1. A computer implemented method of personal monitoring comprising the steps of:
determining if a user is responsive; if the determination is negative, performing, on a computer, a number of responsive actions; wherein said step of determining if a user is responsive includes the steps of:
allowing said user to engage in a number of on-line activities;
determining, on a computer, if said user engaged in on-line activities;
if said determination that said user engaged in on-line activities is negative, then performing, on a computer, a number of responsive actions;
wherein said step of allowing a user to engage in a number of on-line activities includes:
initializing a personal monitoring module, said monitoring module structured to monitor external on-line activity; and
allowing said user to engage in a number of on-line activities external to said personal monitoring module. 2. The computer implemented method of claim 1 wherein said step of determining, on a computer, if said user engaged in on-line activities includes the step of checking said user's on-line activities external to said personal monitoring module. 3. The computer implemented method of claim 2 wherein said step of performing, on a computer, a number of responsive actions includes the steps of:
alerting said user of the lack of on-line activities;
requesting a response from said user; and
if said user responds, then identifying said response as an on-line activity. 4. The computer implemented method of claim 3 wherein said user response is selected from the group consisting of an active verification response or a passive verification response. 5. The computer implemented method of claim 3 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a proxy;
alerting said proxy of the lack of on-line activities by the user;
requesting a response from a proxy; and
if said proxy responds, then identifying said response as an on-line activity. 6. The computer implemented method of claim 5 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a number of scripted actions;
allowing said user to establish a user response time;
requesting a user response within said user response time;
determining if said user response has been provided within said user response time;
if no user response has been provided within said user response time, then performing, on a computer, the scripted actions identified by the user. 7. The computer implemented method of claim 1 wherein said step of checking said user's on-line activities external to said personal monitoring module includes the step of checking on said user's public on-line activities. 8. The computer implemented method of claim 1 wherein said steps of initializing a personal monitoring module and checking said user's on-line activities external to said personal monitoring module includes the steps of:
accessing the user's identification data; and
checking on said user's private on-line activities. 9. The computer implemented method of claim 1 wherein said steps of initializing a personal monitoring module and performing, on a computer, a number of responsive actions includes the steps of:
allowing said user to identify a number of scripted actions;
allowing said user to establish a user response time;
requesting a user response within said user response time;
determining if a said user response has been provided within said user response time; and
if no user response has been provided within said user response time, then performing, on a computer, the scripted actions identified by the user. 10. The computer implemented method of claim 1 wherein said step of determining if a user is responsive includes the step of receiving an instruction indicating the user is nonresponsive. 11. The computer implemented method of claim 10 wherein said step of receiving an instruction indicating the user is nonresponsive includes the steps of:
allowing a proxy to log-in;
verifying the proxy's identity;
determining that a request to initiate a responsive action has been made; and
performing a number of scripted actions. 12. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing a number of modules including:
an investigation module structured to investigate a user and to determine if the user has engaged in an on-line activity within an investigation period;
a response module structured to perform a number of selected scripted actions; and
wherein said investigation module is structured to perform a passive investigation. 13. The system of claim 12 wherein said investigation module is structured to check a user's external on-line activities. 14. The system of claim 13 wherein said investigation module is structured to check one of said user's public on-line activities or said user's private on-line activities. 15. The system of claim 12 wherein:
said response module includes a verification module;
said verification module structured to contact a user; and
said verification module structured to contact a proxy. 16. The system of claim 15 wherein:
if said verification module does not contact said user, said response module is structured to perform a number of primary scripted actions; and
if said verification module does not contact said proxy, said response module is structured to perform a number of secondary scripted actions. 17. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing number of modules including:
an administrative module structured to receive a user's identification data;
a database module structured to store said user's identification data
an investigation module structured to investigate a user and to determine if the user has engaged in an external on-line activity within an investigation period; and
a response module structured to perform a number of selected scripted actions. 18. The system of claim 17 wherein:
said administrative module structured to receive the identification data for a proxy; and
said database module structured to store said identification data for a proxy. 19. The system of claim 17 wherein:
said administrative module structured to receive a user response time;
said database module structured to store said user response time;
said administrative module structured to receive a proxy response time; and
said database module structured to store said proxy response time. 20. A system for personal monitoring, the system comprising:
a non-transitory computer-readable storage medium storing a number of modules including:
an investigation module structured to investigate a user and to determine if the user has engaged in an on-line activity within an investigation period;
a response module structured to perform a number of selected scripted actions;
said response module structured to allow said user to identify a proxy, allow said user to identify a number of scripted actions, including a number of primary actions and a number of secondary actions, and allow said user to establish a proxy response time;
said selected scripted actions including alerting said proxy of the lack of on-line activities by the user, requesting a proxy response within said proxy response time, determining if a proxy response has been provided within said proxy response time, if said proxy responds, then identifying said response as an on-line activity, if no proxy response has been provided within said user response time, then performing, on a computer, the secondary actions identified by the user; and
wherein said investigation module is structured to perform a passive investigation. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.