Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
4,600 | 12,851,879 | 2,158 | In general, the subject matter described in this specification can be embodied in methods, systems, and program products for receiving user input that defines a search query, and providing the search query to a server system. Information that a search engine system determined was responsive to the search query is received at a computing device. The computing device is identified as in a first state, and a first output mode for audibly outputting at least a portion of the information is selected. The first output mode is selected from a collection of the first output mode and a second output mode. The second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the portion of the information and not audibly outputting the at least portion of the information. At least the portion of information is audibly output. | 1. A computer program product tangibly embodied in a computer-readable storage medium and comprising instructions that when executed by a processor perform operations comprising:
receiving, by a computing device, user input that defines a search query, and providing the search query to a server system that is remote from the computing device; receiving, by the computing device, information that a search engine system at the server system determined was responsive to the search query; identifying, by the computing device, that the computing device is in a first state, and in response, selecting a first output mode that is for audibly outputting at least a portion of the information, wherein the first output mode is selected from a collection that comprises the first output mode and a second output mode, wherein the second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the portion of the information and not audibly outputting the at least portion of the information; and audibly outputting, by the computing device and as a result of the identifying, at least the portion of the information. 2. The computer program product of claim 1, wherein the received user input that defines the search query is provided with a keyboard. 3. The computer program product of claim 1, wherein identifying that the computing device is in the first state includes determining that an external speaker and an external microphone have been placed in communication with the computing device by a user of the computing device. 4. The computer program product of claim 1, wherein identifying that the computing device is in the first state includes determining, using a sensor of the computing device, that the computing device is proximate to an object that is recognized by the computing device. 5. The computer program product of claim 4, wherein the computing device is determined to be in the second state when the computing device is determined to not be proximate to an object,
wherein the computing device is in the second state when the user input that defines the search query is received. 6. The computer program product of claim 1, wherein the information includes:
(i) a summarized query response that is responsive to the search query and that includes a human-readable prose sentence that was constructed using (a) a sentence template that includes predefined words and (b) content from a document that was identified as being responsive to the search query; and (ii) multiple search results that each identify a document that is responsive to the search query, wherein the multiple search results do not include a human-readable prose sentence that was constructed using (a) a sentence template that includes predefined words and (b) content from a document that was identified as being responsive to the search query. 7. The computer program product of claim 6, wherein the audible output is based on the human-readable prose sentence. 8. The computer program product of claim 7, wherein the summarized query response is visually output in a display;
wherein the display includes a user-selectable prompt; and wherein the operations further comprise, in response to selection of the prompt, displaying the search results. 9. The computer program product of claim 8, wherein the search results are not audibly output in response to selecting the prompt. 10. The computer program product of claim 8, wherein the operations further comprise visually displaying the search results after the audible output and in response to receiving user input selecting the prompt, wherein the search results are not visually displayed before receiving the user input selecting the prompt. 11. The computer program product of claim 7, wherein the operations further comprise providing a visual display of both the summarized query response and the multiple search results, and wherein the summarized query response is audibly output without receiving user input subsequent to receiving the information, but the multiple search results are not audibly output without user input being provided subsequent to receiving the information. 12. The computer program product of claim 1, wherein the identification that the computing device is in the first state does not depend on whether the computing device was in the first state or the second state when the search query was received. 13. A computer-implemented method, the method comprising:
receiving, by a server system and from a computing device, a search query that was input to the computing device by a user; determining, by the server system, search results that identify documents that are responsive to the search query; generating, by the server system, a summarized query response that is responsive to the search query based on information from one or more of the documents that are responsive to the search query, the summarized query response being generated based on a template that is different than a template that was used to generate the search results; and providing, by the server system and to the computing device, the search results and the summarized query response, so as to cause the computing device to: (i) determine that the computing device is in a first state, and in response, select a first output mode that is for audibly outputting at least the summarized query response, wherein the first mode is selected from a collection of the first output mode and a second output mode, wherein the second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the search results and not audibly outputting the summarized query response, and
(ii) audibly output at least the summarized query response. 14. The method of claim 13, wherein generating the summarized query response includes selecting data from one or more predesignated fields in the one or more documents, and placing the information into slots in a template that includes predefined words, so as to generate a human-understandable sentence that is constructed from both predefined words and the data from the one or more predesignated fields. 15. The method of claim 13, wherein the summarized query response is generated by the server system in response to identifying that the search query is in a defined list of search queries for which the summarized query response is to be generated. 16. The method of claim 13, wherein the summarized query response is generated by the server system in response to identifying that one or more documents from which the summarized query response is constructed is a determined search result. 17. A computer-implemented system comprising:
a search query interface to receive from a server system information that is responsive to a search query, the information including (i) multiple search results that identify documents that are responsive to the search query, and (ii) a summarized query response that is in addition to the multiple search results, and that is generated from content of a document that is responsive to the search query; a computing device state determiner that is programmed to identify whether the computing device is in a first state or a second state; a query result presenter to select for output a stored visual representation of the multiple search results if the computing device is determined to be in the first state, and to select for output a stored audible representation of the summarized query response if the computing device is determined to be in the second state; and audio and visual output devices for selectively outputting a visual representation of the multiple search results and an audible representation of the summarized query response based on the output that is selected by the query result presenter. 18. The system of claim 17, wherein the query result presenter does not select for output the audible representation of the summarized query response when the computing device is in the first state. 19. The system of claim 17, wherein the query result presenter further selects for output a visual representation of the summarized query response when the computing device is in the second state. 20. The system of claim 17, wherein the visual output device does not output a visual representation of either the search results or the summarized query response when the computing device is (i) in the second state and (ii) outputs the audible representation of the summarized query response. | In general, the subject matter described in this specification can be embodied in methods, systems, and program products for receiving user input that defines a search query, and providing the search query to a server system. Information that a search engine system determined was responsive to the search query is received at a computing device. The computing device is identified as in a first state, and a first output mode for audibly outputting at least a portion of the information is selected. The first output mode is selected from a collection of the first output mode and a second output mode. The second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the portion of the information and not audibly outputting the at least portion of the information. At least the portion of information is audibly output.1. A computer program product tangibly embodied in a computer-readable storage medium and comprising instructions that when executed by a processor perform operations comprising:
receiving, by a computing device, user input that defines a search query, and providing the search query to a server system that is remote from the computing device; receiving, by the computing device, information that a search engine system at the server system determined was responsive to the search query; identifying, by the computing device, that the computing device is in a first state, and in response, selecting a first output mode that is for audibly outputting at least a portion of the information, wherein the first output mode is selected from a collection that comprises the first output mode and a second output mode, wherein the second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the portion of the information and not audibly outputting the at least portion of the information; and audibly outputting, by the computing device and as a result of the identifying, at least the portion of the information. 2. The computer program product of claim 1, wherein the received user input that defines the search query is provided with a keyboard. 3. The computer program product of claim 1, wherein identifying that the computing device is in the first state includes determining that an external speaker and an external microphone have been placed in communication with the computing device by a user of the computing device. 4. The computer program product of claim 1, wherein identifying that the computing device is in the first state includes determining, using a sensor of the computing device, that the computing device is proximate to an object that is recognized by the computing device. 5. The computer program product of claim 4, wherein the computing device is determined to be in the second state when the computing device is determined to not be proximate to an object,
wherein the computing device is in the second state when the user input that defines the search query is received. 6. The computer program product of claim 1, wherein the information includes:
(i) a summarized query response that is responsive to the search query and that includes a human-readable prose sentence that was constructed using (a) a sentence template that includes predefined words and (b) content from a document that was identified as being responsive to the search query; and (ii) multiple search results that each identify a document that is responsive to the search query, wherein the multiple search results do not include a human-readable prose sentence that was constructed using (a) a sentence template that includes predefined words and (b) content from a document that was identified as being responsive to the search query. 7. The computer program product of claim 6, wherein the audible output is based on the human-readable prose sentence. 8. The computer program product of claim 7, wherein the summarized query response is visually output in a display;
wherein the display includes a user-selectable prompt; and wherein the operations further comprise, in response to selection of the prompt, displaying the search results. 9. The computer program product of claim 8, wherein the search results are not audibly output in response to selecting the prompt. 10. The computer program product of claim 8, wherein the operations further comprise visually displaying the search results after the audible output and in response to receiving user input selecting the prompt, wherein the search results are not visually displayed before receiving the user input selecting the prompt. 11. The computer program product of claim 7, wherein the operations further comprise providing a visual display of both the summarized query response and the multiple search results, and wherein the summarized query response is audibly output without receiving user input subsequent to receiving the information, but the multiple search results are not audibly output without user input being provided subsequent to receiving the information. 12. The computer program product of claim 1, wherein the identification that the computing device is in the first state does not depend on whether the computing device was in the first state or the second state when the search query was received. 13. A computer-implemented method, the method comprising:
receiving, by a server system and from a computing device, a search query that was input to the computing device by a user; determining, by the server system, search results that identify documents that are responsive to the search query; generating, by the server system, a summarized query response that is responsive to the search query based on information from one or more of the documents that are responsive to the search query, the summarized query response being generated based on a template that is different than a template that was used to generate the search results; and providing, by the server system and to the computing device, the search results and the summarized query response, so as to cause the computing device to: (i) determine that the computing device is in a first state, and in response, select a first output mode that is for audibly outputting at least the summarized query response, wherein the first mode is selected from a collection of the first output mode and a second output mode, wherein the second output mode is selected in response to the computing device being in a second state and is for visually outputting at least the search results and not audibly outputting the summarized query response, and
(ii) audibly output at least the summarized query response. 14. The method of claim 13, wherein generating the summarized query response includes selecting data from one or more predesignated fields in the one or more documents, and placing the information into slots in a template that includes predefined words, so as to generate a human-understandable sentence that is constructed from both predefined words and the data from the one or more predesignated fields. 15. The method of claim 13, wherein the summarized query response is generated by the server system in response to identifying that the search query is in a defined list of search queries for which the summarized query response is to be generated. 16. The method of claim 13, wherein the summarized query response is generated by the server system in response to identifying that one or more documents from which the summarized query response is constructed is a determined search result. 17. A computer-implemented system comprising:
a search query interface to receive from a server system information that is responsive to a search query, the information including (i) multiple search results that identify documents that are responsive to the search query, and (ii) a summarized query response that is in addition to the multiple search results, and that is generated from content of a document that is responsive to the search query; a computing device state determiner that is programmed to identify whether the computing device is in a first state or a second state; a query result presenter to select for output a stored visual representation of the multiple search results if the computing device is determined to be in the first state, and to select for output a stored audible representation of the summarized query response if the computing device is determined to be in the second state; and audio and visual output devices for selectively outputting a visual representation of the multiple search results and an audible representation of the summarized query response based on the output that is selected by the query result presenter. 18. The system of claim 17, wherein the query result presenter does not select for output the audible representation of the summarized query response when the computing device is in the first state. 19. The system of claim 17, wherein the query result presenter further selects for output a visual representation of the summarized query response when the computing device is in the second state. 20. The system of claim 17, wherein the visual output device does not output a visual representation of either the search results or the summarized query response when the computing device is (i) in the second state and (ii) outputs the audible representation of the summarized query response. | 2,100 |
4,601 | 14,242,857 | 2,158 | A method ranks data visualizations. A user selects a set of data fields from a set of data. A device identifies a plurality of data visualizations that use each data field in the user-selected set of data fields and identifies a plurality of respective alternative data visualizations. Each respective alternative data visualization uses each data field in a respective modified set of data fields. Each respective modified set differs from the user-selected set by a limited sequence of atomic operations. For each of the data visualizations and each of the alternative data visualizations, the device computes a score based on a set of ranking criteria. At least one criterion used to compute each score uses values of one or more of the data fields in the set of data. The list of high scoring data visualizations and alternative data visualizations is presented to the user. | 1. A method of ranking data visualizations, comprising:
at a computing device having one or more processors and memory, wherein the memory stores one or more programs for execution by the one or more processors:
receiving user selection of a set of data fields from a set of data;
identifying a plurality of data visualizations that use each data field in the user-selected set of data fields;
identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations;
for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and
presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 2. The method of claim 1, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 3. The method of claim 1, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 4. The method of claim 1, wherein the sequence of atomic operations is limited to two atomic operations. 5. The method of claim 1, wherein each of the atomic operations is selected from the group consisting of:
removing a single data field from the user-selected set; adding a single data field to the user-selected set; replacing a user-selected data field with a hierarchically narrower data field from the set of data; replacing a user-selected data field with a hierarchically broader data field from the set of data; adding a filter to a data field that limits values retrieved to a specified subset of values; removing a user-selected filter from a data field so that there is no limit on values retrieved for the data field; and modifying a filter for a data field, thereby altering values retrieved for the data field. 6. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by including an additional data field from the set of data. 7. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected data field. 8. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 9. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. 10. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by applying a filter to a user-selected data field, thereby limiting values of the user-selected data field to a first set of values, wherein the filter is not selected by the user. 11. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected filter for a user-selected data field. 12. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by modifying a user-selected filter for a data field, thereby altering values retrieved for the data field. 13. The method of claim 1, further comprising:
receiving user selection from the presented data visualization options; and displaying a data visualization on the computing device corresponding to the user selected option. 14. A computer system for ranking data visualizations, comprising:
one or more processors; memory; and one or more programs stored in the memory for execution by the one or more processors, the one or more programs comprising instructions for:
receiving user selection of a set of data fields from a set of data;
identifying a plurality of data visualizations that use each data field in the user-selected set of data fields;
identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations;
for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and
presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 15. The computer system of claim 14, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 16. The computer system of claim 14, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 17. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by including an additional data field from the set of data. 18. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected data field. 19. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 20. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. 21. A non-transitory computer readable storage medium storing one or more programs configured for execution by a computer system having one or more processors and memory storing one or more programs for execution by the one or more processors, the one or more programs comprising instructions for:
receiving user selection of a set of data fields from a set of data; identifying a plurality of data visualizations that use each data field in the user-selected set of data fields; identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations; for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 22. The computer readable storage medium of claim 21, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 23. The computer readable storage medium of claim 21, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 24. The computer readable storage medium of claim 21, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 25. The computer readable storage medium of claim 21, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. | A method ranks data visualizations. A user selects a set of data fields from a set of data. A device identifies a plurality of data visualizations that use each data field in the user-selected set of data fields and identifies a plurality of respective alternative data visualizations. Each respective alternative data visualization uses each data field in a respective modified set of data fields. Each respective modified set differs from the user-selected set by a limited sequence of atomic operations. For each of the data visualizations and each of the alternative data visualizations, the device computes a score based on a set of ranking criteria. At least one criterion used to compute each score uses values of one or more of the data fields in the set of data. The list of high scoring data visualizations and alternative data visualizations is presented to the user.1. A method of ranking data visualizations, comprising:
at a computing device having one or more processors and memory, wherein the memory stores one or more programs for execution by the one or more processors:
receiving user selection of a set of data fields from a set of data;
identifying a plurality of data visualizations that use each data field in the user-selected set of data fields;
identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations;
for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and
presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 2. The method of claim 1, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 3. The method of claim 1, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 4. The method of claim 1, wherein the sequence of atomic operations is limited to two atomic operations. 5. The method of claim 1, wherein each of the atomic operations is selected from the group consisting of:
removing a single data field from the user-selected set; adding a single data field to the user-selected set; replacing a user-selected data field with a hierarchically narrower data field from the set of data; replacing a user-selected data field with a hierarchically broader data field from the set of data; adding a filter to a data field that limits values retrieved to a specified subset of values; removing a user-selected filter from a data field so that there is no limit on values retrieved for the data field; and modifying a filter for a data field, thereby altering values retrieved for the data field. 6. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by including an additional data field from the set of data. 7. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected data field. 8. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 9. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. 10. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by applying a filter to a user-selected data field, thereby limiting values of the user-selected data field to a first set of values, wherein the filter is not selected by the user. 11. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected filter for a user-selected data field. 12. The method of claim 1, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by modifying a user-selected filter for a data field, thereby altering values retrieved for the data field. 13. The method of claim 1, further comprising:
receiving user selection from the presented data visualization options; and displaying a data visualization on the computing device corresponding to the user selected option. 14. A computer system for ranking data visualizations, comprising:
one or more processors; memory; and one or more programs stored in the memory for execution by the one or more processors, the one or more programs comprising instructions for:
receiving user selection of a set of data fields from a set of data;
identifying a plurality of data visualizations that use each data field in the user-selected set of data fields;
identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations;
for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and
presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 15. The computer system of claim 14, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 16. The computer system of claim 14, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 17. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by including an additional data field from the set of data. 18. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by removing a user-selected data field. 19. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 20. The computer system of claim 14, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. 21. A non-transitory computer readable storage medium storing one or more programs configured for execution by a computer system having one or more processors and memory storing one or more programs for execution by the one or more processors, the one or more programs comprising instructions for:
receiving user selection of a set of data fields from a set of data; identifying a plurality of data visualizations that use each data field in the user-selected set of data fields; identifying a plurality of respective alternative data visualizations, wherein each respective alternative data visualization uses each data field in a respective modified set of data fields, and wherein each respective modified set differs from the user-selected set by a limited sequence of atomic operations; for each of the data visualizations and each of the alternative data visualizations, computing a score based on a set of ranking criteria, wherein at least one criterion used to compute each score uses values of one or more of the data fields in the set of data; and presenting data visualization options to the user, wherein the presented options correspond to high scoring data visualizations and high scoring alternative data visualizations. 22. The computer readable storage medium of claim 21, wherein the data visualization options are presented to the user in a single ranked list that is ordered according to the computed scores of the data visualizations and the computed scores of the alternative data visualizations. 23. The computer readable storage medium of claim 21, wherein the data visualization options are presented to the user in two ranked lists, a first ranked list comprising high scoring data visualizations, ordered according to corresponding computed scores, and a second ranked list comprising high scoring alternative data visualizations, ordered according to corresponding computed scores. 24. The computer readable storage medium of claim 21, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically narrower than the first user-selected data field. 25. The computer readable storage medium of claim 21, wherein at least one of the alternative data visualizations is based on a modified set of data fields that differs from the user-selected set of data fields by replacing a first user-selected data field with a different data field that is hierarchically broader than the first user-selected data field. | 2,100 |
4,602 | 13,495,840 | 2,157 | A computer-implemented system and method for keyword extraction are disclosed. The system in an example embodiment includes a keyword extraction component to extract relevant keywords from content of a web page, to identify items relevant to the extracted keywords, and to rank the relevant items. | 1. A method comprising:
using a keyword extraction service to extract relevant keywords from content of a web page; identifying items relevant to the extracted keywords; and ranking the relevant items. 2. The method as claimed in claim 1 wherein the web page is identified using a uniform reference locator (URL). 3. The method as claimed in claim 1 wherein the keyword extraction service is activated when a user accesses the web page. 4. The method as claimed in claim 1 wherein the keyword extraction service is activated off-line without being triggered by user access of the web page. 5. The method as claimed in claim 1 further including performing a search using the extracted keywords. 6. The method as claimed in claim 1 wherein the keyword extraction service may extract relevant keywords from content of the web page using a plurality of extraction processes, the method further including determining which of a plurality of extraction processes is most efficient for the content of the web page. 7. The method as claimed in claim 1 wherein metadata tags are generated automatically based on the content of the web page. 8. The method as claimed in claim 1 wherein the keyword extraction service further identifies category information associated with the content of the web page. 9. The method as claimed in claim 1 wherein the relevancy of the extracted keywords to the items is based on information from the group: measures of item popularity, measures of web site popularity, aggregate user behavior on the web site; user feedback, listings availability, and catalog data. 10. The method as claimed in claim 1 further including using the extracted keywords to produce a contextual advertisement placement. 11. The method as claimed in claim 1 further including using the extracted keywords to automatically initiate a re-fetch of content of the web page. 12. An article of manufacture comprising a machine-readable medium having machine executable instructions embedded thereon, which when executed by a machine, cause the machine to:
use a keyword extraction service to extract relevant keywords from content of a web page; identify items relevant to the extracted keywords; and rank the relevant items. 13. The article of manufacture as claimed in claim 12 wherein the web page is identified using a uniform reference locator (URL). 14. The article of manufacture as claimed in claim 12 wherein the keyword extraction service is activated when a user accesses the web page. 15. A system comprising:
a processor; a memory coupled to the processor to store information related to keywords; and
a keyword extraction component to extract relevant keywords from content of a web page, to identify items relevant to the extracted keywords, and to rank the relevant items. 16. The system as claimed in claim 15 wherein the web page is identified using a uniform reference locator (URL). 17. The system as claimed in claim 15 wherein the keyword extraction component is activated when a user accesses the web page. 18. The system as claimed in claim 15 wherein the keyword extraction component is activated off-line without being triggered by user access of the web page. 19. The system as claimed in claim 15 being further operable to perform a search using the extracted keywords. 20. The system as claimed in claim 15 wherein the keyword extraction component may extract relevant keywords from content of the web page using a plurality of extraction processes, the system being further operable to determine which of a plurality of extraction processes is most efficient for the content of the web page. 21. The system as claimed in claim 15 wherein metadata tags are generated automatically based on the content of the web page. 22. The system as claimed in claim 15 wherein the keyword extraction component being further operable to identify category information associated with the content of the web page. 23. The system as claimed in claim 15 wherein the relevancy of the extracted keywords to the items is based on information from the group: measures of item popularity, measures of web site popularity, aggregate user behavior on the web site; user feedback, listings availability, and catalog data. 24. The system as claimed in claim 15 being further operable to use the extracted keywords to produce a contextual advertisement placement. 25. The system as claimed in claim 15 being further operable to use the extracted keywords to automatically initiate a re-fetch of content of the web page. | A computer-implemented system and method for keyword extraction are disclosed. The system in an example embodiment includes a keyword extraction component to extract relevant keywords from content of a web page, to identify items relevant to the extracted keywords, and to rank the relevant items.1. A method comprising:
using a keyword extraction service to extract relevant keywords from content of a web page; identifying items relevant to the extracted keywords; and ranking the relevant items. 2. The method as claimed in claim 1 wherein the web page is identified using a uniform reference locator (URL). 3. The method as claimed in claim 1 wherein the keyword extraction service is activated when a user accesses the web page. 4. The method as claimed in claim 1 wherein the keyword extraction service is activated off-line without being triggered by user access of the web page. 5. The method as claimed in claim 1 further including performing a search using the extracted keywords. 6. The method as claimed in claim 1 wherein the keyword extraction service may extract relevant keywords from content of the web page using a plurality of extraction processes, the method further including determining which of a plurality of extraction processes is most efficient for the content of the web page. 7. The method as claimed in claim 1 wherein metadata tags are generated automatically based on the content of the web page. 8. The method as claimed in claim 1 wherein the keyword extraction service further identifies category information associated with the content of the web page. 9. The method as claimed in claim 1 wherein the relevancy of the extracted keywords to the items is based on information from the group: measures of item popularity, measures of web site popularity, aggregate user behavior on the web site; user feedback, listings availability, and catalog data. 10. The method as claimed in claim 1 further including using the extracted keywords to produce a contextual advertisement placement. 11. The method as claimed in claim 1 further including using the extracted keywords to automatically initiate a re-fetch of content of the web page. 12. An article of manufacture comprising a machine-readable medium having machine executable instructions embedded thereon, which when executed by a machine, cause the machine to:
use a keyword extraction service to extract relevant keywords from content of a web page; identify items relevant to the extracted keywords; and rank the relevant items. 13. The article of manufacture as claimed in claim 12 wherein the web page is identified using a uniform reference locator (URL). 14. The article of manufacture as claimed in claim 12 wherein the keyword extraction service is activated when a user accesses the web page. 15. A system comprising:
a processor; a memory coupled to the processor to store information related to keywords; and
a keyword extraction component to extract relevant keywords from content of a web page, to identify items relevant to the extracted keywords, and to rank the relevant items. 16. The system as claimed in claim 15 wherein the web page is identified using a uniform reference locator (URL). 17. The system as claimed in claim 15 wherein the keyword extraction component is activated when a user accesses the web page. 18. The system as claimed in claim 15 wherein the keyword extraction component is activated off-line without being triggered by user access of the web page. 19. The system as claimed in claim 15 being further operable to perform a search using the extracted keywords. 20. The system as claimed in claim 15 wherein the keyword extraction component may extract relevant keywords from content of the web page using a plurality of extraction processes, the system being further operable to determine which of a plurality of extraction processes is most efficient for the content of the web page. 21. The system as claimed in claim 15 wherein metadata tags are generated automatically based on the content of the web page. 22. The system as claimed in claim 15 wherein the keyword extraction component being further operable to identify category information associated with the content of the web page. 23. The system as claimed in claim 15 wherein the relevancy of the extracted keywords to the items is based on information from the group: measures of item popularity, measures of web site popularity, aggregate user behavior on the web site; user feedback, listings availability, and catalog data. 24. The system as claimed in claim 15 being further operable to use the extracted keywords to produce a contextual advertisement placement. 25. The system as claimed in claim 15 being further operable to use the extracted keywords to automatically initiate a re-fetch of content of the web page. | 2,100 |
4,603 | 14,025,853 | 2,156 | According to an aspect multiple records are stored in a database server. A set of records are retrieved by querying the database server. A first file is formed to contain the retrieved set of records. The first file is sent by email to a user, and a second file, with at least one of the set of records modified, is received from the user by email. The received modifications contained in the second file are propagated to the database server, upon receipt of the second file. Users may accordingly be able to effect modifications to multiple records in a single email exchange. According to another aspect, the updates are effected by using a SOA server storing a process definition to interface (send and receive emails) with the user and propagate the changes. The SOA server may contain a workflow block to interact with users based on email exchange. | 1. A method of managing records, said method comprising:
storing a plurality of records in a database server; querying said database server to retrieve a set of records of interest; forming a first file containing said set of records; sending said first file, containing said set of records, by email to a user; receiving a second file, with at least one of said set of records modified, by email from said user; and propagating the modifications contained in said second file to said database server, upon receipt of said file. 2. The method of claim 1, wherein said file is sent as a corresponding attachment to said email sent to said user, and said file with modifications is received as a corresponding attachment to said email received from said user. 3. The method of claim 2, wherein said querying comprises sending a SQL query to said database server, said SQL query specifying a condition, wherein each of said set of records of interest satisfies said condition. 4. The method of claim 3, wherein each of said set of records corresponds to a single row of a table stored in said database server. 5. The method of claim 2, further comprising:
maintaining, a process definition containing a set of tasks, wherein said set of tasks include interfacing with said user, and said propagating; and receiving a request to execute said process definition, said request specifying said first file and said user as parameters such that said first file is sent to said user by email. 6. The method of claim 5, wherein a process manager executes said process definition in response to receiving of said request,
said process manager being contained in a SOA (Service Oriented Architecture) server and said process definition being specified according to Business Process Execution Language (BPEL), said process manager invoking a human workflow block to perform said sending and said receiving. 7. The method of claim 6, wherein said plurality of records correspond to issues raised by members of a team, and wherein said condition comprises specifying a manager who is to process the issues as a next step, said user comprising said manager such that said first file contains only issues that are to be processed by said manager,
wherein said querying, said forming and sending of said first file are performed periodically, and wherein modifications performed to said first file are propagated to said database server by execution of said process definition. 8. A computing system comprising:
a database server; an application server to populate said database server with a plurality of records; an update server operable to:
send a first file containing a set of records by email to a user, said set of records being contained in said plurality of records;
receive a second file, with at least one of said set of records modified, by email from said user; and
propagate the modifications contained in said second file to said database server, upon receipt of said file. 9. The computing system of claim 8, further comprising a repository server,
wherein said application server is operable to query said database server to retrieve said set of records as being of interest, and to form said first file, said application server being operable to store said first file in said repository server and to generate a request to said update server to cause said update server to perform said send of said first file. 10. The computing system of claim 9, wherein said update server is a Service Oriented Architecture (SOA) server storing a process definition specified in Business Process Execution Language (BPEL), said process definition specifying interfacing with said user and said propagate as respective tasks,
said update server being operable to receive a request to execute said process definition, and to execute said process definition in response to receipt of said request. 11. The computing system of claim 10, wherein said update server is operable to store said second file also in said repository server, wherein said update server retrieves said second file from said repository server in performing said propagate. 12. The computing system of claim 11, wherein said application server is designed to facilitate members of a team to raise respective issues, each issue requiring review by a corresponding manager as a next step,
said application server retrieving issues to be reviewed by a specific manager as said first set of issues, wherein said user is said specific manager. 13. The computing system of claim 12, wherein said application server generates said request after storing said first file in said repository,
said application server specifying an identity of said user and an identity of said first file in said repository as parameters to said request, causing said update server to send said first file to said user. 14. A non-transitory machine readable medium storing one or more sequences of instructions for causing a server system to manage records, wherein execution of said one or more sequences of instructions by one or more processors contained in said server system causes said server system to perform the actions of:
querying a database server to retrieve a set of records of interest; forming a first file containing said set of records; sending said first file, containing said set of records, by email to a user; receiving a second file, with at least one of said set of records modified, by email from said user; and propagating the modifications contained in said second file to said database server, upon receipt of said file. 15. The non-transitory machine readable medium of claim 14, wherein said file is sent as a corresponding attachment to said email sent to said user, and said file with modifications is received as a corresponding attachment to said email received from said user. 16. The non-transitory machine readable medium of claim 15, wherein said querying comprises sending a SQL query to said database server, said SQL query specifying a condition, wherein each of said set of records of interest satisfies said condition. 17. The non-transitory machine readable medium of claim 16, wherein each of said set of records corresponds to a single row of a table stored in said database server. 18. The non-transitory machine readable medium of claim 15, the actions further comprising:
maintaining, a process definition containing a set of tasks, wherein said set of tasks include interfacing with said user, and said propagating; and receiving a request to execute said process definition, said request specifying said first file and said user as parameters such that said first file is sent to said user by email. 19. The non-transitory machine readable medium of claim 18, wherein a process manager executes said process definition in response to receiving of said request,
said process manager being contained in a SOA (Service Oriented Architecture) server and said process definition being specified according to Business Process Execution Language (BPEL), said process manager invoking a human workflow block to perform said sending and said receiving. 20. The non-transitory machine readable medium of claim 19, wherein said plurality of records correspond to issues raised by members of a team, and wherein said condition comprises specifying a manager who is to process the issues as a next step, said user comprising said manager such that said first file contains only issues that are to be processed by said manager,
wherein said querying, said forming and sending of said first file are performed periodically, and wherein modifications performed to said first file are propagated to said database server by execution of said process definition. | According to an aspect multiple records are stored in a database server. A set of records are retrieved by querying the database server. A first file is formed to contain the retrieved set of records. The first file is sent by email to a user, and a second file, with at least one of the set of records modified, is received from the user by email. The received modifications contained in the second file are propagated to the database server, upon receipt of the second file. Users may accordingly be able to effect modifications to multiple records in a single email exchange. According to another aspect, the updates are effected by using a SOA server storing a process definition to interface (send and receive emails) with the user and propagate the changes. The SOA server may contain a workflow block to interact with users based on email exchange.1. A method of managing records, said method comprising:
storing a plurality of records in a database server; querying said database server to retrieve a set of records of interest; forming a first file containing said set of records; sending said first file, containing said set of records, by email to a user; receiving a second file, with at least one of said set of records modified, by email from said user; and propagating the modifications contained in said second file to said database server, upon receipt of said file. 2. The method of claim 1, wherein said file is sent as a corresponding attachment to said email sent to said user, and said file with modifications is received as a corresponding attachment to said email received from said user. 3. The method of claim 2, wherein said querying comprises sending a SQL query to said database server, said SQL query specifying a condition, wherein each of said set of records of interest satisfies said condition. 4. The method of claim 3, wherein each of said set of records corresponds to a single row of a table stored in said database server. 5. The method of claim 2, further comprising:
maintaining, a process definition containing a set of tasks, wherein said set of tasks include interfacing with said user, and said propagating; and receiving a request to execute said process definition, said request specifying said first file and said user as parameters such that said first file is sent to said user by email. 6. The method of claim 5, wherein a process manager executes said process definition in response to receiving of said request,
said process manager being contained in a SOA (Service Oriented Architecture) server and said process definition being specified according to Business Process Execution Language (BPEL), said process manager invoking a human workflow block to perform said sending and said receiving. 7. The method of claim 6, wherein said plurality of records correspond to issues raised by members of a team, and wherein said condition comprises specifying a manager who is to process the issues as a next step, said user comprising said manager such that said first file contains only issues that are to be processed by said manager,
wherein said querying, said forming and sending of said first file are performed periodically, and wherein modifications performed to said first file are propagated to said database server by execution of said process definition. 8. A computing system comprising:
a database server; an application server to populate said database server with a plurality of records; an update server operable to:
send a first file containing a set of records by email to a user, said set of records being contained in said plurality of records;
receive a second file, with at least one of said set of records modified, by email from said user; and
propagate the modifications contained in said second file to said database server, upon receipt of said file. 9. The computing system of claim 8, further comprising a repository server,
wherein said application server is operable to query said database server to retrieve said set of records as being of interest, and to form said first file, said application server being operable to store said first file in said repository server and to generate a request to said update server to cause said update server to perform said send of said first file. 10. The computing system of claim 9, wherein said update server is a Service Oriented Architecture (SOA) server storing a process definition specified in Business Process Execution Language (BPEL), said process definition specifying interfacing with said user and said propagate as respective tasks,
said update server being operable to receive a request to execute said process definition, and to execute said process definition in response to receipt of said request. 11. The computing system of claim 10, wherein said update server is operable to store said second file also in said repository server, wherein said update server retrieves said second file from said repository server in performing said propagate. 12. The computing system of claim 11, wherein said application server is designed to facilitate members of a team to raise respective issues, each issue requiring review by a corresponding manager as a next step,
said application server retrieving issues to be reviewed by a specific manager as said first set of issues, wherein said user is said specific manager. 13. The computing system of claim 12, wherein said application server generates said request after storing said first file in said repository,
said application server specifying an identity of said user and an identity of said first file in said repository as parameters to said request, causing said update server to send said first file to said user. 14. A non-transitory machine readable medium storing one or more sequences of instructions for causing a server system to manage records, wherein execution of said one or more sequences of instructions by one or more processors contained in said server system causes said server system to perform the actions of:
querying a database server to retrieve a set of records of interest; forming a first file containing said set of records; sending said first file, containing said set of records, by email to a user; receiving a second file, with at least one of said set of records modified, by email from said user; and propagating the modifications contained in said second file to said database server, upon receipt of said file. 15. The non-transitory machine readable medium of claim 14, wherein said file is sent as a corresponding attachment to said email sent to said user, and said file with modifications is received as a corresponding attachment to said email received from said user. 16. The non-transitory machine readable medium of claim 15, wherein said querying comprises sending a SQL query to said database server, said SQL query specifying a condition, wherein each of said set of records of interest satisfies said condition. 17. The non-transitory machine readable medium of claim 16, wherein each of said set of records corresponds to a single row of a table stored in said database server. 18. The non-transitory machine readable medium of claim 15, the actions further comprising:
maintaining, a process definition containing a set of tasks, wherein said set of tasks include interfacing with said user, and said propagating; and receiving a request to execute said process definition, said request specifying said first file and said user as parameters such that said first file is sent to said user by email. 19. The non-transitory machine readable medium of claim 18, wherein a process manager executes said process definition in response to receiving of said request,
said process manager being contained in a SOA (Service Oriented Architecture) server and said process definition being specified according to Business Process Execution Language (BPEL), said process manager invoking a human workflow block to perform said sending and said receiving. 20. The non-transitory machine readable medium of claim 19, wherein said plurality of records correspond to issues raised by members of a team, and wherein said condition comprises specifying a manager who is to process the issues as a next step, said user comprising said manager such that said first file contains only issues that are to be processed by said manager,
wherein said querying, said forming and sending of said first file are performed periodically, and wherein modifications performed to said first file are propagated to said database server by execution of said process definition. | 2,100 |
4,604 | 14,196,135 | 2,174 | A mobile device of executing an action in a display unchecking mode and a method of controlling the same are provided. The method includes detecting a display unchecking mode trigger, entering into the display unchecking mode, upon detection of the display unchecking mode trigger, detecting a predetermined execution trigger in the display unchecking mode, and executing a predetermined action corresponding to the predetermined execution trigger, upon the detecting of the predetermined execution trigger. | 1. A method of controlling a mobile device that executes an action in a display unchecking mode, the method comprising:
detecting a display unchecking mode trigger; entering into the display unchecking mode; detecting a predetermined execution trigger; and executing a predetermined action corresponding to the predetermined execution trigger. 2. The method of claim 1, wherein the detecting of the display unchecking mode trigger comprises:
detecting the display unchecking mode trigger when the mobile device is in at least one of an earphone connected state, a standby state, a locked state, and an application execution state. 3. The method of claim 1, wherein the display unchecking mode trigger is pressing of a home button for a predetermined time or longer. 4. The method of claim 1, wherein the entering into the display unchecking mode comprises:
displaying, on a touch screen, a help indication that explains the predetermined execution trigger and the predetermined action. 5. The method of claim 4, further comprising:
removing the help indication from the touch screen, upon detection of a help remove trigger; and re-displaying the help indication on the touch screen, upon detection of a help re-display trigger. 6. The method of claim 5, wherein the help remove trigger is a selection of a help remove icon or no input for a predetermined time, and
wherein the help re-display trigger is selection of a help re-display icon. 7. The method of claim 1, wherein the predetermined action corresponding to the predetermined execution trigger is determined based on a user information log of a user, determined in relation to a currently executed application, determined as execution of a switching function corresponding to a state of the mobile device, or predefined and stored in a memory of the mobile device. 8. The method of claim 1, wherein, if the predetermined execution trigger is a leftward or rightward swipe, a predetermined action corresponding to the leftward or rightward swipe is a play of a next or previous music, and
wherein, if the predetermined execution trigger is an upward or downward swipe, a predetermined action corresponding to the upward or downward swipe is execution or termination of a music application. 9. The method of claim 1, wherein the predetermined execution trigger is a double tap, and
wherein the predetermined action corresponding to the predetermined execution trigger is reproduction of a voice message explaining a state of the mobile device. 10. The method of claim 1, wherein, if the predetermined execution trigger is a touch held for a predetermined time or longer, a predetermined action corresponding to the touch held for the predetermined time or longer is execution of a voice input standby state, and
wherein, if the predetermined execution trigger is a drag of a voice icon, a predetermined action corresponding to the drag of the voice icon is execution of a voice-controlled interface application. 11. The method of claim 1, wherein, if the predetermined execution trigger is an incoming call, a predetermined action corresponding to the incoming call is execution of an incoming call application. 12. The method of claim 1, wherein, if the predetermined execution trigger is a combination of a message reception, and an upward, downward, leftward, or rightward swipe, a predetermined action corresponding to the combination of the message reception and the upward, downward, leftward, or rightward swipe is voice reproduction of a received message, and
wherein, if the predetermined execution trigger is a combination of a message reception and a double tap, a predetermined action corresponding to the combination of the message reception and the double tap is to ignore the message reception. 13. The method of claim 9, wherein the reproduction is performed in a full mode or a compact mode, and the full mode or the compact mode is preset or is set according to a state of the mobile device or a currently executed application. 14. The method of claim 9, wherein, upon detection of a plurality of rightward swipes, a jump operation is performed during the reproduction, and
wherein, upon detection of a plurality of leftward swipes, a rewind operation is performed during the reproduction. 15. The method of claim 1, further comprising:
upon detection of a trigger other than the predetermined execution trigger in the display unchecking mode, performing voice reproduction of a help explaining the predetermined execution trigger and the predetermined action. 16. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises:
ignoring a touch on an edge of a touch screen. 17. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises:
determining that the predetermined execution trigger is not detected, if the predetermined execution trigger is a swipe, drag, or flick from a first point to a second point on a touch screen, the first point is near to a left or right side of the touch screen, and the swipe, drag, or flick does not reach the second point. 18. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises, if the predetermined execution trigger is a swipe, drag, or flick in a first direction, an orientation of the mobile device is detected, and a swipe, drag, or flick in a second direction is detected, determining the detected swipe, drag, or flick in the second direction as the swipe, drag, or flick in the first direction, taking into account the orientation of the mobile device. 19. A mobile device of executing an action in a display unchecking mode, the mobile device comprising:
a controller configured to detect a display unchecking mode trigger, to enter into the display unchecking mode, to detect a predetermined execution trigger and to execute a predetermined action corresponding to the predetermined execution trigger; a touch screen configured to display a screen of the mobile device; and a memory configured to store information about the predetermined action corresponding to the predetermined execution trigger. 20. The mobile device of claim 19, wherein the controller detects the display unchecking mode trigger when the mobile device is in at least one of an earphone connected state, a standby state, a locked state, and an application execution state. 21. The mobile device of claim 19, wherein the display unchecking mode trigger is pressing of a home button for a predetermined time or longer. 22. The mobile device of claim 19, wherein, when the controller enters the display unchecking mode upon detection of the display, on the touch screen, unchecking mode trigger, the controller displays a help indication that explains the predetermined execution trigger and the predetermined action. 23. The mobile device of claim 22, wherein, upon detection of a help remove trigger, the controller removes the help indication from the touch screen, and
wherein, upon detection of a help re-display trigger, the controller re-displays the help indication on the touch screen. 24. The mobile device of claim 23, wherein the help remove trigger is a selection of a help remove icon or no input for a predetermined time, and
wherein the help re-display trigger is selection of a help re-display icon. 25. The mobile device of claim 19, wherein the predetermined action corresponding to the predetermined execution trigger is determined based on a user information log of a user, determined in relation to a currently executed application, determined as execution of a switching function corresponding to a state of the mobile device, or predefined and stored in a memory of the mobile device. 26. The mobile device of claim 19, wherein, if the predetermined execution trigger is a leftward or rightward swipe, a predetermined action corresponding to the leftward or rightward swipe is a play of a next or previous music, and
wherein, if the predetermined execution trigger is an upward or downward swipe, a predetermined action corresponding to the upward or downward swipe is execution or termination of a music application. 27. The mobile device of claim 19, wherein the predetermined execution trigger is a double tap, and
wherein the predetermined action corresponding to the predetermined execution trigger is reproduction of a voice message explaining a state of the mobile device. 28. The mobile device of claim 19, wherein, if the predetermined execution trigger is a touch held for a predetermined time or longer, a predetermined action corresponding to the touch held for the predetermined time or longer is execution of a voice input standby state, and
wherein, if the predetermined execution trigger is a drag of a voice icon, a predetermined action corresponding to the drag of the voice icon is execution of a voice-controlled interface application. 29. The mobile device of claim 19, wherein, if the predetermined execution trigger is an incoming call, a predetermined action corresponding to the incoming call is execution of an incoming call application. 30. The mobile device of claim 19, wherein, if the predetermined execution trigger is a combination of a message reception, and an upward, downward, leftward, or rightward swipe, a predetermined action corresponding to the combination of the message reception and the upward, downward, leftward, or rightward swipe is voice reproduction of a received message, and
wherein, if the predetermined execution trigger is a combination of a message reception and a double tap, a predetermined action corresponding to the combination of the message reception and the double tap is to ignore the message reception. 31. The mobile device of claim 27, wherein the reproduction is performed in a full mode or a compact mode, and the full mode or the compact mode is preset or is set according to a state of the mobile device or a currently executed application. 32. The mobile device of claim 27, wherein, upon detection of a plurality of rightward swipes, a jump operation is performed during the reproduction and
wherein, upon detection of a plurality of leftward swipes, a rewind operation is performed during the reproduction. 33. The mobile device of claim 19, wherein, upon detection of a trigger other than the predetermined execution trigger in the display unchecking mode, the controller performs voice reproduction of a help explaining the predetermined execution trigger and the predetermined action. 34. The mobile device of claim 19, wherein, when the controller detects the predetermined execution trigger in the display unchecking mode, the controller ignores a touch on an edge of a touch screen. 35. The mobile device of claim 19, wherein, when the controller detects the predetermined execution trigger in the display unchecking mode, if the predetermined execution trigger is a swipe, drag, or flick from a first point to a second point on a touch screen, the first point is near to a left or right side of the touch screen, and the swipe, drag, or flick does not reach the second point, the controller determines that the predetermined execution trigger is not detected. 36. The mobile device of claim 19, wherein when the controller detects the predetermined execution trigger in the display unchecking mode, if the predetermined execution trigger is a swipe, drag, or flick in a first direction, an orientation of the mobile device is detected, and a swipe, drag, or flick in a second direction is detected, the controller determines the detected swipe, drag, or flick in the second direction as the swipe, drag, or flick in the first direction, taking into account the orientation of the mobile device. 37. A non-transitory computer-readable storage medium storing instructions that, when executed, cause at least one processor to perform the method of claim 1. | A mobile device of executing an action in a display unchecking mode and a method of controlling the same are provided. The method includes detecting a display unchecking mode trigger, entering into the display unchecking mode, upon detection of the display unchecking mode trigger, detecting a predetermined execution trigger in the display unchecking mode, and executing a predetermined action corresponding to the predetermined execution trigger, upon the detecting of the predetermined execution trigger.1. A method of controlling a mobile device that executes an action in a display unchecking mode, the method comprising:
detecting a display unchecking mode trigger; entering into the display unchecking mode; detecting a predetermined execution trigger; and executing a predetermined action corresponding to the predetermined execution trigger. 2. The method of claim 1, wherein the detecting of the display unchecking mode trigger comprises:
detecting the display unchecking mode trigger when the mobile device is in at least one of an earphone connected state, a standby state, a locked state, and an application execution state. 3. The method of claim 1, wherein the display unchecking mode trigger is pressing of a home button for a predetermined time or longer. 4. The method of claim 1, wherein the entering into the display unchecking mode comprises:
displaying, on a touch screen, a help indication that explains the predetermined execution trigger and the predetermined action. 5. The method of claim 4, further comprising:
removing the help indication from the touch screen, upon detection of a help remove trigger; and re-displaying the help indication on the touch screen, upon detection of a help re-display trigger. 6. The method of claim 5, wherein the help remove trigger is a selection of a help remove icon or no input for a predetermined time, and
wherein the help re-display trigger is selection of a help re-display icon. 7. The method of claim 1, wherein the predetermined action corresponding to the predetermined execution trigger is determined based on a user information log of a user, determined in relation to a currently executed application, determined as execution of a switching function corresponding to a state of the mobile device, or predefined and stored in a memory of the mobile device. 8. The method of claim 1, wherein, if the predetermined execution trigger is a leftward or rightward swipe, a predetermined action corresponding to the leftward or rightward swipe is a play of a next or previous music, and
wherein, if the predetermined execution trigger is an upward or downward swipe, a predetermined action corresponding to the upward or downward swipe is execution or termination of a music application. 9. The method of claim 1, wherein the predetermined execution trigger is a double tap, and
wherein the predetermined action corresponding to the predetermined execution trigger is reproduction of a voice message explaining a state of the mobile device. 10. The method of claim 1, wherein, if the predetermined execution trigger is a touch held for a predetermined time or longer, a predetermined action corresponding to the touch held for the predetermined time or longer is execution of a voice input standby state, and
wherein, if the predetermined execution trigger is a drag of a voice icon, a predetermined action corresponding to the drag of the voice icon is execution of a voice-controlled interface application. 11. The method of claim 1, wherein, if the predetermined execution trigger is an incoming call, a predetermined action corresponding to the incoming call is execution of an incoming call application. 12. The method of claim 1, wherein, if the predetermined execution trigger is a combination of a message reception, and an upward, downward, leftward, or rightward swipe, a predetermined action corresponding to the combination of the message reception and the upward, downward, leftward, or rightward swipe is voice reproduction of a received message, and
wherein, if the predetermined execution trigger is a combination of a message reception and a double tap, a predetermined action corresponding to the combination of the message reception and the double tap is to ignore the message reception. 13. The method of claim 9, wherein the reproduction is performed in a full mode or a compact mode, and the full mode or the compact mode is preset or is set according to a state of the mobile device or a currently executed application. 14. The method of claim 9, wherein, upon detection of a plurality of rightward swipes, a jump operation is performed during the reproduction, and
wherein, upon detection of a plurality of leftward swipes, a rewind operation is performed during the reproduction. 15. The method of claim 1, further comprising:
upon detection of a trigger other than the predetermined execution trigger in the display unchecking mode, performing voice reproduction of a help explaining the predetermined execution trigger and the predetermined action. 16. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises:
ignoring a touch on an edge of a touch screen. 17. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises:
determining that the predetermined execution trigger is not detected, if the predetermined execution trigger is a swipe, drag, or flick from a first point to a second point on a touch screen, the first point is near to a left or right side of the touch screen, and the swipe, drag, or flick does not reach the second point. 18. The method of claim 1, wherein the detecting of the predetermined execution trigger in the display unchecking mode comprises, if the predetermined execution trigger is a swipe, drag, or flick in a first direction, an orientation of the mobile device is detected, and a swipe, drag, or flick in a second direction is detected, determining the detected swipe, drag, or flick in the second direction as the swipe, drag, or flick in the first direction, taking into account the orientation of the mobile device. 19. A mobile device of executing an action in a display unchecking mode, the mobile device comprising:
a controller configured to detect a display unchecking mode trigger, to enter into the display unchecking mode, to detect a predetermined execution trigger and to execute a predetermined action corresponding to the predetermined execution trigger; a touch screen configured to display a screen of the mobile device; and a memory configured to store information about the predetermined action corresponding to the predetermined execution trigger. 20. The mobile device of claim 19, wherein the controller detects the display unchecking mode trigger when the mobile device is in at least one of an earphone connected state, a standby state, a locked state, and an application execution state. 21. The mobile device of claim 19, wherein the display unchecking mode trigger is pressing of a home button for a predetermined time or longer. 22. The mobile device of claim 19, wherein, when the controller enters the display unchecking mode upon detection of the display, on the touch screen, unchecking mode trigger, the controller displays a help indication that explains the predetermined execution trigger and the predetermined action. 23. The mobile device of claim 22, wherein, upon detection of a help remove trigger, the controller removes the help indication from the touch screen, and
wherein, upon detection of a help re-display trigger, the controller re-displays the help indication on the touch screen. 24. The mobile device of claim 23, wherein the help remove trigger is a selection of a help remove icon or no input for a predetermined time, and
wherein the help re-display trigger is selection of a help re-display icon. 25. The mobile device of claim 19, wherein the predetermined action corresponding to the predetermined execution trigger is determined based on a user information log of a user, determined in relation to a currently executed application, determined as execution of a switching function corresponding to a state of the mobile device, or predefined and stored in a memory of the mobile device. 26. The mobile device of claim 19, wherein, if the predetermined execution trigger is a leftward or rightward swipe, a predetermined action corresponding to the leftward or rightward swipe is a play of a next or previous music, and
wherein, if the predetermined execution trigger is an upward or downward swipe, a predetermined action corresponding to the upward or downward swipe is execution or termination of a music application. 27. The mobile device of claim 19, wherein the predetermined execution trigger is a double tap, and
wherein the predetermined action corresponding to the predetermined execution trigger is reproduction of a voice message explaining a state of the mobile device. 28. The mobile device of claim 19, wherein, if the predetermined execution trigger is a touch held for a predetermined time or longer, a predetermined action corresponding to the touch held for the predetermined time or longer is execution of a voice input standby state, and
wherein, if the predetermined execution trigger is a drag of a voice icon, a predetermined action corresponding to the drag of the voice icon is execution of a voice-controlled interface application. 29. The mobile device of claim 19, wherein, if the predetermined execution trigger is an incoming call, a predetermined action corresponding to the incoming call is execution of an incoming call application. 30. The mobile device of claim 19, wherein, if the predetermined execution trigger is a combination of a message reception, and an upward, downward, leftward, or rightward swipe, a predetermined action corresponding to the combination of the message reception and the upward, downward, leftward, or rightward swipe is voice reproduction of a received message, and
wherein, if the predetermined execution trigger is a combination of a message reception and a double tap, a predetermined action corresponding to the combination of the message reception and the double tap is to ignore the message reception. 31. The mobile device of claim 27, wherein the reproduction is performed in a full mode or a compact mode, and the full mode or the compact mode is preset or is set according to a state of the mobile device or a currently executed application. 32. The mobile device of claim 27, wherein, upon detection of a plurality of rightward swipes, a jump operation is performed during the reproduction and
wherein, upon detection of a plurality of leftward swipes, a rewind operation is performed during the reproduction. 33. The mobile device of claim 19, wherein, upon detection of a trigger other than the predetermined execution trigger in the display unchecking mode, the controller performs voice reproduction of a help explaining the predetermined execution trigger and the predetermined action. 34. The mobile device of claim 19, wherein, when the controller detects the predetermined execution trigger in the display unchecking mode, the controller ignores a touch on an edge of a touch screen. 35. The mobile device of claim 19, wherein, when the controller detects the predetermined execution trigger in the display unchecking mode, if the predetermined execution trigger is a swipe, drag, or flick from a first point to a second point on a touch screen, the first point is near to a left or right side of the touch screen, and the swipe, drag, or flick does not reach the second point, the controller determines that the predetermined execution trigger is not detected. 36. The mobile device of claim 19, wherein when the controller detects the predetermined execution trigger in the display unchecking mode, if the predetermined execution trigger is a swipe, drag, or flick in a first direction, an orientation of the mobile device is detected, and a swipe, drag, or flick in a second direction is detected, the controller determines the detected swipe, drag, or flick in the second direction as the swipe, drag, or flick in the first direction, taking into account the orientation of the mobile device. 37. A non-transitory computer-readable storage medium storing instructions that, when executed, cause at least one processor to perform the method of claim 1. | 2,100 |
4,605 | 14,396,324 | 2,113 | Methods, systems, and computer-readable and executable instructions are provided for checkpointing using a field programmable gate array (FPGA). Checkpointing using FPGA can include checkpointing data within a region of a server's contents to memory and monitoring the checkpointed data using the FPGA. | 1. A computer-implemented method for checkpointing using a field programmable gate array (FPGA) comprising:
checkpointing data within a region of a server's contents to memory; and monitoring the checkpointed data using the FPGA. 2. The method of claim 1, wherein the FPGA is coherently coupled to the memory. 3. The method of claim 1, wherein checkpointing data to memory further comprises checkpointing data to non-volatile memory. 4. The method of claim 1, further comprising utilizing the checkpointed data to recover the server in response to the server crashing. 5. The method of claim 1, further comprising compressing the checkpointed data. 6. The method of claim 1, wherein monitoring the data further comprises excluding expired data entries from the region. 7. A non-transitory computer-readable medium storing a set of instructions executable by a processing resource to:
temporarily lock a memcached hash table from access using a field-programmable gate array (FPGA); checkpoint a first region of a memcached server's contents to non-volatile memory while the memcached hash table is locked; release the lock for a period of time; relock the memcached hash table; checkpoint a second region of the memcached server's contents to the non-volatile memory while the memcached hash table is relocked; and monitor the checkpointed data within the first and second regions using the FPGA, wherein the FPGA is coherently attached to the non-volatile memory. 8. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to monitor the data by tracking an update to each of the number of checkpointed regions. 9. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to divide a memcached hash table lock and add an additional memcached hash table lock to each of the number of checkpointed regions. 10. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to temporarily reduce region updates during checkpointing. 11. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to receive, to the FPGA, information about a hash table of each of the number of regions and data within each of the number of regions. 12. A system for checkpointing using a field-programmable gate array (FPGA), comprising:
a memory resource; and a processing resource coupled to the memory resource, to:
receive, to the FPGA, a number of address regions within a memcached server to checkpoint;
periodically checkpoint each of the number of address regions to non-volatile memory; and
automatically monitor data within each of the number of address regions using the FPGA, wherein the FPGA is coherently coupled to the non-volatile memory. 13. The system of claim 12, wherein the processing resource is further coupled to the memory resource to allow the FPGA access to a memcached hash table lock within one of the number of regions. 14. The system of claim 12, wherein the processing resource is further coupled to the memory resource to save to the non-volatile memory at least one of a pointer to a start of one of the number of address regions, a size of an address region checkpoint, and an address for a beginning of a memcached hash table. 15. The system of claim 12, wherein the FPGA is located in a separate network socket than the non-volatile memory. | Methods, systems, and computer-readable and executable instructions are provided for checkpointing using a field programmable gate array (FPGA). Checkpointing using FPGA can include checkpointing data within a region of a server's contents to memory and monitoring the checkpointed data using the FPGA.1. A computer-implemented method for checkpointing using a field programmable gate array (FPGA) comprising:
checkpointing data within a region of a server's contents to memory; and monitoring the checkpointed data using the FPGA. 2. The method of claim 1, wherein the FPGA is coherently coupled to the memory. 3. The method of claim 1, wherein checkpointing data to memory further comprises checkpointing data to non-volatile memory. 4. The method of claim 1, further comprising utilizing the checkpointed data to recover the server in response to the server crashing. 5. The method of claim 1, further comprising compressing the checkpointed data. 6. The method of claim 1, wherein monitoring the data further comprises excluding expired data entries from the region. 7. A non-transitory computer-readable medium storing a set of instructions executable by a processing resource to:
temporarily lock a memcached hash table from access using a field-programmable gate array (FPGA); checkpoint a first region of a memcached server's contents to non-volatile memory while the memcached hash table is locked; release the lock for a period of time; relock the memcached hash table; checkpoint a second region of the memcached server's contents to the non-volatile memory while the memcached hash table is relocked; and monitor the checkpointed data within the first and second regions using the FPGA, wherein the FPGA is coherently attached to the non-volatile memory. 8. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to monitor the data by tracking an update to each of the number of checkpointed regions. 9. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to divide a memcached hash table lock and add an additional memcached hash table lock to each of the number of checkpointed regions. 10. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to temporarily reduce region updates during checkpointing. 11. The non-transitory computer-readable medium of claim 7, wherein the instructions are further executable to receive, to the FPGA, information about a hash table of each of the number of regions and data within each of the number of regions. 12. A system for checkpointing using a field-programmable gate array (FPGA), comprising:
a memory resource; and a processing resource coupled to the memory resource, to:
receive, to the FPGA, a number of address regions within a memcached server to checkpoint;
periodically checkpoint each of the number of address regions to non-volatile memory; and
automatically monitor data within each of the number of address regions using the FPGA, wherein the FPGA is coherently coupled to the non-volatile memory. 13. The system of claim 12, wherein the processing resource is further coupled to the memory resource to allow the FPGA access to a memcached hash table lock within one of the number of regions. 14. The system of claim 12, wherein the processing resource is further coupled to the memory resource to save to the non-volatile memory at least one of a pointer to a start of one of the number of address regions, a size of an address region checkpoint, and an address for a beginning of a memcached hash table. 15. The system of claim 12, wherein the FPGA is located in a separate network socket than the non-volatile memory. | 2,100 |
4,606 | 14,271,685 | 2,171 | A multi-window user interface (UI) on a control device such as a tablet computer communicates commands to a display controller, which may be implemented by a game console. The controller controls presentation on a large screen display according to the commands. The control device may always present a multi-window UI which the control device can command to have mimicked on the display, with the UI also being configured to cause a single video to be presented whole screen on the display while the multi-window UI remains presented on the control device. The video feeds that populate the multi-window UI are of the same content but of lower resolution than those which are presented on the display. A movable window on the control device can be dragged and dropped to cause a corresponding magnifying focus on the display over the corresponding portion of video in focus on the control device. | 1. A control device comprising:
at least one computer readable storage medium bearing instructions executable by a processor; at least one processor configured for accessing the computer readable storage medium to execute the instructions to configure the processor for: presenting on a display of the control device a user interface (UI) presenting at least one video image of content and a border superimposed on a portion of the video image to define a portion of video, the portion of video being smaller than the video image; receiving a user input to move the border from a first portion of video in the video image to a second portion of video in the video image; and responsive to the user input, sending a command to a controller of a display device presenting the content separately from the control device to pan the video image on the display device from the first portion to the second portion. 2. The control device of claim 1, wherein the instructions when executed by the processor configure the processor for, responsive to the user input, sending a command to the controller of the display device presenting the content separately from the control device to cause the controller to pan and zoom a portion of the video image, such that the content related to the video image on the display device is entirely established, in temporal sequence, by a zoomed presentation of the first portion, then a moving pan across at least part of the video image on the display device in concert with the user input to move the border to the second portion of the video image on the control device. 3. The control device of claim 2, wherein the instructions when executed by the processor configure the processor for, responsive to the user input dropping the border on the second portion of the video image on the control device, sending a command to the controller to cause presentation the video image on the display device to be entirely established by a zoomed presentation of the second portion. 4. The control device of claim 1, wherein the instructions when executed by the processor configure the processor for presenting both the video image of the content and the border superimposed on the portion of the video image as the user input causes the border to move across the video image of the content, while causing the controller to present on the display device only content from the video image corresponding to content within the border on the control device. 5. The control device of claim 1, wherein the control device is established by a portable computer. 6. The control device of claim 1, wherein the display device includes an ultra high definition display. 7. The control device of claim 1, wherein the control device communicates with the controller and not with the display device directly. 8. Method comprising:
receiving at a control device a user-input drag and drop between first and second portions of a video image of content presented on the display device; and responsive to the drag and drop, commanding a controller of a display device presenting the content to pan presentation on the display device from the first portion to the second portion. 9. The method of claim 8, further comprising, responsive to the drag and drop, commanding the controller of the display device to zoom the second portion. 10. System comprising:
display device configured for presenting video content; controller configured for controlling the display device; and control device configured for communicating commands to the controller to control presentation on the display device, the control device being configured to present a user interface (UI) having an indicator on a portion of video content presented on the control device, the video content presented on the control device being the same as the video content presented on the display device, the control device commanding the controller to pan and zoom the video content on the display device responsive to a user moving the indicator on the control device. 11. The system of claim 10, wherein the video content on the display device is received from a source and the video content on the control device is also received from the source. 12. The system of claim 10, wherein the indicator is an enclosed box. 13. The system of claim 10, wherein the control device is established by a portable computer. 14. The system of claim 10, wherein the display device is established by an ultra high definition (UHD) display. 15. The system of claim 10, wherein the controller is established by a game console. 16. The system of claim 10, wherein the controller is established by a personal computer (PC). 17. The system of claim 10, wherein the control device is established by a laptop computer or tablet computer. | A multi-window user interface (UI) on a control device such as a tablet computer communicates commands to a display controller, which may be implemented by a game console. The controller controls presentation on a large screen display according to the commands. The control device may always present a multi-window UI which the control device can command to have mimicked on the display, with the UI also being configured to cause a single video to be presented whole screen on the display while the multi-window UI remains presented on the control device. The video feeds that populate the multi-window UI are of the same content but of lower resolution than those which are presented on the display. A movable window on the control device can be dragged and dropped to cause a corresponding magnifying focus on the display over the corresponding portion of video in focus on the control device.1. A control device comprising:
at least one computer readable storage medium bearing instructions executable by a processor; at least one processor configured for accessing the computer readable storage medium to execute the instructions to configure the processor for: presenting on a display of the control device a user interface (UI) presenting at least one video image of content and a border superimposed on a portion of the video image to define a portion of video, the portion of video being smaller than the video image; receiving a user input to move the border from a first portion of video in the video image to a second portion of video in the video image; and responsive to the user input, sending a command to a controller of a display device presenting the content separately from the control device to pan the video image on the display device from the first portion to the second portion. 2. The control device of claim 1, wherein the instructions when executed by the processor configure the processor for, responsive to the user input, sending a command to the controller of the display device presenting the content separately from the control device to cause the controller to pan and zoom a portion of the video image, such that the content related to the video image on the display device is entirely established, in temporal sequence, by a zoomed presentation of the first portion, then a moving pan across at least part of the video image on the display device in concert with the user input to move the border to the second portion of the video image on the control device. 3. The control device of claim 2, wherein the instructions when executed by the processor configure the processor for, responsive to the user input dropping the border on the second portion of the video image on the control device, sending a command to the controller to cause presentation the video image on the display device to be entirely established by a zoomed presentation of the second portion. 4. The control device of claim 1, wherein the instructions when executed by the processor configure the processor for presenting both the video image of the content and the border superimposed on the portion of the video image as the user input causes the border to move across the video image of the content, while causing the controller to present on the display device only content from the video image corresponding to content within the border on the control device. 5. The control device of claim 1, wherein the control device is established by a portable computer. 6. The control device of claim 1, wherein the display device includes an ultra high definition display. 7. The control device of claim 1, wherein the control device communicates with the controller and not with the display device directly. 8. Method comprising:
receiving at a control device a user-input drag and drop between first and second portions of a video image of content presented on the display device; and responsive to the drag and drop, commanding a controller of a display device presenting the content to pan presentation on the display device from the first portion to the second portion. 9. The method of claim 8, further comprising, responsive to the drag and drop, commanding the controller of the display device to zoom the second portion. 10. System comprising:
display device configured for presenting video content; controller configured for controlling the display device; and control device configured for communicating commands to the controller to control presentation on the display device, the control device being configured to present a user interface (UI) having an indicator on a portion of video content presented on the control device, the video content presented on the control device being the same as the video content presented on the display device, the control device commanding the controller to pan and zoom the video content on the display device responsive to a user moving the indicator on the control device. 11. The system of claim 10, wherein the video content on the display device is received from a source and the video content on the control device is also received from the source. 12. The system of claim 10, wherein the indicator is an enclosed box. 13. The system of claim 10, wherein the control device is established by a portable computer. 14. The system of claim 10, wherein the display device is established by an ultra high definition (UHD) display. 15. The system of claim 10, wherein the controller is established by a game console. 16. The system of claim 10, wherein the controller is established by a personal computer (PC). 17. The system of claim 10, wherein the control device is established by a laptop computer or tablet computer. | 2,100 |
4,607 | 13,848,369 | 2,133 | System, method, and program to perform simultaneous read and write operations in a NAND-type memory device, including: assigning a first partition in a NAND-type memory device, wherein the first partition is configured to perform read operations on high priority read content; assigning a second partition in the NAND-type memory device, wherein the second partition is configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and controlling the first partition and second partition to operate in a simultaneous manner. | 1. A method for simultaneous read and write operations to be performed in a NAND-type memory device, the method comprising:
assigning a first partition in a NAND-type memory device, wherein the first partition is configured to perform read operations on high priority read content; assigning a second partition in the NAND-type memory device, wherein the second partition is configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and controlling the first partition and second partition to operate in a simultaneous manner. 2. The method of claim 1, wherein the step of controlling includes forming a first queue and a second queue from a primary queue, wherein the first queue executes read operations associated with the first partition and the second queue executes read and write operations associated with the second partition. 3. The method of claim 2, wherein the first queue and the second queue are executed in parallel. 4. The method of claim 3, wherein when additional content is required to be written to the first partition, a temporary write is made to the second partition to store the additional content. 5. The method of claim 3, wherein when an associated host device requests writing additional content to the first partition, a temporary write is made to the second partition to store the additional content. 6. The method of claim 4 further comprising transferring the additional content to the first partition during an idle time associated with a system in which the NAND-type memory device is coupled. 7. The method of claim 1 further including assigning one or more additional partitions, wherein at least one of the additional partitions is configured to perform read operations and write operations. 8. The method of claim 7, wherein the read and/or write operations performed by the one or more additional partitions are performed on non-high priority read content. 9. The method of claim 7 further including controlling the first partition, the second partition and the one or more additional partitions in parallel. 10. The method of claim 9, wherein the step of controlling includes forming a first queue and a second queue and additional queues for each of the additional partitions from a primary queue, wherein the first queue executes read operations associated with the first partition and the second queue executes read operations and write operations associated with the second partition and each of the additional queues execute read operations and write operations associated with each of the one or more additional partitions. 11. A non-volatile memory device comprising:
a NAND-type memory chip including a first partition configured to perform read operations on high priority read content and a second partition configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and a memory controller configured to control the first partition and second partition to operate in a simultaneous manner, such that the first partition may read high priority content when the second partition is reading or writing content. 12. The non-volatile memory device of claim 11, wherein the memory controller includes a first queue for executing read operations associated with the first partition and a second queue for executing read and write operations associated with the second partition 13. The non-volatile memory device of claim 12, wherein the first queue and the second queue are configure to be executed in parallel. 14. The non-volatile memory device of claim 13, wherein when additional content is required to be written to the first partition, the memory controller is configured permits a temporary write to be made to the second partition to store the additional content. 15. The non-volatile memory device of claim 13, wherein when an associated host device requests writing additional content to the first partition, a temporary write is made to the second partition to store the additional content. 16. The non-volatile memory device of claim 15, wherein the memory controller transfers the additional content to the first partition during an idle time associated with a host device in which the NAND-type memory device is coupled. 17. The non-volatile memory device of claim 11 further including one or more additional partitions in the NAND-type memory device, wherein at least one of the additional partitions is configured to perform read operations and write operations. 18. The non-volatile memory device of claim 17, wherein the memory controller is configured for controlling the first partition, the second partition and the one or more additional partitions in parallel. 19. The non-volatile memory device of claim 18, wherein the memory controller includes a first queue for controlling execution of the first partition, a second queue for controlling execution of the second partition and additional queues for each additional partition contained on the NAND-type memory chip. 20. A program for use in an electronic host device for controlling for simultaneous read and write operations to be performed in a NAND-type memory device, wherein the NAND-type memory includes a first partition and a second partition; and a memory controller configured to control the first partition and the second partition to execute in a simultaneous manner, wherein the first partition is a read only partition dedicated to high priority read content and second partition is a read and write partition, the program comprising executable logic to:
place high priority read content on the first partition; receiving a request for writing additional content on the first partition; writing the additional content to the second partition; and transferring the additional content to the first partition when a signal is received from the host electronic device to the memory control indicating that the host electronic device is in an idle state. | System, method, and program to perform simultaneous read and write operations in a NAND-type memory device, including: assigning a first partition in a NAND-type memory device, wherein the first partition is configured to perform read operations on high priority read content; assigning a second partition in the NAND-type memory device, wherein the second partition is configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and controlling the first partition and second partition to operate in a simultaneous manner.1. A method for simultaneous read and write operations to be performed in a NAND-type memory device, the method comprising:
assigning a first partition in a NAND-type memory device, wherein the first partition is configured to perform read operations on high priority read content; assigning a second partition in the NAND-type memory device, wherein the second partition is configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and controlling the first partition and second partition to operate in a simultaneous manner. 2. The method of claim 1, wherein the step of controlling includes forming a first queue and a second queue from a primary queue, wherein the first queue executes read operations associated with the first partition and the second queue executes read and write operations associated with the second partition. 3. The method of claim 2, wherein the first queue and the second queue are executed in parallel. 4. The method of claim 3, wherein when additional content is required to be written to the first partition, a temporary write is made to the second partition to store the additional content. 5. The method of claim 3, wherein when an associated host device requests writing additional content to the first partition, a temporary write is made to the second partition to store the additional content. 6. The method of claim 4 further comprising transferring the additional content to the first partition during an idle time associated with a system in which the NAND-type memory device is coupled. 7. The method of claim 1 further including assigning one or more additional partitions, wherein at least one of the additional partitions is configured to perform read operations and write operations. 8. The method of claim 7, wherein the read and/or write operations performed by the one or more additional partitions are performed on non-high priority read content. 9. The method of claim 7 further including controlling the first partition, the second partition and the one or more additional partitions in parallel. 10. The method of claim 9, wherein the step of controlling includes forming a first queue and a second queue and additional queues for each of the additional partitions from a primary queue, wherein the first queue executes read operations associated with the first partition and the second queue executes read operations and write operations associated with the second partition and each of the additional queues execute read operations and write operations associated with each of the one or more additional partitions. 11. A non-volatile memory device comprising:
a NAND-type memory chip including a first partition configured to perform read operations on high priority read content and a second partition configured to perform read operations and write operations, wherein the read operations are performed on non-high priority read content; and a memory controller configured to control the first partition and second partition to operate in a simultaneous manner, such that the first partition may read high priority content when the second partition is reading or writing content. 12. The non-volatile memory device of claim 11, wherein the memory controller includes a first queue for executing read operations associated with the first partition and a second queue for executing read and write operations associated with the second partition 13. The non-volatile memory device of claim 12, wherein the first queue and the second queue are configure to be executed in parallel. 14. The non-volatile memory device of claim 13, wherein when additional content is required to be written to the first partition, the memory controller is configured permits a temporary write to be made to the second partition to store the additional content. 15. The non-volatile memory device of claim 13, wherein when an associated host device requests writing additional content to the first partition, a temporary write is made to the second partition to store the additional content. 16. The non-volatile memory device of claim 15, wherein the memory controller transfers the additional content to the first partition during an idle time associated with a host device in which the NAND-type memory device is coupled. 17. The non-volatile memory device of claim 11 further including one or more additional partitions in the NAND-type memory device, wherein at least one of the additional partitions is configured to perform read operations and write operations. 18. The non-volatile memory device of claim 17, wherein the memory controller is configured for controlling the first partition, the second partition and the one or more additional partitions in parallel. 19. The non-volatile memory device of claim 18, wherein the memory controller includes a first queue for controlling execution of the first partition, a second queue for controlling execution of the second partition and additional queues for each additional partition contained on the NAND-type memory chip. 20. A program for use in an electronic host device for controlling for simultaneous read and write operations to be performed in a NAND-type memory device, wherein the NAND-type memory includes a first partition and a second partition; and a memory controller configured to control the first partition and the second partition to execute in a simultaneous manner, wherein the first partition is a read only partition dedicated to high priority read content and second partition is a read and write partition, the program comprising executable logic to:
place high priority read content on the first partition; receiving a request for writing additional content on the first partition; writing the additional content to the second partition; and transferring the additional content to the first partition when a signal is received from the host electronic device to the memory control indicating that the host electronic device is in an idle state. | 2,100 |
4,608 | 13,755,767 | 2,162 | Methods and arrangements for gathering and managing crowd-sourced information. An event is identified using crowd-sourced information, and component parts of the event are identified using the crowd-sourced information. Information missing from the event is identified using the crowd-sourced information. Individuals associated with the event are identified, and additional crowd-sourced information on the event is harvested from the individuals. | 1. A method of gathering and managing crowd-sourced information, said method comprising:
receiving, at an electronic device, crowd-sourced information; and utilizing a processor to execute computer code configured to perform the steps of: identifying an event using the crowd-sourced information; identifying component parts of the event using the crowd-sourced information; identifying missing information from the event using the crowd-sourced information; and identifying individuals associated with the event, and harvesting from the individuals additional crowd-sourced information on the event. 2. The method according to claim 1, wherein said harvesting comprises sending directed questions to the individuals, the directed questions relating to the missing information. 3. The method according to claim 2, wherein said harvesting comprises receiving responses to the directed questions from the individuals. 4. The method according to claim 1, wherein said identifying of individuals comprises locating one or more individuals in proximity to the event. 5. The method according to claim 1, wherein said identifying of an event comprises classifying the event into a predefined class. 6. The method according to claim 5, wherein said identifying of an event comprises invoking a semantic model related to the predefined class. 7. The method according to claim 6, wherein said identifying of component parts comprises identifying event facets associated with the semantic model. 8. The method according to claim 7, wherein said identifying of missing information comprises identifying missing information associated with one or more event facets. 9. The method according to claim 8, wherein said harvesting comprises sending directed questions to the individuals, the directed questions relating to the missing information. 10. An apparatus for gathering and managing crowd-sourced information, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to identify an event using crowd-sourced information; computer readable program code configured to identify component parts of the event using the crowd-sourced information; computer readable program code configured to identify missing information from the event using the crowd-sourced information; computer readable program code configured to identify individuals associated with the event; and computer readable program code configured to harvest from the individuals additional crowd-sourced information on the event. 11. A computer program product for gathering and managing crowd-sourced information, said computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to identify an event using crowd-sourced information; computer readable program code configured to identify component parts of the event using the crowd-sourced information; computer readable program code configured to identify missing information from the event using the crowd-sourced information; computer readable program code configured to identify individuals associated with the event; and computer readable program code configured to harvest from the individuals additional crowd-sourced information on the event. 12. The computer program product according to claim 11, wherein said computer readable program code is configured to send directed questions to the individuals, the directed questions relating to the missing information. 13. The computer program product according to claim 12, wherein said computer readable program code is configured to receive responses to the directed questions from the individuals. 14. The computer program product according to claim 11, wherein said computer readable program code is configured to locate one or more individuals in proximity to the event. 15. The computer program product according to claim 11, wherein said computer readable program code is configured to classify the event into a predefined class. 16. The computer program product according to claim 15, wherein said computer readable program code is configured to invoke a semantic model related to the predefined class. 17. The computer program product according to claim 16, wherein said computer readable program code is configured to identify event facets associated with the semantic model. 18. The computer program product according to claim 17, wherein said computer readable program code is configured to identify missing information associated with one or more event facets. 19. The computer program product according to claim 18, wherein said computer readable program code is configured to send directed questions to the located individuals, the directed questions relating to the identified missing information. 20. A method comprising:
receiving messages; parsing the messages; after parsing the messages, designating an event class related to the messages; identifying component parts of the event class; for at least one message of the received messages, assigning at least a portion of the at least one message to a corresponding part of the event class; determining parts of the event class to which at least one portion of at least one message has not been assigned; identifying one or more actors associated with the event based on the received messages; and requesting information from the one or more actors corresponding to at least one of the parts of the event class to which at least one portion of at least one message has not been assigned. | Methods and arrangements for gathering and managing crowd-sourced information. An event is identified using crowd-sourced information, and component parts of the event are identified using the crowd-sourced information. Information missing from the event is identified using the crowd-sourced information. Individuals associated with the event are identified, and additional crowd-sourced information on the event is harvested from the individuals.1. A method of gathering and managing crowd-sourced information, said method comprising:
receiving, at an electronic device, crowd-sourced information; and utilizing a processor to execute computer code configured to perform the steps of: identifying an event using the crowd-sourced information; identifying component parts of the event using the crowd-sourced information; identifying missing information from the event using the crowd-sourced information; and identifying individuals associated with the event, and harvesting from the individuals additional crowd-sourced information on the event. 2. The method according to claim 1, wherein said harvesting comprises sending directed questions to the individuals, the directed questions relating to the missing information. 3. The method according to claim 2, wherein said harvesting comprises receiving responses to the directed questions from the individuals. 4. The method according to claim 1, wherein said identifying of individuals comprises locating one or more individuals in proximity to the event. 5. The method according to claim 1, wherein said identifying of an event comprises classifying the event into a predefined class. 6. The method according to claim 5, wherein said identifying of an event comprises invoking a semantic model related to the predefined class. 7. The method according to claim 6, wherein said identifying of component parts comprises identifying event facets associated with the semantic model. 8. The method according to claim 7, wherein said identifying of missing information comprises identifying missing information associated with one or more event facets. 9. The method according to claim 8, wherein said harvesting comprises sending directed questions to the individuals, the directed questions relating to the missing information. 10. An apparatus for gathering and managing crowd-sourced information, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to identify an event using crowd-sourced information; computer readable program code configured to identify component parts of the event using the crowd-sourced information; computer readable program code configured to identify missing information from the event using the crowd-sourced information; computer readable program code configured to identify individuals associated with the event; and computer readable program code configured to harvest from the individuals additional crowd-sourced information on the event. 11. A computer program product for gathering and managing crowd-sourced information, said computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to identify an event using crowd-sourced information; computer readable program code configured to identify component parts of the event using the crowd-sourced information; computer readable program code configured to identify missing information from the event using the crowd-sourced information; computer readable program code configured to identify individuals associated with the event; and computer readable program code configured to harvest from the individuals additional crowd-sourced information on the event. 12. The computer program product according to claim 11, wherein said computer readable program code is configured to send directed questions to the individuals, the directed questions relating to the missing information. 13. The computer program product according to claim 12, wherein said computer readable program code is configured to receive responses to the directed questions from the individuals. 14. The computer program product according to claim 11, wherein said computer readable program code is configured to locate one or more individuals in proximity to the event. 15. The computer program product according to claim 11, wherein said computer readable program code is configured to classify the event into a predefined class. 16. The computer program product according to claim 15, wherein said computer readable program code is configured to invoke a semantic model related to the predefined class. 17. The computer program product according to claim 16, wherein said computer readable program code is configured to identify event facets associated with the semantic model. 18. The computer program product according to claim 17, wherein said computer readable program code is configured to identify missing information associated with one or more event facets. 19. The computer program product according to claim 18, wherein said computer readable program code is configured to send directed questions to the located individuals, the directed questions relating to the identified missing information. 20. A method comprising:
receiving messages; parsing the messages; after parsing the messages, designating an event class related to the messages; identifying component parts of the event class; for at least one message of the received messages, assigning at least a portion of the at least one message to a corresponding part of the event class; determining parts of the event class to which at least one portion of at least one message has not been assigned; identifying one or more actors associated with the event based on the received messages; and requesting information from the one or more actors corresponding to at least one of the parts of the event class to which at least one portion of at least one message has not been assigned. | 2,100 |
4,609 | 15,191,162 | 2,161 | Disclosed is a feature for a vehicle that enables taking precautionary actions in response to conditions on the road network around or ahead of the vehicle, in particular, an intersection located at the bottom of a hill. A database that represents the road network is used to determine locations where an intersection of roads is located at the bottom of a hill and then, precautionary action data is added to the database to indicate such locations. A precautionary action system installed in a vehicle uses this database, or a database derived therefrom, in combination with a positioning system to take a precautionary action as the vehicle approaches such a location. | 1. A system comprising:
a positioning system that determines a current location relative to data representing a geographic region; and a precautionary action application stored in a non-transitory computer readable medium coupled with the positioning system and a database and responsive to the positioning system and the database, the database being adapted to contain data representing a geographic region in which the positioning system is being operated, wherein the data includes multiple data items that contain data that represents a road network in the geographic region, the precautionary action application being operative to determine whether, when combined, the features represented by the multiple data items constitute a hazardous condition, and upon a determination that the features represented by the multiple data items when combined constitute a hazardous condition, providing for taking a precautionary action when the positioning system determines that the current location is approaching or at a location of the features. 2. The system of claim 1 wherein one of the multiple data items comprises data representative of a hill bottom and the other of the multiple data items comprises data representative of an intersection at the hill bottom. 3. The system of claim 1 wherein one of the multiple data items further includes data that refers to the location of the actual intersection of roads located at the bottom of a hill. 4. The system of claim 1 wherein the database is located in the vehicle. 5. The system of claim 1 wherein the database is located remotely and accessed by vehicle systems in a vehicle. 6. The system of claim 1 wherein and the database is accessed using wireless communications. 7. The system of claim 1 wherein part of the database is located locally in the vehicle and part of the database is located remotely. 8. The system of claim 1 wherein the precautionary action application is further operative to determine a location along a road segment which precedes the location of the features at which a precautionary action is to be taken. 9. The system of claim 1 wherein the precautionary action application is further operative to determine a direction along a road segment at which a precautionary action is to be taken. 10. The system of claim 1 wherein the multiple data items are previously collected and present in the database. 11. The system of claim 10 wherein the existence of the hazardous combination of conditions is further determined based on a verification of the existence of the conditions of the hazardous combination of conditions. 12. The system of claim 1 wherein the precautionary action application is further responsive to dynamic information indicative of current conditions of the current location, the precautionary action application being further operative to modify the precautionary action based thereon. 13. A method comprising:
determining a current position in a geographic area; evaluating multiple data items already collected and present in a database that contains data that represents features of a road network in the geographic area; determining whether, when combined, the features represented by the multiple data items constitute a hazardous condition; and upon determining that the features represented by the multiple data items when combined constitute a hazardous condition, providing for taking a precautionary action when approaching a location of the features. 14. The method of claim 13 wherein the combination of the features represented by the multiple data items comprise an intersection of roads located at a bottom of a hill. 15. The method of claim 13 further comprising:
building an electronic horizon after accessing the database; and
using the electronic horizon to determine whether a precautionary action is to be taken. 16. The method of claim 13 wherein the precautionary action is provided via a user interface. 17. The method of claim 13 wherein the precautionary action comprises a warning provided to an operator at a first preceding location preceding the location associated with the features represented by the multiple data items, and readying a user for a quick deceleration or stop at a second preceding location preceding the location associated with the features represented by the multiple data items, the second preceding location being closer to the location associated with the features represented by the multiple data items then the first preceding location. 18. The method of claim 17 wherein the warning comprises an audible or visual warning. 19. The method of claim 17 wherein the readying further comprises tightening seatbelts or setting airbags to deploy. 20. The method of claim 13 wherein the database is located in a vehicle. 21. The method of claim 13 wherein the database is located remotely and accessed by a vehicle system in a vehicle. 22. The method of claim 13 further comprising:
responding to dynamic information indicative of current conditions of the current location; and
modifying the precautionary action based thereon. 23. The method of claim 22 further comprising:
modifying a location at which the precautionary action is taken based on the dynamic information. 24. The method of claim 22 wherein the dynamic information comprises current traffic or weather conditions. 25. A method comprising:
adapting a database that contains multiple data items already collected and present in a database that contains data that represents features of a road network in the geographic area, identifying, based solely on the already collected data, when combined, the features represented by the multiple data items constitute a hazardous condition, and augmenting the database to include precautionary action data associated with the identified multiple data items, the precautionary action data operative to indicate a potentially hazardous location at which a precautionary action is to be taken when approaching; determining a current location; accessing the database based on the current location to identify multiple data items associated with one or more locations being approached from the current location and determine if any of the identified multiple data items are associated with precautionary action data; and upon determining that the features represented by the identified multiple data items are associated with precautionary action data, providing for taking a precautionary action when approaching a location of the features. 26. The method of claim 25 wherein the precautionary action comprises a providing a warning at a first preceding location preceding the location associated with the precautionary action data, and readying for a quick deceleration or stop at a second preceding location preceding the location associated with the precautionary action data, the second preceding location being closer to the location associated with the precautionary action data then the first preceding location. 27. The method of claim 25 further comprising:
using dynamic information to determine the precautionary action to take the location associated with precautionary action data is approached. 28. The method of claim 25 wherein the database is located in a vehicle. 29. The method of claim 25 wherein the database is located remotely and accessed by a vehicle system in a vehicle. 30. The method of claim 25 wherein part of the database is located locally in a vehicle and part of the database is located remotely. | Disclosed is a feature for a vehicle that enables taking precautionary actions in response to conditions on the road network around or ahead of the vehicle, in particular, an intersection located at the bottom of a hill. A database that represents the road network is used to determine locations where an intersection of roads is located at the bottom of a hill and then, precautionary action data is added to the database to indicate such locations. A precautionary action system installed in a vehicle uses this database, or a database derived therefrom, in combination with a positioning system to take a precautionary action as the vehicle approaches such a location.1. A system comprising:
a positioning system that determines a current location relative to data representing a geographic region; and a precautionary action application stored in a non-transitory computer readable medium coupled with the positioning system and a database and responsive to the positioning system and the database, the database being adapted to contain data representing a geographic region in which the positioning system is being operated, wherein the data includes multiple data items that contain data that represents a road network in the geographic region, the precautionary action application being operative to determine whether, when combined, the features represented by the multiple data items constitute a hazardous condition, and upon a determination that the features represented by the multiple data items when combined constitute a hazardous condition, providing for taking a precautionary action when the positioning system determines that the current location is approaching or at a location of the features. 2. The system of claim 1 wherein one of the multiple data items comprises data representative of a hill bottom and the other of the multiple data items comprises data representative of an intersection at the hill bottom. 3. The system of claim 1 wherein one of the multiple data items further includes data that refers to the location of the actual intersection of roads located at the bottom of a hill. 4. The system of claim 1 wherein the database is located in the vehicle. 5. The system of claim 1 wherein the database is located remotely and accessed by vehicle systems in a vehicle. 6. The system of claim 1 wherein and the database is accessed using wireless communications. 7. The system of claim 1 wherein part of the database is located locally in the vehicle and part of the database is located remotely. 8. The system of claim 1 wherein the precautionary action application is further operative to determine a location along a road segment which precedes the location of the features at which a precautionary action is to be taken. 9. The system of claim 1 wherein the precautionary action application is further operative to determine a direction along a road segment at which a precautionary action is to be taken. 10. The system of claim 1 wherein the multiple data items are previously collected and present in the database. 11. The system of claim 10 wherein the existence of the hazardous combination of conditions is further determined based on a verification of the existence of the conditions of the hazardous combination of conditions. 12. The system of claim 1 wherein the precautionary action application is further responsive to dynamic information indicative of current conditions of the current location, the precautionary action application being further operative to modify the precautionary action based thereon. 13. A method comprising:
determining a current position in a geographic area; evaluating multiple data items already collected and present in a database that contains data that represents features of a road network in the geographic area; determining whether, when combined, the features represented by the multiple data items constitute a hazardous condition; and upon determining that the features represented by the multiple data items when combined constitute a hazardous condition, providing for taking a precautionary action when approaching a location of the features. 14. The method of claim 13 wherein the combination of the features represented by the multiple data items comprise an intersection of roads located at a bottom of a hill. 15. The method of claim 13 further comprising:
building an electronic horizon after accessing the database; and
using the electronic horizon to determine whether a precautionary action is to be taken. 16. The method of claim 13 wherein the precautionary action is provided via a user interface. 17. The method of claim 13 wherein the precautionary action comprises a warning provided to an operator at a first preceding location preceding the location associated with the features represented by the multiple data items, and readying a user for a quick deceleration or stop at a second preceding location preceding the location associated with the features represented by the multiple data items, the second preceding location being closer to the location associated with the features represented by the multiple data items then the first preceding location. 18. The method of claim 17 wherein the warning comprises an audible or visual warning. 19. The method of claim 17 wherein the readying further comprises tightening seatbelts or setting airbags to deploy. 20. The method of claim 13 wherein the database is located in a vehicle. 21. The method of claim 13 wherein the database is located remotely and accessed by a vehicle system in a vehicle. 22. The method of claim 13 further comprising:
responding to dynamic information indicative of current conditions of the current location; and
modifying the precautionary action based thereon. 23. The method of claim 22 further comprising:
modifying a location at which the precautionary action is taken based on the dynamic information. 24. The method of claim 22 wherein the dynamic information comprises current traffic or weather conditions. 25. A method comprising:
adapting a database that contains multiple data items already collected and present in a database that contains data that represents features of a road network in the geographic area, identifying, based solely on the already collected data, when combined, the features represented by the multiple data items constitute a hazardous condition, and augmenting the database to include precautionary action data associated with the identified multiple data items, the precautionary action data operative to indicate a potentially hazardous location at which a precautionary action is to be taken when approaching; determining a current location; accessing the database based on the current location to identify multiple data items associated with one or more locations being approached from the current location and determine if any of the identified multiple data items are associated with precautionary action data; and upon determining that the features represented by the identified multiple data items are associated with precautionary action data, providing for taking a precautionary action when approaching a location of the features. 26. The method of claim 25 wherein the precautionary action comprises a providing a warning at a first preceding location preceding the location associated with the precautionary action data, and readying for a quick deceleration or stop at a second preceding location preceding the location associated with the precautionary action data, the second preceding location being closer to the location associated with the precautionary action data then the first preceding location. 27. The method of claim 25 further comprising:
using dynamic information to determine the precautionary action to take the location associated with precautionary action data is approached. 28. The method of claim 25 wherein the database is located in a vehicle. 29. The method of claim 25 wherein the database is located remotely and accessed by a vehicle system in a vehicle. 30. The method of claim 25 wherein part of the database is located locally in a vehicle and part of the database is located remotely. | 2,100 |
4,610 | 14,595,780 | 2,187 | An apparatus and method control booting in a mobile device with a built-in communication module to prevent a service user from using the mobile device for other purposes and to prevent the service user from subscribing to another service provider. A method includes determining, during a booting operation, whether the communication module is mounted with a USIM. A forced booting termination message is displayed if the communication module is not mounted with the USIM. And power supply is interrupted after a predetermined time from displaying the forced booting termination message. | 1. A method for controlling booting in a mobile device with a built-in communication module, the method comprising:
determining, during a booting operation, whether the communication module is mounted with a universal subscriber identity module (USIM); displaying a forced booting termination message in response to determining the communication module is not mounted with the USIM; and interrupting a power supply after a predetermined time from displaying the forced booting termination message. 2. The method of claim 1, further comprising:
completing the booting operation and driving the corresponding operating program normally, in response to determining the communication module is mounted with the USIM. 3. The method of claim 1, wherein the communication module is a high speed packet access (HSPA) module. 4. The method of claim 1, wherein determining whether the communication module is mounted with a USIM comprises:
transmitting an attention (AT) command from a processor to the communication module; and transmitting a response from the communication module to the processor in response to the AT command. 5. The method of claim 1, wherein determining whether the communication module is mounted with the USIM is performed during a Power-On Self Test. 6. A method for controlling booting in a mobile device, the method comprising:
determining, during a booting operation, whether the mobile device is mounted with a communication module and a universal subscriber identity module (USIM); displaying a forced booting termination message in response to determining the mobile device is not mounted with the communication module and the USIM; and interrupting a power supply after a predetermined time from displaying the forced booting termination message. 7. The method of claim 6, further comprising:
completing the booting operation and driving the corresponding operating program normally, in response to determining the mobile device is mounted with the communication module and the USIM. 8. The method of claim 7, wherein the communication module is a high speed packet access (HSPA) module. 9. The method of claim 7, wherein determining whether the mobile device is mounted with a communication module and a USIM comprises:
transmitting an attention (AT) command from a processor to the communication module and the USIM; and transmitting a response from the communication module and the USIM to the processor in response to the AT command. 10. The method of claim 6, wherein determining whether the mobile device is mounted with the communication module and the USIM is performed during a Power-On Self Test. 11. An apparatus for controlling booting in a mobile device with a built-in communication module, the apparatus comprising:
a processor configured to determine, during a booting operation, whether the communication module is mounted with a universal subscriber identity module (USIM), display a forced booting termination message in response to determining the communication module is not mounted with the USIM, and interrupt a power supply after a predetermined time from the displaying of the forced booting termination message. 12. The apparatus of claim 11, wherein in response to determining the communication module is mounted with the USIM, the processor completes the booting operation and drives the corresponding operating program normally. 13. The apparatus of claim 11, wherein the communication module is a high speed packet access (HSPA) module. 14. The apparatus of claim 11, wherein the processor transmits an AT command to the communication module and receives a response from the communication module in response to the attention (AT) command, to determine whether the communication module is mounted with the USIM. 15. The apparatus of claim 11, wherein the processor determines whether the communication module is mounted with the USIM during a Power-On Self Test. 16. An apparatus for controlling booting in a mobile device, the apparatus comprising:
a processor configured to determine, during a booting operation, whether the mobile device is mounted with a communication module and a universal subscriber identity module (USIM), display a forced booting termination message in response to determining the mobile device is not mounted with the communication module and the USIM, and interrupt a power supply after a predetermined time from displaying the forced booting termination message. 17. The apparatus of claim 16, wherein in response to determining the mobile device is mounted with the communication module and the USIM, the processor completes the booting operation and drives the corresponding operating program normally. 18. The apparatus of claim 16, wherein the communication module is a high speed packet access (HSPA) module. 19. The apparatus of claim 16, wherein the processor transmits an attention (AT) command to the communication module and the USIM and receives a response from the communication module and the USIM in response to the AT command, to determine whether the mobile device is mounted with the communication module and the USIM. 20. The apparatus of claim 16, wherein the processor determines whether the mobile device is mounted with the communication module and the USIM during a Power-On Self Test. | An apparatus and method control booting in a mobile device with a built-in communication module to prevent a service user from using the mobile device for other purposes and to prevent the service user from subscribing to another service provider. A method includes determining, during a booting operation, whether the communication module is mounted with a USIM. A forced booting termination message is displayed if the communication module is not mounted with the USIM. And power supply is interrupted after a predetermined time from displaying the forced booting termination message.1. A method for controlling booting in a mobile device with a built-in communication module, the method comprising:
determining, during a booting operation, whether the communication module is mounted with a universal subscriber identity module (USIM); displaying a forced booting termination message in response to determining the communication module is not mounted with the USIM; and interrupting a power supply after a predetermined time from displaying the forced booting termination message. 2. The method of claim 1, further comprising:
completing the booting operation and driving the corresponding operating program normally, in response to determining the communication module is mounted with the USIM. 3. The method of claim 1, wherein the communication module is a high speed packet access (HSPA) module. 4. The method of claim 1, wherein determining whether the communication module is mounted with a USIM comprises:
transmitting an attention (AT) command from a processor to the communication module; and transmitting a response from the communication module to the processor in response to the AT command. 5. The method of claim 1, wherein determining whether the communication module is mounted with the USIM is performed during a Power-On Self Test. 6. A method for controlling booting in a mobile device, the method comprising:
determining, during a booting operation, whether the mobile device is mounted with a communication module and a universal subscriber identity module (USIM); displaying a forced booting termination message in response to determining the mobile device is not mounted with the communication module and the USIM; and interrupting a power supply after a predetermined time from displaying the forced booting termination message. 7. The method of claim 6, further comprising:
completing the booting operation and driving the corresponding operating program normally, in response to determining the mobile device is mounted with the communication module and the USIM. 8. The method of claim 7, wherein the communication module is a high speed packet access (HSPA) module. 9. The method of claim 7, wherein determining whether the mobile device is mounted with a communication module and a USIM comprises:
transmitting an attention (AT) command from a processor to the communication module and the USIM; and transmitting a response from the communication module and the USIM to the processor in response to the AT command. 10. The method of claim 6, wherein determining whether the mobile device is mounted with the communication module and the USIM is performed during a Power-On Self Test. 11. An apparatus for controlling booting in a mobile device with a built-in communication module, the apparatus comprising:
a processor configured to determine, during a booting operation, whether the communication module is mounted with a universal subscriber identity module (USIM), display a forced booting termination message in response to determining the communication module is not mounted with the USIM, and interrupt a power supply after a predetermined time from the displaying of the forced booting termination message. 12. The apparatus of claim 11, wherein in response to determining the communication module is mounted with the USIM, the processor completes the booting operation and drives the corresponding operating program normally. 13. The apparatus of claim 11, wherein the communication module is a high speed packet access (HSPA) module. 14. The apparatus of claim 11, wherein the processor transmits an AT command to the communication module and receives a response from the communication module in response to the attention (AT) command, to determine whether the communication module is mounted with the USIM. 15. The apparatus of claim 11, wherein the processor determines whether the communication module is mounted with the USIM during a Power-On Self Test. 16. An apparatus for controlling booting in a mobile device, the apparatus comprising:
a processor configured to determine, during a booting operation, whether the mobile device is mounted with a communication module and a universal subscriber identity module (USIM), display a forced booting termination message in response to determining the mobile device is not mounted with the communication module and the USIM, and interrupt a power supply after a predetermined time from displaying the forced booting termination message. 17. The apparatus of claim 16, wherein in response to determining the mobile device is mounted with the communication module and the USIM, the processor completes the booting operation and drives the corresponding operating program normally. 18. The apparatus of claim 16, wherein the communication module is a high speed packet access (HSPA) module. 19. The apparatus of claim 16, wherein the processor transmits an attention (AT) command to the communication module and the USIM and receives a response from the communication module and the USIM in response to the AT command, to determine whether the mobile device is mounted with the communication module and the USIM. 20. The apparatus of claim 16, wherein the processor determines whether the mobile device is mounted with the communication module and the USIM during a Power-On Self Test. | 2,100 |
4,611 | 13,890,030 | 2,157 | Methods are presented suitable for clustering computational event logs ( 2 ) including a method for calculating a metric distance between characters of different event messages ( 4 ) by comparing both characters to a comparative set of characters. Methods are presented for calculating a metric distance between two event messages ( 4 ) comprising determining character metric distances between characters in the compared words and word metric distances between the words in the compared events ( 4 ), Methods are presented for creating an area ( 8 ) in metric space corresponding to a new cluster ( 6 ) when a further event message ( 26 ) is found in an overlap region ( 24 ) of existing clusters ( 6, 8 ). Methods are presented in populating and constructing an event table. | 1. A method of determining a metric distance in a metric space between:
I) a first character associated with a first computational event message; II) a second character associated with a second computational event message; comprising the steps of: III) comparing both the first and second characters to a comparative set of characters; IV) outputting a first predefined metric distance when both of the first and second characters comprises a character from the said comparative set. 2. A method as claimed in claim 1 further comprising the steps of:
I) comparing the first character with the second character; and,
II) outputting a fundamental predefined metric distance if the first and second characters are identical. 3. A method as claimed in claim 2 further comprising the steps of:
I) comparing the first character with the second character; and,
II) outputting a second predefined metric distance if:
A) the first and second characters are non-identical; and,
B) at least one of the first or second characters does not comprise a character from the set. 4. A method as claimed in claim 3 wherein the step of outputting a second predefined metric distance comprises:
I) outputting a first value for the second predefined metric distance if:
A) the first character comprises a character from the said comparative set; and,
B) the second character does not comprise a character from the said comparative set; or
II) outputting a second value for the second predefined metric distance if:
C) the first character does not comprises a character from the said comparative set; and,
D) the second character comprises a character from the said comparative set; or
III) outputting a third value for the second predefined metric distance if:
E) the first character does not comprises a character from the said comparative set; and,
F) the second character does not comprises a character from the said comparative set. 5-8. (canceled) 9. A method as claimed in claim 3 wherein the second predefined metric distance is greater than the first predefined metric distance. 10. (canceled) 11. A method as claimed in claim 4 wherein the first and second values of the second predefined metric distance are non-identical. 12. A method as claimed in claim 4 wherein the third value of the second predefined metric distance is greater than both the first and second values of the second predefined metric distance. 13. A method as claimed in claim 4 wherein the numerical difference between the first and second values of the second predefined metric distance is smaller than the numerical difference between any of:
I) the first and third values of the second predefined metric distance; or,
II) the second and third values of the second predefined metric distance. 14. A method as claimed in claim 4 wherein the numerical difference between the first and fundamental metric distances is smaller than any of:
I) the numerical difference between the first value of the second predefined metric distance and the first predefined metric distance; or,
II) the numerical difference between the second value of the second predefined metric distance and the first predefined metric distance; or,
IV) the numerical difference between third value of the second predefined metric distance and the first predefined metric distance. 15. A method as claimed in claim 1 wherein the step of outputting a first predefined metric distance further comprises the steps of:
I) comparing the first character with the second character; and,
II) outputting the first predefined metric distance if the first and second characters are different. 16.-24. (canceled) 25. A method as claimed in claim 1 wherein the comparative set of characters comprises hexadecimal characters. 26.-28. (canceled) 29. A method of calculating a distance in metric space between computational event messages comprising the steps of:
I) providing a first event message associated with a first event log; the first event message comprising a first word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters; II) providing a second event message associated with a second event log; the second event message comprising a second word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters; III) determining, in sequence, for each word in the first word sequence that corresponds to a word in the second word sequence, a word metric distance between said words by:
A) determining, in sequence, for each character in the said word of the first sequence that corresponds to a character in the said word in the second word sequence, a character metric distance between the said characters;
B) summing the said character metric distances;
IV) summing the said word metric distances. 30. A method as claimed in claim 29 wherein the steps of:
I) providing the first event message, further comprises the steps of:
A) providing a first event log comprising the first event message;
B) extracting the first event message from the first event log;
II) providing the second event message, further comprises the steps of:
C) providing a second event log comprising the second event message;
D) extracting the second event message from the second event log. 31. (canceled) 32. A method as claimed in claim 29 further comprising the steps of:
I) comparing the number of words in the first event message to the number of words in the second event message;
II) increasing the metric distance between the said event messages if one of the said event messages comprises a greater number of words than the other event message. 33. A method as claimed in claim 32 wherein increasing the metric distance between the said event messages further comprises the steps of:
I) determining the longest event message comprising the greatest number of words;
II) determining a set of words comprising, in sequence, the words of the longest event message that are in excess of the other event message;
III) increasing the metric distance between the said event messages by a value associated with the said number of excess words. 34. A method as claimed in claim 33 wherein increasing the metric distance between the said event messages further comprises the steps of:
I) determining a set of words, comprising, in sequence, the words in the longest message in excess of the last word in the word sequence of the other event message;
II) determining, for each word in the set, a word weight value associated with the number of characters in the said word;
III) summing the word weight values;
V) increasing the metric distance between the said event messages by the sum of the word weight values. 35. A method as claimed in claim 29, wherein determining a word metric distance between said words further comprises the steps of:
I) comparing the number of characters in the said word of the first word sequence to the number of characters in the said word of the second word sequence; and, II) increasing the word metric distance if one of the said words comprises a greater number of characters than the other said word. 36. A method as claimed in claim 35, wherein increasing the word metric distance further comprises the steps of:
I) determining a character weight value associated with the difference between the number of characters in the said word of the first sequence to the number of characters in the said word of the second sequence; II) increasing the word metric distance by the character weight value. 37. A method as claimed in claim 36, wherein determining the character weight value comprises the steps of:
I) determining a difference value by subtracting the number of characters in the said word of the first word sequence to the number of characters in the said word of the second word sequence; II) taking the modulus of the difference value. 38. A method as claimed in claim 29 wherein determining the character metric distance between the said characters comprises determining a metric distance in a metric space between:
I) a first character associated with a first computational event message;
II) a second character associated with a second computational event message; comprising the steps of:
III) comparing both the first and second characters to a comparative set of characters;
IV) outputting a first predefined metric distance when both of the first and second characters comprises a character from the said comparative set. 39. (canceled) 40. A method of defining an area in metric space for clustering computational event messages, comprising the steps of:
i) providing a first plurality of defined areas in metric space: wherein:
A) each area comprises at least one of a first plurality of event messages; and,
B) each of the said first plurality of event messages is located within one of the plurality of defined areas;
ii) providing an overlap region in metric space wherein at least two of the said plurality of defined areas partially overlap; iii) determining whether a further event message is located in the overlap region in metric space; iv) creating a further defined area in metric space comprising:
C) the further event message; and,
D) the event messages comprised within the at least two partially overlapping areas. 41. A method as claimed in claim 40 wherein each of the said first plurality of defined areas comprises:
I) a metric ball in metric space;
II) a radius, defining the ball, extending from a central event message;
wherein the central event message is one of the first plurality of event messages. 42. A method as claimed in claim 41 wherein the step of creating the further area in metric space further comprises the steps of:
I) providing a distance in metric space, for each of the first plurality of defined areas, between:
A) the further event message; and,
B) the said central event message of the defined area;
II) comparing each metric distance for each defined area to the respective radius for the defined area;
III) determining that the further event message is within the overlap region when the metric distance, for the at least two overlapping areas, is smaller than the respective radius;
IV) creating the further defined area in metric space upon the said determination. 43. A method as claimed in claim 42 wherein determining that the further event message is within the overlap region comprises determining when the metric distance, for the at least two overlapping areas is smaller than or equal to the respective radius. 44. A method as claimed in claim 43 further comprising:
I) assigning the further event message as the further central event message for the further area;
II) providing a further radius for the further area;
III) creating a circular further event area defined by the said further radius extending from the said further central event message. 45. A method as claimed in claim 44 wherein providing the further radius comprises the steps of:
I) calculating, for each of the overlapping areas, a summation value of:
A) the radius for that area; and,
B) the respective distance between the further event message and the central event message for the said area;
II) selecting the largest summation value;
III) providing the further radius based on the said selected summation value. 46. (canceled) 47. A method as claimed in claim 42 wherein the distances between the further event message and the central event messages are determined by calculating a distance in metric space between computational event messages comprising the steps of:
I) providing a first event message associated with a first event log; the first event message comprising a first word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters;
II) providing a second event message associated with a second event log; the second event message comprising a second word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters;
III) determining, in sequence, for each word in the first word sequence that corresponds to a word in the second word sequence, a word metric distance between said words by:
A) determining, in sequence, for each character in the said word of the first sequence that corresponds to a character in the said word in the second word sequence, a character metric distance between the said characters;
B) summing the said character metric distances;
IV) summing the said word metric distances. 48. A method as claimed in claim 47 further comprising providing the step of creating a record comprising the defined areas. 49. A method as claimed in claim 48 further comprising deleting, from the record, the areas associated with the said overlap region upon determining that the further event message is within the overlap region. 50. A method as claimed in claim 49 wherein the record is a table. 51.-64. (canceled) | Methods are presented suitable for clustering computational event logs ( 2 ) including a method for calculating a metric distance between characters of different event messages ( 4 ) by comparing both characters to a comparative set of characters. Methods are presented for calculating a metric distance between two event messages ( 4 ) comprising determining character metric distances between characters in the compared words and word metric distances between the words in the compared events ( 4 ), Methods are presented for creating an area ( 8 ) in metric space corresponding to a new cluster ( 6 ) when a further event message ( 26 ) is found in an overlap region ( 24 ) of existing clusters ( 6, 8 ). Methods are presented in populating and constructing an event table.1. A method of determining a metric distance in a metric space between:
I) a first character associated with a first computational event message; II) a second character associated with a second computational event message; comprising the steps of: III) comparing both the first and second characters to a comparative set of characters; IV) outputting a first predefined metric distance when both of the first and second characters comprises a character from the said comparative set. 2. A method as claimed in claim 1 further comprising the steps of:
I) comparing the first character with the second character; and,
II) outputting a fundamental predefined metric distance if the first and second characters are identical. 3. A method as claimed in claim 2 further comprising the steps of:
I) comparing the first character with the second character; and,
II) outputting a second predefined metric distance if:
A) the first and second characters are non-identical; and,
B) at least one of the first or second characters does not comprise a character from the set. 4. A method as claimed in claim 3 wherein the step of outputting a second predefined metric distance comprises:
I) outputting a first value for the second predefined metric distance if:
A) the first character comprises a character from the said comparative set; and,
B) the second character does not comprise a character from the said comparative set; or
II) outputting a second value for the second predefined metric distance if:
C) the first character does not comprises a character from the said comparative set; and,
D) the second character comprises a character from the said comparative set; or
III) outputting a third value for the second predefined metric distance if:
E) the first character does not comprises a character from the said comparative set; and,
F) the second character does not comprises a character from the said comparative set. 5-8. (canceled) 9. A method as claimed in claim 3 wherein the second predefined metric distance is greater than the first predefined metric distance. 10. (canceled) 11. A method as claimed in claim 4 wherein the first and second values of the second predefined metric distance are non-identical. 12. A method as claimed in claim 4 wherein the third value of the second predefined metric distance is greater than both the first and second values of the second predefined metric distance. 13. A method as claimed in claim 4 wherein the numerical difference between the first and second values of the second predefined metric distance is smaller than the numerical difference between any of:
I) the first and third values of the second predefined metric distance; or,
II) the second and third values of the second predefined metric distance. 14. A method as claimed in claim 4 wherein the numerical difference between the first and fundamental metric distances is smaller than any of:
I) the numerical difference between the first value of the second predefined metric distance and the first predefined metric distance; or,
II) the numerical difference between the second value of the second predefined metric distance and the first predefined metric distance; or,
IV) the numerical difference between third value of the second predefined metric distance and the first predefined metric distance. 15. A method as claimed in claim 1 wherein the step of outputting a first predefined metric distance further comprises the steps of:
I) comparing the first character with the second character; and,
II) outputting the first predefined metric distance if the first and second characters are different. 16.-24. (canceled) 25. A method as claimed in claim 1 wherein the comparative set of characters comprises hexadecimal characters. 26.-28. (canceled) 29. A method of calculating a distance in metric space between computational event messages comprising the steps of:
I) providing a first event message associated with a first event log; the first event message comprising a first word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters; II) providing a second event message associated with a second event log; the second event message comprising a second word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters; III) determining, in sequence, for each word in the first word sequence that corresponds to a word in the second word sequence, a word metric distance between said words by:
A) determining, in sequence, for each character in the said word of the first sequence that corresponds to a character in the said word in the second word sequence, a character metric distance between the said characters;
B) summing the said character metric distances;
IV) summing the said word metric distances. 30. A method as claimed in claim 29 wherein the steps of:
I) providing the first event message, further comprises the steps of:
A) providing a first event log comprising the first event message;
B) extracting the first event message from the first event log;
II) providing the second event message, further comprises the steps of:
C) providing a second event log comprising the second event message;
D) extracting the second event message from the second event log. 31. (canceled) 32. A method as claimed in claim 29 further comprising the steps of:
I) comparing the number of words in the first event message to the number of words in the second event message;
II) increasing the metric distance between the said event messages if one of the said event messages comprises a greater number of words than the other event message. 33. A method as claimed in claim 32 wherein increasing the metric distance between the said event messages further comprises the steps of:
I) determining the longest event message comprising the greatest number of words;
II) determining a set of words comprising, in sequence, the words of the longest event message that are in excess of the other event message;
III) increasing the metric distance between the said event messages by a value associated with the said number of excess words. 34. A method as claimed in claim 33 wherein increasing the metric distance between the said event messages further comprises the steps of:
I) determining a set of words, comprising, in sequence, the words in the longest message in excess of the last word in the word sequence of the other event message;
II) determining, for each word in the set, a word weight value associated with the number of characters in the said word;
III) summing the word weight values;
V) increasing the metric distance between the said event messages by the sum of the word weight values. 35. A method as claimed in claim 29, wherein determining a word metric distance between said words further comprises the steps of:
I) comparing the number of characters in the said word of the first word sequence to the number of characters in the said word of the second word sequence; and, II) increasing the word metric distance if one of the said words comprises a greater number of characters than the other said word. 36. A method as claimed in claim 35, wherein increasing the word metric distance further comprises the steps of:
I) determining a character weight value associated with the difference between the number of characters in the said word of the first sequence to the number of characters in the said word of the second sequence; II) increasing the word metric distance by the character weight value. 37. A method as claimed in claim 36, wherein determining the character weight value comprises the steps of:
I) determining a difference value by subtracting the number of characters in the said word of the first word sequence to the number of characters in the said word of the second word sequence; II) taking the modulus of the difference value. 38. A method as claimed in claim 29 wherein determining the character metric distance between the said characters comprises determining a metric distance in a metric space between:
I) a first character associated with a first computational event message;
II) a second character associated with a second computational event message; comprising the steps of:
III) comparing both the first and second characters to a comparative set of characters;
IV) outputting a first predefined metric distance when both of the first and second characters comprises a character from the said comparative set. 39. (canceled) 40. A method of defining an area in metric space for clustering computational event messages, comprising the steps of:
i) providing a first plurality of defined areas in metric space: wherein:
A) each area comprises at least one of a first plurality of event messages; and,
B) each of the said first plurality of event messages is located within one of the plurality of defined areas;
ii) providing an overlap region in metric space wherein at least two of the said plurality of defined areas partially overlap; iii) determining whether a further event message is located in the overlap region in metric space; iv) creating a further defined area in metric space comprising:
C) the further event message; and,
D) the event messages comprised within the at least two partially overlapping areas. 41. A method as claimed in claim 40 wherein each of the said first plurality of defined areas comprises:
I) a metric ball in metric space;
II) a radius, defining the ball, extending from a central event message;
wherein the central event message is one of the first plurality of event messages. 42. A method as claimed in claim 41 wherein the step of creating the further area in metric space further comprises the steps of:
I) providing a distance in metric space, for each of the first plurality of defined areas, between:
A) the further event message; and,
B) the said central event message of the defined area;
II) comparing each metric distance for each defined area to the respective radius for the defined area;
III) determining that the further event message is within the overlap region when the metric distance, for the at least two overlapping areas, is smaller than the respective radius;
IV) creating the further defined area in metric space upon the said determination. 43. A method as claimed in claim 42 wherein determining that the further event message is within the overlap region comprises determining when the metric distance, for the at least two overlapping areas is smaller than or equal to the respective radius. 44. A method as claimed in claim 43 further comprising:
I) assigning the further event message as the further central event message for the further area;
II) providing a further radius for the further area;
III) creating a circular further event area defined by the said further radius extending from the said further central event message. 45. A method as claimed in claim 44 wherein providing the further radius comprises the steps of:
I) calculating, for each of the overlapping areas, a summation value of:
A) the radius for that area; and,
B) the respective distance between the further event message and the central event message for the said area;
II) selecting the largest summation value;
III) providing the further radius based on the said selected summation value. 46. (canceled) 47. A method as claimed in claim 42 wherein the distances between the further event message and the central event messages are determined by calculating a distance in metric space between computational event messages comprising the steps of:
I) providing a first event message associated with a first event log; the first event message comprising a first word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters;
II) providing a second event message associated with a second event log; the second event message comprising a second word sequence of one or more computational words; wherein each of said one or more computational words comprises a sequence of one or more characters;
III) determining, in sequence, for each word in the first word sequence that corresponds to a word in the second word sequence, a word metric distance between said words by:
A) determining, in sequence, for each character in the said word of the first sequence that corresponds to a character in the said word in the second word sequence, a character metric distance between the said characters;
B) summing the said character metric distances;
IV) summing the said word metric distances. 48. A method as claimed in claim 47 further comprising providing the step of creating a record comprising the defined areas. 49. A method as claimed in claim 48 further comprising deleting, from the record, the areas associated with the said overlap region upon determining that the further event message is within the overlap region. 50. A method as claimed in claim 49 wherein the record is a table. 51.-64. (canceled) | 2,100 |
4,612 | 13,611,533 | 2,132 | A method begins by a dispersed storage (DS) processing module receiving a request to copy a data object in a dispersed storage network (DSN). The method continues with the DS processing module identifying one or more sets of at least a decode threshold number of slice names for one or more sets of encoded data slices of the data object and generating one or more sets of at least a decode threshold of new slice names. The method continues with the DS processing module sending the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN and instructing the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object. | 1. A method for copying a data object in a dispersed storage network (DSN) without replication, the method comprises:
receiving a request to copy the data object, wherein the data object is stored in the DSN as a one or more sets of encoded data slices based on a dispersed storage error coding function; and in response to the request to copy the data object:
identifying one or more sets of at least a decode threshold number of slice names for the one or more sets of encoded data slices;
generating one or more sets of at least a decode threshold of new slice names for the one or more sets of encoded data slices;
sending the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN for storage therein; and
instructing the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object. 2. The method of claim 1, wherein the request to copy comprises at least one of:
a snapshot request; a component of a duplication request; and a component of a backup request. 3. The method of claim 1, wherein the generating the one or more sets of at least a decode threshold of new slice names comprises:
generating the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 4. The method of claim 1, wherein the generating the one or more sets of at least a decode threshold of new slice names comprises:
sending a request to generate the one or more sets of new slices names to the storage nodes, wherein:
a first storage node of the storage nodes generates a first slice name for each of the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function; and
a second storage node of the storage nodes generates a second slice name for each of the one or more set of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 5. The method of claim 1, wherein the instructing to link comprises:
instructing a first storage node of the storage nodes updating a first slice location table to link a first new slice name of the one or more sets of at least a decode threshold of new slice names to a first slice name of the one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to link a second new slice name of the one or more sets of at least a decode threshold of new slice names to a second slice name of the one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 6. A method comprises:
receiving a request to update a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function, and wherein the one or more sets of encoded data slices is identified by a first one or more sets of at least a decode threshold of slice names and a second one or more sets of at least a decode threshold of slice names; selecting the first or the second one or more sets of at least a decode threshold of slice names for the update to the data object to produce a selected one or more sets of at least a decode threshold of slice names; sending one or more sets of updated encoded data slices regarding the update to the data object to storage nodes of the DSN, wherein the storage nodes store the one or more sets of updated encoded data slices in new storage locations addressable based on the selected one or more sets of at least a decode threshold of slice names; and instructing the storage nodes to unlink the selected one or more sets of at least a decode threshold of slice names from the one or more sets of encoded data slices. 7. The method of claim 6 further comprises:
generating the one or more sets of updated encoded data slices regarding the update to the data object in accordance with a dispersed storage error coding function; and
sending write requests to the storage nodes for storing the one or more sets of updated encoded data slices. 8. The method of claim 6, wherein the instructing the unlinking comprises:
instructing a first storage node of the storage nodes updating a first slice location table to unlink a first slice name of the first one or more sets of at least a decode threshold of slice names from a first slice name of the second one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to unlink a second slice name of the first one or more sets of at least a decode threshold of new slice names from a second slice name of the second one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 9. The method of claim 6, wherein the selecting the first or the second one or more sets of at least a decode threshold of slice names comprises at least one of:
selecting the first or the second one or more sets of at least a decode threshold of slice names based on the request for updating; selecting the first or the second one or more sets of at least a decode threshold of slice names based on chronological creation of the first and the second one or more sets of at least a decode threshold of slice names; and selecting the first or the second one or more sets of at least a decode threshold of slice names based on a snapshot procedure. 10. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request to copy a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function;
a second module, when operable within the computing device, in response to the request to copy the data object, causes the computing device to:
identify one or more sets of at least a decode threshold number of slice names for the one or more sets of encoded data slices;
a third module, when operable within the computing device, causes the computing device to:
generate one or more sets of at least a decode threshold of new slice names for the one or more sets of encoded data slices; and
a fourth module, when operable within the computing device, causes the computing device to:
send the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN for storage therein; and
instruct the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object. 11. The DS module of claim 10, wherein the request to copy comprises at least one of:
a snapshot request; a component of a duplication request; and a component of a backup request. 12. The DS module of claim 10, wherein the third module functions to generate the one or more sets of at least a decode threshold of new slice names by:
generating the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 13. The DS module of claim 10, wherein the third module functions to generate the one or more sets of at least a decode threshold of new slice names by:
sending a request to generate the one or more sets of new slices names to the storage nodes, wherein:
a first storage node of the storage nodes generates a first slice name for each of the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function; and
a second storage node of the storage nodes generates a second slice name for each of the one or more set of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 14. The DS module of claim 10, wherein the fourth module functions to instruct to link by:
instructing a first storage node of the storage nodes updating a first slice location table to link a first new slice name of the one or more sets of at least a decode threshold of new slice names to a first slice name of the one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to link a second new slice name of the one or more sets of at least a decode threshold of new slice names to a second slice name of the one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 15. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request to update a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function, and wherein the one or more sets of encoded data slices are identified by a first one or more sets of at least a decode threshold of slice names and a second one or more sets of at least a decode threshold of slice names;
a second module, when operable within the computing device, causes the computing device to:
select the first or the second one or more sets of at least a decode threshold of slice names for the update to the data object to produce a selected one or more sets of at least a decode threshold of slice names; and
a third module, when operable within the computing device, causes the computing device to:
send one or more sets of updated encoded data slices regarding the update to the data object to storage nodes of the DSN, wherein the storage nodes store the one or more sets of updated encoded data slices in new storage locations addressable based on the selected one or more sets of at least a decode threshold of slice names; and
instruct the storage nodes to unlink the selected one or more sets of at least a decode threshold of slice names from the one or more sets of encoded data slices. 16. The DS module of claim 15 further comprises:
the third module further functions to:
generate the one or more sets of updated encoded data slices regarding the update to the data object in accordance with a dispersed storage error coding function;
and send write requests to the storage nodes for storing the one or more sets of updated encoded data slices. 17. The DS module of claim 15, wherein the third module functions to instruct the unlinking by:
instructing a first storage node of the storage nodes updating a first slice location table to unlink a first slice name of the first one or more sets of at least a decode threshold of slice names from a first slice name of the second one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to unlink a second slice name of the first one or more sets of at least a decode threshold of new slice names from a second slice name of the second one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 18. The DS module of claim 15, wherein the second module functions to select the first or the second one or more sets of at least a decode threshold of slice names by at least one of:
selecting the first or the second one or more sets of at least a decode threshold of slice names based on the request for updating; selecting the first or the second one or more sets of at least a decode threshold of slice names based on chronological creation of the first and the second one or more sets of at least a decode threshold of slice names; and selecting the first or the second one or more sets of at least a decode threshold of slice names based on a snapshot procedure. | A method begins by a dispersed storage (DS) processing module receiving a request to copy a data object in a dispersed storage network (DSN). The method continues with the DS processing module identifying one or more sets of at least a decode threshold number of slice names for one or more sets of encoded data slices of the data object and generating one or more sets of at least a decode threshold of new slice names. The method continues with the DS processing module sending the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN and instructing the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object.1. A method for copying a data object in a dispersed storage network (DSN) without replication, the method comprises:
receiving a request to copy the data object, wherein the data object is stored in the DSN as a one or more sets of encoded data slices based on a dispersed storage error coding function; and in response to the request to copy the data object:
identifying one or more sets of at least a decode threshold number of slice names for the one or more sets of encoded data slices;
generating one or more sets of at least a decode threshold of new slice names for the one or more sets of encoded data slices;
sending the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN for storage therein; and
instructing the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object. 2. The method of claim 1, wherein the request to copy comprises at least one of:
a snapshot request; a component of a duplication request; and a component of a backup request. 3. The method of claim 1, wherein the generating the one or more sets of at least a decode threshold of new slice names comprises:
generating the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 4. The method of claim 1, wherein the generating the one or more sets of at least a decode threshold of new slice names comprises:
sending a request to generate the one or more sets of new slices names to the storage nodes, wherein:
a first storage node of the storage nodes generates a first slice name for each of the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function; and
a second storage node of the storage nodes generates a second slice name for each of the one or more set of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 5. The method of claim 1, wherein the instructing to link comprises:
instructing a first storage node of the storage nodes updating a first slice location table to link a first new slice name of the one or more sets of at least a decode threshold of new slice names to a first slice name of the one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to link a second new slice name of the one or more sets of at least a decode threshold of new slice names to a second slice name of the one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 6. A method comprises:
receiving a request to update a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function, and wherein the one or more sets of encoded data slices is identified by a first one or more sets of at least a decode threshold of slice names and a second one or more sets of at least a decode threshold of slice names; selecting the first or the second one or more sets of at least a decode threshold of slice names for the update to the data object to produce a selected one or more sets of at least a decode threshold of slice names; sending one or more sets of updated encoded data slices regarding the update to the data object to storage nodes of the DSN, wherein the storage nodes store the one or more sets of updated encoded data slices in new storage locations addressable based on the selected one or more sets of at least a decode threshold of slice names; and instructing the storage nodes to unlink the selected one or more sets of at least a decode threshold of slice names from the one or more sets of encoded data slices. 7. The method of claim 6 further comprises:
generating the one or more sets of updated encoded data slices regarding the update to the data object in accordance with a dispersed storage error coding function; and
sending write requests to the storage nodes for storing the one or more sets of updated encoded data slices. 8. The method of claim 6, wherein the instructing the unlinking comprises:
instructing a first storage node of the storage nodes updating a first slice location table to unlink a first slice name of the first one or more sets of at least a decode threshold of slice names from a first slice name of the second one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to unlink a second slice name of the first one or more sets of at least a decode threshold of new slice names from a second slice name of the second one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 9. The method of claim 6, wherein the selecting the first or the second one or more sets of at least a decode threshold of slice names comprises at least one of:
selecting the first or the second one or more sets of at least a decode threshold of slice names based on the request for updating; selecting the first or the second one or more sets of at least a decode threshold of slice names based on chronological creation of the first and the second one or more sets of at least a decode threshold of slice names; and selecting the first or the second one or more sets of at least a decode threshold of slice names based on a snapshot procedure. 10. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request to copy a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function;
a second module, when operable within the computing device, in response to the request to copy the data object, causes the computing device to:
identify one or more sets of at least a decode threshold number of slice names for the one or more sets of encoded data slices;
a third module, when operable within the computing device, causes the computing device to:
generate one or more sets of at least a decode threshold of new slice names for the one or more sets of encoded data slices; and
a fourth module, when operable within the computing device, causes the computing device to:
send the one or more sets of at least a decode threshold of new slice names to storage nodes of the DSN for storage therein; and
instruct the storage nodes to link the one or more sets of at least a decode threshold of new slice names to the one or more sets of encoded data slices thereby producing a non-replicated copy of the data object. 11. The DS module of claim 10, wherein the request to copy comprises at least one of:
a snapshot request; a component of a duplication request; and a component of a backup request. 12. The DS module of claim 10, wherein the third module functions to generate the one or more sets of at least a decode threshold of new slice names by:
generating the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 13. The DS module of claim 10, wherein the third module functions to generate the one or more sets of at least a decode threshold of new slice names by:
sending a request to generate the one or more sets of new slices names to the storage nodes, wherein:
a first storage node of the storage nodes generates a first slice name for each of the one or more sets of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function; and
a second storage node of the storage nodes generates a second slice name for each of the one or more set of at least a decode threshold of new slice names in accordance with the dispersed storage error coding function. 14. The DS module of claim 10, wherein the fourth module functions to instruct to link by:
instructing a first storage node of the storage nodes updating a first slice location table to link a first new slice name of the one or more sets of at least a decode threshold of new slice names to a first slice name of the one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to link a second new slice name of the one or more sets of at least a decode threshold of new slice names to a second slice name of the one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 15. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request to update a data object, wherein the data object is stored in a dispersed storage network (DSN) as a one or more sets of encoded data slices based on a dispersed storage error coding function, and wherein the one or more sets of encoded data slices are identified by a first one or more sets of at least a decode threshold of slice names and a second one or more sets of at least a decode threshold of slice names;
a second module, when operable within the computing device, causes the computing device to:
select the first or the second one or more sets of at least a decode threshold of slice names for the update to the data object to produce a selected one or more sets of at least a decode threshold of slice names; and
a third module, when operable within the computing device, causes the computing device to:
send one or more sets of updated encoded data slices regarding the update to the data object to storage nodes of the DSN, wherein the storage nodes store the one or more sets of updated encoded data slices in new storage locations addressable based on the selected one or more sets of at least a decode threshold of slice names; and
instruct the storage nodes to unlink the selected one or more sets of at least a decode threshold of slice names from the one or more sets of encoded data slices. 16. The DS module of claim 15 further comprises:
the third module further functions to:
generate the one or more sets of updated encoded data slices regarding the update to the data object in accordance with a dispersed storage error coding function;
and send write requests to the storage nodes for storing the one or more sets of updated encoded data slices. 17. The DS module of claim 15, wherein the third module functions to instruct the unlinking by:
instructing a first storage node of the storage nodes updating a first slice location table to unlink a first slice name of the first one or more sets of at least a decode threshold of slice names from a first slice name of the second one or more sets of at least a decode threshold of slice names for a first encoded data slice of the one or more sets of encoded data slices; and instructing a second storage node of the storage nodes updating a second slice location table to unlink a second slice name of the first one or more sets of at least a decode threshold of new slice names from a second slice name of the second one or more sets of at least a decode threshold of slice names for a second encoded data slice of the one or more sets of encoded data slices. 18. The DS module of claim 15, wherein the second module functions to select the first or the second one or more sets of at least a decode threshold of slice names by at least one of:
selecting the first or the second one or more sets of at least a decode threshold of slice names based on the request for updating; selecting the first or the second one or more sets of at least a decode threshold of slice names based on chronological creation of the first and the second one or more sets of at least a decode threshold of slice names; and selecting the first or the second one or more sets of at least a decode threshold of slice names based on a snapshot procedure. | 2,100 |
4,613 | 13,074,403 | 2,159 | A multi-media image system includes using a processor for forming a multi-media image product, comprising establishing a multi-media collection on a digital storage system; associating an identifier with the image collection, wherein the identifier is adapted to be accessed from a cellular telephone; providing the identifier for distribution to a plurality of individuals; receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from cellular telephones operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio messages or text messages captured by the cellular telephones; storing the multi-media content in the multi-media collection; and forming a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection. | 1. A method for forming a multi-media image product, comprising:
using a processor to provide a storage location for a multi-media image collection in a digital storage system; associating an identifier with the storage location, wherein the identifier is adapted to be transmitted from or with a mobile communication device; providing the identifier for distribution to a plurality of individuals; receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from one or more mobile communication devices operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio annotations, or text annotations captured by the mobile communication device; storing the multi-media content in the storage location and associating the multi-media content with the multi-media collection; providing rules for associating the multi-media content with the images or the multi-media image collection; and making a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection wherein the multi-media content is associated with the images or multi-media image collection in accordance with the rules. 2. The method of claim 1, wherein the identifier is a universal resource locater, a universal resource identifier, a telephone number, an identification number, a collection name, an electronic code, an optically recognizable code, an instant message address, or an E-mail address. 3. The method of claim 1, further including an individual who established the image collection different from the plurality of individuals. 4. The method of claim 1, wherein a third individual different from the plurality of individuals specifies the multi-media image product. 5. The method of claim 1, further including initializing the image collection with an initial set of images, the initial set of images being provided by a third individual different from the plurality of individuals. 6. The method of claim 1, further including making the multi-media image product with one or more images from the image collection other than the one or more images received from the plurality of individuals. 7. The method of claim 1, wherein the image collection includes still images or video images. 8. The method of claim 1, wherein the identifier is a telephone call to an identified telephone number. 9. The method of claim 1, further including electronically receiving the one or more images from the one of the plurality of individuals by E-mail, land-line telephony, or cellular telephony. 10. The method of claim 1, wherein the multi-media product is a hardcopy image product, photo-book, or a photo collage having an audio playback or reference capability or the multi-media image product is a digital multi-media image product stored in a digital storage medium. 11. The method of claim 10, wherein the digital multi-media image product is a digital slide show, a digital photo album, or a digital collage. 12. The method of claim 1, further including communicating the identifier to the plurality of individuals. 13. The method of claim 1, further including providing a user-interface mechanism in a computing system for recording one or more audio annotations. 14. The method of claim 1, further including providing a user interface mechanism in a computing system for presenting one or more of the images in the image collection to a viewer. 15. The method of claim 1, wherein at least one of the plurality of individuals who was provided the identifier shares the identifier with one or more additional individuals. 16. The method of claim 15, further including receiving one or more additional images from the one or more additional individuals, and associating the additional images with the image collection. 17. The method of claim 15, further including receiving one or more additional audio annotations from the one or more additional individuals. 18. The method of claim 1, further including receiving an audio annotation as an electronic audio file, a voice recording provided by an individual, or a selection of a pre-recorded audio message, 19. The method of claim 1, further including receiving an audio annotation as an E-mail, an audio file recorded on a physical medium, by recording a telephonic message, through a web browser executing on a computer, or from a software application executing on a processor. 20. The method of claim 1, further including receiving an audio annotation from a software application installed on a client computer that interacts with a remote server connected to the client computer through a computer network. 21. The method of claim 1, further including receiving an audio annotation from a web browser executing on a client computer that presents information provided from a remote server connected to the client computer through a computer network. 22. The method of claim 1, further including providing a digital memory for storing the audio annotation, rules for associating images and collections, and a control for activating circuits to play the audio annotation from the digital memory in accordance with rules. 23. The method of claim 1, further including editing one or more of the annotations, images, associations, or rules. 24. A system for annotation of an image collection, comprising:
a digital storage system for storing a multi-media image collection in a storage location, the multi-media image collection having an associated identifier, wherein the identifier is adapted to be transmitted from or with a mobile communication device; communication means for distributing the identifier to a plurality of individuals; communication means for receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from one or more mobile communication devices operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio messages, or text messages captured by the mobile communication device; a processor for storing the multi-media content in the storage location and associating the multi-media content with the multi-media collection; a processor for storing and applying rules for associating the multi-media content with the images or the multi-media image collection; and means for making a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection wherein the multi-media content is associated with the images or multi-media image collection in accordance with the rules. 25. The system of claim 24, further including means for editing one or more of the annotations, images, associations, or rules. 26. A computer program product for audio annotation of a multi-media image collection using the method of claim 1. | A multi-media image system includes using a processor for forming a multi-media image product, comprising establishing a multi-media collection on a digital storage system; associating an identifier with the image collection, wherein the identifier is adapted to be accessed from a cellular telephone; providing the identifier for distribution to a plurality of individuals; receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from cellular telephones operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio messages or text messages captured by the cellular telephones; storing the multi-media content in the multi-media collection; and forming a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection.1. A method for forming a multi-media image product, comprising:
using a processor to provide a storage location for a multi-media image collection in a digital storage system; associating an identifier with the storage location, wherein the identifier is adapted to be transmitted from or with a mobile communication device; providing the identifier for distribution to a plurality of individuals; receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from one or more mobile communication devices operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio annotations, or text annotations captured by the mobile communication device; storing the multi-media content in the storage location and associating the multi-media content with the multi-media collection; providing rules for associating the multi-media content with the images or the multi-media image collection; and making a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection wherein the multi-media content is associated with the images or multi-media image collection in accordance with the rules. 2. The method of claim 1, wherein the identifier is a universal resource locater, a universal resource identifier, a telephone number, an identification number, a collection name, an electronic code, an optically recognizable code, an instant message address, or an E-mail address. 3. The method of claim 1, further including an individual who established the image collection different from the plurality of individuals. 4. The method of claim 1, wherein a third individual different from the plurality of individuals specifies the multi-media image product. 5. The method of claim 1, further including initializing the image collection with an initial set of images, the initial set of images being provided by a third individual different from the plurality of individuals. 6. The method of claim 1, further including making the multi-media image product with one or more images from the image collection other than the one or more images received from the plurality of individuals. 7. The method of claim 1, wherein the image collection includes still images or video images. 8. The method of claim 1, wherein the identifier is a telephone call to an identified telephone number. 9. The method of claim 1, further including electronically receiving the one or more images from the one of the plurality of individuals by E-mail, land-line telephony, or cellular telephony. 10. The method of claim 1, wherein the multi-media product is a hardcopy image product, photo-book, or a photo collage having an audio playback or reference capability or the multi-media image product is a digital multi-media image product stored in a digital storage medium. 11. The method of claim 10, wherein the digital multi-media image product is a digital slide show, a digital photo album, or a digital collage. 12. The method of claim 1, further including communicating the identifier to the plurality of individuals. 13. The method of claim 1, further including providing a user-interface mechanism in a computing system for recording one or more audio annotations. 14. The method of claim 1, further including providing a user interface mechanism in a computing system for presenting one or more of the images in the image collection to a viewer. 15. The method of claim 1, wherein at least one of the plurality of individuals who was provided the identifier shares the identifier with one or more additional individuals. 16. The method of claim 15, further including receiving one or more additional images from the one or more additional individuals, and associating the additional images with the image collection. 17. The method of claim 15, further including receiving one or more additional audio annotations from the one or more additional individuals. 18. The method of claim 1, further including receiving an audio annotation as an electronic audio file, a voice recording provided by an individual, or a selection of a pre-recorded audio message, 19. The method of claim 1, further including receiving an audio annotation as an E-mail, an audio file recorded on a physical medium, by recording a telephonic message, through a web browser executing on a computer, or from a software application executing on a processor. 20. The method of claim 1, further including receiving an audio annotation from a software application installed on a client computer that interacts with a remote server connected to the client computer through a computer network. 21. The method of claim 1, further including receiving an audio annotation from a web browser executing on a client computer that presents information provided from a remote server connected to the client computer through a computer network. 22. The method of claim 1, further including providing a digital memory for storing the audio annotation, rules for associating images and collections, and a control for activating circuits to play the audio annotation from the digital memory in accordance with rules. 23. The method of claim 1, further including editing one or more of the annotations, images, associations, or rules. 24. A system for annotation of an image collection, comprising:
a digital storage system for storing a multi-media image collection in a storage location, the multi-media image collection having an associated identifier, wherein the identifier is adapted to be transmitted from or with a mobile communication device; communication means for distributing the identifier to a plurality of individuals; communication means for receiving a plurality of multi-media content from two or more of the plurality of individuals, the multi-media content being transmitted from one or more mobile communication devices operated by the respective individuals employing the identifier, wherein the multi-media content includes one or more images, audio messages, or text messages captured by the mobile communication device; a processor for storing the multi-media content in the storage location and associating the multi-media content with the multi-media collection; a processor for storing and applying rules for associating the multi-media content with the images or the multi-media image collection; and means for making a multi-media image product using at least a portion of the multi-media content stored in the multi-media collection wherein the multi-media content is associated with the images or multi-media image collection in accordance with the rules. 25. The system of claim 24, further including means for editing one or more of the annotations, images, associations, or rules. 26. A computer program product for audio annotation of a multi-media image collection using the method of claim 1. | 2,100 |
4,614 | 14,383,710 | 2,154 | A method of processing data at a server ( 302 ) for maintenance of a database ( 516 ) of points of interest, such as speed limit enforcement devices. Each of the devices represented in the database has at least one attribute and a confidence value indicative of the accuracy of the at least one attribute associated therewith. The confidence value is time dependent and varies according to a pre-defined decay function. A report ( 500 ) relating to an attribute of a speed limit enforcement device is received at the server ( 302 ) from a mobile device ( 200 ). The confidence value associated with the speed limit enforcement device is adjusted in accordance with the received report, and information relating to the speed limit enforcement device ( 520, 522 ) is selectively transmitted to the or another mobile device ( 200 ) based on the confidence value. | 1. A method of processing data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the method comprising:
transmitting a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receiving a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjusting the confidence value associated with the point of interest in accordance with the received report. 2. The method of claim 1, wherein the confidence value associated with the point of interest is increased upon receipt of a positive report indicating the current attribute is correct, and wherein the confidence value associated with the point interest is decreased upon receipt of a negative report indicating the current attribute is incorrect. 3. The method of claim 1, wherein the points of interest are speed limit enforcement devices. 4. The method of claim 3, wherein the at least one attribute associated with a speed limit enforcement device comprises one or more of: an active status of the device; a device type; a location of the device; a speed limit; a driving direction indicating with which direction of vehicular travel the device operates; and a time period during which the device is operational. 5. The method of claim 3, wherein the at least one attribute associated with a speed limit enforcement device comprises a speed limit, wherein the speed limit is one of: (i) the actual speed limit for the road on which the speed limit enforcement device is located; and (ii) derived from position data received from vehicles travelling along the road on which the speed limit enforcement device is located. 6. The method of claim 3, wherein speed limit enforcement devices are added to and/or modified in the database based on identifying a change in speed indicative of the presence of a speed limit enforcement device from position data relating to the position of at least one vehicle at a plurality of times when travelling along a route. 7. The method of claim 1, wherein the points of interest comprise one or more of: parking locations; electric vehicle charging stations; fuel stations; dynamic advertising locations; and areas of construction or road works. 8. The method of claim 1, wherein the initial confidence value associated with a point of interest is based on the source of the point of interest. 9. The method of claim 1, wherein each point of interest represented in the database has a plurality of attributes associated therewith, and the confidence value associated with a device is a combined confidence value indicative of the accuracy of each of the attributes. 10. The method of claim 1, wherein the confidence value for a point of interest is calculated using one or more of: the number of positive reports received from the remote devices; the number of negative reports received from the remote devices; the ratio of positive reports received to negative reports; and the age of each report. 11. A server system arranged to process data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the system comprising memory for storing the database of points of interest and at least one processor configured to:
transmit a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receive a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjust the confidence value associated with the point of interest in accordance with the received report. 12. The system of claim 11, wherein the adjusting the confidence value comprises increasing the confidence value associated with the point of interest upon receipt of a positive report indicating the current attribute is correct, and decreasing the confidence value associated with the point interest upon receipt of a negative report indicating the current attribute is incorrect. 13. A non-transitory computer readable medium comprising computer program code adapted, when said computer program code is run on a computer, to cause the computer to perform a method of processing data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the method comprising:
transmitting a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receiving a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjusting the confidence value associated with the point of interest in accordance with the received report. 14. (canceled) | A method of processing data at a server ( 302 ) for maintenance of a database ( 516 ) of points of interest, such as speed limit enforcement devices. Each of the devices represented in the database has at least one attribute and a confidence value indicative of the accuracy of the at least one attribute associated therewith. The confidence value is time dependent and varies according to a pre-defined decay function. A report ( 500 ) relating to an attribute of a speed limit enforcement device is received at the server ( 302 ) from a mobile device ( 200 ). The confidence value associated with the speed limit enforcement device is adjusted in accordance with the received report, and information relating to the speed limit enforcement device ( 520, 522 ) is selectively transmitted to the or another mobile device ( 200 ) based on the confidence value.1. A method of processing data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the method comprising:
transmitting a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receiving a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjusting the confidence value associated with the point of interest in accordance with the received report. 2. The method of claim 1, wherein the confidence value associated with the point of interest is increased upon receipt of a positive report indicating the current attribute is correct, and wherein the confidence value associated with the point interest is decreased upon receipt of a negative report indicating the current attribute is incorrect. 3. The method of claim 1, wherein the points of interest are speed limit enforcement devices. 4. The method of claim 3, wherein the at least one attribute associated with a speed limit enforcement device comprises one or more of: an active status of the device; a device type; a location of the device; a speed limit; a driving direction indicating with which direction of vehicular travel the device operates; and a time period during which the device is operational. 5. The method of claim 3, wherein the at least one attribute associated with a speed limit enforcement device comprises a speed limit, wherein the speed limit is one of: (i) the actual speed limit for the road on which the speed limit enforcement device is located; and (ii) derived from position data received from vehicles travelling along the road on which the speed limit enforcement device is located. 6. The method of claim 3, wherein speed limit enforcement devices are added to and/or modified in the database based on identifying a change in speed indicative of the presence of a speed limit enforcement device from position data relating to the position of at least one vehicle at a plurality of times when travelling along a route. 7. The method of claim 1, wherein the points of interest comprise one or more of: parking locations; electric vehicle charging stations; fuel stations; dynamic advertising locations; and areas of construction or road works. 8. The method of claim 1, wherein the initial confidence value associated with a point of interest is based on the source of the point of interest. 9. The method of claim 1, wherein each point of interest represented in the database has a plurality of attributes associated therewith, and the confidence value associated with a device is a combined confidence value indicative of the accuracy of each of the attributes. 10. The method of claim 1, wherein the confidence value for a point of interest is calculated using one or more of: the number of positive reports received from the remote devices; the number of negative reports received from the remote devices; the ratio of positive reports received to negative reports; and the age of each report. 11. A server system arranged to process data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the system comprising memory for storing the database of points of interest and at least one processor configured to:
transmit a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receive a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjust the confidence value associated with the point of interest in accordance with the received report. 12. The system of claim 11, wherein the adjusting the confidence value comprises increasing the confidence value associated with the point of interest upon receipt of a positive report indicating the current attribute is correct, and decreasing the confidence value associated with the point interest upon receipt of a negative report indicating the current attribute is incorrect. 13. A non-transitory computer readable medium comprising computer program code adapted, when said computer program code is run on a computer, to cause the computer to perform a method of processing data for maintenance of a database of points of interest (POI), each point of interest represented in the database having at least one attribute and a time-varying confidence value indicative of the accuracy of the at least one attribute associated therewith, the method comprising:
transmitting a request to one or more remote devices to provide confirmation of an attribute of a point of interest when the confidence value associated with the point of interest is below a predetermined threshold; receiving a report relating to the attribute in response to the transmitted request from at least one of the remote devices; and adjusting the confidence value associated with the point of interest in accordance with the received report. 14. (canceled) | 2,100 |
4,615 | 11,491,427 | 2,159 | A computer implemented method, apparatus, system, and computer usable program product for managing a database. The process receives a request for a list of members for a given group of objects in the database. The process identifies a set of static members for the given group based on a set of records in a membership table in the database. The set of static members includes all direct static members and all indirect static members of the given group. The process identifies a set of dynamic members for the given group of objects based on a reference in a group table in the database. The set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group. The process generates the list of members. | 1. A computer implemented method for managing a database, the computer implemented method comprising:
receiving a request for a list of members for a given group of objects associated with the database; identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members and wherein the list of members is used to manage the database. 2. The computer implemented method of claim 1 wherein the membership table includes a nested field that indicates whether a member of the given group of objects is a nested group. 3. The computer implemented method of claim 2 further comprising:
responsive to a determination that a member of the given group of objects is a nested member, checking the reference in the group table to determine whether the nested member of the given group of objects is a dynamic group to form a dynamic nested group. 4. The computer implemented method of claim 3 further comprising:
executing a query object for the dynamic nested group to identify a set of members of the dynamic nested group to form indirect dynamic members of the given group of objects. 5. The computer implemented method of claim 4 wherein the set of members of the dynamic nested group is identified based on a single database query. 6. The computer implemented method of claim 1 further comprising:
checking a field in the membership table to determine whether a member of the given group is one of a direct static member of the group and an indirect static member of the group. 7. The computer implemented method of claim 1 wherein the reference in the group table is a reference to a query object that defines attributes of the dynamic members of the given group. 8. The computer implemented method of claim 7 further comprising:
executing the query object against the database to identify a set of dynamic members of the given group to form the set of dynamic members. 9. The computer implemented method of claim 1 wherein the set of static members is identified based on a single database query. 10. The computer implemented method of claim 1 further comprising:
responsive to receiving a request to add a member to the given group to form an added member, adding a direct membership record to the membership table for the added member of the given group to form an added member. 11. The computer implemented method of claim 10 further comprising:
responsive to determining the added member is a nested group, setting a field in the membership table to indicate the added member is a nested group to form a nested group member. 12. The computer implemented method of claim 11 further comprising:
responsive to determining a record for a given member of the nested group member is present in the membership table for the given group, incrementing a reference count for the given member of the nested group member. 13. The computer implemented method of claim 11 further comprising:
responsive to determining a record for a given member of the nested group member is not present in the membership table for the given group, adding an indirect membership record for the given member of the nested group member in the membership table for the given group. 14. The computer implemented method of claim 1 further comprising:
responsive to receiving a request to remove a member from the given group, removing direct membership records from the membership table for the removed member to form a removed member. 15. The computer implemented method of claim 14 further comprising:
responsive to a determination that the removed member is a nested group, decrementing a reference count in the indirect membership records for all groups in which the removed member was a direct member or indirect member. 16. The computer implemented method of claim 1 wherein receiving a request for a list of members, identifying a set of static members, identifying a set of dynamic members, and generating the list of members in claim 1 are performed by a database manager. 17. A database system for managing groups of objects, the database system comprising:
a set of databases, wherein the set of databases further comprises:
a membership table, wherein the membership table further comprises:
a direct field, wherein the direct field indicates whether a given member of a group is a direct member of the group or an indirect member of the group;
a nested field, wherein the nested field indicates whether the given member of the group is a nested group; and
a reference count field, wherein the reference count field indicates a number of indirect memberships of the given member for the group; and
a group table, wherein the group table includes a foreign key reference that indicates whether the group is a dynamic group. 18. The database system of claim 17 further comprising:
a database manager, wherein the database manager uses the nested field of the membership table to determine whether a given member of the group is a nested group. 19. The database system of claim 18 wherein the database manager checks the foreign key reference of the group table to determine whether the given member of the group is a dynamic group to form a dynamic nested group member in response to a determination that the given member of the group is a nested group. 20. The database system of claim 17 further comprising:
a database manager, wherein the database manager obtains a list of all direct and indirect static members of the group based on a single query to the membership table. 21. A computer program product comprising:
a computer usable medium having computer usable program code for managing a database, the computer program product comprising: computer usable program code for receiving a request for a list of members for a given group of objects associated with the database; computer usable program code for identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; computer usable program code for identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database and wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and computer usable program code for generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members. 22. The computer program product of claim 21 wherein the membership table includes a nested field that indicates whether a member of the given group of objects is a nested group. 23. The computer program product of claim 22 further comprising:
computer usable program code for checking the reference in the group table to determine whether the nested member of the given group of objects is a dynamic group to form a dynamic nested group in response to a determination that a member of the given group of objects is a nested member. 24. The computer program product of claim 23 further comprising:
computer usable program code for executing a query object for the dynamic nested group to identify a set of members of the dynamic nested group to form indirect dynamic members of the given group of objects. 25. The computer program product of claim 21 wherein the set of static members is identified based on a single database query. 26. An apparatus for managing a database, the apparatus comprising:
a computer comprising:
a database;
a bus;
a storage device connected to the bus, wherein the storage device contains a computer usable program product;
a processor unit, wherein the processor unit executes the computer usable program product to receive a request for a list of members for a given group of objects associated with the database; identify a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; identify a set of dynamic members for the given group of objects based on a set of records in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generate the list of members, wherein the list of members includes the set of static members and the set of dynamic members. 27. An apparatus for managing a database, the apparatus comprising:
receipt means for receiving a request for a list of members for a given group of objects associated with the database; first identification means for identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; second identification means for identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generating means for generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members and wherein the list of members is used to manager the database. | A computer implemented method, apparatus, system, and computer usable program product for managing a database. The process receives a request for a list of members for a given group of objects in the database. The process identifies a set of static members for the given group based on a set of records in a membership table in the database. The set of static members includes all direct static members and all indirect static members of the given group. The process identifies a set of dynamic members for the given group of objects based on a reference in a group table in the database. The set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group. The process generates the list of members.1. A computer implemented method for managing a database, the computer implemented method comprising:
receiving a request for a list of members for a given group of objects associated with the database; identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members and wherein the list of members is used to manage the database. 2. The computer implemented method of claim 1 wherein the membership table includes a nested field that indicates whether a member of the given group of objects is a nested group. 3. The computer implemented method of claim 2 further comprising:
responsive to a determination that a member of the given group of objects is a nested member, checking the reference in the group table to determine whether the nested member of the given group of objects is a dynamic group to form a dynamic nested group. 4. The computer implemented method of claim 3 further comprising:
executing a query object for the dynamic nested group to identify a set of members of the dynamic nested group to form indirect dynamic members of the given group of objects. 5. The computer implemented method of claim 4 wherein the set of members of the dynamic nested group is identified based on a single database query. 6. The computer implemented method of claim 1 further comprising:
checking a field in the membership table to determine whether a member of the given group is one of a direct static member of the group and an indirect static member of the group. 7. The computer implemented method of claim 1 wherein the reference in the group table is a reference to a query object that defines attributes of the dynamic members of the given group. 8. The computer implemented method of claim 7 further comprising:
executing the query object against the database to identify a set of dynamic members of the given group to form the set of dynamic members. 9. The computer implemented method of claim 1 wherein the set of static members is identified based on a single database query. 10. The computer implemented method of claim 1 further comprising:
responsive to receiving a request to add a member to the given group to form an added member, adding a direct membership record to the membership table for the added member of the given group to form an added member. 11. The computer implemented method of claim 10 further comprising:
responsive to determining the added member is a nested group, setting a field in the membership table to indicate the added member is a nested group to form a nested group member. 12. The computer implemented method of claim 11 further comprising:
responsive to determining a record for a given member of the nested group member is present in the membership table for the given group, incrementing a reference count for the given member of the nested group member. 13. The computer implemented method of claim 11 further comprising:
responsive to determining a record for a given member of the nested group member is not present in the membership table for the given group, adding an indirect membership record for the given member of the nested group member in the membership table for the given group. 14. The computer implemented method of claim 1 further comprising:
responsive to receiving a request to remove a member from the given group, removing direct membership records from the membership table for the removed member to form a removed member. 15. The computer implemented method of claim 14 further comprising:
responsive to a determination that the removed member is a nested group, decrementing a reference count in the indirect membership records for all groups in which the removed member was a direct member or indirect member. 16. The computer implemented method of claim 1 wherein receiving a request for a list of members, identifying a set of static members, identifying a set of dynamic members, and generating the list of members in claim 1 are performed by a database manager. 17. A database system for managing groups of objects, the database system comprising:
a set of databases, wherein the set of databases further comprises:
a membership table, wherein the membership table further comprises:
a direct field, wherein the direct field indicates whether a given member of a group is a direct member of the group or an indirect member of the group;
a nested field, wherein the nested field indicates whether the given member of the group is a nested group; and
a reference count field, wherein the reference count field indicates a number of indirect memberships of the given member for the group; and
a group table, wherein the group table includes a foreign key reference that indicates whether the group is a dynamic group. 18. The database system of claim 17 further comprising:
a database manager, wherein the database manager uses the nested field of the membership table to determine whether a given member of the group is a nested group. 19. The database system of claim 18 wherein the database manager checks the foreign key reference of the group table to determine whether the given member of the group is a dynamic group to form a dynamic nested group member in response to a determination that the given member of the group is a nested group. 20. The database system of claim 17 further comprising:
a database manager, wherein the database manager obtains a list of all direct and indirect static members of the group based on a single query to the membership table. 21. A computer program product comprising:
a computer usable medium having computer usable program code for managing a database, the computer program product comprising: computer usable program code for receiving a request for a list of members for a given group of objects associated with the database; computer usable program code for identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; computer usable program code for identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database and wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and computer usable program code for generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members. 22. The computer program product of claim 21 wherein the membership table includes a nested field that indicates whether a member of the given group of objects is a nested group. 23. The computer program product of claim 22 further comprising:
computer usable program code for checking the reference in the group table to determine whether the nested member of the given group of objects is a dynamic group to form a dynamic nested group in response to a determination that a member of the given group of objects is a nested member. 24. The computer program product of claim 23 further comprising:
computer usable program code for executing a query object for the dynamic nested group to identify a set of members of the dynamic nested group to form indirect dynamic members of the given group of objects. 25. The computer program product of claim 21 wherein the set of static members is identified based on a single database query. 26. An apparatus for managing a database, the apparatus comprising:
a computer comprising:
a database;
a bus;
a storage device connected to the bus, wherein the storage device contains a computer usable program product;
a processor unit, wherein the processor unit executes the computer usable program product to receive a request for a list of members for a given group of objects associated with the database; identify a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; identify a set of dynamic members for the given group of objects based on a set of records in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generate the list of members, wherein the list of members includes the set of static members and the set of dynamic members. 27. An apparatus for managing a database, the apparatus comprising:
receipt means for receiving a request for a list of members for a given group of objects associated with the database; first identification means for identifying a set of static members for the given group of objects based on a set of records in a membership table in the database, wherein the set of static members for the given group of objects includes all direct static members of the given group and all indirect static members of the given group; second identification means for identifying a set of dynamic members for the given group of objects based on a reference in a group table in the database, wherein the set of dynamic members includes all direct dynamic members of the given group and all indirect static members of the given group; and generating means for generating the list of members, wherein the list of members includes the set of static members and the set of dynamic members and wherein the list of members is used to manager the database. | 2,100 |
4,616 | 13,897,889 | 2,145 | Systems, methods, and data structures for augmenting data placed on the clipboard with additional data are disclosed. Where the data placed on the clipboard may include one or more references to other information, such systems, methods, or data structures may retrieve data referred to by a reference and place such data, or data associated with the retrieved data, on the clipboard. | 1. A method, comprising:
receiving a notification that data comprising a reference has been placed on a clipboard; adding supplemental data to the clipboard using the reference, the reference referencing a feed, the supplemental data comprising content of the feed; and adding second supplemental data to the clipboard using a second reference within the supplemental data, the second supplemental data comprising content of a second feed. 2. The method of claim 1, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 3. The method of claim 1, the reference comprising a Uniform Resource Locator (URL). 4. The method of claim 1, the second reference comprising a Uniform Resource Locator (URL). 5. The method of claim 1, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 6. The method of claim 1, the reference comprising at least one of a local file system path, a networked file system path or a memory location. 7. The method of claim 1, at least one of the supplemental data or the second supplemental data external to a source from which the data originated. 8. A system, comprising:
one or more processing units; and memory comprising instructions that when executed by at least one of the one or more processing units, perform a method comprising:
receiving a notification that data comprising a reference has been placed on a clipboard;
adding supplemental data to the clipboard using the reference, the reference referencing a feed, the supplemental data comprising content of the feed; and
adding second supplemental data to the clipboard using a second reference within the supplemental data, the second supplemental data comprising content of a second feed. 9. The system of claim 8, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 10. The system of claim 8, the reference comprising a Uniform Resource Locator (URL). 11. The system of claim 10, the second reference comprising a Uniform Resource Locator (URL). 12. The system of claim 8, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 13. The system of claim 8, the reference comprising at least one of a local file system path, a networked file system path or a memory location. 14. The system of claim 8, at least one of the supplemental data or the second supplemental data external to a source from which the data originated. 15. A computer readable medium comprising instructions that when executed perform a method, comprising:
receiving a notification that data comprising a reference has been placed on a clipboard; adding additional data to the clipboard using the reference, the reference referencing a feed, the additional data comprising content of the feed; and adding second additional data to the clipboard using a second reference within the additional data, the second additional data comprising content of a second feed. 16. The computer readable medium of claim 15, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 17. The computer readable medium of claim 15, the reference comprising a Uniform Resource Locator (URL). 18. The computer readable medium of claim 15, the second reference comprising a Uniform Resource Locator (URL). 19. The computer readable medium of claim 15, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 20. The computer readable medium of claim 15, the reference comprising at least one of a local file system path, a networked file system path or a memory location. | Systems, methods, and data structures for augmenting data placed on the clipboard with additional data are disclosed. Where the data placed on the clipboard may include one or more references to other information, such systems, methods, or data structures may retrieve data referred to by a reference and place such data, or data associated with the retrieved data, on the clipboard.1. A method, comprising:
receiving a notification that data comprising a reference has been placed on a clipboard; adding supplemental data to the clipboard using the reference, the reference referencing a feed, the supplemental data comprising content of the feed; and adding second supplemental data to the clipboard using a second reference within the supplemental data, the second supplemental data comprising content of a second feed. 2. The method of claim 1, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 3. The method of claim 1, the reference comprising a Uniform Resource Locator (URL). 4. The method of claim 1, the second reference comprising a Uniform Resource Locator (URL). 5. The method of claim 1, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 6. The method of claim 1, the reference comprising at least one of a local file system path, a networked file system path or a memory location. 7. The method of claim 1, at least one of the supplemental data or the second supplemental data external to a source from which the data originated. 8. A system, comprising:
one or more processing units; and memory comprising instructions that when executed by at least one of the one or more processing units, perform a method comprising:
receiving a notification that data comprising a reference has been placed on a clipboard;
adding supplemental data to the clipboard using the reference, the reference referencing a feed, the supplemental data comprising content of the feed; and
adding second supplemental data to the clipboard using a second reference within the supplemental data, the second supplemental data comprising content of a second feed. 9. The system of claim 8, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 10. The system of claim 8, the reference comprising a Uniform Resource Locator (URL). 11. The system of claim 10, the second reference comprising a Uniform Resource Locator (URL). 12. The system of claim 8, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 13. The system of claim 8, the reference comprising at least one of a local file system path, a networked file system path or a memory location. 14. The system of claim 8, at least one of the supplemental data or the second supplemental data external to a source from which the data originated. 15. A computer readable medium comprising instructions that when executed perform a method, comprising:
receiving a notification that data comprising a reference has been placed on a clipboard; adding additional data to the clipboard using the reference, the reference referencing a feed, the additional data comprising content of the feed; and adding second additional data to the clipboard using a second reference within the additional data, the second additional data comprising content of a second feed. 16. The computer readable medium of claim 15, at least one of the feed or the second feed comprising at least one of a Really Simple Syndication feed, an Atom feed or another feed. 17. The computer readable medium of claim 15, the reference comprising a Uniform Resource Locator (URL). 18. The computer readable medium of claim 15, the second reference comprising a Uniform Resource Locator (URL). 19. The computer readable medium of claim 15, the data associated with a format comprising one or more of:
a structured data item; a feed data item; or a presentation data item. 20. The computer readable medium of claim 15, the reference comprising at least one of a local file system path, a networked file system path or a memory location. | 2,100 |
4,617 | 14,510,829 | 2,131 | Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data, where for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. | 1. A machine implemented method, comprising:
analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 2. The method of claim 1, further comprising:
reconfiguring a set of cache blocks when input to the hashing function changes from the first input to the second input; wherein one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 3. The method of claim 2, wherein the reconfiguring comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 4. The method of claim 3, further comprising:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 5. The method of claim 1, further comprising:
determining a subset of cache blocks within the set of cache blocks associated with a new I/O request; and processing the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 6. The method of claim 5, further comprising:
processing the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 7. The method of claim 6, further comprising:
queuing the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 8. A non-transitory, machine readable storage medium having stored thereon instructions for performing a method, comprising machine executable code which when executed by at least one machine, causes the machine to:
analyze a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 9. The storage medium of claim 8, wherein the instructions, further causing the machine to:
reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 10. The storage medium of claim 9, wherein the reconfiguration comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 11. The storage medium of claim 10, wherein the reconfiguration further comprises:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 12. The storage medium of claim 8, wherein the instructions, further causing the machine to:
determine a subset of cache blocks within the set of cache blocks associated with a new I/O request; and process the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 13. The storage medium of claim 12, wherein the instructions, further causing the machine to:
process the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 14. The storage medium of claim 13, wherein the instructions, further causing the machine to:
queue the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 15. A system comprising:
a memory containing machine readable medium comprising machine executable code having stored thereon instructions; and a processor module coupled to the memory, the processor module configured to execute the machine executable code to: analyze a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 16. The system of claim 15, wherein the processor module further executes the machine executable code to:
reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 17. The system of claim 16, wherein the reconfiguration comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 18. The system of claim 17, wherein the reconfiguration further comprises:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 19. The system of claim 15, wherein the processor module further executes the machine executable code to:
determine a subset of cache blocks within the set of cache blocks associated with a new I/O request; and process the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 20. The system of claim 19, wherein the processor module further executes the machine executable code to:
process the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 21. The system of claim 20, wherein the processor module further executes the machine executable code to:
queue the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. | Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data, where for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value.1. A machine implemented method, comprising:
analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 2. The method of claim 1, further comprising:
reconfiguring a set of cache blocks when input to the hashing function changes from the first input to the second input; wherein one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 3. The method of claim 2, wherein the reconfiguring comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 4. The method of claim 3, further comprising:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 5. The method of claim 1, further comprising:
determining a subset of cache blocks within the set of cache blocks associated with a new I/O request; and processing the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 6. The method of claim 5, further comprising:
processing the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 7. The method of claim 6, further comprising:
queuing the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 8. A non-transitory, machine readable storage medium having stored thereon instructions for performing a method, comprising machine executable code which when executed by at least one machine, causes the machine to:
analyze a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 9. The storage medium of claim 8, wherein the instructions, further causing the machine to:
reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 10. The storage medium of claim 9, wherein the reconfiguration comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 11. The storage medium of claim 10, wherein the reconfiguration further comprises:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 12. The storage medium of claim 8, wherein the instructions, further causing the machine to:
determine a subset of cache blocks within the set of cache blocks associated with a new I/O request; and process the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 13. The storage medium of claim 12, wherein the instructions, further causing the machine to:
process the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 14. The storage medium of claim 13, wherein the instructions, further causing the machine to:
queue the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 15. A system comprising:
a memory containing machine readable medium comprising machine executable code having stored thereon instructions; and a processor module coupled to the memory, the processor module configured to execute the machine executable code to: analyze a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 16. The system of claim 15, wherein the processor module further executes the machine executable code to:
reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 17. The system of claim 16, wherein the reconfiguration comprises:
selecting a Logical Block Address (LBA) range for reconfiguring a sub-set of cache blocks; locking a stripe associated with the sub-set of cache blocks to deny access to the sub-set of cache blocks that are being re-configured; associating each of the sub-set of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 18. The system of claim 17, wherein the reconfiguration further comprises:
tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 19. The system of claim 15, wherein the processor module further executes the machine executable code to:
determine a subset of cache blocks within the set of cache blocks associated with a new I/O request; and process the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 20. The system of claim 19, wherein the processor module further executes the machine executable code to:
process the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 21. The system of claim 20, wherein the processor module further executes the machine executable code to:
queue the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. | 2,100 |
4,618 | 13,951,635 | 2,182 | An apparatus for detecting integrity violation includes a feedback shift register including a plurality of registers connected in series, and a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers. The apparatus further includes an integrity violation detector adapted to determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence. The apparatus is further adapted to output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence, or to output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. | 1. An apparatus, comprising:
a feedback shift register comprising:
a plurality of registers connected in series, and
a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; and
an integrity violation detector adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and
output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or
output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 2. The apparatus according to claim 1, wherein the integrity violation detector comprises an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value. 3. The apparatus according to claim 2, wherein the feedback function unit is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, and an online tester is connected to the output of the preceding register. 4. The apparatus according to claim 2, wherein a seed injection input is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, a logic circuit is connected in parallel between the output of the register and the output of the preceding register, and an online tester is connected to the output of the logic circuit. 5. The apparatus according to claim 4, wherein the logic circuit comprises a series connection of a register and an XOR-gate, wherein the output of the XOR-gate is connected to the online tester. 6. The apparatus according to claim 4, wherein the output of the preceding register is connected to the online tester in-line. 7. The apparatus according to claim 2, wherein the online tester is connected to the input of a first register of the feedback shift register in-line. 8. The apparatus according to claim 1, wherein the registers are configured by flip-flops. 9. The apparatus according to claim 1, wherein the feedback shift register is a linear or a nonlinear feedback shift register. 10. The apparatus according to claim 1, wherein the feedback shift register comprises an output for putting out pseudorandom value sequences, the output being formed by the output of at least one of the registers. 11. The apparatus according to claim 1, wherein the feedback function unit implements either a linear or a nonlinear function. 12. The apparatus according to claim 1, wherein the feedback shift register is in a Fibonacci-configuration or in a Galois-configuration. 13. An apparatus, comprising:
a feedback shift register in a Fibonacci-configuration or in a Galois-configuration, the feedback shift register comprising:
a plurality of registers connected in series, and
a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; and
an integrity violation detector adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and
output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or
output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence;
wherein the integrity violation detector comprises an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and
output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value;
wherein the feedback function unit is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, and an online tester is connected to the output of the preceding register; and/or a seed injection input is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, a logic circuit is connected in parallel between the output of the register and the output of the preceding register, and an online tester is connected to the output of the logic circuit; and/or the logic circuit comprises a series connection of a register and an XOR-gate, wherein the output of the XOR-gate is connected to the online tester; and/or the output of the preceding register is connected to the online tester in-line; and/or the online tester is connected to the input of a first register of the feedback shift register in-line. 14. An integrity violation detector adapted to detect an integrity violation exerted on an associated feedback shift register configured by a plurality of registers, the integrity violation detector being further adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 15. The integrity violation detector according to claim 14 comprising an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and
output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value. 16. A method for detecting an integrity violation exerted on a feedback shift register, the feedback shift register comprising:
a plurality of registers connected in series, and a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; the method comprising: determining as to whether a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 17. The method according to claim 16, the method comprising:
receiving a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof; counting the length of runs of 0-Bits and 1-Bits; and indicating the detection of integrity violation if the length of a run exceeds a predetermined value. 18. A non-transitory storage medium having stored thereon a computer program having a program code for performing, when running on a computer, a method for detecting an integrity violation exerted on a feedback shift register, the method comprising:
determining as to whether a sequence of values at an input or output of at least one of a plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 19. An embedded system comprising a memory and a controller, wherein the controller is adapted to detect an integrity violation exerted on an feedback shift register implemented in software by a method comprising:
determining as to whether a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 20. The embedded system according to claim 19, wherein the embedded system comprises a smartcard controller, an RFID tag or an embedded security controller. | An apparatus for detecting integrity violation includes a feedback shift register including a plurality of registers connected in series, and a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers. The apparatus further includes an integrity violation detector adapted to determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence. The apparatus is further adapted to output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence, or to output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence.1. An apparatus, comprising:
a feedback shift register comprising:
a plurality of registers connected in series, and
a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; and
an integrity violation detector adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and
output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or
output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 2. The apparatus according to claim 1, wherein the integrity violation detector comprises an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value. 3. The apparatus according to claim 2, wherein the feedback function unit is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, and an online tester is connected to the output of the preceding register. 4. The apparatus according to claim 2, wherein a seed injection input is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, a logic circuit is connected in parallel between the output of the register and the output of the preceding register, and an online tester is connected to the output of the logic circuit. 5. The apparatus according to claim 4, wherein the logic circuit comprises a series connection of a register and an XOR-gate, wherein the output of the XOR-gate is connected to the online tester. 6. The apparatus according to claim 4, wherein the output of the preceding register is connected to the online tester in-line. 7. The apparatus according to claim 2, wherein the online tester is connected to the input of a first register of the feedback shift register in-line. 8. The apparatus according to claim 1, wherein the registers are configured by flip-flops. 9. The apparatus according to claim 1, wherein the feedback shift register is a linear or a nonlinear feedback shift register. 10. The apparatus according to claim 1, wherein the feedback shift register comprises an output for putting out pseudorandom value sequences, the output being formed by the output of at least one of the registers. 11. The apparatus according to claim 1, wherein the feedback function unit implements either a linear or a nonlinear function. 12. The apparatus according to claim 1, wherein the feedback shift register is in a Fibonacci-configuration or in a Galois-configuration. 13. An apparatus, comprising:
a feedback shift register in a Fibonacci-configuration or in a Galois-configuration, the feedback shift register comprising:
a plurality of registers connected in series, and
a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; and
an integrity violation detector adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and
output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or
output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence;
wherein the integrity violation detector comprises an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and
output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value;
wherein the feedback function unit is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, and an online tester is connected to the output of the preceding register; and/or a seed injection input is connected to the input of one of the plurality of registers via an XOR-gate, which is connected between the register and a preceding register, a logic circuit is connected in parallel between the output of the register and the output of the preceding register, and an online tester is connected to the output of the logic circuit; and/or the logic circuit comprises a series connection of a register and an XOR-gate, wherein the output of the XOR-gate is connected to the online tester; and/or the output of the preceding register is connected to the online tester in-line; and/or the online tester is connected to the input of a first register of the feedback shift register in-line. 14. An integrity violation detector adapted to detect an integrity violation exerted on an associated feedback shift register configured by a plurality of registers, the integrity violation detector being further adapted to:
determine as to whether a sequence of values at an input or output of at least one of the registers, or a logic combination thereof, is a non-constant sequence or a constant sequence; and output an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or output an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 15. The integrity violation detector according to claim 14 comprising an online tester adapted to:
count a length of runs of 0-Bits and 1-Bits in an inbound sequence of values; and
output the indication that the feedback shift register is subjected to the integrity violation if the length of runs exceeds a predetermined value. 16. A method for detecting an integrity violation exerted on a feedback shift register, the feedback shift register comprising:
a plurality of registers connected in series, and a feedback function unit connected between an output of a number of the registers and an input of at least one of the registers; the method comprising: determining as to whether a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 17. The method according to claim 16, the method comprising:
receiving a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof; counting the length of runs of 0-Bits and 1-Bits; and indicating the detection of integrity violation if the length of a run exceeds a predetermined value. 18. A non-transitory storage medium having stored thereon a computer program having a program code for performing, when running on a computer, a method for detecting an integrity violation exerted on a feedback shift register, the method comprising:
determining as to whether a sequence of values at an input or output of at least one of a plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 19. An embedded system comprising a memory and a controller, wherein the controller is adapted to detect an integrity violation exerted on an feedback shift register implemented in software by a method comprising:
determining as to whether a sequence of values at an input or output of at least one of the plurality of registers comprised by the feedback shift register, or a logic combination thereof, is a non-constant sequence or a constant sequence; and putting out an indication that the feedback shift register is in an integral state if the sequence of values is a non-constant sequence; or putting out an indication that the feedback shift register is subjected to an integrity violation if the sequence of values is a constant sequence. 20. The embedded system according to claim 19, wherein the embedded system comprises a smartcard controller, an RFID tag or an embedded security controller. | 2,100 |
4,619 | 12,274,919 | 2,141 | In accordance with an example embodiment of the present invention, an apparatus, comprising a processor configured to associate a first virtual screen with a first user identity receive input for transitioning from the first virtual screen to a second virtual screen, and associate the second virtual screen with a second user identity based at least in part on the input is disclosed. | 1. An apparatus, comprising:
a processor configured to
associate a first virtual screen with a first user identity;
receive input for transitioning from said first virtual screen to a second virtual screen; and
associate said second virtual screen with a second user identity based at least in part on said input. 2. The apparatus of claim 1, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 3. The apparatus of claim 1, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity 4. The apparatus of claim 1, wherein said processor is further configured to display information associated with said first virtual screen. 5. The apparatus of claim 4, wherein said displaying comprises utilizing a frame related to said first virtual screen to display at least part of said virtual screen. 6. The apparatus of claim 1, wherein said processor is further configured to transition from said first virtual screen to said second virtual screen in response to said input. 7. The apparatus of claim 6, wherein said transitioning comprises utilizing a frame related to said first virtual screen to display at least part of said virtual screen. 8. The apparatus of claim 1, wherein said user identity comprises a subscriber identity module. 9. The apparatus of claim 1, wherein said received input relates to touch display input. 10. The apparatus of claim 1, wherein said received input relates to a movement towards a virtual location of said second virtual screen to indicate said transition. 11. The apparatus of claim 1, wherein said received input relates to panning a frame beyond a boundary of said first virtual screen to indicate said transition. 12. The apparatus of claim 1, wherein said processor is further configured to disable said first user identity. 13. The apparatus of claim 1, wherein the processor comprises at least one memory that contains executable instructions that if executed by the processor cause the apparatus to associate a first virtual screen with a first user identity, receive input indicating a transition from said first virtual screen to a second virtual screen, and associate said second virtual screen with a second user identity based at least in part on said transition. 14. A method, comprising:
associating a first virtual screen with a first user identity; receiving input for transitioning from said first virtual screen to a second virtual screen; and associating said second virtual screen with a second user identity based at least in part on said input. 15. The method of claim 14, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 16. The method of claim 14, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 17. The method of claim 14, further comprising displaying information associated with said first virtual screen. 18. The method of claim 14, further comprising transitioning from said first virtual screen to said second virtual screen in response to said input. 19. The method of claim 14, wherein said user identity comprises a subscriber identity module. 20. The method of claim 14, wherein said received input relates to touch display input. 21. The method of claim 14, wherein said received input relates to a movement towards a virtual location of said second virtual screen to indicate said transition. 22. The method of claim 14, wherein said received input relates to panning a frame beyond a boundary of said first virtual screen to indicate said transition. 23. The method of claim 14, further comprising disabling said first user identity. 24. A computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code comprising:
code for associating a first virtual screen with a first user identity code for receiving input for transitioning from said first virtual screen to a second virtual screen; and code for associating said second virtual screen with a second user identity based at least in part on said transition. 25. The computer program product of claim 24, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 26. The computer program product of claim 24, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 27. A computer-readable medium encoded with instructions that, when executed by a computer, perform:
associating a first virtual screen with a first user identity receiving input for transitioning from said first virtual screen to a second virtual screen; and associating said second virtual screen with a second user identity based at least in part on said transition. 28. The computer-readable medium of claim 27, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 29. The computer-readable medium of claim 27, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 30. An apparatus, comprising:
means for associating a first virtual screen with a first user identity; means for receiving input for transitioning from said first virtual screen to a second virtual screen; and means for associating said second virtual screen with a second user identity based at least in part on said input. | In accordance with an example embodiment of the present invention, an apparatus, comprising a processor configured to associate a first virtual screen with a first user identity receive input for transitioning from the first virtual screen to a second virtual screen, and associate the second virtual screen with a second user identity based at least in part on the input is disclosed.1. An apparatus, comprising:
a processor configured to
associate a first virtual screen with a first user identity;
receive input for transitioning from said first virtual screen to a second virtual screen; and
associate said second virtual screen with a second user identity based at least in part on said input. 2. The apparatus of claim 1, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 3. The apparatus of claim 1, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity 4. The apparatus of claim 1, wherein said processor is further configured to display information associated with said first virtual screen. 5. The apparatus of claim 4, wherein said displaying comprises utilizing a frame related to said first virtual screen to display at least part of said virtual screen. 6. The apparatus of claim 1, wherein said processor is further configured to transition from said first virtual screen to said second virtual screen in response to said input. 7. The apparatus of claim 6, wherein said transitioning comprises utilizing a frame related to said first virtual screen to display at least part of said virtual screen. 8. The apparatus of claim 1, wherein said user identity comprises a subscriber identity module. 9. The apparatus of claim 1, wherein said received input relates to touch display input. 10. The apparatus of claim 1, wherein said received input relates to a movement towards a virtual location of said second virtual screen to indicate said transition. 11. The apparatus of claim 1, wherein said received input relates to panning a frame beyond a boundary of said first virtual screen to indicate said transition. 12. The apparatus of claim 1, wherein said processor is further configured to disable said first user identity. 13. The apparatus of claim 1, wherein the processor comprises at least one memory that contains executable instructions that if executed by the processor cause the apparatus to associate a first virtual screen with a first user identity, receive input indicating a transition from said first virtual screen to a second virtual screen, and associate said second virtual screen with a second user identity based at least in part on said transition. 14. A method, comprising:
associating a first virtual screen with a first user identity; receiving input for transitioning from said first virtual screen to a second virtual screen; and associating said second virtual screen with a second user identity based at least in part on said input. 15. The method of claim 14, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 16. The method of claim 14, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 17. The method of claim 14, further comprising displaying information associated with said first virtual screen. 18. The method of claim 14, further comprising transitioning from said first virtual screen to said second virtual screen in response to said input. 19. The method of claim 14, wherein said user identity comprises a subscriber identity module. 20. The method of claim 14, wherein said received input relates to touch display input. 21. The method of claim 14, wherein said received input relates to a movement towards a virtual location of said second virtual screen to indicate said transition. 22. The method of claim 14, wherein said received input relates to panning a frame beyond a boundary of said first virtual screen to indicate said transition. 23. The method of claim 14, further comprising disabling said first user identity. 24. A computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code comprising:
code for associating a first virtual screen with a first user identity code for receiving input for transitioning from said first virtual screen to a second virtual screen; and code for associating said second virtual screen with a second user identity based at least in part on said transition. 25. The computer program product of claim 24, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 26. The computer program product of claim 24, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 27. A computer-readable medium encoded with instructions that, when executed by a computer, perform:
associating a first virtual screen with a first user identity receiving input for transitioning from said first virtual screen to a second virtual screen; and associating said second virtual screen with a second user identity based at least in part on said transition. 28. The computer-readable medium of claim 27, wherein said associating said first virtual screen with said first user identity comprises utilizing information related to said first user identity. 29. The computer-readable medium of claim 27, wherein said associating said second virtual screen with said second user identity comprises utilizing information related to said second user identity. 30. An apparatus, comprising:
means for associating a first virtual screen with a first user identity; means for receiving input for transitioning from said first virtual screen to a second virtual screen; and means for associating said second virtual screen with a second user identity based at least in part on said input. | 2,100 |
4,620 | 13,804,545 | 2,119 | The disclosure relates to a content-based control system for controlling a smart home. The control system includes a client terminal connectable to a media content provider and a home automation interface operable to connect with a smart home controller. The system may allow settings and ambience to be controlled according to current media content being consumed and the media consumers social environment. | 1. A content-based control system, comprising:
a processor configured to use a software application; a client terminal connectable to a media content provider and to a media renderer; a home automation interface operable to connect with a smart home controller; and a media renderer connectable to said media content provider. 2. The content-based control system of claim 1, wherein said software application comprises:
a. a management module configured to create an overlay superimposed upon the screen of the media renderer; b. a social configuration module, configured to manage one or more social space; c. an authorization module, configured to manage the assignment of permissions to members of said one or more social spaces; and d. an integration module, configured to manage integration with the smart home controller. 3. The content-based control system of claim 1, wherein said at least one media renderer is selected from the group consisting of a television, a tablet, a smartphone, a personal computer and laptop. 4. The content-based control system of claim 1, wherein the smart home controller is operable to control one or more household devices. 5. The content based control system of claim 4, where said household devices are selected from the group consisting of: a light, an air-conditioner, a window shade, a water boiler, coffee maker, an oven, a stove, a microwave, a popcorn maker, a phone, a washing machine and a dishwasher. 6. The content-based control system of claim 1, wherein the smart home controller is operable to transmit controls to and receive input from one or more sensors. 7. The content-based control system of claim 6, wherein the sensors are selected from the group consisting of light sensors, sound sensors and motion sensors. 8. The content-based control system of claim 1, wherein said processor is incorporated in the client terminal. 9. The content-based control system of claim 1, wherein said client terminal is connectable to said media content provider through a network based communication channel selected from the group consisting of internet based communication, cellular based communication and a combination thereof. 10. The content-based control system of claim 9, wherein said processor is incorporated in a remote central unit. 11. A method for controlling ambience comprising the step of:
engaging a current content; generating at least one ambience structure operable to generate an ambience based on at least one input structure; and transmitting said at least one ambience structure to generate a desired ambience, wherein the ambience structure is transmitted through a home automation interface to a smart home controller or a media renderer. 12. The method of claim 11, wherein the media renderer is selected from the group consisting of a television, a tablet, a smartphone, a personal computer and a laptop. 13. The method of claim 11, wherein said at least one ambience structure is generated based on one or a combination of input structures selected from the group consisting of the current content, a personal preference input, a content history input, a social network input, and a physical setting input, wherein:
the personal preference input reflects viewing preference based on preference data; the content history input reflects viewing preference based on content viewing history; the social network input reflects collaborating information social spaces; and the physical setting input reflects the reading of at least one sensor connected to the smart home controller. 14. The method of claim 13, wherein the physical setting input reflects the current reading of at least one sensor connected to the smart home controller. 15. The method of claim 13, wherein the physical setting input reflects prior sensor readings for determining a preferred ambience. 16. The method of claim 13, wherein the sensor is selected from the group consisting of a light sensor, a sound sensor, and a motion detector. 17. The method of claim 11, wherein said at least one ambience structure generates a desired ambience through controlling the function of at least one home device through the smart home controller. 18. The method of claim 17, wherein the home device is selected from a group consisting of a light, an air-conditioner, a window shade, a water boiler, coffee maker, an oven, a stove, a microwave, a popcorn maker, a phone, a washing machine and a dishwasher. 19. The method of claim 11, wherein said at least one ambience structure may generate a desired ambience through controlling a function of the media renderer. 20. The method of claim 19, wherein said function of the media renderer is selected from the group consisting of: screen brightness, and audio volume. 21. The method of claim 11, wherein the step of engaging a current content is selected from the group consisting of: activating a media renderer; and selecting the current content for presentation in the media renderer. 22. A home ambience management software comprising:
a. a management module configured to create an overlay superimposed upon the screen of a media renderer; b. a social configuration module, configured to manage one or more social spaces; c. an authorization module, configured to manage the assignment of permissions to members of said one or more social spaces; and d. an integration module, configured to manage integration with a smart home controller. | The disclosure relates to a content-based control system for controlling a smart home. The control system includes a client terminal connectable to a media content provider and a home automation interface operable to connect with a smart home controller. The system may allow settings and ambience to be controlled according to current media content being consumed and the media consumers social environment.1. A content-based control system, comprising:
a processor configured to use a software application; a client terminal connectable to a media content provider and to a media renderer; a home automation interface operable to connect with a smart home controller; and a media renderer connectable to said media content provider. 2. The content-based control system of claim 1, wherein said software application comprises:
a. a management module configured to create an overlay superimposed upon the screen of the media renderer; b. a social configuration module, configured to manage one or more social space; c. an authorization module, configured to manage the assignment of permissions to members of said one or more social spaces; and d. an integration module, configured to manage integration with the smart home controller. 3. The content-based control system of claim 1, wherein said at least one media renderer is selected from the group consisting of a television, a tablet, a smartphone, a personal computer and laptop. 4. The content-based control system of claim 1, wherein the smart home controller is operable to control one or more household devices. 5. The content based control system of claim 4, where said household devices are selected from the group consisting of: a light, an air-conditioner, a window shade, a water boiler, coffee maker, an oven, a stove, a microwave, a popcorn maker, a phone, a washing machine and a dishwasher. 6. The content-based control system of claim 1, wherein the smart home controller is operable to transmit controls to and receive input from one or more sensors. 7. The content-based control system of claim 6, wherein the sensors are selected from the group consisting of light sensors, sound sensors and motion sensors. 8. The content-based control system of claim 1, wherein said processor is incorporated in the client terminal. 9. The content-based control system of claim 1, wherein said client terminal is connectable to said media content provider through a network based communication channel selected from the group consisting of internet based communication, cellular based communication and a combination thereof. 10. The content-based control system of claim 9, wherein said processor is incorporated in a remote central unit. 11. A method for controlling ambience comprising the step of:
engaging a current content; generating at least one ambience structure operable to generate an ambience based on at least one input structure; and transmitting said at least one ambience structure to generate a desired ambience, wherein the ambience structure is transmitted through a home automation interface to a smart home controller or a media renderer. 12. The method of claim 11, wherein the media renderer is selected from the group consisting of a television, a tablet, a smartphone, a personal computer and a laptop. 13. The method of claim 11, wherein said at least one ambience structure is generated based on one or a combination of input structures selected from the group consisting of the current content, a personal preference input, a content history input, a social network input, and a physical setting input, wherein:
the personal preference input reflects viewing preference based on preference data; the content history input reflects viewing preference based on content viewing history; the social network input reflects collaborating information social spaces; and the physical setting input reflects the reading of at least one sensor connected to the smart home controller. 14. The method of claim 13, wherein the physical setting input reflects the current reading of at least one sensor connected to the smart home controller. 15. The method of claim 13, wherein the physical setting input reflects prior sensor readings for determining a preferred ambience. 16. The method of claim 13, wherein the sensor is selected from the group consisting of a light sensor, a sound sensor, and a motion detector. 17. The method of claim 11, wherein said at least one ambience structure generates a desired ambience through controlling the function of at least one home device through the smart home controller. 18. The method of claim 17, wherein the home device is selected from a group consisting of a light, an air-conditioner, a window shade, a water boiler, coffee maker, an oven, a stove, a microwave, a popcorn maker, a phone, a washing machine and a dishwasher. 19. The method of claim 11, wherein said at least one ambience structure may generate a desired ambience through controlling a function of the media renderer. 20. The method of claim 19, wherein said function of the media renderer is selected from the group consisting of: screen brightness, and audio volume. 21. The method of claim 11, wherein the step of engaging a current content is selected from the group consisting of: activating a media renderer; and selecting the current content for presentation in the media renderer. 22. A home ambience management software comprising:
a. a management module configured to create an overlay superimposed upon the screen of a media renderer; b. a social configuration module, configured to manage one or more social spaces; c. an authorization module, configured to manage the assignment of permissions to members of said one or more social spaces; and d. an integration module, configured to manage integration with a smart home controller. | 2,100 |
4,621 | 14,557,881 | 2,192 | An apparatus for performing data processing in a single program multiple data fashion on a target data set is provided, having execution circuitry configured to execute multiple threads, thread schedule configuration storage configured to store information defining a plurality of thread schedule configurations, and thread scheduling circuitry configured to cause the execution circuitry to execute the multiple threads in a selected order defined by a selected thread schedule configuration. A method of operating the apparatus, as well as a method of compiling a source program for the apparatus are also provided. | 1. Apparatus for performing data processing in a single program multiple data fashion on a target data set, the apparatus comprising:
execution circuitry configured to execute multiple threads to perform the data processing; thread schedule configuration storage configured to store information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed by the execution circuitry; and thread scheduling circuitry configured to cause the execution circuitry to execute the multiple threads in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. 2. The apparatus as claimed in claim 1, further comprising performance control circuitry configured to gather performance data relating to the data processing performed by the execution circuitry and to generate the thread schedule selection signal in dependence on the performance data. 3. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to control a performance analysis process, the performance analysis process comprising the steps of:
selecting a minority subset of the multiple threads which are to be executed; controlling the execution circuitry to execute a first subset of the minority subset of the multiple threads in a first selected order defined by a first thread schedule configuration; changing the thread schedule selection signal to cause the execution circuitry to execute a next subset of the minority subset of the multiple threads in a next selected order defined by a next thread schedule configuration; and repeating the changing step until all threads of the minority subset of threads have been executed by the execution circuitry, wherein the performance control circuitry is configured to set the thread selection signal to cause the execution circuitry to execute a majority remaining subset of the multiple threads which are to be executed to perform the data processing on the target data set in an order defined by a selected thread schedule tested in the performance analysis process. 4. The apparatus as claimed in claim 3, wherein the first subset and next subset each correspond to a workgroup of threads, wherein a workgroup of threads is a selected subset of the multiple threads defined by a programmer of the apparatus or set by default. 5. The apparatus as claimed in claim 3, wherein at least some of the plurality of thread schedule configurations are further configured in dependence on a control parameter and the performance analysis process further comprises gathering performance data relating to the data processing performed by the execution circuitry for a plurality of values of the control parameter. 6. The apparatus as claimed in claim 5, wherein the plurality of values of the control parameter corresponds to a geometric progression of the control parameter. 7. The apparatus as claimed in claim 6, wherein the geometric progression is powers of two of the control parameter. 8. The apparatus as claimed in claim 5, wherein the control parameter is a stride value, the stride value determining a number of threads which are skipped to find a next thread in the selected order, the next thread in the selected order being determined subject to a modulo of a total number of the multiple threads. 9. The apparatus as claimed in claim 5, wherein the control parameter is at least one tiling dimension value, the tiling dimension value determining a dimension of tiles within an at least two-dimensional coordinate space of the threads, and wherein the selected order causes the execution circuitry to execute the multiple threads on a tile-by-tile basis. 10. The apparatus as claimed in claim 3, wherein the performance control circuitry is configured to repeat the performance analysis process at predetermined intervals. 11. The apparatus as claimed in claim 3, wherein the performance control circuitry is configured to select the minority subset of the threads to start at a predetermined offset from a beginning of all the multiple threads. 12. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to measure a performance versus time taken metric for the data processing as the performance data. 13. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to measure an energy use metric for the data processing as the performance data. 14. The apparatus as claimed in claim 2, wherein the performance control circuitry comprises at least one event counter configured to count occurrences of a predetermined event during the data processing as the performance data. 15. The apparatus as claimed in claim 14, wherein the predetermined event is a cache miss in a cache which forms part of the apparatus. 16. The apparatus as claimed in claim 15, wherein the execution circuitry comprises multiple processor cores and the cache is shared by the multiple processor cores. 17. The apparatus as claimed in claim 1, further configured to receive the thread schedule selection signal from an external source. 18. The apparatus as claimed in claim 17, wherein the apparatus is configured to receive a set of instructions defining the data processing to be performed in the single program multiple data fashion on the target data set, wherein the thread schedule selection signal is generated by the apparatus in dependence on a thread schedule selection value definition associated with the set of instructions. 19. A method of performing data processing in a single program multiple data fashion on a target data set, the method comprising the steps of:
executing multiple threads to perform the data processing; storing information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed in the executing step; and controlling the execution of the multiple threads to be in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. 20. Apparatus for performing data processing in a single program multiple data fashion on a target data set comprising:
means for executing multiple threads to perform the data processing; means for storing information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed by the means for executing multiple threads; and means for controlling the execution of the multiple threads to be in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. | An apparatus for performing data processing in a single program multiple data fashion on a target data set is provided, having execution circuitry configured to execute multiple threads, thread schedule configuration storage configured to store information defining a plurality of thread schedule configurations, and thread scheduling circuitry configured to cause the execution circuitry to execute the multiple threads in a selected order defined by a selected thread schedule configuration. A method of operating the apparatus, as well as a method of compiling a source program for the apparatus are also provided.1. Apparatus for performing data processing in a single program multiple data fashion on a target data set, the apparatus comprising:
execution circuitry configured to execute multiple threads to perform the data processing; thread schedule configuration storage configured to store information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed by the execution circuitry; and thread scheduling circuitry configured to cause the execution circuitry to execute the multiple threads in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. 2. The apparatus as claimed in claim 1, further comprising performance control circuitry configured to gather performance data relating to the data processing performed by the execution circuitry and to generate the thread schedule selection signal in dependence on the performance data. 3. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to control a performance analysis process, the performance analysis process comprising the steps of:
selecting a minority subset of the multiple threads which are to be executed; controlling the execution circuitry to execute a first subset of the minority subset of the multiple threads in a first selected order defined by a first thread schedule configuration; changing the thread schedule selection signal to cause the execution circuitry to execute a next subset of the minority subset of the multiple threads in a next selected order defined by a next thread schedule configuration; and repeating the changing step until all threads of the minority subset of threads have been executed by the execution circuitry, wherein the performance control circuitry is configured to set the thread selection signal to cause the execution circuitry to execute a majority remaining subset of the multiple threads which are to be executed to perform the data processing on the target data set in an order defined by a selected thread schedule tested in the performance analysis process. 4. The apparatus as claimed in claim 3, wherein the first subset and next subset each correspond to a workgroup of threads, wherein a workgroup of threads is a selected subset of the multiple threads defined by a programmer of the apparatus or set by default. 5. The apparatus as claimed in claim 3, wherein at least some of the plurality of thread schedule configurations are further configured in dependence on a control parameter and the performance analysis process further comprises gathering performance data relating to the data processing performed by the execution circuitry for a plurality of values of the control parameter. 6. The apparatus as claimed in claim 5, wherein the plurality of values of the control parameter corresponds to a geometric progression of the control parameter. 7. The apparatus as claimed in claim 6, wherein the geometric progression is powers of two of the control parameter. 8. The apparatus as claimed in claim 5, wherein the control parameter is a stride value, the stride value determining a number of threads which are skipped to find a next thread in the selected order, the next thread in the selected order being determined subject to a modulo of a total number of the multiple threads. 9. The apparatus as claimed in claim 5, wherein the control parameter is at least one tiling dimension value, the tiling dimension value determining a dimension of tiles within an at least two-dimensional coordinate space of the threads, and wherein the selected order causes the execution circuitry to execute the multiple threads on a tile-by-tile basis. 10. The apparatus as claimed in claim 3, wherein the performance control circuitry is configured to repeat the performance analysis process at predetermined intervals. 11. The apparatus as claimed in claim 3, wherein the performance control circuitry is configured to select the minority subset of the threads to start at a predetermined offset from a beginning of all the multiple threads. 12. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to measure a performance versus time taken metric for the data processing as the performance data. 13. The apparatus as claimed in claim 2, wherein the performance control circuitry is configured to measure an energy use metric for the data processing as the performance data. 14. The apparatus as claimed in claim 2, wherein the performance control circuitry comprises at least one event counter configured to count occurrences of a predetermined event during the data processing as the performance data. 15. The apparatus as claimed in claim 14, wherein the predetermined event is a cache miss in a cache which forms part of the apparatus. 16. The apparatus as claimed in claim 15, wherein the execution circuitry comprises multiple processor cores and the cache is shared by the multiple processor cores. 17. The apparatus as claimed in claim 1, further configured to receive the thread schedule selection signal from an external source. 18. The apparatus as claimed in claim 17, wherein the apparatus is configured to receive a set of instructions defining the data processing to be performed in the single program multiple data fashion on the target data set, wherein the thread schedule selection signal is generated by the apparatus in dependence on a thread schedule selection value definition associated with the set of instructions. 19. A method of performing data processing in a single program multiple data fashion on a target data set, the method comprising the steps of:
executing multiple threads to perform the data processing; storing information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed in the executing step; and controlling the execution of the multiple threads to be in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. 20. Apparatus for performing data processing in a single program multiple data fashion on a target data set comprising:
means for executing multiple threads to perform the data processing; means for storing information defining a plurality of thread schedule configurations, each thread schedule configuration defining an order in which the multiple threads are to be executed by the means for executing multiple threads; and means for controlling the execution of the multiple threads to be in a selected order defined by a selected thread schedule configuration of the plurality of thread schedule configurations in response to a thread schedule selection signal. | 2,100 |
4,622 | 13,711,896 | 2,124 | Various embodiments of the invention allow for electronic labeling and identification of electronic equipment. Contact-based and contactless systems and methods to electronically associate hardware are described. | 1. An identification apparatus to associate devices, the identification apparatus comprising:
a first device comprising first and second power lines, the first and second power lines couple to an output connector that is configured to couple to a second device; a serial data line coupled to output connector, the serial data line serves to exchange data with the second device; and a memory coupled to the output connector via the serial data line, the memory stores identification data that associates the first device with the second device. 2. The identification apparatus according to claim 1, wherein the memory is coupled between the second power line and the serial data line. 3. The identification apparatus according to claim 1, wherein the identification data is permanently stored into serial memory. 4. The identification apparatus according to claim 1, wherein the serial data multiplexes power and data onto a single contact on the output connector. 5. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface and a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact positioned at the center axis of the body, the third contact receives and transmits a data signal. 6. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface; a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact disposed on the outer edge of the second concentric surface aligned co-linear with the second contact, the third contact receives and transmits a data signal. 7. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface; a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact disposed on the inner edge of the first concentric surface aligned co-linear with the first contact, the third contact receives and transmits a data signal. 8. An identification apparatus to associate devices, the identification apparatus comprising:
a power supply comprising an output connector, the power supply is configured to provide power signals of a first and second polarity to energize a counterpart device; a memory coupled to receive the power signal of the second polarity, the memory stores identification data that associates the power supply with the counterpart device; and a serial data line coupled between the power signal of the second polarity and the output connector, the serial data line enables data exchange between the memory and a reader. 9. An identification system to associate devices, the system comprising:
a power supply configured to couple to a counterpart device, the power supply is configured to provide power signals of a first and a second polarity; an output connector coupled to the power supply, the output connector receives a serial data signal; a memory coupled to an output of the output connector, the memory stores identifying data that identifies the counterpart device; at least one receptacle configured to couple to the output connector, the at least one receptacle receives the power signal of the second polarity and the serial data signal, wherein the serial data signal comprises the identifying data; a converter coupled to receive the serial data signal from the receptacle; and a reader coupled to the converter to receive the serial data signal. 10. The system according to claim 9, wherein the output connector further receives the power signals of the first and second polarity. 11. The system according to claim 9, wherein the memory is further coupled to the power signal of the first polarity. 12. An identification system to associate devices, the system comprising:
a power supply assembly comprising: a power supply coupled to a first power line and a second power line, the power supply assembly is configured to couple to a counterpart device; an output connector coupled to the power supply; and a memory coupled between the second power line and a serial data line, the first and second power lines and the serial data line are further coupled to an output of the output connector, the memory stores identifying data that identifies the counterpart device; at least one receptacle configured to couple the serial data line; a converter configured to receive the identifying data from the memory via the serial data signal that comprises the identifying data; and a reader coupled to receive the serial data signal. 13. The system according to claim 12, wherein the receptacle receives power from the power supply to power the receptacle. 14. An identification system to associate devices, the system comprising:
a power supply configured to couple to a counterpart device; a memory disposed on an integrated circuit chip, the memory is configured to store identifying data that identifies one or more properties of the counterpart device; and a contactless reading device configured to receive the identifying data via wireless communication. 15. The system according to claim 14, wherein the wireless communication is in accordance with a radio frequency communication standard. 16. The system according to claim 14, wherein the integrated circuit comprises a passive circuit to communicate with the contactless reading device, the passive circuit comprises a resonant structure that draws energy from an electromagnetic field generated by the contactless reading device. 17. The system according to claim 14, wherein the integrated circuit is an active transponder comprising a power storage device. 18. The system according to claim 14, wherein the memory is embedded within an output connector of the power supply. 19. The system according to claim 14, wherein the contactless reading device is a NFC transponder reader. 20. A method of associating devices, the method comprising:
receiving an output connector of a power supply assembly that comprises a memory with a receptacle that is coupled to a reader assembly; establishing a communication between the memory and the reader assembly; reading identification data that is stored on the memory; converting the identification data to a displayable format; and displaying the formatted data on a display unit. 21. The method according to claim 20, wherein establishing a communication further comprises adding a data protection that provides secure communication determining that a connection has been made. 22. The method according to claim 20, wherein establishing a communication further comprises adding a data protection that provides secure communication between the memory and the reader assembly. | Various embodiments of the invention allow for electronic labeling and identification of electronic equipment. Contact-based and contactless systems and methods to electronically associate hardware are described.1. An identification apparatus to associate devices, the identification apparatus comprising:
a first device comprising first and second power lines, the first and second power lines couple to an output connector that is configured to couple to a second device; a serial data line coupled to output connector, the serial data line serves to exchange data with the second device; and a memory coupled to the output connector via the serial data line, the memory stores identification data that associates the first device with the second device. 2. The identification apparatus according to claim 1, wherein the memory is coupled between the second power line and the serial data line. 3. The identification apparatus according to claim 1, wherein the identification data is permanently stored into serial memory. 4. The identification apparatus according to claim 1, wherein the serial data multiplexes power and data onto a single contact on the output connector. 5. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface and a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact positioned at the center axis of the body, the third contact receives and transmits a data signal. 6. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface; a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact disposed on the outer edge of the second concentric surface aligned co-linear with the second contact, the third contact receives and transmits a data signal. 7. The identification apparatus according to claim 1, wherein the output connector comprises:
a body defined by insulating material enclosed between a first and a second concentric surface along the center axis of the body; a first contact disposed on an inner edge of the first concentric surface; a second contact disposed on an outer edge of the second concentric surface, the first and second contact receive and transmit power signals; and a third contact disposed on the inner edge of the first concentric surface aligned co-linear with the first contact, the third contact receives and transmits a data signal. 8. An identification apparatus to associate devices, the identification apparatus comprising:
a power supply comprising an output connector, the power supply is configured to provide power signals of a first and second polarity to energize a counterpart device; a memory coupled to receive the power signal of the second polarity, the memory stores identification data that associates the power supply with the counterpart device; and a serial data line coupled between the power signal of the second polarity and the output connector, the serial data line enables data exchange between the memory and a reader. 9. An identification system to associate devices, the system comprising:
a power supply configured to couple to a counterpart device, the power supply is configured to provide power signals of a first and a second polarity; an output connector coupled to the power supply, the output connector receives a serial data signal; a memory coupled to an output of the output connector, the memory stores identifying data that identifies the counterpart device; at least one receptacle configured to couple to the output connector, the at least one receptacle receives the power signal of the second polarity and the serial data signal, wherein the serial data signal comprises the identifying data; a converter coupled to receive the serial data signal from the receptacle; and a reader coupled to the converter to receive the serial data signal. 10. The system according to claim 9, wherein the output connector further receives the power signals of the first and second polarity. 11. The system according to claim 9, wherein the memory is further coupled to the power signal of the first polarity. 12. An identification system to associate devices, the system comprising:
a power supply assembly comprising: a power supply coupled to a first power line and a second power line, the power supply assembly is configured to couple to a counterpart device; an output connector coupled to the power supply; and a memory coupled between the second power line and a serial data line, the first and second power lines and the serial data line are further coupled to an output of the output connector, the memory stores identifying data that identifies the counterpart device; at least one receptacle configured to couple the serial data line; a converter configured to receive the identifying data from the memory via the serial data signal that comprises the identifying data; and a reader coupled to receive the serial data signal. 13. The system according to claim 12, wherein the receptacle receives power from the power supply to power the receptacle. 14. An identification system to associate devices, the system comprising:
a power supply configured to couple to a counterpart device; a memory disposed on an integrated circuit chip, the memory is configured to store identifying data that identifies one or more properties of the counterpart device; and a contactless reading device configured to receive the identifying data via wireless communication. 15. The system according to claim 14, wherein the wireless communication is in accordance with a radio frequency communication standard. 16. The system according to claim 14, wherein the integrated circuit comprises a passive circuit to communicate with the contactless reading device, the passive circuit comprises a resonant structure that draws energy from an electromagnetic field generated by the contactless reading device. 17. The system according to claim 14, wherein the integrated circuit is an active transponder comprising a power storage device. 18. The system according to claim 14, wherein the memory is embedded within an output connector of the power supply. 19. The system according to claim 14, wherein the contactless reading device is a NFC transponder reader. 20. A method of associating devices, the method comprising:
receiving an output connector of a power supply assembly that comprises a memory with a receptacle that is coupled to a reader assembly; establishing a communication between the memory and the reader assembly; reading identification data that is stored on the memory; converting the identification data to a displayable format; and displaying the formatted data on a display unit. 21. The method according to claim 20, wherein establishing a communication further comprises adding a data protection that provides secure communication determining that a connection has been made. 22. The method according to claim 20, wherein establishing a communication further comprises adding a data protection that provides secure communication between the memory and the reader assembly. | 2,100 |
4,623 | 13,117,166 | 2,129 | A method for optimizing the contact surfaces of abutting shroud segments of adjacent blades of a rotor blade row of a gas turbine includes providing a 3-D model of an individual blade. A geometry of the individual blade is calculated using the 3-D model while considering centrifugal forces, temperature stresses and pressure loads experienced in a loaded state of the blade during operation. The contact surfaces of the abutting shroud segments of adjacent blades are optimized in the loaded state of the blade. The optimization includes the surfaces of functionally serving interlocking surfaces and functionally serving wedge surfaces disposed on each side of the interlocking surfaces. A geometry of the interlocking surfaces and of the wedge surfaces in an unloaded state corresponding to the optimized contact surfaces in the loaded state of the blade is calculated. | 1. A method for optimizing the contact surfaces of abutting shroud segments of adjacent blades of a rotor blade row of a gas turbine, the method comprising the steps of:
a) providing a 3-D model of an individual blade; b) calculating a geometry of the individual blade using the 3-D model, the calculating including consideration of centrifugal forces, temperature stresses and pressure loads experienced in a loaded state of the blade during operation; c) optimizing the contact surfaces of the abutting shroud segments of adjacent blades in the loaded state of the blade, including functionally serving interlocking surfaces and functionally serving wedge surfaces disposed on each side of the interlocking surfaces; and d) determining a geometry of the interlocking surfaces and of the wedge surfaces in an unloaded state corresponding to the optimized contact surfaces in the loaded state of the blade. 2. The method recited in claim 1, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid an increase in contact pressure as a result of ensuing operating temperature of the blades. 3. The method recited in claim 1, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid a drop in a natural frequency of the blade as a result of ensuing operating temperature of the blades. 4. The method recited in claim 2, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid a drop in a natural frequency of the blade as a result of ensuing operating temperature of the blades. 5. A blade for a rotor blade row of a gas turbine, the blade comprising:
a shroud segment including contact surfaces configured to abut shroud segments of adjacent blades, the contact surfaces including a functionally serving interlocking surface including sides; and functionally serving wedge surfaces disposed on both sides of the interlocking surface and in an opposed manner to the interlocking surface, the wedge surfaces being configured to undertake a guiding function. | A method for optimizing the contact surfaces of abutting shroud segments of adjacent blades of a rotor blade row of a gas turbine includes providing a 3-D model of an individual blade. A geometry of the individual blade is calculated using the 3-D model while considering centrifugal forces, temperature stresses and pressure loads experienced in a loaded state of the blade during operation. The contact surfaces of the abutting shroud segments of adjacent blades are optimized in the loaded state of the blade. The optimization includes the surfaces of functionally serving interlocking surfaces and functionally serving wedge surfaces disposed on each side of the interlocking surfaces. A geometry of the interlocking surfaces and of the wedge surfaces in an unloaded state corresponding to the optimized contact surfaces in the loaded state of the blade is calculated.1. A method for optimizing the contact surfaces of abutting shroud segments of adjacent blades of a rotor blade row of a gas turbine, the method comprising the steps of:
a) providing a 3-D model of an individual blade; b) calculating a geometry of the individual blade using the 3-D model, the calculating including consideration of centrifugal forces, temperature stresses and pressure loads experienced in a loaded state of the blade during operation; c) optimizing the contact surfaces of the abutting shroud segments of adjacent blades in the loaded state of the blade, including functionally serving interlocking surfaces and functionally serving wedge surfaces disposed on each side of the interlocking surfaces; and d) determining a geometry of the interlocking surfaces and of the wedge surfaces in an unloaded state corresponding to the optimized contact surfaces in the loaded state of the blade. 2. The method recited in claim 1, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid an increase in contact pressure as a result of ensuing operating temperature of the blades. 3. The method recited in claim 1, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid a drop in a natural frequency of the blade as a result of ensuing operating temperature of the blades. 4. The method recited in claim 2, wherein the contact surfaces between the interlocking surfaces of abutting shroud segments of adjacent blades in the loaded state of the blade are optimized so as to avoid a drop in a natural frequency of the blade as a result of ensuing operating temperature of the blades. 5. A blade for a rotor blade row of a gas turbine, the blade comprising:
a shroud segment including contact surfaces configured to abut shroud segments of adjacent blades, the contact surfaces including a functionally serving interlocking surface including sides; and functionally serving wedge surfaces disposed on both sides of the interlocking surface and in an opposed manner to the interlocking surface, the wedge surfaces being configured to undertake a guiding function. | 2,100 |
4,624 | 14,014,149 | 2,144 | Data collected during reservoir monitoring may include fiber optic measurements utilizing a distributed sensing system. Downhole monitoring with the distributed sensing system may generate large amounts of data. For example, the system may be capable of producing the functional equivalent of tens, hundreds, or even thousands of sensors along a length of a wellbore. Continuous monitoring of various properties, including temperature, pressure, Bragg gradient, acoustic, and strain, may create a large volume of data, possibly spanning into several gigabytes. Embodiments of the present invention provide techniques for analyzing a large volume of measurements taken in a wellbore without compromising on the integrity of data. | 1. A method of organizing, visualizing, and/or analyzing measurements taken in a wellbore, the method comprising:
defining a page size for visualizing portions of the measurements; dividing the measurements into a plurality of pages, wherein each page corresponds to the page size; and rendering at least one page from the plurality of pages for visual analysis. 2. The method of claim 1, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. 3. The method of claim 2, wherein axes of the 3D visualization represent time, depth, and measurement. 4. The method of claim 1, wherein the at least one page is user-selectable. 5. The method of claim 2, wherein variations in the particular portion of the measurements are indicated by coloring. 6. The method of claim 1, further comprising:
rendering the plurality of pages for visualizing the measurements taken in the wellbore, wherein the rendering is through continuous page navigation. 7. The method of claim 1, wherein the measurements are distributed measurement sensing measurements of one of temperature, strain, pressure, and acoustic. 8. The method of claim 1, wherein rendering the at least one page does not comprise downsampling. 9. The method of claim 1, wherein the page size is defined based on memory and hard disk space of a computer system which performs the rendering. 10. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause a computer system to organize, visualize, and/or analyze measurements taken in a wellbore, by performing the steps of:
defining a page size for visualizing portions of the measurements;
dividing the measurements into a plurality of pages, wherein each page corresponds to the page size; and
rendering at least one page from the plurality of pages for visual analysis. 11. The computer-readable storage medium of claim 10, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. 12. The computer-readable storage medium of claim 11, wherein axes of the 3D visualization represent time, depth, and measurement. 13. The computer-readable storage medium of claim 10, wherein the at least one page is user-selectable. 14. The computer-readable storage medium of claim 11, wherein variations in the particular portion of the measurements are indicated by coloring. 15. The computer-readable storage medium of claim 10, the steps further comprising:
rendering the plurality of pages for visualizing the measurements taken in the wellbore, wherein the rendering is through continuous page navigation. 16. The computer-readable storage medium of claim 10, wherein the measurements are distributed measurement sensing measurements of one of temperature, strain, pressure, and acoustic. 17. The computer-readable storage medium of claim 10, wherein rendering the at least one page does not comprise downsampling. 18. The computer-readable storage medium of claim 10, wherein the page size is defined based on memory and hard disk space of the computer system. 19. A computer system, comprising:
a processor configured to organize, visualize, and/or analyze measurements taken in a wellbore, by performing the steps of:
defining a page size for visualizing portions of the measurements;
dividing the measurements into a plurality of pages, wherein each page corresponds to the page size, and
rendering at least one page from the plurality of pages for visual analysis. 20. The computer system of claim 19, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. | Data collected during reservoir monitoring may include fiber optic measurements utilizing a distributed sensing system. Downhole monitoring with the distributed sensing system may generate large amounts of data. For example, the system may be capable of producing the functional equivalent of tens, hundreds, or even thousands of sensors along a length of a wellbore. Continuous monitoring of various properties, including temperature, pressure, Bragg gradient, acoustic, and strain, may create a large volume of data, possibly spanning into several gigabytes. Embodiments of the present invention provide techniques for analyzing a large volume of measurements taken in a wellbore without compromising on the integrity of data.1. A method of organizing, visualizing, and/or analyzing measurements taken in a wellbore, the method comprising:
defining a page size for visualizing portions of the measurements; dividing the measurements into a plurality of pages, wherein each page corresponds to the page size; and rendering at least one page from the plurality of pages for visual analysis. 2. The method of claim 1, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. 3. The method of claim 2, wherein axes of the 3D visualization represent time, depth, and measurement. 4. The method of claim 1, wherein the at least one page is user-selectable. 5. The method of claim 2, wherein variations in the particular portion of the measurements are indicated by coloring. 6. The method of claim 1, further comprising:
rendering the plurality of pages for visualizing the measurements taken in the wellbore, wherein the rendering is through continuous page navigation. 7. The method of claim 1, wherein the measurements are distributed measurement sensing measurements of one of temperature, strain, pressure, and acoustic. 8. The method of claim 1, wherein rendering the at least one page does not comprise downsampling. 9. The method of claim 1, wherein the page size is defined based on memory and hard disk space of a computer system which performs the rendering. 10. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause a computer system to organize, visualize, and/or analyze measurements taken in a wellbore, by performing the steps of:
defining a page size for visualizing portions of the measurements;
dividing the measurements into a plurality of pages, wherein each page corresponds to the page size; and
rendering at least one page from the plurality of pages for visual analysis. 11. The computer-readable storage medium of claim 10, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. 12. The computer-readable storage medium of claim 11, wherein axes of the 3D visualization represent time, depth, and measurement. 13. The computer-readable storage medium of claim 10, wherein the at least one page is user-selectable. 14. The computer-readable storage medium of claim 11, wherein variations in the particular portion of the measurements are indicated by coloring. 15. The computer-readable storage medium of claim 10, the steps further comprising:
rendering the plurality of pages for visualizing the measurements taken in the wellbore, wherein the rendering is through continuous page navigation. 16. The computer-readable storage medium of claim 10, wherein the measurements are distributed measurement sensing measurements of one of temperature, strain, pressure, and acoustic. 17. The computer-readable storage medium of claim 10, wherein rendering the at least one page does not comprise downsampling. 18. The computer-readable storage medium of claim 10, wherein the page size is defined based on memory and hard disk space of the computer system. 19. A computer system, comprising:
a processor configured to organize, visualize, and/or analyze measurements taken in a wellbore, by performing the steps of:
defining a page size for visualizing portions of the measurements;
dividing the measurements into a plurality of pages, wherein each page corresponds to the page size, and
rendering at least one page from the plurality of pages for visual analysis. 20. The computer system of claim 19, wherein the rendering generates a three-dimensional space (3D) visualization of a particular portion of the measurements that corresponds to the at least one page. | 2,100 |
4,625 | 13,636,236 | 2,117 | Methods and apparatus for a scalable network of heterogeneous devices are disclosed. The network may include segment controllers in communication with a remote management system and a plurality of heterogeneous devices such as, for example, lighting fixture nodes and sensors. The segment controllers may transmit sensor data from the sensors to the remote management system. The segment controllers may also transmit control data to the lighting fixture nodes and, optionally, to one or more supplementary nodes. At least some of the control data may be based on data sent from the remote management system and, optionally, the segment controller may generate at least some of the control data independently of the remote management system. | 1. A scalable network of heterogeneous devices, said network comprising:
a plurality of outdoor lighting fixture nodes, each of said outdoor lighting fixture nodes controlling at least one light output characteristic of at least one outdoor lighting fixture; a plurality of segment controllers, each of said segment controllers transmitting lighting fixture control data to at least one of said outdoor lighting fixture nodes;
wherein said light output characteristic of said at least one outdoor lighting fixture is based at least in part on said lighting fixture control data;
at least one gateway in communication with at least two of said segment controllers; at least one remote management system in communication with said gateway and in communication with said segment controllers via said gateway;
wherein said remote management system transmits segment controller data to said segment controllers and at least some of said lighting fixture control data is based at least in part on said segment controller data;
a plurality of sensors transmitting sensor data to at least one of said segment controllers;
wherein said segment controllers transmit remote system data to said remote management system via said gateway, said remote system data including information indicative of said sensor data;
wherein said segment controllers locally process at least some of said sensor data and include less than all of said sensor data in said remote system data; and
wherein said segment controller directly determines at least some of said lighting fixture control data based on said sensor data. 2. The network of claim 1 wherein at least some of said sensors transmit said sensor data directly to at least one of said segment controllers. 3. The network of claim 2 wherein at least some of said sensors transmit said sensor data to at least one of said segment controllers via at least one of said lighting fixture nodes. 4. The network of claim 1 wherein said segment controllers may operate in an independent mode independently of communication with said remote management system. 5. The network of claim 4 wherein in said independent mode said lighting fixture control data is determined independently of said segment controller data. 6. The network of claim 1 wherein said sensors selectively transmit identifying information to at least one of said segment controllers, said identifying information including type, at least one operation mode, and at least one quality of service mode. 7. The network of claim 6 wherein said identifying information includes a plurality of said operation mode and a plurality of said quality of service mode. 8. The network of claim 1 wherein a plurality of said segment controllers are each in communication with at least one other of said segment controllers. 9. A scalable network of heterogeneous devices, said network comprising:
a plurality of outdoor lighting fixture nodes, each of said outdoor lighting fixture nodes controlling at least one light output characteristic of at least one outdoor lighting fixture; a plurality of outdoor supplementary nodes, at least one of said outdoor supplementary nodes controlling at least one control characteristic of at least one of a security system, a traffic system, and an emergency response system; a plurality of segment controllers transmitting lighting fixture control data to at least one of said outdoor lighting fixture nodes and transmitting supplementary control data to at least one of said outdoor supplementary nodes;
wherein said light output characteristic is based at least in part on said lighting fixture control data;
wherein said control characteristic is based at least in part on said supplementary control data;
at least one remote management system in communication with said segment controllers;
wherein said remote management system transmits segment controller data to said segment controllers, wherein at least some of said lighting fixture control data and said supplementary control data are based at least in part on said segment controller data;
a plurality of sensors transmitting sensor data to at least one of said segment controllers;
wherein said segment controllers transmit remote system data to said remote management system, said remote system data indicative of said sensor data; and
wherein said segment controllers determine at least one of at least some of said lighting fixture control data and at least some of said supplementary control data independently of said segment controller data. 10. The network of claim 9 wherein at least some of said sensors transmit said sensor data to at least one of said segment controllers via at least one of said lighting fixture nodes. 11. The network of claim 10 wherein at least some of said sensors transmit said sensor data directly to at least one of said segment controllers. 12. The network of claim 9 wherein said sensors selectively transmit identifying information to at least one of said segment controllers, said identifying information including at least two of type, at least one operation mode, and at least one quality of service mode. 13. The network of claim 12 wherein said supplementary nodes have said identifying information and selectively transmit said identifying information to at least one of said segment controllers. 14. The network of claim 13 wherein said identifying information includes a plurality of said operation mode and a plurality of said quality of service mode. 15. The network of claim 9 further comprising at least one gateway in communication with at least two of said segment controllers and said remote management system, said gateway enabling communication between said segment controllers and said remote management system. 16. The network of claim 9 wherein said segment controllers locally process at least some of said sensor data, thereby including less than all of said sensor data in said remote system data. 17. The network of claim 9, wherein said supplementary nodes, said lighting fixture nodes, said segment controllers, and said sensors utilize a common data format to communicate with one another and each transmit a signal having one of a plurality of device class sequences, whereby each of said device class sequences is indicative of a device class. 18. A method of communication between a plurality of heterogeneous devices, said method comprising:
transmitting lighting fixture control data to at least one outdoor lighting fixture node, said outdoor lighting fixture node controlling at least one desired light output characteristic of at least one outdoor lighting fixture;
wherein said light output characteristic of said at least one outdoor lighting fixture is based at least in part on said lighting fixture control data;
transmitting supplementary control data to at least one outdoor supplementary node, said outdoor supplementary node controlling at least one control characteristic of at least one of a security system, a traffic system, and an emergency response system;
wherein said control characteristic is based at least in part on said supplementary control data;
receiving segment controller data from a remote management system, wherein at least some of said lighting fixture control data and said supplementary control data are based at least in part on said segment controller data; receiving sensor data from a plurality of said sensors; transmitting remote system data to said remote management system, said remote system data including information indicative of said sensor data; locally processing at least some of said sensor data, thereby including less than all of said sensor data in said remote system data; and determining at least one of some of said lighting fixture control data and at least some of said supplementary control data independently of said segment controller data. | Methods and apparatus for a scalable network of heterogeneous devices are disclosed. The network may include segment controllers in communication with a remote management system and a plurality of heterogeneous devices such as, for example, lighting fixture nodes and sensors. The segment controllers may transmit sensor data from the sensors to the remote management system. The segment controllers may also transmit control data to the lighting fixture nodes and, optionally, to one or more supplementary nodes. At least some of the control data may be based on data sent from the remote management system and, optionally, the segment controller may generate at least some of the control data independently of the remote management system.1. A scalable network of heterogeneous devices, said network comprising:
a plurality of outdoor lighting fixture nodes, each of said outdoor lighting fixture nodes controlling at least one light output characteristic of at least one outdoor lighting fixture; a plurality of segment controllers, each of said segment controllers transmitting lighting fixture control data to at least one of said outdoor lighting fixture nodes;
wherein said light output characteristic of said at least one outdoor lighting fixture is based at least in part on said lighting fixture control data;
at least one gateway in communication with at least two of said segment controllers; at least one remote management system in communication with said gateway and in communication with said segment controllers via said gateway;
wherein said remote management system transmits segment controller data to said segment controllers and at least some of said lighting fixture control data is based at least in part on said segment controller data;
a plurality of sensors transmitting sensor data to at least one of said segment controllers;
wherein said segment controllers transmit remote system data to said remote management system via said gateway, said remote system data including information indicative of said sensor data;
wherein said segment controllers locally process at least some of said sensor data and include less than all of said sensor data in said remote system data; and
wherein said segment controller directly determines at least some of said lighting fixture control data based on said sensor data. 2. The network of claim 1 wherein at least some of said sensors transmit said sensor data directly to at least one of said segment controllers. 3. The network of claim 2 wherein at least some of said sensors transmit said sensor data to at least one of said segment controllers via at least one of said lighting fixture nodes. 4. The network of claim 1 wherein said segment controllers may operate in an independent mode independently of communication with said remote management system. 5. The network of claim 4 wherein in said independent mode said lighting fixture control data is determined independently of said segment controller data. 6. The network of claim 1 wherein said sensors selectively transmit identifying information to at least one of said segment controllers, said identifying information including type, at least one operation mode, and at least one quality of service mode. 7. The network of claim 6 wherein said identifying information includes a plurality of said operation mode and a plurality of said quality of service mode. 8. The network of claim 1 wherein a plurality of said segment controllers are each in communication with at least one other of said segment controllers. 9. A scalable network of heterogeneous devices, said network comprising:
a plurality of outdoor lighting fixture nodes, each of said outdoor lighting fixture nodes controlling at least one light output characteristic of at least one outdoor lighting fixture; a plurality of outdoor supplementary nodes, at least one of said outdoor supplementary nodes controlling at least one control characteristic of at least one of a security system, a traffic system, and an emergency response system; a plurality of segment controllers transmitting lighting fixture control data to at least one of said outdoor lighting fixture nodes and transmitting supplementary control data to at least one of said outdoor supplementary nodes;
wherein said light output characteristic is based at least in part on said lighting fixture control data;
wherein said control characteristic is based at least in part on said supplementary control data;
at least one remote management system in communication with said segment controllers;
wherein said remote management system transmits segment controller data to said segment controllers, wherein at least some of said lighting fixture control data and said supplementary control data are based at least in part on said segment controller data;
a plurality of sensors transmitting sensor data to at least one of said segment controllers;
wherein said segment controllers transmit remote system data to said remote management system, said remote system data indicative of said sensor data; and
wherein said segment controllers determine at least one of at least some of said lighting fixture control data and at least some of said supplementary control data independently of said segment controller data. 10. The network of claim 9 wherein at least some of said sensors transmit said sensor data to at least one of said segment controllers via at least one of said lighting fixture nodes. 11. The network of claim 10 wherein at least some of said sensors transmit said sensor data directly to at least one of said segment controllers. 12. The network of claim 9 wherein said sensors selectively transmit identifying information to at least one of said segment controllers, said identifying information including at least two of type, at least one operation mode, and at least one quality of service mode. 13. The network of claim 12 wherein said supplementary nodes have said identifying information and selectively transmit said identifying information to at least one of said segment controllers. 14. The network of claim 13 wherein said identifying information includes a plurality of said operation mode and a plurality of said quality of service mode. 15. The network of claim 9 further comprising at least one gateway in communication with at least two of said segment controllers and said remote management system, said gateway enabling communication between said segment controllers and said remote management system. 16. The network of claim 9 wherein said segment controllers locally process at least some of said sensor data, thereby including less than all of said sensor data in said remote system data. 17. The network of claim 9, wherein said supplementary nodes, said lighting fixture nodes, said segment controllers, and said sensors utilize a common data format to communicate with one another and each transmit a signal having one of a plurality of device class sequences, whereby each of said device class sequences is indicative of a device class. 18. A method of communication between a plurality of heterogeneous devices, said method comprising:
transmitting lighting fixture control data to at least one outdoor lighting fixture node, said outdoor lighting fixture node controlling at least one desired light output characteristic of at least one outdoor lighting fixture;
wherein said light output characteristic of said at least one outdoor lighting fixture is based at least in part on said lighting fixture control data;
transmitting supplementary control data to at least one outdoor supplementary node, said outdoor supplementary node controlling at least one control characteristic of at least one of a security system, a traffic system, and an emergency response system;
wherein said control characteristic is based at least in part on said supplementary control data;
receiving segment controller data from a remote management system, wherein at least some of said lighting fixture control data and said supplementary control data are based at least in part on said segment controller data; receiving sensor data from a plurality of said sensors; transmitting remote system data to said remote management system, said remote system data including information indicative of said sensor data; locally processing at least some of said sensor data, thereby including less than all of said sensor data in said remote system data; and determining at least one of some of said lighting fixture control data and at least some of said supplementary control data independently of said segment controller data. | 2,100 |
4,626 | 12,965,171 | 2,118 | A method and apparatus for providing welding-type power is disclosed and includes a database, preferably with a DBMS, and preferably embedded. The welding-type system includes a source of power, and a controller connected to the source of power. The DBMS may be part of the welding controller. A method of monitoring a welding-type system is also disclosed, and includes monitoring data and storing the data in an embedded database. The database may include data organized in a plurality of columns and rows, and the date may relate to one or more welding processes, data relating to welding parameters, including one or more of commanded welding voltages, welding current, wire feed speed, data relating to one or more welding sequences, and/or one or more fedback welding parameters such as current, voltage, welding time, ramp rates and wire feed speed. The data may be located in a file in an operating system, in a file on a personal computer, and/or in a file networked to the welding-type system. The system may include a user input connected to the database and the user can change the data in another embodiment. The user input may be connected to a network. | 1. A welding-type system including a source of power, and a controller connected to the source of power, wherein the controller includes an embedded database. 2. The welding-type system of claim 1, wherein the database includes data organized in a plurality of columns and rows. 3. The welding-type system of claim 1, wherein the database includes as data stored variables used to perform the weld. 4. The welding-type system of claim 2, wherein the database provides for queries from multiple users. 5. The welding-type system of claim 3, wherein the data cannot be accessed in an intermediate state. 6. The welding-type system of claim 1, wherein the database includes data located in a file in an operating system. 7. The welding-type system of claim 6, wherein the data is located in a file on a personal computer. 8. The welding-type system of claim 6, wherein the data is located in a file networked to the welding-type system. 9. The welding-type system of claim 1, wherein the embedded database includes data relating to more than one welding process. 10. The welding-type system of claim 1, wherein the embedded database include data relating to welding parameters, including one or more of commanded welding voltages, welding current, wire feed speed. 11. The welding-type system of claim 1, wherein the embedded database include data relating to one or more welding sequences. 12. The welding-type system of claim 1, wherein the database includes data related to one or more fedback welding parameters of current, voltage, welding time, ramp rates and wire feed speed. 13. The welding-type system of claim 2, including a user input connected to the database, wherein the user can change the data. 14. The welding-type system of claim 13, wherein the user input is further connected to a network. 15. A method of controlling a welding-type system, comprising:
storing data in an embedded database; accessing the stored data using a welding controller; and controlling the output of a welding-type power source in response to the data accessed. 16. The method of claim 15, wherein storing includes storing data in a file in an operating system. 17. The method of claim 15, wherein storing includes storing data in a file located on a personal computer. 18. The method of claim 15, wherein storing includes storing data in a file located on network connected to the welding type system. 19. The method of claim 15, wherein accessing includes accessing data in a file located on network connected to the welding type system. 20. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding parameter; accessing includes accessing data for at least a selected one welding parameter. 21. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding process; accessing includes accessing data for a selected one welding process; and controlling includes controlling the output to be the selected welding process. 22. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding sequence; accessing includes accessing data for at least one selected welding sequences; and controlling includes controlling the output to provide the at least one selected welding sequence. 23. The method of claim 15, including receiving a user input and changing the data in response to the user input. 24. The method of claim 15, including receiving a user input over network and changing the data in response to the user input. 25. A method of monitoring a welding-type system, comprising monitoring data and storing the data in an embedded database. 26. The method of claim 25, wherein monitoring data includes monitoring at least one of commanded or fedback data. 27. An embedded database for a welding-type system. 28. The database of claim 27, wherein the database includes as data stored variables used to perform the weld. 29. The database system of claim 28, wherein the data is located in a file networked to a welding-type system. 30. The database of claim 29, wherein the embedded database include data relating to one or more one welding processes, one or more of commanded welding voltages, welding current, wire feed speed, and one or more welding sequences. | A method and apparatus for providing welding-type power is disclosed and includes a database, preferably with a DBMS, and preferably embedded. The welding-type system includes a source of power, and a controller connected to the source of power. The DBMS may be part of the welding controller. A method of monitoring a welding-type system is also disclosed, and includes monitoring data and storing the data in an embedded database. The database may include data organized in a plurality of columns and rows, and the date may relate to one or more welding processes, data relating to welding parameters, including one or more of commanded welding voltages, welding current, wire feed speed, data relating to one or more welding sequences, and/or one or more fedback welding parameters such as current, voltage, welding time, ramp rates and wire feed speed. The data may be located in a file in an operating system, in a file on a personal computer, and/or in a file networked to the welding-type system. The system may include a user input connected to the database and the user can change the data in another embodiment. The user input may be connected to a network.1. A welding-type system including a source of power, and a controller connected to the source of power, wherein the controller includes an embedded database. 2. The welding-type system of claim 1, wherein the database includes data organized in a plurality of columns and rows. 3. The welding-type system of claim 1, wherein the database includes as data stored variables used to perform the weld. 4. The welding-type system of claim 2, wherein the database provides for queries from multiple users. 5. The welding-type system of claim 3, wherein the data cannot be accessed in an intermediate state. 6. The welding-type system of claim 1, wherein the database includes data located in a file in an operating system. 7. The welding-type system of claim 6, wherein the data is located in a file on a personal computer. 8. The welding-type system of claim 6, wherein the data is located in a file networked to the welding-type system. 9. The welding-type system of claim 1, wherein the embedded database includes data relating to more than one welding process. 10. The welding-type system of claim 1, wherein the embedded database include data relating to welding parameters, including one or more of commanded welding voltages, welding current, wire feed speed. 11. The welding-type system of claim 1, wherein the embedded database include data relating to one or more welding sequences. 12. The welding-type system of claim 1, wherein the database includes data related to one or more fedback welding parameters of current, voltage, welding time, ramp rates and wire feed speed. 13. The welding-type system of claim 2, including a user input connected to the database, wherein the user can change the data. 14. The welding-type system of claim 13, wherein the user input is further connected to a network. 15. A method of controlling a welding-type system, comprising:
storing data in an embedded database; accessing the stored data using a welding controller; and controlling the output of a welding-type power source in response to the data accessed. 16. The method of claim 15, wherein storing includes storing data in a file in an operating system. 17. The method of claim 15, wherein storing includes storing data in a file located on a personal computer. 18. The method of claim 15, wherein storing includes storing data in a file located on network connected to the welding type system. 19. The method of claim 15, wherein accessing includes accessing data in a file located on network connected to the welding type system. 20. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding parameter; accessing includes accessing data for at least a selected one welding parameter. 21. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding process; accessing includes accessing data for a selected one welding process; and controlling includes controlling the output to be the selected welding process. 22. The method of claim 15, wherein:
storing data includes storing data relating to more than one welding sequence; accessing includes accessing data for at least one selected welding sequences; and controlling includes controlling the output to provide the at least one selected welding sequence. 23. The method of claim 15, including receiving a user input and changing the data in response to the user input. 24. The method of claim 15, including receiving a user input over network and changing the data in response to the user input. 25. A method of monitoring a welding-type system, comprising monitoring data and storing the data in an embedded database. 26. The method of claim 25, wherein monitoring data includes monitoring at least one of commanded or fedback data. 27. An embedded database for a welding-type system. 28. The database of claim 27, wherein the database includes as data stored variables used to perform the weld. 29. The database system of claim 28, wherein the data is located in a file networked to a welding-type system. 30. The database of claim 29, wherein the embedded database include data relating to one or more one welding processes, one or more of commanded welding voltages, welding current, wire feed speed, and one or more welding sequences. | 2,100 |
4,627 | 12,648,523 | 2,167 | A computer system is used to manage content in a database system that stores data representing data elements defined by a logical data model. For at least one of multiple business functions to be carried out with the database system, the computer system (1) identifies a total amount of data elements required to carry out the business function, (2) identifies an amount of common data elements that are required to carry out both the business function and another of the multiple business functions, (3) creates information that indicates a percentage of the total amount of data elements that are also common data elements, and (4) delivers the information for presentation to a human user. | 1. A computer-implemented method for enabling a user at a user terminal to manage content in a database system that stores data representing data elements defined by a logical data model, the method comprising:
for at least one of multiple business functions to be carried out with the database system:
identifying a total amount of data elements required to carry out the business function;
identifying an amount of common data elements that are required to carry out both the business function and another of the multiple business functions; and
creating information that indicates a percentage of the total amount of data elements that are also common data elements; and
delivering the information to the user terminal for presentation to the user. 2. The method of claim 1, further comprising storing data that identifies:
one or more business questions that must be answered in carrying out the business function; and the data elements that are required to answer each of the business questions. 3. The method of claim 1, further comprising storing data that identifies:
one or more business questions that must be answered in carrying out the other business function; and the data elements that are required to answer each of the business questions required for the other business function. 4. The method of claim 1, further comprising:
identifying a total amount of data elements required to carry out the other business function; creating information that indicates a percentage of the total amount of data elements required for the other business function that are also common data elements; and delivering the information to the user terminal for presentation to the user. | A computer system is used to manage content in a database system that stores data representing data elements defined by a logical data model. For at least one of multiple business functions to be carried out with the database system, the computer system (1) identifies a total amount of data elements required to carry out the business function, (2) identifies an amount of common data elements that are required to carry out both the business function and another of the multiple business functions, (3) creates information that indicates a percentage of the total amount of data elements that are also common data elements, and (4) delivers the information for presentation to a human user.1. A computer-implemented method for enabling a user at a user terminal to manage content in a database system that stores data representing data elements defined by a logical data model, the method comprising:
for at least one of multiple business functions to be carried out with the database system:
identifying a total amount of data elements required to carry out the business function;
identifying an amount of common data elements that are required to carry out both the business function and another of the multiple business functions; and
creating information that indicates a percentage of the total amount of data elements that are also common data elements; and
delivering the information to the user terminal for presentation to the user. 2. The method of claim 1, further comprising storing data that identifies:
one or more business questions that must be answered in carrying out the business function; and the data elements that are required to answer each of the business questions. 3. The method of claim 1, further comprising storing data that identifies:
one or more business questions that must be answered in carrying out the other business function; and the data elements that are required to answer each of the business questions required for the other business function. 4. The method of claim 1, further comprising:
identifying a total amount of data elements required to carry out the other business function; creating information that indicates a percentage of the total amount of data elements required for the other business function that are also common data elements; and delivering the information to the user terminal for presentation to the user. | 2,100 |
4,628 | 14,172,218 | 2,137 | A method begins by a dispersed storage (DS) processing module of a dispersed storage network (DSN) receiving a plurality of data access requests regarding a plurality of data objects. As individual data access requests of the plurality of data access requests are received, the method continues with the DS processing module, for each of the individual data access requests identifying a corresponding one of a plurality of logical storage pools of the DSN and determining power based access status of the corresponding one of the plurality of logical storage pools. When the power based access status is power saving mode, the method continues with the DS processing module queuing the individual data access request. When the power based access status is not in the power saving mode, the method continues with the DS processing module executing the individual data access request. | 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 a plurality of data access requests regarding a plurality of data objects, wherein a data object of the plurality of data objects is distributedly stored in a set of storage devices of a plurality of storage devices of the DSN, wherein the plurality of storage devices is arranged into a plurality of logical storage pools, wherein the set of storage devices stores data objects of the plurality of data objects having a common data access trait, and wherein the set of storage devices is affiliated with one of the plurality of logical storage pools; and as individual data access requests of the plurality of data access requests are received, for each individual data access request of the individual data access requests:
identifying a corresponding one of the plurality of logical storage pools;
determining power based access status of the corresponding one of the plurality of logical storage pools;
when the power based access status is power saving mode, queuing the individual data access request; and
when the power based access status is not in the power saving mode, executing the individual data access request. 2. The method of claim 1, wherein the identifying the corresponding one of the plurality of logical storage pools comprises at least one of:
interpreting a field within the individual data access request, wherein the field includes data regarding one or more of a data identifier, a generation value, a vault identifier, a timestamp, user preference, a DSN data access priority, and a logical storage pool identifier; and determining a data access trait of the data object of the individual data access request, wherein the data access trait includes one or more of age of the data object, data object type, and data object storage status. 3. The method of claim 1, wherein the determining the power based access status comprises:
accessing a power based data access plan for the corresponding one of the plurality of logical storage pools, wherein the power based data access plan indicates a power status for each storage device affiliated with the corresponding one of the plurality of logical storage pools, wherein the power status is one of active power on, inactive power off, and inactive power on. 4. The method of claim 1 further comprises:
retrieving, from a queue, a queued individual data access request;
sending an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generating execute access request commands for the desired set of storage devices; and
when the desired set of storage devices are in an active power on mode, sending the execute access request commands to the desired set of storage devices for execution. 5. The method of claim 4 further comprises:
when the queued individual data access request is a read request:
determining a read threshold number of storage devices as the desired set of storage devices; and
generating a plurality of read commands as the execute access request commands. 6. The method of claim 4 further comprises:
when the queued individual data access request is a write request:
determining a write threshold number of storage devices as the desired set of storage devices; and
generating a plurality of write commands as the execute access request commands. 7. The method of claim 1, wherein a storage device of the plurality of storage devices comprises one or more of:
one or more memory devices within a storage unit of the DSN; one or more storage units at a site of the DSN; and one or more sites of the DSN. 8. The method of claim 1 further comprises:
organizing queued individual data access requests into groups of requests based on the plurality of logical storage pools such that a group of requests of the groups of requests is affiliated with a given one of the plurality of logical storage pools. 9. The method of claim 8 further comprises:
retrieving, from a queue, a group of queued individual data access requests;
sending an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generating, for each of the queued individual data access requests, execute access request commands for the desired set of storage devices to produce a group of execute access request commands;
when the desired set of storage devices are in an active power on mode, sending the group of execute access request commands to the desired set of storage devices for execution; and
when the desired set of storage devices have executed the group of execute access request commands, sending an inactivation power down command to the desired set of storage devices. 10. A dispersed storage (DS) module of a dispersed storage network (DSN), the DS module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a plurality of data access requests regarding a plurality of data objects, wherein a data object of the plurality of data objects is distributedly stored in a set of storage devices of a plurality of storage devices of the DSN, wherein the plurality of storage devices is arranged into a plurality of logical storage pools, wherein the set of storage devices stores data objects of the plurality of data objects having a common data access trait, and wherein the set of storage devices is affiliated with one of the plurality of logical storage pools; and
a second module, when operable within the computing device, causes the computing device to:
as individual data access requests of the plurality of data access requests are received, for each individual data access request of the individual data access requests:
identify a corresponding one of the plurality of logical storage pools;
determine power based access status of the corresponding one of the plurality of logical storage pools;
when the power based access status is power saving mode, queue the individual data access request; and
when the power based access status is not in the power saving mode, execute the individual data access request. 11. The DS module of claim 10, wherein the second module causes the computing device to identify the corresponding one of the plurality of logical storage pools by at least one of:
interpreting a field within the individual data access request, wherein the field includes data regarding one or more of a data identifier, a generation value, a vault identifier, a timestamp, user preference, a DSN data access priority, and a logical storage pool identifier; and determining a data access trait of the data object of the individual data access request, wherein the data access trait includes one or more of age of the data object, data object type, and data object storage status. 12. The DS module of claim 10, wherein the second module causes the computing device to determine the power based access status by:
accessing a power based data access plan for the corresponding one of the plurality of logical storage pools, wherein the power based data access plan indicates a power status for each storage device affiliated with the corresponding one of the plurality of logical storage pools, wherein the power status is one of active power on, inactive power off, and inactive power on. 13. The DS module of claim 10 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
retrieve, from a queue, a queued individual data access request;
send an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generate execute access request commands for the desired set of storage devices; and
when the desired set of storage devices are in an active power on mode, send the execute access request commands to the desired set of storage devices for execution. 14. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when the queued individual data access request is a read request:
determine a read threshold number of storage devices as the desired set of storage devices; and
generate a plurality of read commands as the execute access request commands. 15. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when the queued individual data access request is a write request:
determine a write threshold number of storage devices as the desired set of storage devices; and
generate a plurality of write commands as the execute access request commands. 16. The DS module of claim 10, wherein a storage device of the plurality of storage devices comprises one or more of:
one or more memory devices within a storage unit of the DSN; one or more storage units at a site of the DSN; and one or more sites of the DSN. 17. The DS module of claim 10 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
organize queued individual data access requests into groups of requests based on the plurality of logical storage pools such that a group of requests of the groups of requests is affiliated with a given one of the plurality of logical storage pools. 18. The DS module of claim 17 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
retrieve, from a queue, a group of queued individual data access requests;
send an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generate, for each of the queued individual data access requests, execute access request commands for the desired set of storage devices to produce a group of execute access request commands;
when the desired set of storage devices are in an active power on mode, send the group of execute access request commands to the desired set of storage devices for execution; and
when the desired set of storage devices have executed the group of execute access request commands, send an inactivation power down command to the desired set of storage devices. | A method begins by a dispersed storage (DS) processing module of a dispersed storage network (DSN) receiving a plurality of data access requests regarding a plurality of data objects. As individual data access requests of the plurality of data access requests are received, the method continues with the DS processing module, for each of the individual data access requests identifying a corresponding one of a plurality of logical storage pools of the DSN and determining power based access status of the corresponding one of the plurality of logical storage pools. When the power based access status is power saving mode, the method continues with the DS processing module queuing the individual data access request. When the power based access status is not in the power saving mode, the method continues with the DS processing module executing the individual data access request.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 a plurality of data access requests regarding a plurality of data objects, wherein a data object of the plurality of data objects is distributedly stored in a set of storage devices of a plurality of storage devices of the DSN, wherein the plurality of storage devices is arranged into a plurality of logical storage pools, wherein the set of storage devices stores data objects of the plurality of data objects having a common data access trait, and wherein the set of storage devices is affiliated with one of the plurality of logical storage pools; and as individual data access requests of the plurality of data access requests are received, for each individual data access request of the individual data access requests:
identifying a corresponding one of the plurality of logical storage pools;
determining power based access status of the corresponding one of the plurality of logical storage pools;
when the power based access status is power saving mode, queuing the individual data access request; and
when the power based access status is not in the power saving mode, executing the individual data access request. 2. The method of claim 1, wherein the identifying the corresponding one of the plurality of logical storage pools comprises at least one of:
interpreting a field within the individual data access request, wherein the field includes data regarding one or more of a data identifier, a generation value, a vault identifier, a timestamp, user preference, a DSN data access priority, and a logical storage pool identifier; and determining a data access trait of the data object of the individual data access request, wherein the data access trait includes one or more of age of the data object, data object type, and data object storage status. 3. The method of claim 1, wherein the determining the power based access status comprises:
accessing a power based data access plan for the corresponding one of the plurality of logical storage pools, wherein the power based data access plan indicates a power status for each storage device affiliated with the corresponding one of the plurality of logical storage pools, wherein the power status is one of active power on, inactive power off, and inactive power on. 4. The method of claim 1 further comprises:
retrieving, from a queue, a queued individual data access request;
sending an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generating execute access request commands for the desired set of storage devices; and
when the desired set of storage devices are in an active power on mode, sending the execute access request commands to the desired set of storage devices for execution. 5. The method of claim 4 further comprises:
when the queued individual data access request is a read request:
determining a read threshold number of storage devices as the desired set of storage devices; and
generating a plurality of read commands as the execute access request commands. 6. The method of claim 4 further comprises:
when the queued individual data access request is a write request:
determining a write threshold number of storage devices as the desired set of storage devices; and
generating a plurality of write commands as the execute access request commands. 7. The method of claim 1, wherein a storage device of the plurality of storage devices comprises one or more of:
one or more memory devices within a storage unit of the DSN; one or more storage units at a site of the DSN; and one or more sites of the DSN. 8. The method of claim 1 further comprises:
organizing queued individual data access requests into groups of requests based on the plurality of logical storage pools such that a group of requests of the groups of requests is affiliated with a given one of the plurality of logical storage pools. 9. The method of claim 8 further comprises:
retrieving, from a queue, a group of queued individual data access requests;
sending an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generating, for each of the queued individual data access requests, execute access request commands for the desired set of storage devices to produce a group of execute access request commands;
when the desired set of storage devices are in an active power on mode, sending the group of execute access request commands to the desired set of storage devices for execution; and
when the desired set of storage devices have executed the group of execute access request commands, sending an inactivation power down command to the desired set of storage devices. 10. A dispersed storage (DS) module of a dispersed storage network (DSN), the DS module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a plurality of data access requests regarding a plurality of data objects, wherein a data object of the plurality of data objects is distributedly stored in a set of storage devices of a plurality of storage devices of the DSN, wherein the plurality of storage devices is arranged into a plurality of logical storage pools, wherein the set of storage devices stores data objects of the plurality of data objects having a common data access trait, and wherein the set of storage devices is affiliated with one of the plurality of logical storage pools; and
a second module, when operable within the computing device, causes the computing device to:
as individual data access requests of the plurality of data access requests are received, for each individual data access request of the individual data access requests:
identify a corresponding one of the plurality of logical storage pools;
determine power based access status of the corresponding one of the plurality of logical storage pools;
when the power based access status is power saving mode, queue the individual data access request; and
when the power based access status is not in the power saving mode, execute the individual data access request. 11. The DS module of claim 10, wherein the second module causes the computing device to identify the corresponding one of the plurality of logical storage pools by at least one of:
interpreting a field within the individual data access request, wherein the field includes data regarding one or more of a data identifier, a generation value, a vault identifier, a timestamp, user preference, a DSN data access priority, and a logical storage pool identifier; and determining a data access trait of the data object of the individual data access request, wherein the data access trait includes one or more of age of the data object, data object type, and data object storage status. 12. The DS module of claim 10, wherein the second module causes the computing device to determine the power based access status by:
accessing a power based data access plan for the corresponding one of the plurality of logical storage pools, wherein the power based data access plan indicates a power status for each storage device affiliated with the corresponding one of the plurality of logical storage pools, wherein the power status is one of active power on, inactive power off, and inactive power on. 13. The DS module of claim 10 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
retrieve, from a queue, a queued individual data access request;
send an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generate execute access request commands for the desired set of storage devices; and
when the desired set of storage devices are in an active power on mode, send the execute access request commands to the desired set of storage devices for execution. 14. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when the queued individual data access request is a read request:
determine a read threshold number of storage devices as the desired set of storage devices; and
generate a plurality of read commands as the execute access request commands. 15. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when the queued individual data access request is a write request:
determine a write threshold number of storage devices as the desired set of storage devices; and
generate a plurality of write commands as the execute access request commands. 16. The DS module of claim 10, wherein a storage device of the plurality of storage devices comprises one or more of:
one or more memory devices within a storage unit of the DSN; one or more storage units at a site of the DSN; and one or more sites of the DSN. 17. The DS module of claim 10 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
organize queued individual data access requests into groups of requests based on the plurality of logical storage pools such that a group of requests of the groups of requests is affiliated with a given one of the plurality of logical storage pools. 18. The DS module of claim 17 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
retrieve, from a queue, a group of queued individual data access requests;
send an activation power on command to a desired set of storage devices affiliated with the corresponding one of the plurality of logical storage pools;
generate, for each of the queued individual data access requests, execute access request commands for the desired set of storage devices to produce a group of execute access request commands;
when the desired set of storage devices are in an active power on mode, send the group of execute access request commands to the desired set of storage devices for execution; and
when the desired set of storage devices have executed the group of execute access request commands, send an inactivation power down command to the desired set of storage devices. | 2,100 |
4,629 | 14,559,816 | 2,159 | An apparatus and a computer-implemented method for processing data are disclosed. The apparatus comprises a memory device that stores first history data, and at least one processor configured to receive input data, determine a relationship between the first history data and one or more portions of the input data, generate one or more reference tokens reflecting the relationship, and transmit the one or more reference tokens to a recipient device. | 1. An apparatus, comprising:
a memory device that stores first history data; and at least one processor configured to:
receive input data;
determine a relationship between the first history data and one or more portions of the input data;
generate one or more reference tokens reflecting the relationship; and
transmit the one or more reference tokens to a recipient device. 2. The apparatus of claim 1, wherein the one or more reference tokens allow a reconstruction of the one or more portions of the input data at the recipient device. 3. The apparatus of claim 1, wherein the determination of the relationship between the first history data and the one or more portions of the input data includes determining whether a portion of the input data matches with any portion of the first history data, and wherein the at least one processor is further configured to:
responsive to determining that the portion of the input data does not match with any portion of the first history data, transmit the portion of the input data to the recipient device. 4. The apparatus of claim 1, wherein the first history data comprises one or more first data chunks, wherein each first data chunk is associated with one or more first signatures, wherein the one or more first data chunks include a working data chunk, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
associate one or more second signatures with the input data; and determine whether at least one of the first signatures associated with the working data chunk matches with at least one of the second signatures. 5. The apparatus of claim 4, wherein, responsive to a determination that at least one of the first signatures of the working data chunk matches with at least one of the second signatures, the first signature that matches with the second signature being associated with a portion of the working data chunk and the second signature being associated with a portion of the input data, the determination of the relationship between the first history data and the one or more portions of the input data further includes:
determine that the associated portion of the working data chunk is identical to the associated portion of the input data; and determine information about a location and a size of the associated portion of the working data chunk that is identical to the associated portion of the input data, wherein a first reference token is generated to include the information about the location and the size of the associated portion of the working data chunk. 6. The apparatus of claim 4, wherein the apparatus further comprises a data storage device storing one or more second data chunks, each second data chunk being associated with one or more third signatures, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that none of the first signatures matches with any of the second signatures, determining whether at least one of the third signatures matches with at least one of the second signatures. 7. The apparatus of claim 6, wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that at least one of the third signatures matches with at least one of the second signatures, acquiring the second data chunk associated with the third signature that matches with the first second signature from the data storage device to become the working history data chunk. 8. The apparatus of claim 5, wherein the working data chunk further includes one or more data blocks, wherein at least one of the first signatures is associated with at least one of the data blocks and with a first offset, the first offset reflecting the location of the at least one of the data blocks within the working data chunk, and
wherein the determination of the information about a location and a size of the associated portion of the working data chunk includes: searching, within the working data chunk and in a forward direction and/or backward direction relative to the location reflected by the first offset, data that matches with one or more portions of the input data. 9. The apparatus of claim 8, wherein the at least one of the first signatures is generated from a plurality of sub-signatures, each sub-signature being generated from a portion of the at least one of the data blocks. 10. The apparatus of claim 4, wherein each of the first data chunks is associated with a timestamp, and wherein the working data chunk is designated based on the timestamp associated with the working data chunk. 11. A computer-implemented method for processing data, the method comprising:
receiving input data; receiving first history data; determining a relationship between the first history data and one or more portions of the input data; generating one or more reference tokens reflecting the relationship; and transmitting the one or more reference tokens to a recipient device. 12. The method of claim 11, wherein the one or more reference tokens allow a reconstruction of the one or more portions of the input data at the recipient device. 13. The method of claim 11, wherein the determining of the relationship between the first history data and the one or more portions of the input data includes determining whether a first portion of the input data matches with any portion of the first history data, further comprising:
responsive to determining that the first portion of the input data does not match with any portion of the first history data, transmitting the first portion of the input data to the recipient device. 14. The method of claim 11, wherein the first history data comprises one or more first data chunks, wherein each first data chunk is associated with one or more first signatures, wherein the one or more first data chunks include a working data chunk, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
associating one or more second signatures with the input data; and determining whether at least one of the first signatures matches with at least one of the second signatures. 15. The method of claim 14, wherein, responsive to a determination that at least one of the first signatures of the working data chunk matches with at least one of the second signatures, the first signature that matches with the second signature being associated with a portion of the working data chunk and the second signature being associated with a portion of the input data, the determination of the relationship between the first history data and the one or more portions of the input data further includes:
determining that the associated portion of the working data chunk is identical to the associated portion of the input data; and determining information about a location and a size of the associated portion of the working data chunk, wherein a first reference token is generated to include the information about the location and size of the associated portion of the working data chunk. 16. The method of claim 14, further comprising receiving one or more second data chunks from a data storage device, each second data chunk being associated with one or more third signatures, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that none of the first signatures matches with any of the second signatures, determining whether at least one of the third signatures matches with at least one of the second signatures. 17. The method of claim 16, wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that at least one of the third signatures matches with at least one of the second signatures, acquiring the second data chunk associated with the third signature that matches with the second signature from the data storage device to become the working data chunk. 18. The method of claim 14, wherein the working data chunk further includes one or more data blocks, wherein at least one of the first signatures is associated with at least one of the data blocks and with a first offset, the first offset indicating the location of the at least one of the data blocks within the working data chunk, and
wherein the determination of the information about a location and a size of the associated portion of the working data chunk includes: searching, within the working data chunk and in a forward direction and/or backward direction relative to the location reflected by the first offset, data that matches with one or more portions of the input data. 19. An apparatus, comprising:
a memory device that stores history data; and at least one processor configured to: receive input data; generate one or more reference tokens including information about at least a portion of history data that is associated with the input data; and transmit the one or more reference tokens and at least a portion of the input data that is not in the history data to a recipient device. 20. The apparatus of claim 19, wherein the information about the portion of the history data includes a location of the portion of the first history data and the size of the portion of the history data. | An apparatus and a computer-implemented method for processing data are disclosed. The apparatus comprises a memory device that stores first history data, and at least one processor configured to receive input data, determine a relationship between the first history data and one or more portions of the input data, generate one or more reference tokens reflecting the relationship, and transmit the one or more reference tokens to a recipient device.1. An apparatus, comprising:
a memory device that stores first history data; and at least one processor configured to:
receive input data;
determine a relationship between the first history data and one or more portions of the input data;
generate one or more reference tokens reflecting the relationship; and
transmit the one or more reference tokens to a recipient device. 2. The apparatus of claim 1, wherein the one or more reference tokens allow a reconstruction of the one or more portions of the input data at the recipient device. 3. The apparatus of claim 1, wherein the determination of the relationship between the first history data and the one or more portions of the input data includes determining whether a portion of the input data matches with any portion of the first history data, and wherein the at least one processor is further configured to:
responsive to determining that the portion of the input data does not match with any portion of the first history data, transmit the portion of the input data to the recipient device. 4. The apparatus of claim 1, wherein the first history data comprises one or more first data chunks, wherein each first data chunk is associated with one or more first signatures, wherein the one or more first data chunks include a working data chunk, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
associate one or more second signatures with the input data; and determine whether at least one of the first signatures associated with the working data chunk matches with at least one of the second signatures. 5. The apparatus of claim 4, wherein, responsive to a determination that at least one of the first signatures of the working data chunk matches with at least one of the second signatures, the first signature that matches with the second signature being associated with a portion of the working data chunk and the second signature being associated with a portion of the input data, the determination of the relationship between the first history data and the one or more portions of the input data further includes:
determine that the associated portion of the working data chunk is identical to the associated portion of the input data; and determine information about a location and a size of the associated portion of the working data chunk that is identical to the associated portion of the input data, wherein a first reference token is generated to include the information about the location and the size of the associated portion of the working data chunk. 6. The apparatus of claim 4, wherein the apparatus further comprises a data storage device storing one or more second data chunks, each second data chunk being associated with one or more third signatures, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that none of the first signatures matches with any of the second signatures, determining whether at least one of the third signatures matches with at least one of the second signatures. 7. The apparatus of claim 6, wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that at least one of the third signatures matches with at least one of the second signatures, acquiring the second data chunk associated with the third signature that matches with the first second signature from the data storage device to become the working history data chunk. 8. The apparatus of claim 5, wherein the working data chunk further includes one or more data blocks, wherein at least one of the first signatures is associated with at least one of the data blocks and with a first offset, the first offset reflecting the location of the at least one of the data blocks within the working data chunk, and
wherein the determination of the information about a location and a size of the associated portion of the working data chunk includes: searching, within the working data chunk and in a forward direction and/or backward direction relative to the location reflected by the first offset, data that matches with one or more portions of the input data. 9. The apparatus of claim 8, wherein the at least one of the first signatures is generated from a plurality of sub-signatures, each sub-signature being generated from a portion of the at least one of the data blocks. 10. The apparatus of claim 4, wherein each of the first data chunks is associated with a timestamp, and wherein the working data chunk is designated based on the timestamp associated with the working data chunk. 11. A computer-implemented method for processing data, the method comprising:
receiving input data; receiving first history data; determining a relationship between the first history data and one or more portions of the input data; generating one or more reference tokens reflecting the relationship; and transmitting the one or more reference tokens to a recipient device. 12. The method of claim 11, wherein the one or more reference tokens allow a reconstruction of the one or more portions of the input data at the recipient device. 13. The method of claim 11, wherein the determining of the relationship between the first history data and the one or more portions of the input data includes determining whether a first portion of the input data matches with any portion of the first history data, further comprising:
responsive to determining that the first portion of the input data does not match with any portion of the first history data, transmitting the first portion of the input data to the recipient device. 14. The method of claim 11, wherein the first history data comprises one or more first data chunks, wherein each first data chunk is associated with one or more first signatures, wherein the one or more first data chunks include a working data chunk, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
associating one or more second signatures with the input data; and determining whether at least one of the first signatures matches with at least one of the second signatures. 15. The method of claim 14, wherein, responsive to a determination that at least one of the first signatures of the working data chunk matches with at least one of the second signatures, the first signature that matches with the second signature being associated with a portion of the working data chunk and the second signature being associated with a portion of the input data, the determination of the relationship between the first history data and the one or more portions of the input data further includes:
determining that the associated portion of the working data chunk is identical to the associated portion of the input data; and determining information about a location and a size of the associated portion of the working data chunk, wherein a first reference token is generated to include the information about the location and size of the associated portion of the working data chunk. 16. The method of claim 14, further comprising receiving one or more second data chunks from a data storage device, each second data chunk being associated with one or more third signatures, and wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that none of the first signatures matches with any of the second signatures, determining whether at least one of the third signatures matches with at least one of the second signatures. 17. The method of claim 16, wherein the determination of the relationship between the first history data and the one or more portions of the input data further includes:
responsive to a determination that at least one of the third signatures matches with at least one of the second signatures, acquiring the second data chunk associated with the third signature that matches with the second signature from the data storage device to become the working data chunk. 18. The method of claim 14, wherein the working data chunk further includes one or more data blocks, wherein at least one of the first signatures is associated with at least one of the data blocks and with a first offset, the first offset indicating the location of the at least one of the data blocks within the working data chunk, and
wherein the determination of the information about a location and a size of the associated portion of the working data chunk includes: searching, within the working data chunk and in a forward direction and/or backward direction relative to the location reflected by the first offset, data that matches with one or more portions of the input data. 19. An apparatus, comprising:
a memory device that stores history data; and at least one processor configured to: receive input data; generate one or more reference tokens including information about at least a portion of history data that is associated with the input data; and transmit the one or more reference tokens and at least a portion of the input data that is not in the history data to a recipient device. 20. The apparatus of claim 19, wherein the information about the portion of the history data includes a location of the portion of the first history data and the size of the portion of the history data. | 2,100 |
4,630 | 14,316,186 | 2,125 | The present invention relates to a probabilistic programming compiler that (a) generates data-parallel inference code to sample from probability distributions in models provided to the compiler; and (b) utilizes a modular framework to allow addition and removal of inference algorithm information based on which the compiler generates the inference code. For a given model, the described compiler can generate inference code that implements any one or more of the inference algorithms that are available to the compiler. The modular compiler framework utilizes an intermediate representation (IR) that symbolically represents features of probability distributions. The compiler then uses the IR as a basis for emitting inference code to sample from the one or more probability distributions represented in the IR. Further, the compiler produces parallelized inference code that facilitates efficient parallel processing of inference computations in order to take advantage of highly data-parallel architectures, such as GPUs. | 1. A method comprising:
compiling source code, representing a model of a body of data, into an intermediate representation of the model; wherein the model of the body of data specifies one or more probability distributions; wherein the intermediate representation of the model represents at least one probability distribution, of the one or more probability distributions, with one or more mathematical expressions; identifying a particular inference algorithm of a plurality of inference algorithms; and producing inference code that implements the particular inference algorithm; wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and wherein producing the inference code is based, at least in part, on an analysis of the one or more mathematical expressions; wherein the method is performed by one or more computing devices. 2. The method of claim 1 further comprising:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying one or more features of the at least one probability distribution that are represented in the one or more mathematical expressions. 3. The method of claim 1, further comprising:
prior to identifying the particular inference algorithm, receiving information indicating one or more rules for analyzing intermediate representations of models; wherein the one or more rules are specific to the particular inference algorithm. 4. The method of claim 3 further comprising:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises:
rewriting the one or more mathematical expressions based, at least in part, on the one or more rules that are specific to the particular inference algorithm, to produce one or more transformed mathematical expressions, and
identifying features of the at least one probability distribution based, at least in part, on analysis of the one or more transformed mathematical expressions. 5. The method of claim 1, further comprising performing the analysis of the one or more mathematical expressions without materializing, in computer memory, a graphical representation of the at least one probability distribution. 6. The method of claim 1 further comprising:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 7. The method of claim 6 wherein:
the inference code, implementing the particular inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data; and
the second inference code, implementing the second inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data. 8. The method of claim 1 further comprising:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from a second probability distribution of the one or more probability distributions;
wherein the second probability distribution is not a probability distribution of the at least one probability distribution; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 9. The method of claim 1 further comprising:
performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying independencies between variables in the one or more mathematical expressions; and
wherein producing the inference code comprises building parallelism into the inference code based, at least in part, on the identified independencies. 10. The method of claim 9 wherein performing the analysis of the one or more mathematical expressions further comprises rewriting the one or more mathematical expressions based, at least in part, on one or more rewrite rules that are specific to a class of the at least one probability distribution, to produce one or more transformed mathematical expressions. 11. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause performance of:
compiling source code, representing a model of a body of data, into an intermediate representation of the model; wherein the model of the body of data specifies one or more probability distributions; wherein the intermediate representation of the model represents at least one probability distribution, of the one or more probability distributions, with one or more mathematical expressions; identifying a particular inference algorithm of a plurality of inference algorithms; and producing inference code that implements the particular inference algorithm; wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and wherein producing the inference code is based, at least in part, on an analysis of the one or more mathematical expressions. 12. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying one or more features of the at least one probability distribution that are represented in the one or more mathematical expressions. 13. The one or more non-transitory computer-readable media of claim 11, further comprising instructions for:
prior to identifying the particular inference algorithm, receiving information indicating one or more rules for analyzing intermediate representations of models; wherein the one or more rules are specific to the particular inference algorithm. 14. The one or more non-transitory computer-readable media of claim 13 further comprising instructions for:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises:
rewriting the one or more mathematical expressions based, at least in part, on the one or more rules that are specific to the particular inference algorithm, to produce one or more transformed mathematical expressions, and
identifying features of the at least one probability distribution based, at least in part, on analysis of the one or more transformed mathematical expressions. 15. The one or more non-transitory computer-readable media of claim 11, further comprising instructions for performing the analysis of the one or more mathematical expressions without materializing, in computer memory, a graphical representation of the at least one probability distribution. 16. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 17. The one or more non-transitory computer-readable media of claim 16 wherein:
the inference code, implementing the particular inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data; and
the second inference code, implementing the second inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data. 18. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from a second probability distribution of the one or more probability distributions;
wherein the second probability distribution is not a probability distribution of the at least one probability distribution; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 19. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying independencies between variables in the one or more mathematical expressions; and
wherein producing the inference code comprises building parallelism into the inference code based, at least in part, on the identified independencies. 20. The one or more non-transitory computer-readable media of claim 19 wherein performing the analysis of the one or more mathematical expressions further comprises rewriting the one or more mathematical expressions based, at least in part, on one or more rewrite rules that are specific to a class of the at least one probability distribution, to produce one or more transformed mathematical expressions. | The present invention relates to a probabilistic programming compiler that (a) generates data-parallel inference code to sample from probability distributions in models provided to the compiler; and (b) utilizes a modular framework to allow addition and removal of inference algorithm information based on which the compiler generates the inference code. For a given model, the described compiler can generate inference code that implements any one or more of the inference algorithms that are available to the compiler. The modular compiler framework utilizes an intermediate representation (IR) that symbolically represents features of probability distributions. The compiler then uses the IR as a basis for emitting inference code to sample from the one or more probability distributions represented in the IR. Further, the compiler produces parallelized inference code that facilitates efficient parallel processing of inference computations in order to take advantage of highly data-parallel architectures, such as GPUs.1. A method comprising:
compiling source code, representing a model of a body of data, into an intermediate representation of the model; wherein the model of the body of data specifies one or more probability distributions; wherein the intermediate representation of the model represents at least one probability distribution, of the one or more probability distributions, with one or more mathematical expressions; identifying a particular inference algorithm of a plurality of inference algorithms; and producing inference code that implements the particular inference algorithm; wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and wherein producing the inference code is based, at least in part, on an analysis of the one or more mathematical expressions; wherein the method is performed by one or more computing devices. 2. The method of claim 1 further comprising:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying one or more features of the at least one probability distribution that are represented in the one or more mathematical expressions. 3. The method of claim 1, further comprising:
prior to identifying the particular inference algorithm, receiving information indicating one or more rules for analyzing intermediate representations of models; wherein the one or more rules are specific to the particular inference algorithm. 4. The method of claim 3 further comprising:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises:
rewriting the one or more mathematical expressions based, at least in part, on the one or more rules that are specific to the particular inference algorithm, to produce one or more transformed mathematical expressions, and
identifying features of the at least one probability distribution based, at least in part, on analysis of the one or more transformed mathematical expressions. 5. The method of claim 1, further comprising performing the analysis of the one or more mathematical expressions without materializing, in computer memory, a graphical representation of the at least one probability distribution. 6. The method of claim 1 further comprising:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 7. The method of claim 6 wherein:
the inference code, implementing the particular inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data; and
the second inference code, implementing the second inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data. 8. The method of claim 1 further comprising:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from a second probability distribution of the one or more probability distributions;
wherein the second probability distribution is not a probability distribution of the at least one probability distribution; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 9. The method of claim 1 further comprising:
performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying independencies between variables in the one or more mathematical expressions; and
wherein producing the inference code comprises building parallelism into the inference code based, at least in part, on the identified independencies. 10. The method of claim 9 wherein performing the analysis of the one or more mathematical expressions further comprises rewriting the one or more mathematical expressions based, at least in part, on one or more rewrite rules that are specific to a class of the at least one probability distribution, to produce one or more transformed mathematical expressions. 11. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause performance of:
compiling source code, representing a model of a body of data, into an intermediate representation of the model; wherein the model of the body of data specifies one or more probability distributions; wherein the intermediate representation of the model represents at least one probability distribution, of the one or more probability distributions, with one or more mathematical expressions; identifying a particular inference algorithm of a plurality of inference algorithms; and producing inference code that implements the particular inference algorithm; wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and wherein producing the inference code is based, at least in part, on an analysis of the one or more mathematical expressions. 12. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying one or more features of the at least one probability distribution that are represented in the one or more mathematical expressions. 13. The one or more non-transitory computer-readable media of claim 11, further comprising instructions for:
prior to identifying the particular inference algorithm, receiving information indicating one or more rules for analyzing intermediate representations of models; wherein the one or more rules are specific to the particular inference algorithm. 14. The one or more non-transitory computer-readable media of claim 13 further comprising instructions for:
prior to producing the inference code, performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises:
rewriting the one or more mathematical expressions based, at least in part, on the one or more rules that are specific to the particular inference algorithm, to produce one or more transformed mathematical expressions, and
identifying features of the at least one probability distribution based, at least in part, on analysis of the one or more transformed mathematical expressions. 15. The one or more non-transitory computer-readable media of claim 11, further comprising instructions for performing the analysis of the one or more mathematical expressions without materializing, in computer memory, a graphical representation of the at least one probability distribution. 16. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from the at least one probability distribution of the one or more probability distributions; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 17. The one or more non-transitory computer-readable media of claim 16 wherein:
the inference code, implementing the particular inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data; and
the second inference code, implementing the second inference algorithm, explores all of the one or more probability distributions specified in the model of the body of data. 18. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
identifying a second inference algorithm, of the plurality of inference algorithms; and
producing second inference code that implements the second inference algorithm;
wherein the inference code is configured to sample from a second probability distribution of the one or more probability distributions;
wherein the second probability distribution is not a probability distribution of the at least one probability distribution; and
wherein producing the second inference code is based, at least in part, on a second analysis of the one or more mathematical expressions. 19. The one or more non-transitory computer-readable media of claim 11 further comprising instructions for:
performing the analysis of the one or more mathematical expressions;
wherein performing the analysis of the one or more mathematical expressions comprises identifying independencies between variables in the one or more mathematical expressions; and
wherein producing the inference code comprises building parallelism into the inference code based, at least in part, on the identified independencies. 20. The one or more non-transitory computer-readable media of claim 19 wherein performing the analysis of the one or more mathematical expressions further comprises rewriting the one or more mathematical expressions based, at least in part, on one or more rewrite rules that are specific to a class of the at least one probability distribution, to produce one or more transformed mathematical expressions. | 2,100 |
4,631 | 13,616,734 | 2,174 | A computer implemented method for intelligently enabling menu choices includes rendering, on a client system, an address book user interface comprising information related to one or more contacts, selecting a contact from the address book user interface, determining an online presence state for the selected contact, enabling one or more menu options based upon the determined online presence state, with the menu options enabled for a first online presence state differing from the menu options enabled for a second online presence state, and presenting the enabled menu options to a user in a user interface. | 1. A computer implemented method for intelligently enabling menu choices, the method comprising:
rendering, on a client system, an address book user interface comprising information related to one or more contacts; selecting a contact from the address book user interface; determining an online presence for the selected contact; enabling one or more menu options based upon the determined online presence state, with menu options enabled for a first online presence differing from menu options enabled for a second online presence state; and presenting the enable menu options to a user in a user interface. 2-46. (canceled) | A computer implemented method for intelligently enabling menu choices includes rendering, on a client system, an address book user interface comprising information related to one or more contacts, selecting a contact from the address book user interface, determining an online presence state for the selected contact, enabling one or more menu options based upon the determined online presence state, with the menu options enabled for a first online presence state differing from the menu options enabled for a second online presence state, and presenting the enabled menu options to a user in a user interface.1. A computer implemented method for intelligently enabling menu choices, the method comprising:
rendering, on a client system, an address book user interface comprising information related to one or more contacts; selecting a contact from the address book user interface; determining an online presence for the selected contact; enabling one or more menu options based upon the determined online presence state, with menu options enabled for a first online presence differing from menu options enabled for a second online presence state; and presenting the enable menu options to a user in a user interface. 2-46. (canceled) | 2,100 |
4,632 | 14,588,563 | 2,158 | Mechanisms, in a Question and Answer (QA) system, are provided for performing a personalized context based search of a corpus of information. A question is received, by the QA system, from a first user via a source device. An answer and supplemental information about the answer to the question are generated based on a corpus processed by the QA system. One or more personality traits associated with the first user are identified and a subset of the supplemental information is selected to present along with the answer to the first user based on the one or more personality traits associated with the first user. The answer and the subset of supplemental information are output to the first user via the source device. | 1. A method, in a data processing system implementing a Question and Answer (QA) system, for performing a personalized context based search of a corpus of information, comprising:
receiving, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generating, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identifying, by the QA system, one or more personality traits associated with the first user; selecting, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and outputting, by the QA system, the answer and the subset of supplemental information to the first user via the source device. 2. The method of claim 1, wherein selecting a subset of the supplemental information to present along with the answer to the first user further comprises:
correlating the one or more personality traits associated with the first user with pre-determined personality traits in a configuration data structure of the QA system to thereby generate at least one matched pre-determined personality traits; identifying types of supplemental information associated with the at least one matched pre-determined personality traits; and selecting the subset of the supplemental information based on the identified types of supplemental information. 3. The method of claim 2, wherein identifying types of supplemental information associated with the at least one matched pre-determined personality traits comprises determining a level of detail of information to present as supplemental information with the answer. 4. The method of claim 2, wherein the one or more personality traits are identified in a first user profile associated with the first user, and wherein the one or more personality traits are personality traits identified in the first user profile that have a most dominant associated trait value. 5. The method of claim 2, wherein selecting the subset of the supplemental information based on the identified types of supplemental information comprises:
weighting values associated with portions of the supplemental information based on whether the portions of the supplemental information align with the one or more personality traits of the first user; and selecting the subset of the supplemental information based on the weighted values associated with the portions of the supplemental information. 6. The method of claim 1, wherein outputting the answer and the supplemental information to the first user via the source device comprises outputting the answer and the supplemental information as one or more natural language statements. 7. The method of claim 1, wherein generating, by the QA system, the answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system further comprises:
retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of the corpus of information; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; and generating, by the QA system, the answer based on the one or more first candidate answers and one or more second candidate answers. 8. The method of claim 1, wherein the one or more second users are second users logically connected to the first user by a common context, and wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 9. The method of claim 1, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 10. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises:
applying the one or more supplemental queries to the corpus to generate the one or more second candidate answers; and generating a ranked listing of candidate answers comprising the one or more first candidate answers and the one or more second candidate answers. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system implementing a Question and Answer (QA) system, causes the data processing system to:
receive, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generate, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identify, by the QA system, one or more personality traits associated with the first user; select, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and output, by the QA system, the answer and the subset of supplemental information to the first user via the source device. 12. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to select a subset of the supplemental information to present along with the answer to the first user at least by:
correlating the one or more personality traits associated with the first user with pre-determined personality traits in a configuration data structure of the QA system to thereby generate at least one matched pre-determined personality traits; identifying types of supplemental information associated with the at least one matched pre-determined personality traits; and selecting the subset of the supplemental information based on the identified types of supplemental information. 13. The computer program product of claim 12, wherein identifying types of supplemental information associated with the at least one matched pre-determined personality traits comprises determining a level of detail of information to present as supplemental information with the answer. 14. The computer program product of claim 12, wherein the one or more personality traits are identified in a first user profile associated with the first user, and wherein the one or more personality traits are personality traits identified in the first user profile that have a most dominant associated trait value. 15. The computer program product of claim 12, wherein selecting the subset of the supplemental information based on the identified types of supplemental information comprises:
weighting values associated with portions of the supplemental information based on whether the portions of the supplemental information align with the one or more personality traits of the first user; and selecting the subset of the supplemental information based on the weighted values associated with the portions of the supplemental information. 16. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to output the answer and the supplemental information to the first user via the source device at least by outputting the answer and the supplemental information as one or more natural language statements. 17. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to generate, by the QA system, the answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system at least by:
retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of the corpus of information; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; and generating, by the QA system, the answer based on the one or more first candidate answers and one or more second candidate answers. 18. The computer program product of claim 11, wherein the one or more second users are second users logically connected to the first user by a common context, and wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 19. The computer program product of claim 11, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a Question and Answer (QA) system and perform the following operations: receive, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generate, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identify, by the QA system, one or more personality traits associated with the first user; select, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and output, by the QA system, the answer and the subset of supplemental information to the first user via the source device. | Mechanisms, in a Question and Answer (QA) system, are provided for performing a personalized context based search of a corpus of information. A question is received, by the QA system, from a first user via a source device. An answer and supplemental information about the answer to the question are generated based on a corpus processed by the QA system. One or more personality traits associated with the first user are identified and a subset of the supplemental information is selected to present along with the answer to the first user based on the one or more personality traits associated with the first user. The answer and the subset of supplemental information are output to the first user via the source device.1. A method, in a data processing system implementing a Question and Answer (QA) system, for performing a personalized context based search of a corpus of information, comprising:
receiving, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generating, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identifying, by the QA system, one or more personality traits associated with the first user; selecting, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and outputting, by the QA system, the answer and the subset of supplemental information to the first user via the source device. 2. The method of claim 1, wherein selecting a subset of the supplemental information to present along with the answer to the first user further comprises:
correlating the one or more personality traits associated with the first user with pre-determined personality traits in a configuration data structure of the QA system to thereby generate at least one matched pre-determined personality traits; identifying types of supplemental information associated with the at least one matched pre-determined personality traits; and selecting the subset of the supplemental information based on the identified types of supplemental information. 3. The method of claim 2, wherein identifying types of supplemental information associated with the at least one matched pre-determined personality traits comprises determining a level of detail of information to present as supplemental information with the answer. 4. The method of claim 2, wherein the one or more personality traits are identified in a first user profile associated with the first user, and wherein the one or more personality traits are personality traits identified in the first user profile that have a most dominant associated trait value. 5. The method of claim 2, wherein selecting the subset of the supplemental information based on the identified types of supplemental information comprises:
weighting values associated with portions of the supplemental information based on whether the portions of the supplemental information align with the one or more personality traits of the first user; and selecting the subset of the supplemental information based on the weighted values associated with the portions of the supplemental information. 6. The method of claim 1, wherein outputting the answer and the supplemental information to the first user via the source device comprises outputting the answer and the supplemental information as one or more natural language statements. 7. The method of claim 1, wherein generating, by the QA system, the answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system further comprises:
retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of the corpus of information; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; and generating, by the QA system, the answer based on the one or more first candidate answers and one or more second candidate answers. 8. The method of claim 1, wherein the one or more second users are second users logically connected to the first user by a common context, and wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 9. The method of claim 1, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 10. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises:
applying the one or more supplemental queries to the corpus to generate the one or more second candidate answers; and generating a ranked listing of candidate answers comprising the one or more first candidate answers and the one or more second candidate answers. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system implementing a Question and Answer (QA) system, causes the data processing system to:
receive, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generate, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identify, by the QA system, one or more personality traits associated with the first user; select, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and output, by the QA system, the answer and the subset of supplemental information to the first user via the source device. 12. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to select a subset of the supplemental information to present along with the answer to the first user at least by:
correlating the one or more personality traits associated with the first user with pre-determined personality traits in a configuration data structure of the QA system to thereby generate at least one matched pre-determined personality traits; identifying types of supplemental information associated with the at least one matched pre-determined personality traits; and selecting the subset of the supplemental information based on the identified types of supplemental information. 13. The computer program product of claim 12, wherein identifying types of supplemental information associated with the at least one matched pre-determined personality traits comprises determining a level of detail of information to present as supplemental information with the answer. 14. The computer program product of claim 12, wherein the one or more personality traits are identified in a first user profile associated with the first user, and wherein the one or more personality traits are personality traits identified in the first user profile that have a most dominant associated trait value. 15. The computer program product of claim 12, wherein selecting the subset of the supplemental information based on the identified types of supplemental information comprises:
weighting values associated with portions of the supplemental information based on whether the portions of the supplemental information align with the one or more personality traits of the first user; and selecting the subset of the supplemental information based on the weighted values associated with the portions of the supplemental information. 16. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to output the answer and the supplemental information to the first user via the source device at least by outputting the answer and the supplemental information as one or more natural language statements. 17. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to generate, by the QA system, the answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system at least by:
retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of the corpus of information; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; and generating, by the QA system, the answer based on the one or more first candidate answers and one or more second candidate answers. 18. The computer program product of claim 11, wherein the one or more second users are second users logically connected to the first user by a common context, and wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 19. The computer program product of claim 11, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a Question and Answer (QA) system and perform the following operations: receive, by the QA system, from a first user via a source device, a question for processing by the QA system to generate an answer result; generate, by the QA system, an answer and supplemental information about the answer to the question based on a corpus of information processed by the QA system; identify, by the QA system, one or more personality traits associated with the first user; select, by the QA system, a subset of the supplemental information to present along with the answer to the first user based on the one or more personality traits associated with the first user; and output, by the QA system, the answer and the subset of supplemental information to the first user via the source device. | 2,100 |
4,633 | 14,588,547 | 2,158 | Mechanisms, in a Question and Answer (QA) system, are provided for performing a personalized context based search of a corpus of information. A question is received, by the QA system, from a first user via a source device. A first user profile associated with the first user, which specifies a personality trait of the first user, is retrieved. First candidate answers to the original question are generated based on a search of a corpus and second users having a similar personality trait to the personality trait of the first user are identified. Similar questions to that of the original question, which were previously submitted to the QA system by the one or more second users are identified. Second candidate answers based on the one or more similar questions are generated by the QA system. A final answer based on the first candidate answers and the second candidate answers is generated and output to the user via the source device. | 1. A method, in a data processing system implementing a Question and Answer (QA) system, for performing a personalized context based search of a corpus of information, comprising:
receiving, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; generating, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and outputting, by the QA system, the answer to the user via the source device. 2. The method of claim 1, wherein the one or more second users are second users logically connected to the first user by a common context. 3. The method of claim 2, wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 4. The method of claim 3, wherein the first user profile comprises an identifier of a context associated with the first user, and wherein the method further comprises selecting the common context and the portion of electronic content associated with the common context based on the context identified in the first user profile. 5. The method of claim 4, wherein the first user profile comprises a plurality of identifiers of contexts associated with the first user, and wherein the common context is selected based on a correlation of features of the original question with an identified context in the first user profile. 6. The method of claim 2, wherein the common context comprises an online community with which the first user and the one or more second users are associated. 7. The method of claim 2, wherein the common context comprises at least one of electronic objects accessed by the first user and the one or more second users within a historical time frame, electronic communications exchanged between the first user and the one or more second users, or electronic communications exchanged between a plurality of the one or more second users. 8. The method of claim 1, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 9. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises performing an interactive exchange between the QA system and a client computing device of the first user that outputs a listing of the one or more portions to the first user and receives a selection from the first user of at least one portion in the one or more portion for use in generating supplemental queries, wherein the one or more supplemental queries are generated based on the selected at least one portion. 10. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises:
applying the one or more supplemental queries to the corpus to generate the one or more second candidate answers; and generating a ranked listing of candidate answers comprising the one or more first candidate answers and the one or more second candidate answers. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system implementing a Question and Answer (QA) system, causes the data processing system to:
receive, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieve, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generate, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identify, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identify, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generate, by the QA system, one or more second candidate answers based on the one or more similar questions; generate, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and output, by the QA system, the answer to the user via the source device. 12. The computer program product of claim 11, wherein the one or more second users are second users logically connected to the first user by a common context. 13. The computer program product of claim 12, wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 14. The computer program product of claim 13, wherein the first user profile comprises an identifier of a context associated with the first user, and wherein the computer readable program further causes the data processing system to select the common context and the portion of electronic content associated with the common context based on the context identified in the first user profile. 15. The computer program product of claim 14, wherein the first user profile comprises a plurality of identifiers of contexts associated with the first user, and wherein the common context is selected based on a correlation of features of the original question with an identified context in the first user profile. 16. The computer program product of claim 12, wherein the common context comprises an online community with which the first user and the one or more second users are associated. 17. The computer program product of claim 12, wherein the common context comprises at least one of electronic objects accessed by the first user and the one or more second users within a historical time frame, electronic communications exchanged between the first user and the one or more second users, or electronic communications exchanged between a plurality of the one or more second users. 18. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to generate one or more second candidate answers based on the one or more similar questions at least by:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 19. The computer program product of claim 18, wherein the computer readable program further causes the data processing system to generate one or more second candidate answers based on the one or more similar questions at least by performing an interactive exchange between the QA system and a client computing device of the first user that outputs a listing of the one or more portions to the first user and receives a selection from the first user of at least one portion in the one or more portion for use in generating supplemental queries, wherein the one or more supplemental queries are generated based on the selected at least one portion. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a Question and Answer (QA) system and perform the following operations: receive, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieve, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generate, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identify, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identify, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generate, by the QA system, one or more second candidate answers based on the one or more similar questions; generate, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and output, by the QA system, the answer to the user via the source device. | Mechanisms, in a Question and Answer (QA) system, are provided for performing a personalized context based search of a corpus of information. A question is received, by the QA system, from a first user via a source device. A first user profile associated with the first user, which specifies a personality trait of the first user, is retrieved. First candidate answers to the original question are generated based on a search of a corpus and second users having a similar personality trait to the personality trait of the first user are identified. Similar questions to that of the original question, which were previously submitted to the QA system by the one or more second users are identified. Second candidate answers based on the one or more similar questions are generated by the QA system. A final answer based on the first candidate answers and the second candidate answers is generated and output to the user via the source device.1. A method, in a data processing system implementing a Question and Answer (QA) system, for performing a personalized context based search of a corpus of information, comprising:
receiving, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieving, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generating, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identifying, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identifying, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generating, by the QA system, one or more second candidate answers based on the one or more similar questions; generating, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and outputting, by the QA system, the answer to the user via the source device. 2. The method of claim 1, wherein the one or more second users are second users logically connected to the first user by a common context. 3. The method of claim 2, wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 4. The method of claim 3, wherein the first user profile comprises an identifier of a context associated with the first user, and wherein the method further comprises selecting the common context and the portion of electronic content associated with the common context based on the context identified in the first user profile. 5. The method of claim 4, wherein the first user profile comprises a plurality of identifiers of contexts associated with the first user, and wherein the common context is selected based on a correlation of features of the original question with an identified context in the first user profile. 6. The method of claim 2, wherein the common context comprises an online community with which the first user and the one or more second users are associated. 7. The method of claim 2, wherein the common context comprises at least one of electronic objects accessed by the first user and the one or more second users within a historical time frame, electronic communications exchanged between the first user and the one or more second users, or electronic communications exchanged between a plurality of the one or more second users. 8. The method of claim 1, wherein generating one or more second candidate answers based on the one or more similar questions comprises:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 9. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises performing an interactive exchange between the QA system and a client computing device of the first user that outputs a listing of the one or more portions to the first user and receives a selection from the first user of at least one portion in the one or more portion for use in generating supplemental queries, wherein the one or more supplemental queries are generated based on the selected at least one portion. 10. The method of claim 8, wherein generating one or more second candidate answers based on the one or more similar questions further comprises:
applying the one or more supplemental queries to the corpus to generate the one or more second candidate answers; and generating a ranked listing of candidate answers comprising the one or more first candidate answers and the one or more second candidate answers. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system implementing a Question and Answer (QA) system, causes the data processing system to:
receive, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieve, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generate, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identify, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identify, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generate, by the QA system, one or more second candidate answers based on the one or more similar questions; generate, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and output, by the QA system, the answer to the user via the source device. 12. The computer program product of claim 11, wherein the one or more second users are second users logically connected to the first user by a common context. 13. The computer program product of claim 12, wherein the corpus of electronic content comprises a portion of electronic content associated with the common context. 14. The computer program product of claim 13, wherein the first user profile comprises an identifier of a context associated with the first user, and wherein the computer readable program further causes the data processing system to select the common context and the portion of electronic content associated with the common context based on the context identified in the first user profile. 15. The computer program product of claim 14, wherein the first user profile comprises a plurality of identifiers of contexts associated with the first user, and wherein the common context is selected based on a correlation of features of the original question with an identified context in the first user profile. 16. The computer program product of claim 12, wherein the common context comprises an online community with which the first user and the one or more second users are associated. 17. The computer program product of claim 12, wherein the common context comprises at least one of electronic objects accessed by the first user and the one or more second users within a historical time frame, electronic communications exchanged between the first user and the one or more second users, or electronic communications exchanged between a plurality of the one or more second users. 18. The computer program product of claim 11, wherein the computer readable program further causes the data processing system to generate one or more second candidate answers based on the one or more similar questions at least by:
identifying one or more portions of the one or more similar questions that align with the personality trait of the first user; and generating one or more supplemental queries based on the identified portions of the one or more similar questions. 19. The computer program product of claim 18, wherein the computer readable program further causes the data processing system to generate one or more second candidate answers based on the one or more similar questions at least by performing an interactive exchange between the QA system and a client computing device of the first user that outputs a listing of the one or more portions to the first user and receives a selection from the first user of at least one portion in the one or more portion for use in generating supplemental queries, wherein the one or more supplemental queries are generated based on the selected at least one portion. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a Question and Answer (QA) system and perform the following operations: receive, by the QA system, from a first user via a source device, an original question for processing by the QA system to generate an answer result; retrieve, by the QA system, a first user profile associated with the first user, wherein the first user profile specifies a personality trait of the first user; generate, by the QA system, one or more first candidate answers to the original question based on a search of a corpus of electronic content; identify, by the QA system, one or more second users having a similar personality trait to the personality trait of the first user; identify, by the QA system, one or more similar questions, similar to that of the original question, previously submitted to the QA system by the one or more second users; generate, by the QA system, one or more second candidate answers based on the one or more similar questions; generate, by the QA system, a final answer based on the one or more first candidate answers and one or more second candidate answers; and output, by the QA system, the answer to the user via the source device. | 2,100 |
4,634 | 14,502,643 | 2,181 | An instrumentation chassis includes a backplane, multiple peripheral slots located on the backplane and configured to receive insertable peripheral modules, respectively, and at least one protocol agnostic high speed connection mounted on, but not electrically connected to the backplane. The high speed connection is configured to interconnect at least two peripheral modules in corresponding peripheral slots of the multiple peripheral slots, bypassing the backplane. | 1. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules, respectively; and at least one protocol agnostic high speed connection mounted on, but not electrically connected to the backplane and configured to interconnect at least two peripheral modules in corresponding peripheral slots of the plurality of peripheral slots, bypassing the backplane. 2. The instrumentation chassis of claim 1, wherein the at least one protocol agnostic high speed connection comprises differential pair high speed connections. 3. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise transceiver connections. 4. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise connections enabling communication in one direction only. 5. The instrumentation chassis of claim 2, wherein the insertable peripheral modules comprise processing or converter elements which communicate over the high speed transceiver connection contained on the at least one protocol agnostic high speed connection. 6. The instrumentation chassis of claim 5, wherein the processing or converter elements comprise at least one of a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a JESD204B Analog to Digital Converter or a JESD204B Digital to Analog Converter. 7. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise Serializer/Deserializer (SerDes) connections. 8. The instrumentation chassis of claim 1, wherein each of the at least two peripheral modules contains a differential pair high speed connector for interconnecting modules with at least one differential pair high speed connection. 9. The instrumentation chassis of claim 1, wherein the instrumentation chassis comprises a peripheral component interconnect express (PCIe) eXtensions for instrumentation (PXIe) chassis, and
wherein at least one of the at least two peripheral modules contains a standard PXIe connector for connecting with the corresponding peripheral slot and a high speed transceiver connection for connecting with the at least one high speed connection. 10. The instrumentation chassis of claim 1, further comprising:
a bridge board restraint located between the backplane and the at least one protocol agnostic high speed connection, providing an attachment mechanism for the bridge board and an insulating surface separating agnostic high speed connection from at least one of the plurality of peripheral slots and the backplane. 11. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules; and a bridge board attachable to the backplane, the bridge board comprising a plurality of differential pair high speed connections configured to interconnect insertable peripheral modules of the plurality of insertable peripheral modules. 12. The instrumentation chassis of claim 11, wherein at least one of the plurality of differential pair high speed connections comprises a high speed transceiver connection, or a connection enabling communication in one direction only. 13. The instrumentation chassis of claim 11, wherein each of the multiple insertable peripheral modules comprises at least one high speed transceiver connection for connecting with the bridge board. 14. The instrumentation chassis of claim 11, wherein each of the insertable peripheral modules further comprises at least one standard connector for connecting with the backplane via the respective peripheral slots. 15. The instrumentation chassis of claim 11, further comprising:
a bridge board restraint configured to attach the bridge board to the backplane, while keeping the bridge board electrically isolated. 16. The instrumentation chassis of claim 15, wherein the bridge board restraint is installed in the instrumentation chassis using legacy connectors of the peripheral slots. 17. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules; and a bridge board attachable to the backplane, the bridge board containing a plurality of mixed signal connections configured to interconnect insertable peripheral modules, by-passing the backplane, of the plurality of insertable peripheral modules. 18. The instrumentation chassis of claim 17, wherein at least one of the mixed signal connections comprises radio frequency (RF) or microwave connectors. 19. The instrumentation chassis of claim 18, wherein at least one of the connections comprises coaxial blindmate connectors with attached transmission lines between connectors configured to interconnect insertable peripheral modules. 20. The instrumentation chassis of claim 18, wherein the insertable peripheral modules comprise processing or converter elements which communicate over the plurality of mixed signal connections. | An instrumentation chassis includes a backplane, multiple peripheral slots located on the backplane and configured to receive insertable peripheral modules, respectively, and at least one protocol agnostic high speed connection mounted on, but not electrically connected to the backplane. The high speed connection is configured to interconnect at least two peripheral modules in corresponding peripheral slots of the multiple peripheral slots, bypassing the backplane.1. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules, respectively; and at least one protocol agnostic high speed connection mounted on, but not electrically connected to the backplane and configured to interconnect at least two peripheral modules in corresponding peripheral slots of the plurality of peripheral slots, bypassing the backplane. 2. The instrumentation chassis of claim 1, wherein the at least one protocol agnostic high speed connection comprises differential pair high speed connections. 3. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise transceiver connections. 4. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise connections enabling communication in one direction only. 5. The instrumentation chassis of claim 2, wherein the insertable peripheral modules comprise processing or converter elements which communicate over the high speed transceiver connection contained on the at least one protocol agnostic high speed connection. 6. The instrumentation chassis of claim 5, wherein the processing or converter elements comprise at least one of a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a JESD204B Analog to Digital Converter or a JESD204B Digital to Analog Converter. 7. The instrumentation chassis of claim 2, wherein the differential pair high speed connections comprise Serializer/Deserializer (SerDes) connections. 8. The instrumentation chassis of claim 1, wherein each of the at least two peripheral modules contains a differential pair high speed connector for interconnecting modules with at least one differential pair high speed connection. 9. The instrumentation chassis of claim 1, wherein the instrumentation chassis comprises a peripheral component interconnect express (PCIe) eXtensions for instrumentation (PXIe) chassis, and
wherein at least one of the at least two peripheral modules contains a standard PXIe connector for connecting with the corresponding peripheral slot and a high speed transceiver connection for connecting with the at least one high speed connection. 10. The instrumentation chassis of claim 1, further comprising:
a bridge board restraint located between the backplane and the at least one protocol agnostic high speed connection, providing an attachment mechanism for the bridge board and an insulating surface separating agnostic high speed connection from at least one of the plurality of peripheral slots and the backplane. 11. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules; and a bridge board attachable to the backplane, the bridge board comprising a plurality of differential pair high speed connections configured to interconnect insertable peripheral modules of the plurality of insertable peripheral modules. 12. The instrumentation chassis of claim 11, wherein at least one of the plurality of differential pair high speed connections comprises a high speed transceiver connection, or a connection enabling communication in one direction only. 13. The instrumentation chassis of claim 11, wherein each of the multiple insertable peripheral modules comprises at least one high speed transceiver connection for connecting with the bridge board. 14. The instrumentation chassis of claim 11, wherein each of the insertable peripheral modules further comprises at least one standard connector for connecting with the backplane via the respective peripheral slots. 15. The instrumentation chassis of claim 11, further comprising:
a bridge board restraint configured to attach the bridge board to the backplane, while keeping the bridge board electrically isolated. 16. The instrumentation chassis of claim 15, wherein the bridge board restraint is installed in the instrumentation chassis using legacy connectors of the peripheral slots. 17. An instrumentation chassis, comprising:
a backplane; a plurality of peripheral slots located on the backplane and configured to receive a plurality of insertable peripheral modules; and a bridge board attachable to the backplane, the bridge board containing a plurality of mixed signal connections configured to interconnect insertable peripheral modules, by-passing the backplane, of the plurality of insertable peripheral modules. 18. The instrumentation chassis of claim 17, wherein at least one of the mixed signal connections comprises radio frequency (RF) or microwave connectors. 19. The instrumentation chassis of claim 18, wherein at least one of the connections comprises coaxial blindmate connectors with attached transmission lines between connectors configured to interconnect insertable peripheral modules. 20. The instrumentation chassis of claim 18, wherein the insertable peripheral modules comprise processing or converter elements which communicate over the plurality of mixed signal connections. | 2,100 |
4,635 | 14,225,714 | 2,167 | A method may include receiving a selected document, or a set of documents, from a user, analyzing a content of the selected document, or documents, and determining a category of skill based on the content of the selected document. The method may also include locating a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators, and ranking the plurality of collaborators based on a predetermined score for the corresponding category of skill. Further, the method may include presenting the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. | 1. A method, comprising:
receiving a selected document from a user; analyzing content of the selected document; determining a category of skill based on the content of the selected document; locating a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; ranking the plurality of collaborators on the corresponding category of skill; and presenting the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 2. The method of claim 1, wherein a plurality of potential collaborators is determined by:
determining a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; assigning a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and storing the score for each category of skill for each potential collaborator in a predetermined location. 3. The method of claim 2, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 4. The method of claim 3, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 5. The method of claim 2, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 6. The method of claim 1, wherein determining the category of skill comprises clustering the content of the selected document into a plurality of skill axes. 7. The method of claim 1, wherein receiving a selected document from the user comprises:
presenting a list of documents to the user; and receiving a selection of a document from the user. 8. A system comprising:
a receiving device configured to receive a selected document from a user; an analyzing device configured to analyze content of the selected document; a determining device configured to determine a category of skill based on the content of the selected document; a locating device configured to locate a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; a ranking device configured to rank the plurality of collaborators on the corresponding category of skill; and a presenting device configured to present the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 9. The system of claim 8, wherein a plurality of potential collaborators is determined by:
the determining device configured to determine a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; an assigning device configured to assign a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and a storing device configured to store the score for each category of skill for each potential collaborator in a predetermined location. 10. The system of claim 9, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 11. The system of claim 10, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 12. The system of claim 9, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 13. The system of claim 8, wherein the determining device is further configured to cluster the content of the selected document into a plurality of skill axes. 14. The system of claim 8, wherein the receiving device is further configured to:
present a list of documents to the user; and receive a selection of a document from the user. 15. 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 receive a selected document from a user; computer readable program code configured to analyze content of the selected document; computer readable program code configured to determine a category of skill based on the content of the selected document; computer readable program code configured to locate a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; computer readable program code configured to rank the plurality of collaborators on the corresponding category of skill; and computer readable program code configured to present the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 16. The computer program product of claim 15, wherein a plurality of potential collaborators is determined by:
computer readable program code configured to determine a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; computer readable program code configured to assign a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and computer readable program code configured to store the score for each category of skill for each potential collaborator in a predetermined location. 17. The computer program product of claim 16, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 18. The computer program product of claim 17, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 19. The computer program product of claim 16, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 20. The computer program product of claim 15, wherein the computer readable program code is further configured to cluster the content of the selected document into a plurality of skill axes. 21. The computer program product of claim 15, wherein the computer readable program code is further configured to:
present a list of documents to the user; and receive a selection of a document from the user. | A method may include receiving a selected document, or a set of documents, from a user, analyzing a content of the selected document, or documents, and determining a category of skill based on the content of the selected document. The method may also include locating a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators, and ranking the plurality of collaborators based on a predetermined score for the corresponding category of skill. Further, the method may include presenting the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators.1. A method, comprising:
receiving a selected document from a user; analyzing content of the selected document; determining a category of skill based on the content of the selected document; locating a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; ranking the plurality of collaborators on the corresponding category of skill; and presenting the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 2. The method of claim 1, wherein a plurality of potential collaborators is determined by:
determining a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; assigning a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and storing the score for each category of skill for each potential collaborator in a predetermined location. 3. The method of claim 2, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 4. The method of claim 3, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 5. The method of claim 2, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 6. The method of claim 1, wherein determining the category of skill comprises clustering the content of the selected document into a plurality of skill axes. 7. The method of claim 1, wherein receiving a selected document from the user comprises:
presenting a list of documents to the user; and receiving a selection of a document from the user. 8. A system comprising:
a receiving device configured to receive a selected document from a user; an analyzing device configured to analyze content of the selected document; a determining device configured to determine a category of skill based on the content of the selected document; a locating device configured to locate a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; a ranking device configured to rank the plurality of collaborators on the corresponding category of skill; and a presenting device configured to present the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 9. The system of claim 8, wherein a plurality of potential collaborators is determined by:
the determining device configured to determine a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; an assigning device configured to assign a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and a storing device configured to store the score for each category of skill for each potential collaborator in a predetermined location. 10. The system of claim 9, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 11. The system of claim 10, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 12. The system of claim 9, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 13. The system of claim 8, wherein the determining device is further configured to cluster the content of the selected document into a plurality of skill axes. 14. The system of claim 8, wherein the receiving device is further configured to:
present a list of documents to the user; and receive a selection of a document from the user. 15. 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 receive a selected document from a user; computer readable program code configured to analyze content of the selected document; computer readable program code configured to determine a category of skill based on the content of the selected document; computer readable program code configured to locate a plurality of collaborators by matching the category of skill with a corresponding category of skill of a potential collaborator selected from a plurality of potential collaborators; computer readable program code configured to rank the plurality of collaborators on the corresponding category of skill; and computer readable program code configured to present the user with a ranked list of the plurality of collaborators based on the ranking of the plurality of collaborators. 16. The computer program product of claim 15, wherein a plurality of potential collaborators is determined by:
computer readable program code configured to determine a plurality of categories of skills for each potential collaborator of the plurality of potential collaborators based on user content of each potential collaborator; computer readable program code configured to assign a score for each category of skill for each potential collaborator based on an overall affinity of the potential collaborator's content for the category of skill; and computer readable program code configured to store the score for each category of skill for each potential collaborator in a predetermined location. 17. The computer program product of claim 16, wherein the user content of each potential collaborator comprises an entire body of documents created or edited by the potential collaborator. 18. The computer program product of claim 17, wherein the overall affinity of the potential collaborator's content for the category of skill is determined by the number of documents of the entire body of documents created or edited by the potential collaborator that correspond to the category of skill. 19. The computer program product of claim 16, wherein
the corresponding category of skill of each collaborator comprises a category of skill of the plurality of categories of skills for each potential collaborator that matches the determined category of skill based on the content of the selected document; and a predetermined score on the corresponding category of skill of each collaborator used for ranking the plurality of collaborators comprises the score for a category of skill for each potential collaborator based on the overall affinity of the potential collaborator's content for the category of skill. 20. The computer program product of claim 15, wherein the computer readable program code is further configured to cluster the content of the selected document into a plurality of skill axes. 21. The computer program product of claim 15, wherein the computer readable program code is further configured to:
present a list of documents to the user; and receive a selection of a document from the user. | 2,100 |
4,636 | 14,457,585 | 2,114 | A method for determining that a defect applies to a network device that includes receiving, at a monitoring module, network device information from the network device. The network device information includes state information for the network device and does not include hardware and software version information. The method includes storing, in a network device database, the network device information from the network device and receiving, at the monitoring module, defect information about a defect. The defect information includes network device criteria specifying what state information is required for a network device to be affected by the defect. The method includes storing the defect information in a defect database, determining that the defect applies to the network device based on analyzing the network device information and the defect information from their respective databases, and, based on the determination, informing a defect alert recipient that the defect applies to the network device. | 1. A method for determining that a defect applies to a network device, comprising:
receiving, at a monitoring module, network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the monitoring module defect information about a defect, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affected by the defect; storing the defect information in a defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. 2. The method of claim 1, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, and configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device. 3. The method of claim 1, wherein the network device information further comprises operational information that specifies commands executed on the network device. 4. The method of claim 1, wherein the state information comprises at least one selected from a group consisting of a number of routing table entries and a number of Internet Gateway Protocol (IGP) peers. 5. The method of claim 1, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 6. The method of claim 1, wherein informing the defect alert recipient that the defect applies to the network device further comprises:
sending, from the monitoring module, information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 7. The method of claim 1, the method further comprising:
executing automatically a solution for the defect that applies to the network device. 8. The method of claim 7, the method further comprising:
obtaining permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 9. A defect monitoring system, comprising:
a defect database comprising a defect entry for a defect, wherein the defect entry comprises defect information; a network device database comprising a network device entry for a network device, wherein the network device entry comprises network device information; and a monitoring module operatively connected to the network device and to a defect alert recipient and configured to:
receive the network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information;
store in the network device database the network device information from the network device;
determine that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affected by the defect; and
based on the determination, inform the defect alert recipient that the defect applies to the network device. 10. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
receive the defect information about the defect; and store the defect information in the defect database. 11. The defect monitoring system of claim 9, wherein the network device is one selected from a group consisting of a switch and a router. 12. The defect monitoring system of claim 9, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device, and operational information that specifies commands executed on the network device. 13. The defect monitoring system of claim 9, wherein the state information comprises at least one selected from a group consisting of capabilities enabled on the switch and security settings information. 14. The defect monitoring system of claim 9, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 15. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
send information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 16. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
execute automatically a solution for the defect that applies to the network device. 17. The defect monitoring system of claim 16, wherein the monitoring module is further configured to:
obtain permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 18. A non-transitory computer readable medium comprising instructions, which when executed by a processor perform a method, the method comprising:
receiving at a monitoring module network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the monitoring module defect information about a defect, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affect by the defect; storing the defect information in a defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. 19. The non-transitory computer readable medium of claim 18, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, and configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device. 20. The non-transitory computer readable medium of claim 18, wherein the network device information further comprises operational information that specifies commands executed on the network device. 21. The non-transitory computer readable medium of claim 18, wherein the state information comprises at least one selected from a group consisting of a number of virtual local area networks (VLAN) configured and a number of media access control (MAC) addresses in a MAC address table. 22. The non-transitory computer readable medium of claim 18, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 23. The non-transitory computer readable medium of claim 18, wherein informing the defect alert recipient that the defect applies to the network device further comprises:
sending, from the monitoring module, information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 24. The non-transitory computer readable medium of claim 18, further comprising instructions for executing automatically a solution for the defect that applies to the network device. 25. The non-transitory computer readable medium of claim 24, further comprising instructions for obtaining permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 26. A method for determining that a defect applies to a network device, comprising:
receiving at an internal monitoring module network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the internal monitoring module defect information about a defect from an external monitoring module, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affect by the defect; storing the defect information in an internal defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. | A method for determining that a defect applies to a network device that includes receiving, at a monitoring module, network device information from the network device. The network device information includes state information for the network device and does not include hardware and software version information. The method includes storing, in a network device database, the network device information from the network device and receiving, at the monitoring module, defect information about a defect. The defect information includes network device criteria specifying what state information is required for a network device to be affected by the defect. The method includes storing the defect information in a defect database, determining that the defect applies to the network device based on analyzing the network device information and the defect information from their respective databases, and, based on the determination, informing a defect alert recipient that the defect applies to the network device.1. A method for determining that a defect applies to a network device, comprising:
receiving, at a monitoring module, network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the monitoring module defect information about a defect, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affected by the defect; storing the defect information in a defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. 2. The method of claim 1, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, and configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device. 3. The method of claim 1, wherein the network device information further comprises operational information that specifies commands executed on the network device. 4. The method of claim 1, wherein the state information comprises at least one selected from a group consisting of a number of routing table entries and a number of Internet Gateway Protocol (IGP) peers. 5. The method of claim 1, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 6. The method of claim 1, wherein informing the defect alert recipient that the defect applies to the network device further comprises:
sending, from the monitoring module, information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 7. The method of claim 1, the method further comprising:
executing automatically a solution for the defect that applies to the network device. 8. The method of claim 7, the method further comprising:
obtaining permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 9. A defect monitoring system, comprising:
a defect database comprising a defect entry for a defect, wherein the defect entry comprises defect information; a network device database comprising a network device entry for a network device, wherein the network device entry comprises network device information; and a monitoring module operatively connected to the network device and to a defect alert recipient and configured to:
receive the network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information;
store in the network device database the network device information from the network device;
determine that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affected by the defect; and
based on the determination, inform the defect alert recipient that the defect applies to the network device. 10. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
receive the defect information about the defect; and store the defect information in the defect database. 11. The defect monitoring system of claim 9, wherein the network device is one selected from a group consisting of a switch and a router. 12. The defect monitoring system of claim 9, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device, and operational information that specifies commands executed on the network device. 13. The defect monitoring system of claim 9, wherein the state information comprises at least one selected from a group consisting of capabilities enabled on the switch and security settings information. 14. The defect monitoring system of claim 9, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 15. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
send information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 16. The defect monitoring system of claim 9, wherein the monitoring module is further configured to:
execute automatically a solution for the defect that applies to the network device. 17. The defect monitoring system of claim 16, wherein the monitoring module is further configured to:
obtain permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 18. A non-transitory computer readable medium comprising instructions, which when executed by a processor perform a method, the method comprising:
receiving at a monitoring module network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the monitoring module defect information about a defect, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affect by the defect; storing the defect information in a defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. 19. The non-transitory computer readable medium of claim 18, wherein the network device information further comprises network device identification (ID) information that uniquely identifies the network device, and configuration information that specifies a hardware version of hardware in the network device and a software version of software executing on the network device. 20. The non-transitory computer readable medium of claim 18, wherein the network device information further comprises operational information that specifies commands executed on the network device. 21. The non-transitory computer readable medium of claim 18, wherein the state information comprises at least one selected from a group consisting of a number of virtual local area networks (VLAN) configured and a number of media access control (MAC) addresses in a MAC address table. 22. The non-transitory computer readable medium of claim 18, wherein the defect information further comprises defect identification information that uniquely identifies the defect, defect details information, and solution information specifying how to correct the defect. 23. The non-transitory computer readable medium of claim 18, wherein informing the defect alert recipient that the defect applies to the network device further comprises:
sending, from the monitoring module, information to the defect alert recipient relating to a solution for the defect, wherein the solution is derived from the solution information. 24. The non-transitory computer readable medium of claim 18, further comprising instructions for executing automatically a solution for the defect that applies to the network device. 25. The non-transitory computer readable medium of claim 24, further comprising instructions for obtaining permission from the defect alert recipient before automatically executing the solution for the defect that applies to the network device. 26. A method for determining that a defect applies to a network device, comprising:
receiving at an internal monitoring module network device information from the network device, wherein the network device information comprises state information for the network device, and wherein state information does not comprise hardware and software version information; storing in a network device database the network device information from the network device; receiving at the internal monitoring module defect information about a defect from an external monitoring module, wherein the defect information comprises network device criteria specifying what state information is required for a network device to be affect by the defect; storing the defect information in an internal defect database; determining that the defect applies to the network device based on analyzing the network device information in the network device database and the defect information in the defect database; based on the determination, informing a defect alert recipient that the defect applies to the network device. | 2,100 |
4,637 | 14,787,380 | 2,196 | An application process can be executed based on an initialization instruction, where the application process includes instructions associated with a hook framework. A virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process can be initiated and the instructions associated with the hook framework can be executed upon initiation of the virtual machine to insert a hook on the virtual machine. A nascent process configured to initiate an additional virtual machine can be initiated based on a request to load an application, where the additional virtual machine is hooked via the hook inserted on the virtual machine. | 1. A non-transitory computer-readable medium storing a set of instructions executable by a processing resource to:
execute an application process based on an initialization instruction, wherein the application process includes instructions associated with a hook framework; initiate a virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process; execute the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook on the virtual machine; and initiate a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook inserted on the virtual machine. 2. The medium of claim 1, wherein instructions are executable to cause the hook to collect data associated with the application that has been loaded. 3. The medium of claim 1, wherein instructions are executable to cause the hook to collect data associated with an application that will be loaded within a defined time. 4. The medium of claim 3, wherein instructions are executable to intercept a library function call made by the application loaded by the virtual machine. 5. The medium of claim 1, wherein the instructions associated with the hook framework are executable after the virtual machine is initiated and before the nascent process is initiated. 6. The medium of claim 5, wherein additional virtual machines that are loaded based on additional requests to load applications are hooked via the hook inserted on the virtual machine. 7. The medium of claim 1, wherein instructions are executable to monitor at least one of central processing unit utilization, memory demands, data throughput, and bandwidth associated with the application via the hook. 8. The medium of claim 1, wherein instructions are executable to perform application interruption via the hook. 9. A system, comprising a processing resource in communication with a non-transitory computer readable medium having instructions executable by the processing resource to implement an interpret engine, an execute process engine, an initiate machine engine, an execute instructions engine, and an initiate process engine, wherein:
the interpret engine to interpret an initialization instruction; the execute process engine to execute the application process based on the initialization instruction, wherein the application process includes instructions associated with a hook framework; the initiate machine engine to initiate a virtual machine configured to load the hook framework based on instructions included in the application process; the execute instructions engine to execute the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook from the hook framework on the virtual machine; and the initiate process engine to initiate a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook to collect data associated with the application. 10. The system of claim 9, wherein the hook is configured to perform application recording. 11. The system of claim 9, wherein the hook is configured to collect sensor data associated with the application. 12. A method, comprising:
interpreting an initialization instruction associated with a startup of a mobile device; executing an application process based on the initialization instruction, wherein the application process includes instructions associated with a hook framework; initiating a virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process; executing the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook from the hook framework on the virtual machine; and initiating a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook to collect sensor data associated with the application, and wherein the hook framework is executed after the virtual machine is initiated and before the nascent process is initiated. 13. The method of claim 12, wherein the method includes replacing instructions associated with the application via the hook. 14. The method of claim 13, wherein the method includes executing the replaced instructions associated with the application. 15. The method of claim 12, wherein collecting sensor data associated with the application includes collecting data from a network connectivity sensor. | An application process can be executed based on an initialization instruction, where the application process includes instructions associated with a hook framework. A virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process can be initiated and the instructions associated with the hook framework can be executed upon initiation of the virtual machine to insert a hook on the virtual machine. A nascent process configured to initiate an additional virtual machine can be initiated based on a request to load an application, where the additional virtual machine is hooked via the hook inserted on the virtual machine.1. A non-transitory computer-readable medium storing a set of instructions executable by a processing resource to:
execute an application process based on an initialization instruction, wherein the application process includes instructions associated with a hook framework; initiate a virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process; execute the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook on the virtual machine; and initiate a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook inserted on the virtual machine. 2. The medium of claim 1, wherein instructions are executable to cause the hook to collect data associated with the application that has been loaded. 3. The medium of claim 1, wherein instructions are executable to cause the hook to collect data associated with an application that will be loaded within a defined time. 4. The medium of claim 3, wherein instructions are executable to intercept a library function call made by the application loaded by the virtual machine. 5. The medium of claim 1, wherein the instructions associated with the hook framework are executable after the virtual machine is initiated and before the nascent process is initiated. 6. The medium of claim 5, wherein additional virtual machines that are loaded based on additional requests to load applications are hooked via the hook inserted on the virtual machine. 7. The medium of claim 1, wherein instructions are executable to monitor at least one of central processing unit utilization, memory demands, data throughput, and bandwidth associated with the application via the hook. 8. The medium of claim 1, wherein instructions are executable to perform application interruption via the hook. 9. A system, comprising a processing resource in communication with a non-transitory computer readable medium having instructions executable by the processing resource to implement an interpret engine, an execute process engine, an initiate machine engine, an execute instructions engine, and an initiate process engine, wherein:
the interpret engine to interpret an initialization instruction; the execute process engine to execute the application process based on the initialization instruction, wherein the application process includes instructions associated with a hook framework; the initiate machine engine to initiate a virtual machine configured to load the hook framework based on instructions included in the application process; the execute instructions engine to execute the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook from the hook framework on the virtual machine; and the initiate process engine to initiate a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook to collect data associated with the application. 10. The system of claim 9, wherein the hook is configured to perform application recording. 11. The system of claim 9, wherein the hook is configured to collect sensor data associated with the application. 12. A method, comprising:
interpreting an initialization instruction associated with a startup of a mobile device; executing an application process based on the initialization instruction, wherein the application process includes instructions associated with a hook framework; initiating a virtual machine configured to load the hook framework on the virtual machine based on instructions included in the application process; executing the instructions associated with the hook framework upon initiation of the virtual machine to insert a hook from the hook framework on the virtual machine; and initiating a nascent process configured to initiate an additional virtual machine based on a request to load an application, wherein the additional virtual machine is hooked via the hook to collect sensor data associated with the application, and wherein the hook framework is executed after the virtual machine is initiated and before the nascent process is initiated. 13. The method of claim 12, wherein the method includes replacing instructions associated with the application via the hook. 14. The method of claim 13, wherein the method includes executing the replaced instructions associated with the application. 15. The method of claim 12, wherein collecting sensor data associated with the application includes collecting data from a network connectivity sensor. | 2,100 |
4,638 | 13,606,775 | 2,128 | Various embodiments provide a network planning tool comprising one or more memory storage areas containing data related to a plurality of transportation networks, and one or more computer processors configured to: receive input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks; retrieve at least a portion of the data contained in the one or more memory storage areas; validate the input data against the portion of data retrieved from the one or more memory storage areas, the validating comprising at least calculating one or more impacts to the integrated flow model based at least in part upon the received input data; and calculate, based at least in part upon the identified one or more impacts, one or more updated flow models for the plurality of transportation networks. Associated computer program products and computer-implemented methods are also provided. | 1. A network planning tool for simulating an integrated flow model for a plurality of transportation networks, the tool comprising:
one or more memory storage areas containing data related to a plurality of transportation networks; and one or more computer processors configured to:
(A) receive input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks;
(B) retrieve at least a portion of the data contained in the one or more memory storage areas;
(C) validate the input data against the portion of data retrieved from the one or more memory storage areas, the validating comprising at least calculating one or more impacts to the integrated flow model based at least in part upon the received input data; and
(D) calculate, based at least in part upon the identified one or more impacts, one or more updated flow models for the plurality of transportation networks. 2. The network planning tool of claim 1, further comprising the step of updating the integrated flow model to reflect a single one of the one or more updated flow models. 3. The network planning tool of claim 2, wherein the one or more computer processors are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 4. The network planning tool of claim 1, wherein the one or more computer processors are configured to automatically perform the recited steps based solely upon receipt of input data in Step A. 5. The network planning tool of claim 4, wherein the one or more computer processors are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 6. The network planning tool of claim 1, wherein:
the input data comprises a global modification to one or more parameters associated with the plurality of transportation networks; and the portion of retrieved data previously stored comprises essentially an entirety of the previously stored data. 7. The network planning tool of claim 6, wherein:
the global modification comprises an addition of a new shipping service level within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the addition of the new shipping service level. 8. The network planning tool of claim 6, wherein:
the global modification comprises a deletion of a new shipping service level within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the deletion of the new shipping service level. 9. The network planning tool of claim 8, wherein the calculation of one or more updated flow models comprises calculating at least one flow model wherein one or more commitments associated with the deleted service level are rebalanced between one or more remaining service levels so as to optimize the integrated flow model for the plurality of transportation networks. 10. The network planning tool of claim 1, wherein the one or more computer processors are further configured to transmit the one or more updated flow models to one or more distributed devices connected via at least one network. 11. The network planning tool of claim 10, wherein the one or more computer processors are configured to automatically transmit the one or more optimized flow models to the one or more distributed devices, so as to provide near real-time updates based upon validation and optimization of the plurality of transportation networks. 12. The network planning tool of claim 1, wherein:
the input data comprises a localized modification to one or more parameters associated with the plurality of transportation networks; and the portion data retrieved from the one or more storage areas comprises a subset of the entirety of the data contained in the one or more storage areas, the subset comprising data associated with the one or more parameters being modified by the input data. 13. The network planning tool of claim 12, wherein:
the localized modification comprises bypass of a particular load within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the bypass of the particular load. 14. The network planning tool of claim 12, wherein the localized modification is selected from a group consisting of a bypass of a particular load, a bypass of a particular facility, a bypass of a particular sort, a lane enhancement, and an alternative flow. 15. The network planning tool of claim 12, wherein the one or more computer processors are further configured to automatically transmit the one or more updated flow models to one or more distributed devices connected via at least one network. 16. A computer program product comprising at least one computer-readable storage medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising:
a first executable portion configured for receiving data associated with a plurality of transportation networks, wherein the data comprises a first portion of existing data and a second portion of newly input data; a second executable portion configured for validating the newly input data against the existing data, wherein the validating comprises calculating one or more impacts to an integrated flow model for the plurality of transportation networks based at least in part upon the newly input data; and a third executable portion configured for using the one or more impacts to the integrated flow model, the input data, and the existing data to calculate one or more updated flow models for the plurality of transportation networks. 17. The computer program product of claim 16, further comprising a fourth executable portion configured to transmit at least one of the one or more updated flow models for the plurality of transportation networks to at least one distributed device. 18. The computer program product of claim 16, wherein the second and third executable portions are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 19. A computer-implemented method for facilitating near real-time validation and optimization of an integrated flow model for a plurality of transportation networks, the method comprising the steps of:
(A) receiving and storing input data within one or more memory storage areas, the input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks; (B) retrieving from the one or more memory storage areas at least a portion of previously existing data, the previously existing data also being associated with the plurality of transportation networks; (C) validate, via at least one computer processor, the input data against the retrieved portion of existing data, the validating comprising at least calculating, via the at least one computer processor, one or more impacts to the integrated flow model based at least in part upon the received input data; and (D) calculate, via the at least one computer processor, one or more updated flow models for the plurality of transportation networks, the one or more updated flow models being based at least in part upon the identified one or more impacts. 20. The computer-implemented method of claim 19, further comprising the steps of:
updating the integrated flow model to reflect a single one of the one or more updated flow models; and transmit, via the at least one computer processor, the single updated flow model to one or more distributed devices connected via at least one network. | Various embodiments provide a network planning tool comprising one or more memory storage areas containing data related to a plurality of transportation networks, and one or more computer processors configured to: receive input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks; retrieve at least a portion of the data contained in the one or more memory storage areas; validate the input data against the portion of data retrieved from the one or more memory storage areas, the validating comprising at least calculating one or more impacts to the integrated flow model based at least in part upon the received input data; and calculate, based at least in part upon the identified one or more impacts, one or more updated flow models for the plurality of transportation networks. Associated computer program products and computer-implemented methods are also provided.1. A network planning tool for simulating an integrated flow model for a plurality of transportation networks, the tool comprising:
one or more memory storage areas containing data related to a plurality of transportation networks; and one or more computer processors configured to:
(A) receive input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks;
(B) retrieve at least a portion of the data contained in the one or more memory storage areas;
(C) validate the input data against the portion of data retrieved from the one or more memory storage areas, the validating comprising at least calculating one or more impacts to the integrated flow model based at least in part upon the received input data; and
(D) calculate, based at least in part upon the identified one or more impacts, one or more updated flow models for the plurality of transportation networks. 2. The network planning tool of claim 1, further comprising the step of updating the integrated flow model to reflect a single one of the one or more updated flow models. 3. The network planning tool of claim 2, wherein the one or more computer processors are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 4. The network planning tool of claim 1, wherein the one or more computer processors are configured to automatically perform the recited steps based solely upon receipt of input data in Step A. 5. The network planning tool of claim 4, wherein the one or more computer processors are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 6. The network planning tool of claim 1, wherein:
the input data comprises a global modification to one or more parameters associated with the plurality of transportation networks; and the portion of retrieved data previously stored comprises essentially an entirety of the previously stored data. 7. The network planning tool of claim 6, wherein:
the global modification comprises an addition of a new shipping service level within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the addition of the new shipping service level. 8. The network planning tool of claim 6, wherein:
the global modification comprises a deletion of a new shipping service level within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the deletion of the new shipping service level. 9. The network planning tool of claim 8, wherein the calculation of one or more updated flow models comprises calculating at least one flow model wherein one or more commitments associated with the deleted service level are rebalanced between one or more remaining service levels so as to optimize the integrated flow model for the plurality of transportation networks. 10. The network planning tool of claim 1, wherein the one or more computer processors are further configured to transmit the one or more updated flow models to one or more distributed devices connected via at least one network. 11. The network planning tool of claim 10, wherein the one or more computer processors are configured to automatically transmit the one or more optimized flow models to the one or more distributed devices, so as to provide near real-time updates based upon validation and optimization of the plurality of transportation networks. 12. The network planning tool of claim 1, wherein:
the input data comprises a localized modification to one or more parameters associated with the plurality of transportation networks; and the portion data retrieved from the one or more storage areas comprises a subset of the entirety of the data contained in the one or more storage areas, the subset comprising data associated with the one or more parameters being modified by the input data. 13. The network planning tool of claim 12, wherein:
the localized modification comprises bypass of a particular load within one or more of the plurality of transportation networks; and the validation step comprises calculating one or more impacts to the integrated flow model based upon the bypass of the particular load. 14. The network planning tool of claim 12, wherein the localized modification is selected from a group consisting of a bypass of a particular load, a bypass of a particular facility, a bypass of a particular sort, a lane enhancement, and an alternative flow. 15. The network planning tool of claim 12, wherein the one or more computer processors are further configured to automatically transmit the one or more updated flow models to one or more distributed devices connected via at least one network. 16. A computer program product comprising at least one computer-readable storage medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising:
a first executable portion configured for receiving data associated with a plurality of transportation networks, wherein the data comprises a first portion of existing data and a second portion of newly input data; a second executable portion configured for validating the newly input data against the existing data, wherein the validating comprises calculating one or more impacts to an integrated flow model for the plurality of transportation networks based at least in part upon the newly input data; and a third executable portion configured for using the one or more impacts to the integrated flow model, the input data, and the existing data to calculate one or more updated flow models for the plurality of transportation networks. 17. The computer program product of claim 16, further comprising a fourth executable portion configured to transmit at least one of the one or more updated flow models for the plurality of transportation networks to at least one distributed device. 18. The computer program product of claim 16, wherein the second and third executable portions are configured to provide near real-time validation and optimization of the integrated flow model for the plurality of transportation networks, based at least in part upon the calculation of the updated flow models for the plurality of transportation networks. 19. A computer-implemented method for facilitating near real-time validation and optimization of an integrated flow model for a plurality of transportation networks, the method comprising the steps of:
(A) receiving and storing input data within one or more memory storage areas, the input data comprising one or more modifications to one or more parameters associated with the plurality of transportation networks; (B) retrieving from the one or more memory storage areas at least a portion of previously existing data, the previously existing data also being associated with the plurality of transportation networks; (C) validate, via at least one computer processor, the input data against the retrieved portion of existing data, the validating comprising at least calculating, via the at least one computer processor, one or more impacts to the integrated flow model based at least in part upon the received input data; and (D) calculate, via the at least one computer processor, one or more updated flow models for the plurality of transportation networks, the one or more updated flow models being based at least in part upon the identified one or more impacts. 20. The computer-implemented method of claim 19, further comprising the steps of:
updating the integrated flow model to reflect a single one of the one or more updated flow models; and transmit, via the at least one computer processor, the single updated flow model to one or more distributed devices connected via at least one network. | 2,100 |
4,639 | 14,954,500 | 2,165 | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy. | 1. A computer-implemented method, performed by one or more computing devices, for aggregating product information for use in a product database including various products arranged in categories within a taxonomy, the method comprising the steps of:
receiving, by at least one of the one or more computing devices, a plurality of records; grouping, by at least one of the one or more computing devices, one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product; receiving, by at least one of the one or more computing devices, one or more attribute values to be retrieved from each of the records in the cluster; merging, by at least one of the one or more computing devices, the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and categorizing, by at least one of the one or more computing devices, the product in the taxonomy according to the one or more product attribute values. 2. The method of claim 1, wherein the step of receiving one or more attribute values for each of the records in the cluster:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values comprises, merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 3. The method of claim 1, further comprising:
clustering a set of products together having a threshold number of common product attribute values;
generating a new category in the taxonomy corresponding to the common product attribute values; and
categorizing the set of products in the new category. 4. The method of claim 3, wherein the method further comprises:
clustering a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values;
generating a new super-category in the taxonomy corresponding to the common product attribute values; and
categorizing the set of new categories in the new super-category. 5. The method of claim 1, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 6. A system for aggregating product information for use in a product database including various products arranged in categories within a taxonomy comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
receive a plurality of records;
group one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product;
receive one or more attribute values from each of the records in the cluster;
merge the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and
categorize the product in the taxonomy according to the one or more product attribute values. 7. The system of claim 6, wherein the step of receiving one or more attribute values for each of the records in the cluster comprises:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; and assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values comprises merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 8. The system of claim 6, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
cluster a set of products together having a threshold number of common product attribute values; generate a new category in the taxonomy corresponding to the common product attribute values; and categorize the set of products in the new category. 9. The system of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
cluster a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values;
generate a new super-category in the taxonomy corresponding to the common product attribute values; and
categorize the set of new categories in the new super-category. 10. The system of claim 6, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 11. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more a computing devices, cause at least one of the one or more computing devices to:
receive a plurality of records; group one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product;
receive one or more attribute values from each of the records in the cluster;
merge the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and categorize the product in the taxonomy according to the one or more product attribute values. 12. The at least one non-transitory computer-readable medium of claim 11, wherein the step of receiving one or more attribute values for each of the records in the cluster:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; and assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product comprises merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 13. The at least one non-transitory computer-readable medium of claim 11, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
cluster a set of products together having a threshold number of common product attribute values; generate a new category in the taxonomy corresponding to the common product attribute values; and categorize the set of products in the new category. 14. The at least one non-transitory computer-readable medium of claim 13, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
cluster a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values; generate a new super-category in the taxonomy corresponding to the common product attribute values; and categorize the set of new categories in the new super-category. 15. The at least one non-transitory computer-readable medium of claim 11, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 16. The method of claim 1, further comprising:
assigning, by at least one of the one or more computing devices, a product identifier to the cluster. 17. The method of claim 1, wherein the probability determination is based at least in part on a degree of textual overlap between the one or more product records. 18. The system of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to assign a product identifier to the cluster. 19. The system of claim 8, wherein the probability determination is based at least in part on a degree of textual overlap between the one or more product records. 20. The at least one non-transitory computer-readable medium of claim 13, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to assign a product identifier to the cluster. | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.1. A computer-implemented method, performed by one or more computing devices, for aggregating product information for use in a product database including various products arranged in categories within a taxonomy, the method comprising the steps of:
receiving, by at least one of the one or more computing devices, a plurality of records; grouping, by at least one of the one or more computing devices, one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product; receiving, by at least one of the one or more computing devices, one or more attribute values to be retrieved from each of the records in the cluster; merging, by at least one of the one or more computing devices, the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and categorizing, by at least one of the one or more computing devices, the product in the taxonomy according to the one or more product attribute values. 2. The method of claim 1, wherein the step of receiving one or more attribute values for each of the records in the cluster:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values comprises, merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 3. The method of claim 1, further comprising:
clustering a set of products together having a threshold number of common product attribute values;
generating a new category in the taxonomy corresponding to the common product attribute values; and
categorizing the set of products in the new category. 4. The method of claim 3, wherein the method further comprises:
clustering a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values;
generating a new super-category in the taxonomy corresponding to the common product attribute values; and
categorizing the set of new categories in the new super-category. 5. The method of claim 1, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 6. A system for aggregating product information for use in a product database including various products arranged in categories within a taxonomy comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
receive a plurality of records;
group one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product;
receive one or more attribute values from each of the records in the cluster;
merge the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and
categorize the product in the taxonomy according to the one or more product attribute values. 7. The system of claim 6, wherein the step of receiving one or more attribute values for each of the records in the cluster comprises:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; and assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values comprises merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 8. The system of claim 6, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
cluster a set of products together having a threshold number of common product attribute values; generate a new category in the taxonomy corresponding to the common product attribute values; and categorize the set of products in the new category. 9. The system of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
cluster a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values;
generate a new super-category in the taxonomy corresponding to the common product attribute values; and
categorize the set of new categories in the new super-category. 10. The system of claim 6, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 11. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more a computing devices, cause at least one of the one or more computing devices to:
receive a plurality of records; group one or more records of the plurality of records into a cluster, wherein the cluster corresponds to a product and the one or more records are grouped into the cluster based on a probability determination that the one or more records correspond to the product;
receive one or more attribute values from each of the records in the cluster;
merge the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product based at least in part on a confidence rating associated with at least one of the one or more received attribute values; and categorize the product in the taxonomy according to the one or more product attribute values. 12. The at least one non-transitory computer-readable medium of claim 11, wherein the step of receiving one or more attribute values for each of the records in the cluster:
identifying one or more normalized attribute values for each record; assigning each normalized attribute value a confidence rating; identifying one or more keyword attribute values for each record; and assigning each keyword attribute value a confidence rating; and wherein said step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product comprises merging the normalized attribute values based on each normalized attribute value's confidence rating; and merging the keyword attribute values based on each keyword value's confidence rating. 13. The at least one non-transitory computer-readable medium of claim 11, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
cluster a set of products together having a threshold number of common product attribute values; generate a new category in the taxonomy corresponding to the common product attribute values; and categorize the set of products in the new category. 14. The at least one non-transitory computer-readable medium of claim 13, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
cluster a set of new categories together having a threshold number of products within each new category having a threshold number of common product attribute values; generate a new super-category in the taxonomy corresponding to the common product attribute values; and categorize the set of new categories in the new super-category. 15. The at least one non-transitory computer-readable medium of claim 11, wherein the step of merging the one or more received attribute values from each of the records in the cluster to determine one or more product attribute values for the product further comprises:
generating one or more configurations for the product; and assigning one or more received attribute values of one of the records in the cluster to one of the configurations of the product; and wherein said step of categorizing the product in the taxonomy according to the one or more product attribute values comprises generating one or more sub-categories below the product in the taxonomy, and wherein the one or more sub-categories correspond to the configurations for the product. 16. The method of claim 1, further comprising:
assigning, by at least one of the one or more computing devices, a product identifier to the cluster. 17. The method of claim 1, wherein the probability determination is based at least in part on a degree of textual overlap between the one or more product records. 18. The system of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to assign a product identifier to the cluster. 19. The system of claim 8, wherein the probability determination is based at least in part on a degree of textual overlap between the one or more product records. 20. The at least one non-transitory computer-readable medium of claim 13, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to assign a product identifier to the cluster. | 2,100 |
4,640 | 14,932,058 | 2,165 | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy. | 1. A method of effecting commerce in a networked computer environment comprising the steps of:
receiving, by a shopping server having a database, identification a user of a client computer; receiving a selection of plural products through an integrated shopping interface of the client computer, based on product information in the database, for purchase from plural merchant servers that are remote from the shopping server; transmitting product information related to the selected products for presentation to the user for confirmation of a purchase; and causing a buy procedure to be executed on the merchant servers for purchase of the selected products from the merchant servers if the user confirms the purchase. 2. A method as recited in claim 1, further comprising verifying the product information by receiving updated product information from the merchant servers. 3. A method as recited in claim 2, wherein said verifying step comprises verifying the product related to the selected products after said selecting step. 4. A method as recited in claim 1, wherein the database comprises a product database having product information and a shopper database having shopper information. 5. A method as recited in claim 4, further comprising the steps of:
checking if there is account information in the shopper database related to the user for the merchant servers; and establishing an account related to the user with the merchant servers if said checking step indicates that there is not account information in the shopper database related to the user for the merchant servers; wherein the buy procedure is executed on the merchant computer in association with the account information related to the user for the merchant server. 6. A method as recited in claim 4, further comprising displaying a buy form to the user containing information from the shopper database corresponding to the user and to be used in the buy procedure. 7. A method as recited in claim 4, wherein said buy procedure is executed on the merchant servers through an interface of the merchant servers. 8. A method as recited in claim 7, wherein said buy procedure further comprises filtering out form submissions sent by the merchant servers and filling in the filtered forms with information related to the user from the shopper database. 9. A method as recited in claim 1, wherein a purchase procedure is executed on the shopping server, the buy procedure of the merchant servers being integrated into the purchase procedure. 10. A method as recited in claim 3, wherein said verifying step comprises accessing a checkout page of each of the merchant servers and downloading the products information related to the selected product from the checkout pages. 11. A method as recited in claim 1, further comprising the steps of:
establishing a first cookie on the shopping server containing a merchant server session identification; establishing a second cookie on the client computer identifying a user session between the client computer and the shopping server corresponding to the merchant serve identification; and correlating the second cookie with a transaction record established in connection with the first cookie. 12. A method as recited in claim 1, further comprising the steps of:
spawning a buy process in the shopping server for accomplishing said selecting step; and updating a transaction record based on the status of the buy process. 13. A computer system for effecting commerce in a networked computer environment comprising:
at least one processor: a database; at least one memory coupled to one or more of the at least one processors and having computer executable code stored therein which, when executed by said one or more of the at least one processors, causes the one or more of the at least one processors to:
receive identification a user of a client computer;
receive a selection of plural products through an integrated shopping interface of the client computer, based on product information in the database, for purchase from plural merchant servers that are remote from the shopping server;
transmit product information related to the selected products for presentation to the user for confirmation of a purchase; and
causing a buy procedure to be executed on the merchant servers for purchase of the selected products from the merchant servers if the user confirms the purchase. 14. A system as recited in claim 13, wherein the product information is verified by receiving updated product information from the merchant servers. 15. A system as recited in claim 214 wherein the product information is verified by verifying the product related to the selected products after said selecting step. 16. A system as recited in claim 13, wherein the database comprises a product database having product information and a shopper database having shopper information. 17. A system as recited in claim 16, wherein the instructions further cause the one or more of the at least one processors to:
check if there is account information in the shopper database related to the user for the merchant servers; and establish an account related to the user with the merchant servers if there is not account information in the shopper database related to the user for the merchant servers; wherein the buy procedure is executed on the merchant computer in association with the account information related to the user for the merchant server. 18. A system as recited in claim 16, wherein the instructions further cause the one or more of the at least one processors to display a buy form to the user containing information from the shopper database corresponding to the user and to be used in the buy procedure. 19. A system as recited in claim 16, wherein the buy procedure is executed on the merchant servers through an interface of the merchant servers. 20. A system as recited in claim 19, wherein the buy procedure further comprises filtering out form submissions sent by the merchant servers and filling in the filtered forms with information related to the user from the shopper database. 22. A system as recited in claim 13, wherein a purchase procedure is executed on the shopping server, the buy procedure of the merchant servers being integrated into the purchase procedure. 23. A system as recited in claim 16, wherein the verifying comprises accessing a checkout page of each of the merchant servers and downloading the products information related to the selected product from the checkout pages. 24. A system as recited in claim 13, wherein the instructions further cause the one or more of the at least one processors to:
establish a first cookie on the shopping server containing a merchant server session identification; establish a second cookie on the client computer identifying a user session between the client computer and the shopping server corresponding to the merchant serve identification; and correlate the second cookie with a transaction record established in connection with the first cookie. 25. A system as recited in claim 13, wherein the instructions further cause the one or more of the at least one processors to:
spawn a buy process in the shopping server for accomplishing said selecting step; and update a transaction record based on the status of the buy process. | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.1. A method of effecting commerce in a networked computer environment comprising the steps of:
receiving, by a shopping server having a database, identification a user of a client computer; receiving a selection of plural products through an integrated shopping interface of the client computer, based on product information in the database, for purchase from plural merchant servers that are remote from the shopping server; transmitting product information related to the selected products for presentation to the user for confirmation of a purchase; and causing a buy procedure to be executed on the merchant servers for purchase of the selected products from the merchant servers if the user confirms the purchase. 2. A method as recited in claim 1, further comprising verifying the product information by receiving updated product information from the merchant servers. 3. A method as recited in claim 2, wherein said verifying step comprises verifying the product related to the selected products after said selecting step. 4. A method as recited in claim 1, wherein the database comprises a product database having product information and a shopper database having shopper information. 5. A method as recited in claim 4, further comprising the steps of:
checking if there is account information in the shopper database related to the user for the merchant servers; and establishing an account related to the user with the merchant servers if said checking step indicates that there is not account information in the shopper database related to the user for the merchant servers; wherein the buy procedure is executed on the merchant computer in association with the account information related to the user for the merchant server. 6. A method as recited in claim 4, further comprising displaying a buy form to the user containing information from the shopper database corresponding to the user and to be used in the buy procedure. 7. A method as recited in claim 4, wherein said buy procedure is executed on the merchant servers through an interface of the merchant servers. 8. A method as recited in claim 7, wherein said buy procedure further comprises filtering out form submissions sent by the merchant servers and filling in the filtered forms with information related to the user from the shopper database. 9. A method as recited in claim 1, wherein a purchase procedure is executed on the shopping server, the buy procedure of the merchant servers being integrated into the purchase procedure. 10. A method as recited in claim 3, wherein said verifying step comprises accessing a checkout page of each of the merchant servers and downloading the products information related to the selected product from the checkout pages. 11. A method as recited in claim 1, further comprising the steps of:
establishing a first cookie on the shopping server containing a merchant server session identification; establishing a second cookie on the client computer identifying a user session between the client computer and the shopping server corresponding to the merchant serve identification; and correlating the second cookie with a transaction record established in connection with the first cookie. 12. A method as recited in claim 1, further comprising the steps of:
spawning a buy process in the shopping server for accomplishing said selecting step; and updating a transaction record based on the status of the buy process. 13. A computer system for effecting commerce in a networked computer environment comprising:
at least one processor: a database; at least one memory coupled to one or more of the at least one processors and having computer executable code stored therein which, when executed by said one or more of the at least one processors, causes the one or more of the at least one processors to:
receive identification a user of a client computer;
receive a selection of plural products through an integrated shopping interface of the client computer, based on product information in the database, for purchase from plural merchant servers that are remote from the shopping server;
transmit product information related to the selected products for presentation to the user for confirmation of a purchase; and
causing a buy procedure to be executed on the merchant servers for purchase of the selected products from the merchant servers if the user confirms the purchase. 14. A system as recited in claim 13, wherein the product information is verified by receiving updated product information from the merchant servers. 15. A system as recited in claim 214 wherein the product information is verified by verifying the product related to the selected products after said selecting step. 16. A system as recited in claim 13, wherein the database comprises a product database having product information and a shopper database having shopper information. 17. A system as recited in claim 16, wherein the instructions further cause the one or more of the at least one processors to:
check if there is account information in the shopper database related to the user for the merchant servers; and establish an account related to the user with the merchant servers if there is not account information in the shopper database related to the user for the merchant servers; wherein the buy procedure is executed on the merchant computer in association with the account information related to the user for the merchant server. 18. A system as recited in claim 16, wherein the instructions further cause the one or more of the at least one processors to display a buy form to the user containing information from the shopper database corresponding to the user and to be used in the buy procedure. 19. A system as recited in claim 16, wherein the buy procedure is executed on the merchant servers through an interface of the merchant servers. 20. A system as recited in claim 19, wherein the buy procedure further comprises filtering out form submissions sent by the merchant servers and filling in the filtered forms with information related to the user from the shopper database. 22. A system as recited in claim 13, wherein a purchase procedure is executed on the shopping server, the buy procedure of the merchant servers being integrated into the purchase procedure. 23. A system as recited in claim 16, wherein the verifying comprises accessing a checkout page of each of the merchant servers and downloading the products information related to the selected product from the checkout pages. 24. A system as recited in claim 13, wherein the instructions further cause the one or more of the at least one processors to:
establish a first cookie on the shopping server containing a merchant server session identification; establish a second cookie on the client computer identifying a user session between the client computer and the shopping server corresponding to the merchant serve identification; and correlate the second cookie with a transaction record established in connection with the first cookie. 25. A system as recited in claim 13, wherein the instructions further cause the one or more of the at least one processors to:
spawn a buy process in the shopping server for accomplishing said selecting step; and update a transaction record based on the status of the buy process. | 2,100 |
4,641 | 14,791,612 | 2,194 | A method of updating a bootloader includes a slave controller that includes a central processing unit in communication with non-volatile memory having a shared memory architecture. The shared memory architecture including a non-volatile application memory block having application code and a non-volatile launcher memory block having bootloader code for initiating the slave controller. The method including a step of storing updated code to an application memory block of the non-volatile memory. The updated code includes a first code section having application code for application functions, a second code section having updated bootupdater code, and a third code section having image code for an updated bootloader. Slave controller receives indication to update the bootloader code stored in the non-volatile launcher memory block and then executes the bootupdater stored in the application memory block to update the bootloader stored in the launcher memory block from the image code for an updated bootloader. | 1. A method of updating a bootloader in a slave controller, the slave controller including a central processing unit in communication with non-volatile memory having a shared memory architecture, the shared memory architecture including a non-volatile application memory block having application code and a non-volatile launcher memory block having bootloader code for initiating the slave controller:
storing updated code to an application memory block of the non-volatile memory, the updated code including a first code section including application code for application functions, a second code section including updated bootupdater code, and a third code section having image code for an updated bootloader; receiving an indication to update the bootloader code stored in the non-volatile launcher memory block; and executing the bootupdater stored in the application memory block to update the bootloader stored in launcher memory block from the image code for an updated bootloader. 2. The method of claim 1 further comprising storing shared code for at least one shared function to a shared memory block of the non-volatile memory. 3. The method of claim 1 wherein the indication to update the bootloader code occurs at startup when having the image for updated bootloader code stored in the application memory block is newer than the bootloader code stored in the launcher memory block. 4. The method of claim 1 wherein the indication to update the bootloader code occurs when the slave controller receives a command to update the bootloader stored in launcher memory block. 5. The method of claim 4 wherein the slave controller is in communication with a master controller. 6. The method of claim 4 wherein the launcher memory block also includes code operable to call shared functions, to call launcher proprietary functions, and to call application callback functions. 7. The method of claim 5 wherein the slave controller is a component of a battery management system (BMS) that includes the master controller, the slave controller having applications for measuring current flow and voltages for a vehicle battery, including HV batteries. 8. The method of claim 5 wherein the slave controller is a body control module is a module that controls a load selected from the group consisting of lights, wipers, motors, receivers, transmitters and combinations thereof. 9. The method of claim 5 wherein the slave controller and the master controller are each independent microcontrollers that include a microprocessor. 10. The method of claim 5 wherein at least one additional slave controller is in communication with the master controller. 11. A control system having a shared memory architecture, the control system comprising:
a master controller having a first central processing unit and a first memory; a slave controller having a second central processing unit and a second memory, the slave controller in communication with the master controller, the second memory including non-volatile memory having: a launcher memory block having bootloader code encoded therein; a shared memory block having shared code encoded thereon; and an application memory block having a first code section having application code for application functions, a second code section having updated bootupdater code, and a third code section having image code for an updated bootloader, the second central processing unit configured to receive an indication to update the bootloader code stored in the launcher memory block and execute the bootupdater code stored in the application memory block to update to bootloader stored in the launcher memory block from the image code for an updated bootloader. 12. The control system of claim 11 wherein the indication to update the bootloader code occurs at startup when having the image for updated bootloader code stored in the application memory block is newer than the bootloader code stored in the launcher memory block. 13. The control system of claim 11 wherein the indication to update the bootloader code occurs when the slave controller receives a command to update the bootloader stored in launcher memory block. 14. The control system of claim 11 wherein the launcher memory block also includes code operable to call shared functions, to call launcher proprietary functions, and to call application callback functions. 15. The control system of claim 11 wherein the slave controller is a component of a battery management system (BMS) that includes the master controller, the slave controller having applications for measuring current flow and voltages for a vehicle battery, including a high voltage battery. 16. The control system of claim 11 wherein the slave controller is a body control module is a module that controls a load selected from the group consisting of lights, wipers, motors, receivers, transmitters and combinations thereof. 17. The control system of claim 11 wherein the slave controller and the master controller are each independent microcontrollers that include a microprocessor. 18. The control system of claim 11 further comprising at least one additional slave controller in communication with the master controller. | A method of updating a bootloader includes a slave controller that includes a central processing unit in communication with non-volatile memory having a shared memory architecture. The shared memory architecture including a non-volatile application memory block having application code and a non-volatile launcher memory block having bootloader code for initiating the slave controller. The method including a step of storing updated code to an application memory block of the non-volatile memory. The updated code includes a first code section having application code for application functions, a second code section having updated bootupdater code, and a third code section having image code for an updated bootloader. Slave controller receives indication to update the bootloader code stored in the non-volatile launcher memory block and then executes the bootupdater stored in the application memory block to update the bootloader stored in the launcher memory block from the image code for an updated bootloader.1. A method of updating a bootloader in a slave controller, the slave controller including a central processing unit in communication with non-volatile memory having a shared memory architecture, the shared memory architecture including a non-volatile application memory block having application code and a non-volatile launcher memory block having bootloader code for initiating the slave controller:
storing updated code to an application memory block of the non-volatile memory, the updated code including a first code section including application code for application functions, a second code section including updated bootupdater code, and a third code section having image code for an updated bootloader; receiving an indication to update the bootloader code stored in the non-volatile launcher memory block; and executing the bootupdater stored in the application memory block to update the bootloader stored in launcher memory block from the image code for an updated bootloader. 2. The method of claim 1 further comprising storing shared code for at least one shared function to a shared memory block of the non-volatile memory. 3. The method of claim 1 wherein the indication to update the bootloader code occurs at startup when having the image for updated bootloader code stored in the application memory block is newer than the bootloader code stored in the launcher memory block. 4. The method of claim 1 wherein the indication to update the bootloader code occurs when the slave controller receives a command to update the bootloader stored in launcher memory block. 5. The method of claim 4 wherein the slave controller is in communication with a master controller. 6. The method of claim 4 wherein the launcher memory block also includes code operable to call shared functions, to call launcher proprietary functions, and to call application callback functions. 7. The method of claim 5 wherein the slave controller is a component of a battery management system (BMS) that includes the master controller, the slave controller having applications for measuring current flow and voltages for a vehicle battery, including HV batteries. 8. The method of claim 5 wherein the slave controller is a body control module is a module that controls a load selected from the group consisting of lights, wipers, motors, receivers, transmitters and combinations thereof. 9. The method of claim 5 wherein the slave controller and the master controller are each independent microcontrollers that include a microprocessor. 10. The method of claim 5 wherein at least one additional slave controller is in communication with the master controller. 11. A control system having a shared memory architecture, the control system comprising:
a master controller having a first central processing unit and a first memory; a slave controller having a second central processing unit and a second memory, the slave controller in communication with the master controller, the second memory including non-volatile memory having: a launcher memory block having bootloader code encoded therein; a shared memory block having shared code encoded thereon; and an application memory block having a first code section having application code for application functions, a second code section having updated bootupdater code, and a third code section having image code for an updated bootloader, the second central processing unit configured to receive an indication to update the bootloader code stored in the launcher memory block and execute the bootupdater code stored in the application memory block to update to bootloader stored in the launcher memory block from the image code for an updated bootloader. 12. The control system of claim 11 wherein the indication to update the bootloader code occurs at startup when having the image for updated bootloader code stored in the application memory block is newer than the bootloader code stored in the launcher memory block. 13. The control system of claim 11 wherein the indication to update the bootloader code occurs when the slave controller receives a command to update the bootloader stored in launcher memory block. 14. The control system of claim 11 wherein the launcher memory block also includes code operable to call shared functions, to call launcher proprietary functions, and to call application callback functions. 15. The control system of claim 11 wherein the slave controller is a component of a battery management system (BMS) that includes the master controller, the slave controller having applications for measuring current flow and voltages for a vehicle battery, including a high voltage battery. 16. The control system of claim 11 wherein the slave controller is a body control module is a module that controls a load selected from the group consisting of lights, wipers, motors, receivers, transmitters and combinations thereof. 17. The control system of claim 11 wherein the slave controller and the master controller are each independent microcontrollers that include a microprocessor. 18. The control system of claim 11 further comprising at least one additional slave controller in communication with the master controller. | 2,100 |
4,642 | 14,040,316 | 2,185 | Improved power control techniques for integrated peripheral component interconnect express (PCIe) controllers are described. In one embodiment, for example, a processor circuit may comprise an integrated PCIe controller and logic to detect a power reduction trigger, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. Other embodiments are described and claimed. | 1. A processor circuit, comprising:
an integrated peripheral component interconnect express (PCIe) controller; and logic, at least a portion of which is in hardware, the logic to detect a power reduction trigger, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 2. The processor circuit of claim 1, the logic to store configuration information for the integrated PCIe controller. 3. The processor circuit of claim 1, the logic to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 4. The processor circuit of claim 1, the power reduction trigger indicating that a connection to an external power supply has been removed. 5. The processor circuit of claim 1, the logic to disable a PCIe graphics card communicating with the processor circuit over a PCIe link and activate integrated graphics circuitry of the processor circuit. 6. The processor circuit of claim 1, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence. 7. The processor circuit of claim 1, the logic to transition the processor circuit into a lower power state after removing power from the integrated PCIe controller. 8. The processor circuit of claim 1, comprising a PCIe input/output (I/O) module, the logic to disable the PCIe I/O module. 9. The processor circuit of claim 8, the logic to remove power from the PCIe I/O module when the power removal setting indicates that power may be removed from the PCIe I/O module, and place the PCIe I/O module into a low power state when the power removal setting indicates that power may not be removed from the PCIe I/O module. 10. An apparatus, comprising:
a processor circuit comprising an integrated peripheral component interconnect express (PCIe) controller to control a PCIe link; an integrated device; and logic, at least a portion of which is in hardware, the logic to detect a power reduction trigger, activate the integrated device, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 11. The apparatus of claim 10, comprising a memory unit, the logic to store configuration information for the integrated PCIe controller in the memory unit. 12. The apparatus of claim 10, the logic to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 13. The apparatus of claim 10, the power reduction trigger indicating that a connection to an external power supply has been removed. 14. The apparatus of claim 10, the processor circuit to communicate with a PCIe device over the PCIe link, the logic to disable the PCIe device and activate the integrated device. 15. The apparatus of claim 10, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence. 16. The apparatus of claim 10, the logic to transition the processor circuit into a lower power state after removing power from the integrated PCIe controller. 17. The apparatus of claim 10, the processor circuit comprising a PCIe input/output (I/O) module, the logic to disable the PCIe I/O module. 18. The apparatus of claim 17, the logic to remove power from the PCIe I/O module when the power removal setting indicates that power may be removed from the PCIe I/O module, and place the PCIe I/O module into a low power state when the power removal setting indicates that power may not be removed from the PCIe I/O module. 19. The apparatus of claim 10, comprising a display and one or more RF transceivers. 20. At least one machine-readable medium comprising a set of instructions that, in response to being executed on a computing device, cause the computing device to:
detect a power reduction trigger; disable an integrated peripheral component interconnect express (PCIe) controller of a processor circuit; and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 21. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to store configuration information for the integrated PCIe controller in a memory unit. 22. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 23. The at least one machine-readable medium of claim 20, the power reduction trigger indicating that a connection of the computing device to an external power supply has been removed. 24. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to disable a PCIe graphics card communicating with the processor circuit over a PCIe link and activate integrated graphics circuitry of the processor circuit. 25. The at least one machine-readable medium of claim 20, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence of the computing device. | Improved power control techniques for integrated peripheral component interconnect express (PCIe) controllers are described. In one embodiment, for example, a processor circuit may comprise an integrated PCIe controller and logic to detect a power reduction trigger, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. Other embodiments are described and claimed.1. A processor circuit, comprising:
an integrated peripheral component interconnect express (PCIe) controller; and logic, at least a portion of which is in hardware, the logic to detect a power reduction trigger, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 2. The processor circuit of claim 1, the logic to store configuration information for the integrated PCIe controller. 3. The processor circuit of claim 1, the logic to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 4. The processor circuit of claim 1, the power reduction trigger indicating that a connection to an external power supply has been removed. 5. The processor circuit of claim 1, the logic to disable a PCIe graphics card communicating with the processor circuit over a PCIe link and activate integrated graphics circuitry of the processor circuit. 6. The processor circuit of claim 1, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence. 7. The processor circuit of claim 1, the logic to transition the processor circuit into a lower power state after removing power from the integrated PCIe controller. 8. The processor circuit of claim 1, comprising a PCIe input/output (I/O) module, the logic to disable the PCIe I/O module. 9. The processor circuit of claim 8, the logic to remove power from the PCIe I/O module when the power removal setting indicates that power may be removed from the PCIe I/O module, and place the PCIe I/O module into a low power state when the power removal setting indicates that power may not be removed from the PCIe I/O module. 10. An apparatus, comprising:
a processor circuit comprising an integrated peripheral component interconnect express (PCIe) controller to control a PCIe link; an integrated device; and logic, at least a portion of which is in hardware, the logic to detect a power reduction trigger, activate the integrated device, disable the integrated PCIe controller, and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 11. The apparatus of claim 10, comprising a memory unit, the logic to store configuration information for the integrated PCIe controller in the memory unit. 12. The apparatus of claim 10, the logic to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 13. The apparatus of claim 10, the power reduction trigger indicating that a connection to an external power supply has been removed. 14. The apparatus of claim 10, the processor circuit to communicate with a PCIe device over the PCIe link, the logic to disable the PCIe device and activate the integrated device. 15. The apparatus of claim 10, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence. 16. The apparatus of claim 10, the logic to transition the processor circuit into a lower power state after removing power from the integrated PCIe controller. 17. The apparatus of claim 10, the processor circuit comprising a PCIe input/output (I/O) module, the logic to disable the PCIe I/O module. 18. The apparatus of claim 17, the logic to remove power from the PCIe I/O module when the power removal setting indicates that power may be removed from the PCIe I/O module, and place the PCIe I/O module into a low power state when the power removal setting indicates that power may not be removed from the PCIe I/O module. 19. The apparatus of claim 10, comprising a display and one or more RF transceivers. 20. At least one machine-readable medium comprising a set of instructions that, in response to being executed on a computing device, cause the computing device to:
detect a power reduction trigger; disable an integrated peripheral component interconnect express (PCIe) controller of a processor circuit; and remove power from the integrated PCIe controller based on a power removal setting for the integrated PCIe controller. 21. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to store configuration information for the integrated PCIe controller in a memory unit. 22. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to remove power from the integrated PCIe controller by setting a power gate for the integrated PCIe controller to an open state. 23. The at least one machine-readable medium of claim 20, the power reduction trigger indicating that a connection of the computing device to an external power supply has been removed. 24. The at least one machine-readable medium of claim 20, comprising instructions that, in response to being executed on the computing device, cause the computing device to disable a PCIe graphics card communicating with the processor circuit over a PCIe link and activate integrated graphics circuitry of the processor circuit. 25. The at least one machine-readable medium of claim 20, the power removal setting comprising a bit set by a basic input/output system (BIOS) during an initial boot sequence of the computing device. | 2,100 |
4,643 | 14,942,827 | 2,191 | Methods, systems, and computer-readable media for deploying an updated image to nodes propagated throughout a distributed computing platform are provided. Upon receiving an indication to install a patch to an operating system residing on the nodes, an existing image of the operating system is accessed at a staging service. The staging service generates the updated image by applying the patch to the existing image. The process of applying the patch includes mounting the existing image of the operating system to a virtual machine, copying the patch to the mounted existing image, setting a command within the existing image that executes upon activating the virtual machine, and activating the virtual machine, thereby executing the command. This directs the patch to be installed. The updated image is pushed to the nodes. The nodes are configured to utilize the updated image as the operating system without performing an individual installation of the patch. | 1. A computer system to deploy updated images to nodes in data centers, the system comprising:
a staging service to initialize a virtual machine to update an existing image of an operating system using a patch, the existing image having a variant state and an invariant state of the operating system; the virtual machine to generate an updated image of the existing image, generating the updated image comprises:
separating the existing image into a variant state and an invariant state;
performing an installation of the patch on the variant state; and
recombining the variant state and the invariant state to form the updated image; and
one or more nodes to receive and run the updated image without performing an installation of the updated image on the one or more nodes, the updated image is received from the staging service that remotely stores the existing image and the updated image. 2. The computer system of claim 1, further comprising a fabric controller to make a determination to roll out the patch to the operating system and communicate an indication to staging service to generate an updated image. 3. The computer system of claim 1, wherein the virtual machine supports an existing image having a virtual disk linked to a differencing disk, the virtual disk comprises the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein the variant disk and the invariant disk are configured such that a service application supported by the operating system writes data to the differencing disk and does not write data to the virtual disk. 4. The computer system of claim 1, generating the updated image at the virtual machine further comprises:
mounting the existing image on the virtual machine, wherein the existing image is a pristine model of the operating system that excludes data written to the operating system when running on the one or more nodes; copying the patch to the mounted existing image; setting a command within the existing image that executes upon activating the virtual machine; activating the virtual machine to cause the command to execute to be invoked, wherein, during execution, the command instructs the existing image to install the patch; capturing a snapshot of the existing image with the patch installed; saving the snapshot as the updated image; and utilizing the updated image for upgrading the operating system of the one or more nodes. 5. The computer system of claim 1, wherein the one or more nodes are further configured to:
initiate an offline condition; download the updated image; and boot to run an operating system of the updated image without reinstalling the operating system of the updated image. 6. The computer system of claim 5, wherein downloading the updated image further comprises the one or more nodes configured to:
receive the updated image comprising an updated virtual disk and a differencing disk that is empty and cleared of externally-written data; store the updated virtual disk such that a new operating system is ready to be used upon booting; and replace a differencing disk on the one or more nodes with the differencing disk of the updated image. 7. A computer-implemented for upgrading operating systems computing devices without installing patches on the computing devices, the method comprising:
downloading an updated image of an operating system, the updated image is remotely stored on a staging service, the staging service initializes a virtual machine to generate the updated image with a patch that is installed on the operating system, the virtual machine supports an existing image having a virtual disk and a differencing disk, the virtual disk comprises the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein the variant disk and the invariant disk are configured to cause a service application supported by the operating system to write data to the differencing disk and not write to the virtual disk;
booting to the operating system of the update image; and
utilizing the operating system of the updated image without performing an installation of the patch. 8. The computer-implemented method of claim 7, wherein generating the updated image at the staging service comprises:
separating the existing image into the variant state and an invariant state; performing an installation of the patch on the variant state; and recombining the variant state and the invariant state to form the updated image. 9. The computer-implemented method of claim 7, the method further comprising:
receiving the updated image comprising an updated virtual disk and a differencing disk that is empty and cleared of externally-written data; storing the updated virtual disk such that a new operating system is ready to be used upon booting; and replacing a differencing disk on the one or more nodes with the differencing disk of the updated image. 10. The computer-implemented method of claim 7, wherein the updated image is propagated to be downloaded based on a persistence algorithm, wherein the persistence algorithm selects an order and timing for removing one or more nodes, that download updated images, to an offline condition to ensure that active redundant nodes are available for supporting the particular functional aspects of the service application that are supported by the one or more nodes. 11. One or more computer storage hardware memory having computer-executable instructions embodied thereon that, when executed, perform a method for deploying updated images to one or more nodes propagated throughout a distributed computing platform, the method comprising:
receiving an indication to install a patch to an operating system residing on one or more nodes of a data center, wherein an existing image of the operating system is stored at a staging service remotely located from the one or more nodes; generating the updated image by applying the patch to the existing image at a virtual machine, the virtual machine supports an existing image having a virtual disk and a differencing disk, the virtual disk comprising the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein generating the updated image comprises:
separating the existing image into a variant state and an invariant state of the operating system;
performing an installation of the patch on the variant state; and
recombining the variant state and the invariant state to form the updated image;
pushing the updated image to the one or more nodes of a data center, wherein the one or more nodes are configured to utilize the updated image of the operating system without performing an installation of the updated image. 12. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
copying the patch to the mounted existing image; and setting a command within the existing image that executes upon activating the virtual machine. 13. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises activating the virtual machine to cause the command to execute to be invoked, wherein, during execution, the command instructs the existing image to install the patch. 14. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
capturing a snapshot of the existing image with the patch installed; saving the snapshot as the updated image; and utilizing the updated image for upgrading the operating system of the one or more nodes. 15. The media of claim 11, wherein the method further comprises separating the existing image of the operating system into at least one differencing disk and a virtual disk, wherein the virtual disk is a pristine model of the operating system. 16. The media of claim 15, wherein the virtual disk is configured to accommodate the invariant state of the operating system that is common to each of the one or more nodes of the data center. 17. The media of claim 15, wherein the at least one differencing disk is configured to accommodate the variant state of the operating system that is affected by the role instances of the service application running on the one or more nodes. 18. The media of claim 15, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
selecting at least one empty differencing disk based upon attributes of the one or more nodes that are targeted for receiving the updated image; and combining the at least one empty differencing disk with the virtual disk upon installing the patch thereto. 19. The media of claim 18, wherein selecting at least one empty differencing disk is based upon attributes of the one or more nodes that are targeted for receiving the updated image comprises:
recognizing the role instances of the service application running on the one or more target nodes; and identifying the at least one empty differencing disk that adequately supports functionality of the one or more target node. 20. The media of claim 18, wherein pushing the updated image to the one or more nodes of the data center comprises:
remove the one or more nodes to an offline condition; loading the updated image to the one or more offline nodes; and booting the one or more offline nodes, wherein the process of booting does not reinstall the operating system carried in the updated image. | Methods, systems, and computer-readable media for deploying an updated image to nodes propagated throughout a distributed computing platform are provided. Upon receiving an indication to install a patch to an operating system residing on the nodes, an existing image of the operating system is accessed at a staging service. The staging service generates the updated image by applying the patch to the existing image. The process of applying the patch includes mounting the existing image of the operating system to a virtual machine, copying the patch to the mounted existing image, setting a command within the existing image that executes upon activating the virtual machine, and activating the virtual machine, thereby executing the command. This directs the patch to be installed. The updated image is pushed to the nodes. The nodes are configured to utilize the updated image as the operating system without performing an individual installation of the patch.1. A computer system to deploy updated images to nodes in data centers, the system comprising:
a staging service to initialize a virtual machine to update an existing image of an operating system using a patch, the existing image having a variant state and an invariant state of the operating system; the virtual machine to generate an updated image of the existing image, generating the updated image comprises:
separating the existing image into a variant state and an invariant state;
performing an installation of the patch on the variant state; and
recombining the variant state and the invariant state to form the updated image; and
one or more nodes to receive and run the updated image without performing an installation of the updated image on the one or more nodes, the updated image is received from the staging service that remotely stores the existing image and the updated image. 2. The computer system of claim 1, further comprising a fabric controller to make a determination to roll out the patch to the operating system and communicate an indication to staging service to generate an updated image. 3. The computer system of claim 1, wherein the virtual machine supports an existing image having a virtual disk linked to a differencing disk, the virtual disk comprises the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein the variant disk and the invariant disk are configured such that a service application supported by the operating system writes data to the differencing disk and does not write data to the virtual disk. 4. The computer system of claim 1, generating the updated image at the virtual machine further comprises:
mounting the existing image on the virtual machine, wherein the existing image is a pristine model of the operating system that excludes data written to the operating system when running on the one or more nodes; copying the patch to the mounted existing image; setting a command within the existing image that executes upon activating the virtual machine; activating the virtual machine to cause the command to execute to be invoked, wherein, during execution, the command instructs the existing image to install the patch; capturing a snapshot of the existing image with the patch installed; saving the snapshot as the updated image; and utilizing the updated image for upgrading the operating system of the one or more nodes. 5. The computer system of claim 1, wherein the one or more nodes are further configured to:
initiate an offline condition; download the updated image; and boot to run an operating system of the updated image without reinstalling the operating system of the updated image. 6. The computer system of claim 5, wherein downloading the updated image further comprises the one or more nodes configured to:
receive the updated image comprising an updated virtual disk and a differencing disk that is empty and cleared of externally-written data; store the updated virtual disk such that a new operating system is ready to be used upon booting; and replace a differencing disk on the one or more nodes with the differencing disk of the updated image. 7. A computer-implemented for upgrading operating systems computing devices without installing patches on the computing devices, the method comprising:
downloading an updated image of an operating system, the updated image is remotely stored on a staging service, the staging service initializes a virtual machine to generate the updated image with a patch that is installed on the operating system, the virtual machine supports an existing image having a virtual disk and a differencing disk, the virtual disk comprises the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein the variant disk and the invariant disk are configured to cause a service application supported by the operating system to write data to the differencing disk and not write to the virtual disk;
booting to the operating system of the update image; and
utilizing the operating system of the updated image without performing an installation of the patch. 8. The computer-implemented method of claim 7, wherein generating the updated image at the staging service comprises:
separating the existing image into the variant state and an invariant state; performing an installation of the patch on the variant state; and recombining the variant state and the invariant state to form the updated image. 9. The computer-implemented method of claim 7, the method further comprising:
receiving the updated image comprising an updated virtual disk and a differencing disk that is empty and cleared of externally-written data; storing the updated virtual disk such that a new operating system is ready to be used upon booting; and replacing a differencing disk on the one or more nodes with the differencing disk of the updated image. 10. The computer-implemented method of claim 7, wherein the updated image is propagated to be downloaded based on a persistence algorithm, wherein the persistence algorithm selects an order and timing for removing one or more nodes, that download updated images, to an offline condition to ensure that active redundant nodes are available for supporting the particular functional aspects of the service application that are supported by the one or more nodes. 11. One or more computer storage hardware memory having computer-executable instructions embodied thereon that, when executed, perform a method for deploying updated images to one or more nodes propagated throughout a distributed computing platform, the method comprising:
receiving an indication to install a patch to an operating system residing on one or more nodes of a data center, wherein an existing image of the operating system is stored at a staging service remotely located from the one or more nodes; generating the updated image by applying the patch to the existing image at a virtual machine, the virtual machine supports an existing image having a virtual disk and a differencing disk, the virtual disk comprising the invariant state of the operating system and the differencing disk stores the variant state of the operating system, wherein generating the updated image comprises:
separating the existing image into a variant state and an invariant state of the operating system;
performing an installation of the patch on the variant state; and
recombining the variant state and the invariant state to form the updated image;
pushing the updated image to the one or more nodes of a data center, wherein the one or more nodes are configured to utilize the updated image of the operating system without performing an installation of the updated image. 12. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
copying the patch to the mounted existing image; and setting a command within the existing image that executes upon activating the virtual machine. 13. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises activating the virtual machine to cause the command to execute to be invoked, wherein, during execution, the command instructs the existing image to install the patch. 14. The media of claim 11, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
capturing a snapshot of the existing image with the patch installed; saving the snapshot as the updated image; and utilizing the updated image for upgrading the operating system of the one or more nodes. 15. The media of claim 11, wherein the method further comprises separating the existing image of the operating system into at least one differencing disk and a virtual disk, wherein the virtual disk is a pristine model of the operating system. 16. The media of claim 15, wherein the virtual disk is configured to accommodate the invariant state of the operating system that is common to each of the one or more nodes of the data center. 17. The media of claim 15, wherein the at least one differencing disk is configured to accommodate the variant state of the operating system that is affected by the role instances of the service application running on the one or more nodes. 18. The media of claim 15, wherein generating the updated image by applying the patch to the existing image at a virtual machine further comprises:
selecting at least one empty differencing disk based upon attributes of the one or more nodes that are targeted for receiving the updated image; and combining the at least one empty differencing disk with the virtual disk upon installing the patch thereto. 19. The media of claim 18, wherein selecting at least one empty differencing disk is based upon attributes of the one or more nodes that are targeted for receiving the updated image comprises:
recognizing the role instances of the service application running on the one or more target nodes; and identifying the at least one empty differencing disk that adequately supports functionality of the one or more target node. 20. The media of claim 18, wherein pushing the updated image to the one or more nodes of the data center comprises:
remove the one or more nodes to an offline condition; loading the updated image to the one or more offline nodes; and booting the one or more offline nodes, wherein the process of booting does not reinstall the operating system carried in the updated image. | 2,100 |
4,644 | 14,556,854 | 2,122 | In one embodiment, a method includes accessing a first set of objects associated with an online social network, each object being associated with one or more comments. The method also includes generating a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects and scoring each object in the second set of objects based on the comments associated with each object. The method further includes generating a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification. The method further includes determining an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times. | 1. A method comprising, by one or more computing devices:
accessing a first set of objects associated with an online social network, each object being associated with one or more comments; generating a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; scoring each object in the second set of objects based on the comments associated with each object; generating a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determining an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
training an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
accessing a third set of objects associated with the online social network;
classifying, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
training a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
accessing a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classifying, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generating a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. 2. 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 node corresponding to an object associated with the online social network. 3. The method of claim 2, wherein, for each object in the first set of objects, the object is a post by a first user of the online social network corresponding to a first node of the plurality of nodes, and wherein each comment associated with the object is a comment on the post by a second user of the online social network, each second user corresponding to a second node, each second node being within a single degree of separation from the first node in the social graph. 4. The method of claim 1, wherein the objects of the first set of objects are each of an object-type selected from a group consisting of: photos, posts, pages, applications, events, locations, or user groups. 5. The method of claim 1, wherein:
applying the first filtering criteria to the first set of objects comprises comparing metadata associated with each object in the first set of objects to a set of filtering criteria; and generating the second set of objects comprises adding objects from the first set of objects to the second set based on the comparison of the metadata to the filtering criteria. 6. The method of claim 5, wherein the metadata comprises one or more of: social-graph information associated with the object, other objects associated with the object, a language associated with the object, a time or date associated with the object, or any combination thereof. 7. The method of claim 6, wherein the social-graph information comprises an affinity coefficient between first and second users of the online social network, the first user being associated with an object in the first set of objects. 8. The method of claim 1, wherein scoring each object in the second set of objects comprises determining a score for each comment associated with the object by comparing the comment to a set of regular expressions associated with the first object-classification. 9. The method of claim 1, wherein scoring each object in the second set of objects comprises:
determining, for each object in the second set of objects, a score for each comment associated with the object; and combining, for each object in the second set of objects, the scores for the comments to produce an object score. 10. The method of claim 9, wherein the object score is an average of the scores for the comments. 11. The method of claim 1, wherein the first threshold score is greater than 90% of the scores of the objects in the second set of objects. 12. The method of claim 1, wherein training the initial object-classifier algorithm comprises:
analyzing the comments associated with the objects in the training set to determine a set of features; scoring each feature in the set of features based on a frequency of occurrence of the feature in the comments associated with the objects in the training set; and modifying the initial object-classifier algorithm to associate at least in part the first object-classification with one or more of the features in the set of features having a score greater than a threshold feature score. 13. The method of claim 1, wherein classifying each object in the third set of objects comprises comparing the comments associated with an object in the third set to features associated with the initial object-classifier algorithm to determine whether the object is classified with the first object-classification. 14. The method of claim 1, wherein training the revised object-classifier algorithm comprises:
analyzing the comments associated with the objects in the third set of objects having the first object-classification to determine a set of revised features; scoring each revised feature in the set of revised features based on a frequency of occurrence of the feature in the comments associated with the objects in the third set of objects having the first object-classification; and modifying the revised object-classifier algorithm to associate at least in part the first object-classification with one or more of the features in the set of revised features having a score greater than a threshold feature score. 15. The method of claim 1, wherein classifying each object in the fourth set of objects comprises comparing the comments associated with an object in the fourth set to features associated with the revised object-classifier algorithm to determine whether the object is classified with the first object-classification. 16. The method of claim 1, wherein training the initial object-classifier algorithm is further based on the revised object-classifier algorithm trained in a prior iteration of the iterative training process. 17. The method of claim 1, wherein one or more of the first, third, or fifth sets of objects each comprise objects that are randomly selected from objects associated with the online social network. 18. The method of claim 1, wherein the first, third, and fifth sets of objects each comprise greater than or equal to one million objects. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access a first set of objects associated with an online social network, each object being associated with one or more comments; generate a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; score each object in the second set of objects based on the comments associated with each object; generate a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determine an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
train an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
access a third set of objects associated with the online social network;
classify, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
train a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
access a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classify, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generate a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
access a first set of objects associated with an online social network, each object being associated with one or more comments; generate a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; score each object in the second set of objects based on the comments associated with each object; generate a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determine an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
train an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
access a third set of objects associated with the online social network;
classify, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
train a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
access a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classify, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generate a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. | In one embodiment, a method includes accessing a first set of objects associated with an online social network, each object being associated with one or more comments. The method also includes generating a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects and scoring each object in the second set of objects based on the comments associated with each object. The method further includes generating a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification. The method further includes determining an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times.1. A method comprising, by one or more computing devices:
accessing a first set of objects associated with an online social network, each object being associated with one or more comments; generating a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; scoring each object in the second set of objects based on the comments associated with each object; generating a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determining an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
training an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
accessing a third set of objects associated with the online social network;
classifying, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
training a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
accessing a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classifying, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generating a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. 2. 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 node corresponding to an object associated with the online social network. 3. The method of claim 2, wherein, for each object in the first set of objects, the object is a post by a first user of the online social network corresponding to a first node of the plurality of nodes, and wherein each comment associated with the object is a comment on the post by a second user of the online social network, each second user corresponding to a second node, each second node being within a single degree of separation from the first node in the social graph. 4. The method of claim 1, wherein the objects of the first set of objects are each of an object-type selected from a group consisting of: photos, posts, pages, applications, events, locations, or user groups. 5. The method of claim 1, wherein:
applying the first filtering criteria to the first set of objects comprises comparing metadata associated with each object in the first set of objects to a set of filtering criteria; and generating the second set of objects comprises adding objects from the first set of objects to the second set based on the comparison of the metadata to the filtering criteria. 6. The method of claim 5, wherein the metadata comprises one or more of: social-graph information associated with the object, other objects associated with the object, a language associated with the object, a time or date associated with the object, or any combination thereof. 7. The method of claim 6, wherein the social-graph information comprises an affinity coefficient between first and second users of the online social network, the first user being associated with an object in the first set of objects. 8. The method of claim 1, wherein scoring each object in the second set of objects comprises determining a score for each comment associated with the object by comparing the comment to a set of regular expressions associated with the first object-classification. 9. The method of claim 1, wherein scoring each object in the second set of objects comprises:
determining, for each object in the second set of objects, a score for each comment associated with the object; and combining, for each object in the second set of objects, the scores for the comments to produce an object score. 10. The method of claim 9, wherein the object score is an average of the scores for the comments. 11. The method of claim 1, wherein the first threshold score is greater than 90% of the scores of the objects in the second set of objects. 12. The method of claim 1, wherein training the initial object-classifier algorithm comprises:
analyzing the comments associated with the objects in the training set to determine a set of features; scoring each feature in the set of features based on a frequency of occurrence of the feature in the comments associated with the objects in the training set; and modifying the initial object-classifier algorithm to associate at least in part the first object-classification with one or more of the features in the set of features having a score greater than a threshold feature score. 13. The method of claim 1, wherein classifying each object in the third set of objects comprises comparing the comments associated with an object in the third set to features associated with the initial object-classifier algorithm to determine whether the object is classified with the first object-classification. 14. The method of claim 1, wherein training the revised object-classifier algorithm comprises:
analyzing the comments associated with the objects in the third set of objects having the first object-classification to determine a set of revised features; scoring each revised feature in the set of revised features based on a frequency of occurrence of the feature in the comments associated with the objects in the third set of objects having the first object-classification; and modifying the revised object-classifier algorithm to associate at least in part the first object-classification with one or more of the features in the set of revised features having a score greater than a threshold feature score. 15. The method of claim 1, wherein classifying each object in the fourth set of objects comprises comparing the comments associated with an object in the fourth set to features associated with the revised object-classifier algorithm to determine whether the object is classified with the first object-classification. 16. The method of claim 1, wherein training the initial object-classifier algorithm is further based on the revised object-classifier algorithm trained in a prior iteration of the iterative training process. 17. The method of claim 1, wherein one or more of the first, third, or fifth sets of objects each comprise objects that are randomly selected from objects associated with the online social network. 18. The method of claim 1, wherein the first, third, and fifth sets of objects each comprise greater than or equal to one million objects. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access a first set of objects associated with an online social network, each object being associated with one or more comments; generate a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; score each object in the second set of objects based on the comments associated with each object; generate a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determine an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
train an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
access a third set of objects associated with the online social network;
classify, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
train a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
access a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classify, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generate a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
access a first set of objects associated with an online social network, each object being associated with one or more comments; generate a second set of objects from the first set of objects by applying a first filtering criteria to the first set of objects; score each object in the second set of objects based on the comments associated with each object; generate a training set of objects from the second set of objects by selecting each object from the second set of objects having a score greater than a first threshold score, each object in the training set being associated with a first object-classification; and determine an object-classifier algorithm for the first object-classification, the object-classifier algorithm being determined through an iterative training process performed one or more times, each iteration of the iterative training process comprising:
train an initial object-classifier algorithm based on the comments associated with the objects in the training set of objects;
access a third set of objects associated with the online social network;
classify, using the initial object-classifier algorithm, each object in the third set of objects based on an analysis of the comments associated with each object, one or more of the objects in the third set of objects being classified with the first object-classification;
train a revised object-classifier algorithm based on the comments associated with the objects in the third set of objects having the first object-classification;
access a fourth set of objects associated with the online social network, the fourth set of objects being generated by applying a second filtering criteria to a fifth set of objects associated with the online social network;
classify, using the revised object-classifier algorithm, each object in the fourth set of objects based on an analysis of the comments associated with each object, one or more objects in the fourth set of objects being classified with the first object-classification; and
generate a sixth set of objects from the fourth set of objects by selecting each object from the fourth set of objects having a score greater than a second threshold score, each object in the sixth set of objects being associated with the first object-classification, wherein the sixth set of objects is to be used as the training set in a next iteration of the iterative training process. | 2,100 |
4,645 | 14,792,524 | 2,117 | A model-based control scheme consisting of either a proportional-integral-derivative (IMC-PID) controller or a model predictive controller (MPC), with an insulin feedback (IFB) scheme personalized based on a priori subject characteristics and comprising a lower order control-relevant model to obtain PID or MPC controller for artificial pancreas (AP) applications. | 1. An internal model-based proportional-integral-derivative (IMC-PID) controller with an insulin feedback (IFB) scheme personalized based on a priori subject characteristics and comprising a control-relevant model to obtain PID controller parameters through an IMC based approach configured for artificial pancreas (AP) applications. 2. The controller of claim 1 that is a model predictive control (MPC) feedback controller comprising the control-relevant model directly in the MPC controller. 3. An internal model-based proportional-integral-derivative (IMC-PID) controller adapted for an artificial pancreas (AP) system which controller requires only a single tuning parameter to modify controller performance and comprises a discrete control-relevant model with a priori subject information as design criteria, wherein a subject's basal insulin injection characteristic is incorporated, in addition to the total daily insulin (TDI) clinical parameter to further attune the controller's action in cases of model and patient mismatch, and an insulin feedback scheme (IFB), which accelerates the apparent insulin pharmacokinetic profile. 4. A controller for an artificial pancreas (AP) system adapted to maintain blood glucose concentrations of people with type 1 diabetes mellitus within the euglycemic zone (80-140 mg/dl) comprising a control algorithm, and which automatically directs the delivery of insulin to be administered to a subject with type 1 diabetes, comprising an internal model control (IMC) based design of a proportional-integral-derivative (PID) controller or a model predictive control (MPC) feedback controller, wherein the controller is configured with individual gain personalization based on each subject's clinical characteristics, using a control-relevant discrete model with a priori subject information, wherein the subject's basal insulin is incorporated into the lower order model to further personalize the controller's aggressiveness and take into account variations in insulin sensitivity, wherein the personalization allows the controller to be aggressive in cases where the subject is insensitive to insulin and requires a large basal amount to maintain euglycemia, while preventing hypoglycemic risk by reducing the controller's aggressiveness in cases where the subject requires a low basal amount to maintain normal blood glucose levels. 5. The controller of claim 4 wherein the controller is a model predictive control (MPC) feedback controller. 6. The controller of claim 1 where in the model is lower order, wherein the model is 1st-5th dimensional. 7. The controller of claim 3 where in the model is lower order, wherein the model is 1st-5th dimensional. 8. The controller of claim 4 where in the model is lower order, wherein the model is 1st-5th dimensional. 9. The controller of claim 1 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 10. The controller of claim 3 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 11. The controller of claim 4 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 12. The controller of claim 5 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 13. The controller of claim 6 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 14. The controller of claim 7 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 15. The controller of claim 8 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 16. A method comprising directing insulin delivery using the controller of claim 1. 17. A method comprising directing insulin delivery using the controller of claim 3. 18. A method comprising directing insulin delivery using the controller of claim 5. 19. A method comprising directing insulin delivery using the controller of claim 6. 20. A method comprising directing insulin delivery using the controller of claim 9. | A model-based control scheme consisting of either a proportional-integral-derivative (IMC-PID) controller or a model predictive controller (MPC), with an insulin feedback (IFB) scheme personalized based on a priori subject characteristics and comprising a lower order control-relevant model to obtain PID or MPC controller for artificial pancreas (AP) applications.1. An internal model-based proportional-integral-derivative (IMC-PID) controller with an insulin feedback (IFB) scheme personalized based on a priori subject characteristics and comprising a control-relevant model to obtain PID controller parameters through an IMC based approach configured for artificial pancreas (AP) applications. 2. The controller of claim 1 that is a model predictive control (MPC) feedback controller comprising the control-relevant model directly in the MPC controller. 3. An internal model-based proportional-integral-derivative (IMC-PID) controller adapted for an artificial pancreas (AP) system which controller requires only a single tuning parameter to modify controller performance and comprises a discrete control-relevant model with a priori subject information as design criteria, wherein a subject's basal insulin injection characteristic is incorporated, in addition to the total daily insulin (TDI) clinical parameter to further attune the controller's action in cases of model and patient mismatch, and an insulin feedback scheme (IFB), which accelerates the apparent insulin pharmacokinetic profile. 4. A controller for an artificial pancreas (AP) system adapted to maintain blood glucose concentrations of people with type 1 diabetes mellitus within the euglycemic zone (80-140 mg/dl) comprising a control algorithm, and which automatically directs the delivery of insulin to be administered to a subject with type 1 diabetes, comprising an internal model control (IMC) based design of a proportional-integral-derivative (PID) controller or a model predictive control (MPC) feedback controller, wherein the controller is configured with individual gain personalization based on each subject's clinical characteristics, using a control-relevant discrete model with a priori subject information, wherein the subject's basal insulin is incorporated into the lower order model to further personalize the controller's aggressiveness and take into account variations in insulin sensitivity, wherein the personalization allows the controller to be aggressive in cases where the subject is insensitive to insulin and requires a large basal amount to maintain euglycemia, while preventing hypoglycemic risk by reducing the controller's aggressiveness in cases where the subject requires a low basal amount to maintain normal blood glucose levels. 5. The controller of claim 4 wherein the controller is a model predictive control (MPC) feedback controller. 6. The controller of claim 1 where in the model is lower order, wherein the model is 1st-5th dimensional. 7. The controller of claim 3 where in the model is lower order, wherein the model is 1st-5th dimensional. 8. The controller of claim 4 where in the model is lower order, wherein the model is 1st-5th dimensional. 9. The controller of claim 1 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 10. The controller of claim 3 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 11. The controller of claim 4 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 12. The controller of claim 5 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 13. The controller of claim 6 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 14. The controller of claim 7 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 15. The controller of claim 8 integrated in an artificial pancreas system further comprising a subcutaneous continuous glucose monitor (CGM) and a continuous subcutaneous insulin injection (CSII) pump to deliver insulin. 16. A method comprising directing insulin delivery using the controller of claim 1. 17. A method comprising directing insulin delivery using the controller of claim 3. 18. A method comprising directing insulin delivery using the controller of claim 5. 19. A method comprising directing insulin delivery using the controller of claim 6. 20. A method comprising directing insulin delivery using the controller of claim 9. | 2,100 |
4,646 | 14,531,855 | 2,169 | Various implementations described herein are directed to a non-transitory computer readable medium having stored thereon computer-executable instructions which, when executed by a computer, may cause the computer to receive a number of display fields. The computer may retrieve a list of data types that correspond to marine electronics. The computer may also fill the number of display fields on a display with data corresponding to the list of data types. Data may only displayed if a sensor transmitting the data is detected on a network. | 1. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
retrieve a hierarchical list of data items that correspond to marine electronics data; select a first data item from the list of data items; detect whether data corresponding to the first data item is available on a network; and display data corresponding to the first data item if data corresponding to the first data item is available on the network. 2. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions further cause the computer to display data corresponding to a second data item in the list of data items if data corresponding to the first data item is not available on the network. 3. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to detect whether the data corresponding to the first data item is available on the network comprise computer-executable instructions that cause the computer to detect whether one or more sensors measuring data corresponding to the first data item are connected to the network. 4. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to select a first data item from the list of date items comprise computer-executable instructions that cause the computer to select a data item with a highest priority in the list of data items. 5. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to detect whether data corresponding to the first data item is available on the network comprise computer-executable instructions that cause the computer to detect whether National Marine Electronics Association (NMEA) 2000 compliant data corresponding to the first data item is available on the network. 6. The non-transitory computer readable medium of claim 1 wherein the hierarchical list of data items comprises one or more formulas or instructions for calculating a data item. 7. The non-transitory computer readable medium of claim 1 wherein the data corresponding to the first data item comprises data from a plurality of sensors. 8. The non-transitory computer readable medium of claim 1 wherein the first data item has a highest priority in the hierarchical or prioritized list. 9. The non-transitory computer readable medium of claim 1, wherein the computer-executable instructions further cause the computer to:
detect that the data corresponding to a displayed data item is not being transmitted on the network; and automatically replace the displayed data item with another data item. 10. The non-transitory computer readable medium of claim 1, wherein the computer-executable instructions further cause the computer to:
detect that a sensor has been added to the network; and automatically replace a displayed data item with a data item corresponding to the sensor. 11. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
retrieve a hierarchical list of data items that correspond to marine electronics data; select a first data item from the list of data items, wherein the first data item has the highest priority in the list; determine whether data corresponding to the first data item is detected; display data corresponding to the first data item if data corresponding to the first data item is detected; select a second data item from the hierarchy, wherein the second data item has a lower priority than the first data item; determine whether data corresponding to the second data item is detected; and display data corresponding to the second data item if data corresponding to the second data item is detected. 12. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions that cause the computer to determine whether data corresponding to the first data item is detected comprise computer-executable instructions that cause the computer to detect whether one or more sensors measuring data corresponding to the first data item are connected to a network. 13. The non-transitory computer readable medium of claim 11 wherein the hierarchical or prioritized list of data items comprises one or more formulas or instructions for calculating a data item. 14. The non-transitory computer readable medium of claim 11 wherein the computer-executable instructions that cause the computer to determine whether data corresponding to the first data item is detected comprise computer-executable instructions that cause the computer to detect whether National Marine Electronics Association (NMEA) 2000 compliant data corresponding to the first data item is available on the network. 15. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions further cause the computer to:
determine that the data corresponding to the first or second data item is no longer detected; and automatically replace the first or second data item with a third data item in the list of data items. 16. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions further cause the computer to:
detect that a sensor has been added to the network; and automatically replace a displayed data item with a data item corresponding to the sensor. 17. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
receive a number of display fields; retrieve a list of data types that correspond to marine electronics; and fill the number of display fields on a display with data corresponding to the list of data types, wherein data is only displayed if a sensor transmitting the data is detected on a network. 18. The non-transitory computer readable medium of claim 17 wherein the list of data types comprises a hierarchical or prioritized list of data items. 19. The non-transitory computer readable medium of claim 17 wherein the network is a National Marine Electronics Association (NMEA) 2000 bus. 20. The non-transitory computer readable medium of claim 11 wherein the number of display fields is received in response to a request to display a page. | Various implementations described herein are directed to a non-transitory computer readable medium having stored thereon computer-executable instructions which, when executed by a computer, may cause the computer to receive a number of display fields. The computer may retrieve a list of data types that correspond to marine electronics. The computer may also fill the number of display fields on a display with data corresponding to the list of data types. Data may only displayed if a sensor transmitting the data is detected on a network.1. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
retrieve a hierarchical list of data items that correspond to marine electronics data; select a first data item from the list of data items; detect whether data corresponding to the first data item is available on a network; and display data corresponding to the first data item if data corresponding to the first data item is available on the network. 2. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions further cause the computer to display data corresponding to a second data item in the list of data items if data corresponding to the first data item is not available on the network. 3. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to detect whether the data corresponding to the first data item is available on the network comprise computer-executable instructions that cause the computer to detect whether one or more sensors measuring data corresponding to the first data item are connected to the network. 4. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to select a first data item from the list of date items comprise computer-executable instructions that cause the computer to select a data item with a highest priority in the list of data items. 5. The non-transitory computer readable medium of claim 1 wherein the computer-executable instructions that cause the computer to detect whether data corresponding to the first data item is available on the network comprise computer-executable instructions that cause the computer to detect whether National Marine Electronics Association (NMEA) 2000 compliant data corresponding to the first data item is available on the network. 6. The non-transitory computer readable medium of claim 1 wherein the hierarchical list of data items comprises one or more formulas or instructions for calculating a data item. 7. The non-transitory computer readable medium of claim 1 wherein the data corresponding to the first data item comprises data from a plurality of sensors. 8. The non-transitory computer readable medium of claim 1 wherein the first data item has a highest priority in the hierarchical or prioritized list. 9. The non-transitory computer readable medium of claim 1, wherein the computer-executable instructions further cause the computer to:
detect that the data corresponding to a displayed data item is not being transmitted on the network; and automatically replace the displayed data item with another data item. 10. The non-transitory computer readable medium of claim 1, wherein the computer-executable instructions further cause the computer to:
detect that a sensor has been added to the network; and automatically replace a displayed data item with a data item corresponding to the sensor. 11. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
retrieve a hierarchical list of data items that correspond to marine electronics data; select a first data item from the list of data items, wherein the first data item has the highest priority in the list; determine whether data corresponding to the first data item is detected; display data corresponding to the first data item if data corresponding to the first data item is detected; select a second data item from the hierarchy, wherein the second data item has a lower priority than the first data item; determine whether data corresponding to the second data item is detected; and display data corresponding to the second data item if data corresponding to the second data item is detected. 12. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions that cause the computer to determine whether data corresponding to the first data item is detected comprise computer-executable instructions that cause the computer to detect whether one or more sensors measuring data corresponding to the first data item are connected to a network. 13. The non-transitory computer readable medium of claim 11 wherein the hierarchical or prioritized list of data items comprises one or more formulas or instructions for calculating a data item. 14. The non-transitory computer readable medium of claim 11 wherein the computer-executable instructions that cause the computer to determine whether data corresponding to the first data item is detected comprise computer-executable instructions that cause the computer to detect whether National Marine Electronics Association (NMEA) 2000 compliant data corresponding to the first data item is available on the network. 15. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions further cause the computer to:
determine that the data corresponding to the first or second data item is no longer detected; and automatically replace the first or second data item with a third data item in the list of data items. 16. The non-transitory computer readable medium of claim 11, wherein the computer-executable instructions further cause the computer to:
detect that a sensor has been added to the network; and automatically replace a displayed data item with a data item corresponding to the sensor. 17. A non-transitory computer readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
receive a number of display fields; retrieve a list of data types that correspond to marine electronics; and fill the number of display fields on a display with data corresponding to the list of data types, wherein data is only displayed if a sensor transmitting the data is detected on a network. 18. The non-transitory computer readable medium of claim 17 wherein the list of data types comprises a hierarchical or prioritized list of data items. 19. The non-transitory computer readable medium of claim 17 wherein the network is a National Marine Electronics Association (NMEA) 2000 bus. 20. The non-transitory computer readable medium of claim 11 wherein the number of display fields is received in response to a request to display a page. | 2,100 |
4,647 | 13,016,355 | 2,143 | Embodiments of the present invention provide a method, system and computer program product for constraining individual meeting times of a task to a specified total duration of aggregated meeting times. In an embodiment of the invention, a method of constraining individual meeting times of a task to a specified total duration of aggregated meeting times is provided. The method includes selecting an event amongst a plurality of events associated with a single task in a C&S system executing in memory of a host server. The method further includes adjusting a duration of time for the selected event. The method yet further includes determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task. Thereafter, in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, a compensatory adjustment of time can be apportioned to remaining ones of the events associated with the single task. | 1. A method of constraining individual meeting times of a task to a specified total duration of aggregated meeting times comprising:
selecting an event amongst a plurality of events associated with a single task in a calendaring and scheduling (C&S) system executing in memory of a host server; adjusting a duration of time for the selected event; determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task; and, apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 2. The method of claim 1, wherein determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task, comprises:
filtering the events of the single task to include only present and future events and not past events; and, determining whether or not a sum total of all durations of time for the filtered events exceeds a time constraint for the single task. 3. The method of claim 1, wherein apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises apportioning a compensatory adjustment of time evenly to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 4. The method of claim 1, wherein apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises apportioning a compensatory adjustment of time proportionately by weight to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 5. The method of claim 1, further comprising:
identifying an event amongst the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time; and, removing the event from the C&S system. 6. A calendaring and scheduling (C&S) data processing system comprising:
a host server with at least one processor and memory configured for communicative coupling to a plurality of different computers over a computer communications network; a C&S system executing in the memory of the host server; a plurality of events scheduled in the C&S system and associated with a single task in the C&S system; and, a time constraint enforcement module coupled to the C&S system, the module comprising program code enabled to select an event amongst the plurality of events, and to respond to an adjustment of a duration of time for the selected event by determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task and by apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 7. The system of claim 6, wherein the program code is further enabled to filter the remaining ones of the events to receive the apportionment of the compensatory adjustment of time to only present and future ones of the remaining ones of the events. 8. The system of claim 6, wherein the apportionment of the compensatory adjustment of time is an even apportionment across the remaining ones of the events. 9. The system of claim 6, wherein the apportionment of the compensatory adjustment of time is a proportional apportionment across the remaining ones of the events. 10. The system of claim 6, wherein the program code is further enabled to remove from the C&S system remaining ones of the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time. 11. A computer program product for constraining individual meeting times of a task to a specified total duration of aggregated meeting times, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for selecting an event amongst a plurality of events associated with a single task in a calendaring and scheduling (C&S) system executing in memory of a host server; computer readable program code for adjusting a duration of time for the selected event; computer readable program code for determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task; and, computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 12. The computer program product of claim 11, wherein the computer readable program code for determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task, comprises:
computer readable program code for filtering the events of the single task to include only present and future events and not past events; and, computer readable program code for determining whether or not a sum total of all durations of time for the filtered events exceeds a time constraint for the single task. 13. The computer program product of claim 11, wherein the computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises computer readable program code for apportioning a compensatory adjustment of time evenly to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 14. The computer program product of claim 11, wherein the computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises computer readable program code for apportioning a compensatory adjustment of time proportionately by weight to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 15. The computer program product of claim 11, further comprising:
computer readable program code for identifying an event amongst the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time; and, computer readable program code for removing the event from the C&S system. | Embodiments of the present invention provide a method, system and computer program product for constraining individual meeting times of a task to a specified total duration of aggregated meeting times. In an embodiment of the invention, a method of constraining individual meeting times of a task to a specified total duration of aggregated meeting times is provided. The method includes selecting an event amongst a plurality of events associated with a single task in a C&S system executing in memory of a host server. The method further includes adjusting a duration of time for the selected event. The method yet further includes determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task. Thereafter, in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, a compensatory adjustment of time can be apportioned to remaining ones of the events associated with the single task.1. A method of constraining individual meeting times of a task to a specified total duration of aggregated meeting times comprising:
selecting an event amongst a plurality of events associated with a single task in a calendaring and scheduling (C&S) system executing in memory of a host server; adjusting a duration of time for the selected event; determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task; and, apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 2. The method of claim 1, wherein determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task, comprises:
filtering the events of the single task to include only present and future events and not past events; and, determining whether or not a sum total of all durations of time for the filtered events exceeds a time constraint for the single task. 3. The method of claim 1, wherein apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises apportioning a compensatory adjustment of time evenly to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 4. The method of claim 1, wherein apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises apportioning a compensatory adjustment of time proportionately by weight to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 5. The method of claim 1, further comprising:
identifying an event amongst the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time; and, removing the event from the C&S system. 6. A calendaring and scheduling (C&S) data processing system comprising:
a host server with at least one processor and memory configured for communicative coupling to a plurality of different computers over a computer communications network; a C&S system executing in the memory of the host server; a plurality of events scheduled in the C&S system and associated with a single task in the C&S system; and, a time constraint enforcement module coupled to the C&S system, the module comprising program code enabled to select an event amongst the plurality of events, and to respond to an adjustment of a duration of time for the selected event by determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task and by apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 7. The system of claim 6, wherein the program code is further enabled to filter the remaining ones of the events to receive the apportionment of the compensatory adjustment of time to only present and future ones of the remaining ones of the events. 8. The system of claim 6, wherein the apportionment of the compensatory adjustment of time is an even apportionment across the remaining ones of the events. 9. The system of claim 6, wherein the apportionment of the compensatory adjustment of time is a proportional apportionment across the remaining ones of the events. 10. The system of claim 6, wherein the program code is further enabled to remove from the C&S system remaining ones of the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time. 11. A computer program product for constraining individual meeting times of a task to a specified total duration of aggregated meeting times, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for selecting an event amongst a plurality of events associated with a single task in a calendaring and scheduling (C&S) system executing in memory of a host server; computer readable program code for adjusting a duration of time for the selected event; computer readable program code for determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task; and, computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 12. The computer program product of claim 11, wherein the computer readable program code for determining whether or not a sum total of all durations of time for the events associated with the single task exceeds a time constraint for the single task, comprises:
computer readable program code for filtering the events of the single task to include only present and future events and not past events; and, computer readable program code for determining whether or not a sum total of all durations of time for the filtered events exceeds a time constraint for the single task. 13. The computer program product of claim 11, wherein the computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises computer readable program code for apportioning a compensatory adjustment of time evenly to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 14. The computer program product of claim 11, wherein the computer readable program code for apportioning a compensatory adjustment of time to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task, comprises computer readable program code for apportioning a compensatory adjustment of time proportionately by weight to remaining ones of the events associated with the single task in response to determining the sum total of all durations of time for the events associated with the single task to have exceeded the time constraint for the single task. 15. The computer program product of claim 11, further comprising:
computer readable program code for identifying an event amongst the events with a duration of time of zero resulting from the apportionment of the compensatory adjustment of time; and, computer readable program code for removing the event from the C&S system. | 2,100 |
4,648 | 13,771,692 | 2,167 | A system for automatically applying retention categories and retention rules to records. The system defines a plurality of retention categories. Each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category. The system receives at least one record. The system automatically associates a retention category of the plurality of retention categories with the at least one record. The at least one record meets the criteria for membership in the associated retention category. The system automatically applies the retention rule of the associated retention category to the at least one record. | 1. A computer readable medium having instructions stored thereon that, when executed by a processor, causes the processor to automatically apply retention categories and retention rules to records, the applying comprising:
defining a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; receiving at least one record; automatically associating a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; automatically applying the retention rule of the associated retention category to the at least one record. 2. The computer readable medium of claim 1, wherein the retention category determines a retention period for the record. 3. The computer readable medium of claim 1, wherein the retention category is associated with the record based upon business metadata associated with the record. 4. The computer readable medium of claim 1, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 5. The computer readable medium of claim 1, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 6. The computer readable medium of claim 1, wherein the retention rule references a retention schedule. 7. The computer readable medium of claim 2, the applying further comprising deleting the at least one record at the end of the retention period. 8. A method for automatically applying retention categories and retention rules to records, the method comprising:
defining a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; receiving at least one record; automatically associating a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; automatically applying the retention rule of the associated retention category to the at least one record. 9. The method of claim 8, wherein the retention category determines a retention period for the record. 10. The method of claim 8, wherein the retention category is associated with the record based upon business metadata associated with the record. 11. The method of claim 8, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 12. The method of claim 8, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 13. The method of claim 8, wherein the retention rule references a retention schedule. 14. The method of claim 9, further comprising deleting the at least one record at the end of the retention period. 15. A system for automatically applying retention categories and retention rules to records, the system comprising:
a processor; a memory coupled to the processor; a defining module that defines a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; a receiving module that receives at least one record; an associating module that automatically associates a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; an applying module that automatically applies the retention rule of the associated retention category to the at least one record. 16. The system of claim 15, wherein the retention category determines a retention period for the record. 17. The system of claim 15, wherein the retention category is associated with the record based upon business metadata associated with the record. 18. The system of claim 15, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 19. The system of claim 15, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 20. The system of claim 15, wherein the retention rule references a retention schedule. 21. The system of claim 16, further comprising a deleting module that deletes the at least one record at the end of the retention period. | A system for automatically applying retention categories and retention rules to records. The system defines a plurality of retention categories. Each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category. The system receives at least one record. The system automatically associates a retention category of the plurality of retention categories with the at least one record. The at least one record meets the criteria for membership in the associated retention category. The system automatically applies the retention rule of the associated retention category to the at least one record.1. A computer readable medium having instructions stored thereon that, when executed by a processor, causes the processor to automatically apply retention categories and retention rules to records, the applying comprising:
defining a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; receiving at least one record; automatically associating a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; automatically applying the retention rule of the associated retention category to the at least one record. 2. The computer readable medium of claim 1, wherein the retention category determines a retention period for the record. 3. The computer readable medium of claim 1, wherein the retention category is associated with the record based upon business metadata associated with the record. 4. The computer readable medium of claim 1, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 5. The computer readable medium of claim 1, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 6. The computer readable medium of claim 1, wherein the retention rule references a retention schedule. 7. The computer readable medium of claim 2, the applying further comprising deleting the at least one record at the end of the retention period. 8. A method for automatically applying retention categories and retention rules to records, the method comprising:
defining a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; receiving at least one record; automatically associating a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; automatically applying the retention rule of the associated retention category to the at least one record. 9. The method of claim 8, wherein the retention category determines a retention period for the record. 10. The method of claim 8, wherein the retention category is associated with the record based upon business metadata associated with the record. 11. The method of claim 8, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 12. The method of claim 8, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 13. The method of claim 8, wherein the retention rule references a retention schedule. 14. The method of claim 9, further comprising deleting the at least one record at the end of the retention period. 15. A system for automatically applying retention categories and retention rules to records, the system comprising:
a processor; a memory coupled to the processor; a defining module that defines a plurality of retention categories, wherein each retention category of the plurality of retention categories comprises a criteria for membership in the retention category and at least one retention rule for the retention category; a receiving module that receives at least one record; an associating module that automatically associates a retention category of the plurality of retention categories with the at least one record, wherein the at least one record meets the criteria for membership in the associated retention category; an applying module that automatically applies the retention rule of the associated retention category to the at least one record. 16. The system of claim 15, wherein the retention category determines a retention period for the record. 17. The system of claim 15, wherein the retention category is associated with the record based upon business metadata associated with the record. 18. The system of claim 15, wherein associating the retention category with the at least one record is performed without prompting the user to perform the associating. 19. The system of claim 15, wherein application of the retention rule verifies the integrity of the record using a checksum that is periodically computed. 20. The system of claim 15, wherein the retention rule references a retention schedule. 21. The system of claim 16, further comprising a deleting module that deletes the at least one record at the end of the retention period. | 2,100 |
4,649 | 14,219,030 | 2,182 | A method and a device that includes a set of multiple pipeline stages, wherein the set of multiple pipeline stages is arranged to execute a first thread of instructions; multiple memristor based registers that are arranged to store a state of another thread of instructions that differs from the first thread of instructions; and a control circuit that is arranged to control a thread switch between the first thread of instructions and the other thread of instructions by controlling a storage of a state of the first thread of instructions at the multiple memristor based registers and by controlling a provision of the state of the other thread of instructions by the set of multiple pipeline stages; wherein the set of multiple pipeline stages is arranged to execute the other thread of instructions upon a reception of the state of the other thread of instructions. | 1. A device that comprises:
a set of multiple pipeline stages, wherein the set of multiple pipeline stages is arranged to execute a first thread of instructions; multiple memristor based registers that are arranged to store a state of another thread of instructions that differs from the first thread of instructions; and a control circuit that is arranged to control a thread switch between the first thread of instructions and the other thread of instructions by controlling a storage of a state of the first thread of instructions at the multiple memristor based registers and by controlling a provision of the state of the other thread of instructions by the set of multiple pipeline stages; wherein the set of multiple pipeline stages is arranged to execute the other thread of instructions upon a reception of the state of the other thread of instructions. 2. The device according to claim 1, wherein the memristor based registers comprise spin torque transfer magnetoresistive memory elements. 3. The device according to claim 1, wherein the memristor based registers comprise resistive memory elements. 4. The device according to claim 3, wherein the resistive memory elements are formed in close proximity to the multiple pipeline stages. 5. The device according to claim 3, wherein the resistive memory elements are positioned directly above portions of the set of multiple pipeline stages. 6. The device according to claim 1, wherein duration of the thread switch does not a time required to re-fill the pipeline . 7. The device according to claim 1, wherein each pipeline stage is followed by a memristor based register. 8. The device according to claim 1, wherein the storage of the state of the first thread of instructions at the multiple memristor based registers is preceded by extracting the state of the first thread of instructions from the set of multiple pipeline stages. 9. The device according to claim 8, wherein an aggregate duration of the extracting of the state of the first thread of instructions and the storage of the state of the first thread of instructions exceeds a duration of the provision of the state of the other thread of instructions. 10. The device according to claim 1, wherein the multiple memristor based registers are arranged to store a state of each one out of multiple other thread of instructions that differ from the first thread of instructions; and wherein the control circuit is arranged to control thread switches between any instructions out of the first thread if instructions and any one of the other threads of instructions. 11. The device according to claim 10, wherein the multiple other thread of instructions exceed three threads of instructions. 12. The device according to claim 10, wherein the multiple other thread of instructions exceed ten threads of instructions. 13. The device according to claim 10, wherein the multiple memristor based registers comprises multiple layers, wherein each layer is dedicated for storing the status of a single other thread of instructions. 14. The device according to claim 10 wherein the memristor based registers comprise resistive memory elements; wherein each other thread of instructions is stored in a memristive-based layer of the memristor based registers. 15. A method, comprising:
executing, by a set of multiple pipeline stages, a first thread of instructions; storing, by multiple memristor based registers, a state of another thread of instructions that differs from the first thread of instructions; and executing a thread switch between the first thread of instructions and the other thread of instructions; wherein the executing of the thread switch comprises:
storing a state of the first thread of instructions at the multiple memristor based registers; and
providing the state of the other thread of instructions by the set of multiple pipeline stages; wherein the state of the other thread of instructions facilitates an executing of the other thread of instructions. 16. The method according to claim 15, wherein the memristor based registers comprise spin torque transfer magnetoresistive memory elements. 17. The method according to claim 15, wherein the memristor based registers comprise resistive memory elements. 18. The method according to claim 17, wherein the resistive memory elements are formed in close proximity to the multiple pipeline stages. 19. The method according to claim 17, wherein the resistive memory elements are positioned directly above portions of the set of multiple pipeline stages. 20. The method according to claim 15, wherein a duration of the thread switch does not exceed 3 clock cycles of a clock signal provided to the set of multiple pipeline stages. 21. The method according to claim 15, wherein each pipeline stage is followed by a memristor based register. 22. The method according to claim 15, wherein the storing of the state of the first thread of instructions at the multiple memristor based registers is preceded by extracting the state of the first thread of instructions from the set of multiple pipeline stages. 23. The method according to claim 8, wherein an aggregate duration of the extracting of the state of the first thread of instructions and the storing of the state of the first thread of instructions exceeds a duration of the provision of the state of the other thread of instructions. 24. The method according to claim 15, comprising storing by the multiple memristor based registers a state of each one out of multiple other thread of instructions that differ from the first thread of instructions; and wherein the method comprises executing a thread switch between any thread of instructions out of the first thread of instructions and the multiple other threads of instructions. 25. The method according to claim 24, wherein the multiple other thread of instructions exceed three threads of instructions. 26. The method according to claim 24, wherein the multiple other thread of instructions exceed ten threads of instructions. 27. The method according to claim 24, wherein the multiple memristor based registers comprises multiple layers, wherein the storing comprise storing by each layer a status of a single other thread of instructions. 28. The method according to claim 24 wherein the memristor based registers comprise resistive memory elements; wherein the method comprises storing each other thread of instructions is in a memristive-based layer of the memristor based registers. | A method and a device that includes a set of multiple pipeline stages, wherein the set of multiple pipeline stages is arranged to execute a first thread of instructions; multiple memristor based registers that are arranged to store a state of another thread of instructions that differs from the first thread of instructions; and a control circuit that is arranged to control a thread switch between the first thread of instructions and the other thread of instructions by controlling a storage of a state of the first thread of instructions at the multiple memristor based registers and by controlling a provision of the state of the other thread of instructions by the set of multiple pipeline stages; wherein the set of multiple pipeline stages is arranged to execute the other thread of instructions upon a reception of the state of the other thread of instructions.1. A device that comprises:
a set of multiple pipeline stages, wherein the set of multiple pipeline stages is arranged to execute a first thread of instructions; multiple memristor based registers that are arranged to store a state of another thread of instructions that differs from the first thread of instructions; and a control circuit that is arranged to control a thread switch between the first thread of instructions and the other thread of instructions by controlling a storage of a state of the first thread of instructions at the multiple memristor based registers and by controlling a provision of the state of the other thread of instructions by the set of multiple pipeline stages; wherein the set of multiple pipeline stages is arranged to execute the other thread of instructions upon a reception of the state of the other thread of instructions. 2. The device according to claim 1, wherein the memristor based registers comprise spin torque transfer magnetoresistive memory elements. 3. The device according to claim 1, wherein the memristor based registers comprise resistive memory elements. 4. The device according to claim 3, wherein the resistive memory elements are formed in close proximity to the multiple pipeline stages. 5. The device according to claim 3, wherein the resistive memory elements are positioned directly above portions of the set of multiple pipeline stages. 6. The device according to claim 1, wherein duration of the thread switch does not a time required to re-fill the pipeline . 7. The device according to claim 1, wherein each pipeline stage is followed by a memristor based register. 8. The device according to claim 1, wherein the storage of the state of the first thread of instructions at the multiple memristor based registers is preceded by extracting the state of the first thread of instructions from the set of multiple pipeline stages. 9. The device according to claim 8, wherein an aggregate duration of the extracting of the state of the first thread of instructions and the storage of the state of the first thread of instructions exceeds a duration of the provision of the state of the other thread of instructions. 10. The device according to claim 1, wherein the multiple memristor based registers are arranged to store a state of each one out of multiple other thread of instructions that differ from the first thread of instructions; and wherein the control circuit is arranged to control thread switches between any instructions out of the first thread if instructions and any one of the other threads of instructions. 11. The device according to claim 10, wherein the multiple other thread of instructions exceed three threads of instructions. 12. The device according to claim 10, wherein the multiple other thread of instructions exceed ten threads of instructions. 13. The device according to claim 10, wherein the multiple memristor based registers comprises multiple layers, wherein each layer is dedicated for storing the status of a single other thread of instructions. 14. The device according to claim 10 wherein the memristor based registers comprise resistive memory elements; wherein each other thread of instructions is stored in a memristive-based layer of the memristor based registers. 15. A method, comprising:
executing, by a set of multiple pipeline stages, a first thread of instructions; storing, by multiple memristor based registers, a state of another thread of instructions that differs from the first thread of instructions; and executing a thread switch between the first thread of instructions and the other thread of instructions; wherein the executing of the thread switch comprises:
storing a state of the first thread of instructions at the multiple memristor based registers; and
providing the state of the other thread of instructions by the set of multiple pipeline stages; wherein the state of the other thread of instructions facilitates an executing of the other thread of instructions. 16. The method according to claim 15, wherein the memristor based registers comprise spin torque transfer magnetoresistive memory elements. 17. The method according to claim 15, wherein the memristor based registers comprise resistive memory elements. 18. The method according to claim 17, wherein the resistive memory elements are formed in close proximity to the multiple pipeline stages. 19. The method according to claim 17, wherein the resistive memory elements are positioned directly above portions of the set of multiple pipeline stages. 20. The method according to claim 15, wherein a duration of the thread switch does not exceed 3 clock cycles of a clock signal provided to the set of multiple pipeline stages. 21. The method according to claim 15, wherein each pipeline stage is followed by a memristor based register. 22. The method according to claim 15, wherein the storing of the state of the first thread of instructions at the multiple memristor based registers is preceded by extracting the state of the first thread of instructions from the set of multiple pipeline stages. 23. The method according to claim 8, wherein an aggregate duration of the extracting of the state of the first thread of instructions and the storing of the state of the first thread of instructions exceeds a duration of the provision of the state of the other thread of instructions. 24. The method according to claim 15, comprising storing by the multiple memristor based registers a state of each one out of multiple other thread of instructions that differ from the first thread of instructions; and wherein the method comprises executing a thread switch between any thread of instructions out of the first thread of instructions and the multiple other threads of instructions. 25. The method according to claim 24, wherein the multiple other thread of instructions exceed three threads of instructions. 26. The method according to claim 24, wherein the multiple other thread of instructions exceed ten threads of instructions. 27. The method according to claim 24, wherein the multiple memristor based registers comprises multiple layers, wherein the storing comprise storing by each layer a status of a single other thread of instructions. 28. The method according to claim 24 wherein the memristor based registers comprise resistive memory elements; wherein the method comprises storing each other thread of instructions is in a memristive-based layer of the memristor based registers. | 2,100 |
4,650 | 14,148,598 | 2,176 | In one embodiment, a web page presented to a user includes a header section that substantially spans the top of the web page and provides a menu of selectable options as well as a search input box. A product display region provided below the header displays images and information about a selected product. Below the product display region is a carousel control that shows information about other products in a horizontally scrollable list. Two columns of various types of product review information provided by sources such as professional reviewers, existing owners, and the user's friends are displayed below the carousel control. Below the review information, a sortable and filterable grid of products is displayed such that the user's attention is drawn to the variety of products available for purchase. | 1. (canceled) 2. (canceled) 3. (canceled) 4. (canceled) 5. (canceled) 6. (canceled) 7. (canceled) 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a search activation member that when activated by a user will cause a search to be performed for product information corresponding to the search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the product information includes a pictorial image of a product, product pricing and one of a customer rating and a product description, the second region further including at least one of a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the plurality of different search sorting criteria including at least relevance, product cost and product popularity, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area, the plurality of different views including a grid view displaying product information in a plurality of rows in the second region and a list view displaying product information in a vertical column with product information for a first product displayed directly above product information for a second product; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being horizontally aligned with the second region and disposed below the first region, the search narrowing control including at least a first search narrowing criteria and a second search narrowing criteria where the first search narrowing criteria is different from the second search narrowing criteria. 13. The method claim 12, wherein one of the search sorting control and the display view control is a drop-down menu. 14. The method of claim 13, wherein the search results display area includes a search sorting control, the search sorting control is a drop-down menu that upon activation presents the user with the relevance search sorting criteria, the product cost search sorting criteria and the product popularity search sorting criteria. 15. The method of claim 14, wherein the drop-down menu is disposed above the product information. 16. The method of claim 12, wherein the first region includes a search results summary identifying a number of search results displayed on the web page at a given time and a total number of search results developed from the search query. 17. The method of claim 12, wherein the display view control includes at least one other view different from the grid view and the list view. 18. The method of claim 12, wherein the display view control further includes a compare view. 19. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a portion in which a user can enter a search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the second region further including a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being disposed below the first region, the search narrowing control including at least a first search narrowing criteria which when activated by the user will narrow search results of the search query displayed in the second region. 20. The method claim 19, wherein one of the search sorting control and the display view control is a drop-down menu. 21. The method of claim 19, wherein the search sorting control is a drop-down menu that upon activation presents the user with a relevance search sorting criteria, a product cost search sorting criteria and a product popularity search sorting criteria. 22. The method of claim 19, wherein the at least one search narrowing control includes at least two of the following search narrowing criteria: (i) a product category search narrowing criteria; (ii) a product price search narrowing criteria; (iii) a product size search narrowing criteria and (iv) a product color search narrowing criteria. 23. The method of claim 19, wherein the at least one search narrowing control includes a product category search narrowing criteria, a product price search narrowing criteria and a product size search narrowing criteria. 24. The method of claim 23, wherein the first region includes a search results summary identifying a number of search results displayed on the web page at a given time and a total number of search results developed from the search query. 25. The method of claim 19, wherein the display view control is horizontally aligned with the search sorting control. 26. The method of claim 25, wherein the display view control and the search sorting control are disposed above the product information. 27. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a search activation member that when activated by a user will cause a search to be performed for product information corresponding to the search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the product information includes a pictorial image of a product, product pricing and one of a customer rating and a product description, the second region further including a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the plurality of different search sorting criteria including at least relevance, product cost and product popularity, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area, the plurality of different views including at least three different views; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being horizontally aligned with the second region and disposed below the first region, the search narrowing control including at least a first search narrowing criteria, a second search narrowing criteria and a third search narrowing criteria where the first search narrowing criteria, the second search narrowing criteria and the third search narrowing criteria are each different search narrowing criteria. 28. The method of claim 27, wherein the product information includes a customer rating. 29. The method of claim 27, wherein the first search narrowing criteria is a product category search narrowing criteria. 30. The method of claim 27, wherein the third region includes a clear search narrowing control member for clearing at least one previously activated search narrowing criteria such that the product information displayed in the search results display area returns to the product information displayed just prior to activation of the search narrowing criteria. 31. The method of claim 27, wherein the first region extends substantially the width of the web page and the second region has a width substantially greater than a width of the third region. | In one embodiment, a web page presented to a user includes a header section that substantially spans the top of the web page and provides a menu of selectable options as well as a search input box. A product display region provided below the header displays images and information about a selected product. Below the product display region is a carousel control that shows information about other products in a horizontally scrollable list. Two columns of various types of product review information provided by sources such as professional reviewers, existing owners, and the user's friends are displayed below the carousel control. Below the review information, a sortable and filterable grid of products is displayed such that the user's attention is drawn to the variety of products available for purchase.1. (canceled) 2. (canceled) 3. (canceled) 4. (canceled) 5. (canceled) 6. (canceled) 7. (canceled) 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a search activation member that when activated by a user will cause a search to be performed for product information corresponding to the search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the product information includes a pictorial image of a product, product pricing and one of a customer rating and a product description, the second region further including at least one of a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the plurality of different search sorting criteria including at least relevance, product cost and product popularity, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area, the plurality of different views including a grid view displaying product information in a plurality of rows in the second region and a list view displaying product information in a vertical column with product information for a first product displayed directly above product information for a second product; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being horizontally aligned with the second region and disposed below the first region, the search narrowing control including at least a first search narrowing criteria and a second search narrowing criteria where the first search narrowing criteria is different from the second search narrowing criteria. 13. The method claim 12, wherein one of the search sorting control and the display view control is a drop-down menu. 14. The method of claim 13, wherein the search results display area includes a search sorting control, the search sorting control is a drop-down menu that upon activation presents the user with the relevance search sorting criteria, the product cost search sorting criteria and the product popularity search sorting criteria. 15. The method of claim 14, wherein the drop-down menu is disposed above the product information. 16. The method of claim 12, wherein the first region includes a search results summary identifying a number of search results displayed on the web page at a given time and a total number of search results developed from the search query. 17. The method of claim 12, wherein the display view control includes at least one other view different from the grid view and the list view. 18. The method of claim 12, wherein the display view control further includes a compare view. 19. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a portion in which a user can enter a search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the second region further including a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being disposed below the first region, the search narrowing control including at least a first search narrowing criteria which when activated by the user will narrow search results of the search query displayed in the second region. 20. The method claim 19, wherein one of the search sorting control and the display view control is a drop-down menu. 21. The method of claim 19, wherein the search sorting control is a drop-down menu that upon activation presents the user with a relevance search sorting criteria, a product cost search sorting criteria and a product popularity search sorting criteria. 22. The method of claim 19, wherein the at least one search narrowing control includes at least two of the following search narrowing criteria: (i) a product category search narrowing criteria; (ii) a product price search narrowing criteria; (iii) a product size search narrowing criteria and (iv) a product color search narrowing criteria. 23. The method of claim 19, wherein the at least one search narrowing control includes a product category search narrowing criteria, a product price search narrowing criteria and a product size search narrowing criteria. 24. The method of claim 23, wherein the first region includes a search results summary identifying a number of search results displayed on the web page at a given time and a total number of search results developed from the search query. 25. The method of claim 19, wherein the display view control is horizontally aligned with the search sorting control. 26. The method of claim 25, wherein the display view control and the search sorting control are disposed above the product information. 27. A computer-implemented method of rendering a web page of a retailer, the computer-implemented method including the step of:
operating one or more computers to serve one or more files to create and display a web page of a retailer on an electronic display, the web page including: a first region including a search input box for receiving a search query of a user, the search input box including a search activation member that when activated by a user will cause a search to be performed for product information corresponding to the search query; a second region below the first region, the second region having a search results display area for displaying results of the search query of the user, the search results display area being configured to display product information for a plurality of products corresponding to the search query of the user, the product information includes a pictorial image of a product, product pricing and one of a customer rating and a product description, the second region further including a search sorting control and a display view control, the search sorting control being configured to allow a user to customize order of appearance of the results of the search query displayed in the search results display area based on a plurality of different search sorting criteria, the plurality of different search sorting criteria including at least relevance, product cost and product popularity, the display view control being configured to allow a user to select from a plurality of different views to display the product information in the search results display area, the plurality of different views including at least three different views; and, a third region including at least one search narrowing control for narrowing search results displayed in the search results display area without entering a new search query in the search input box, the third region being horizontally aligned with the second region and disposed below the first region, the search narrowing control including at least a first search narrowing criteria, a second search narrowing criteria and a third search narrowing criteria where the first search narrowing criteria, the second search narrowing criteria and the third search narrowing criteria are each different search narrowing criteria. 28. The method of claim 27, wherein the product information includes a customer rating. 29. The method of claim 27, wherein the first search narrowing criteria is a product category search narrowing criteria. 30. The method of claim 27, wherein the third region includes a clear search narrowing control member for clearing at least one previously activated search narrowing criteria such that the product information displayed in the search results display area returns to the product information displayed just prior to activation of the search narrowing criteria. 31. The method of claim 27, wherein the first region extends substantially the width of the web page and the second region has a width substantially greater than a width of the third region. | 2,100 |
4,651 | 14,054,999 | 2,117 | The present invention provides a software and system to provide group control and network operations to/for a multiplicity of distributed energy storage units. In particular, the group control software and system connects multiple individual distributed energy storage units and operates those units in synchronicity to create a large virtual energy storage device. This group control system includes two methods of controlling the distributed energy storage units: through a browser-based online user portal, or though network-based, system-to-system protocols by third-party operation controllers. | 1. A method for controlling a network of distributed energy storage devices comprising:
providing a plurality of distributed energy storage devices; providing each of said distributed energy storage devices with a computer, said computer constructed and arranged to provide local monitoring and control of said distributed energy storage device, said computer including an internet connected controller; providing a centralized server, said server including an internet connected controller; providing a master/slave Internet protocol network for connecting said computer and said server; providing a group control software, said group control software installed into each said computer and said server; utilizing said group control software to establish said server as master in said master/slave network over said plurality of distributed energy storage device computers, whereby said server provides commands to said computers; utilizing said group control software to define and control said plurality of energy storage devices in user-defined groups, such that the groups of distributed energy storage units have centralized user-controlled dispatch for both charge and discharge of real and reactive power; 2. The method for controlling a network of distributed energy storage devices of claim 1 including the step of utilizing said group control software to form a group including all of said plurality of distributed energy storage devices such that the networked group of distributed energy storage devices will behave substantially in unison as one large virtual bulk energy storage unit. 3. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software provides the ability to establish user permissions for each user-defined group. 4. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software is configured by a user through the server to perform group assignment of distributed energy storage devices to the user-defined groups. 5. The method for controlling a network of distributed energy storage devices of claim 3 wherein said group control software provides device-level configuration of schedules defining operation and function of devices and systems within said distributed energy storage device. 6. The method for controlling a network of distributed energy storage devices of claim 5 wherein said schedules are downloaded from said centralized server and stored on a local memory within said distributed energy storage device. 7. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software provides real-time control of each said distributed energy storage device through frequent, periodic messaging between said centralized server and said distributed energy storage devices. 8. The method for controlling a network of distributed energy storage devices of claim 5 wherein said server is part of a distributed energy storage device. 9. The method for controlling a network of distributed energy storage devices of claim 7 wherein said device level configuration regulates the sequence of termination of controlled events within said schedule, in the event of a user schedule change from said server. 10. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software requires each distributed energy storage device to power up as an independent device and master of its own group. 11. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software sends out a signal about every two seconds requesting other master groups to join together into a larger group, an algorithm determining which added independent group will be master. 12. The method for controlling a network of distributed energy storage devices of claim 11 wherein said algorithm utilizes a user assigned number to each said distributed energy storage device, whereby said user assigned number is utilized by said algorithm to determine which added independent group will be master. 13. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software includes a power level determination algorithm for controlling power distribution into and out of each said distributed energy storage device. 14. The method for controlling a network of distributed energy storage devices of claim 13 wherein said power level distribution algorithm within said server monitors the capabilities and state of charge of each said distributed energy storage device, whereby said server utilizes said capabilities and state of charge in combination with said algorithm to control the flow of power into and out of each said distributed energy storage device. 15. The method for controlling a network of distributed energy storage devices of claim 14 wherein said algorithm routes unutilized power to units with capacity. 16. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software depicts the distributed energy storage devices listed under each group as a device tree. 17. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software creates a graphical user interface in the form of monitors, charts, and dashboards to track metrics regarding location, energy available, AC meter information, renewable generation information, temperature, voltage, state of charge estimations, and real and reactive power information. 18. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software is operable from a mobile device. 19. The method for controlling a network of distributed energy storage devices of claim 18 wherein said mobile device is a smartphone. 20. The method for controlling a network of distributed energy storage devices of claim 1 wherein said master/slave network is provided with at least one redundant master unit. | The present invention provides a software and system to provide group control and network operations to/for a multiplicity of distributed energy storage units. In particular, the group control software and system connects multiple individual distributed energy storage units and operates those units in synchronicity to create a large virtual energy storage device. This group control system includes two methods of controlling the distributed energy storage units: through a browser-based online user portal, or though network-based, system-to-system protocols by third-party operation controllers.1. A method for controlling a network of distributed energy storage devices comprising:
providing a plurality of distributed energy storage devices; providing each of said distributed energy storage devices with a computer, said computer constructed and arranged to provide local monitoring and control of said distributed energy storage device, said computer including an internet connected controller; providing a centralized server, said server including an internet connected controller; providing a master/slave Internet protocol network for connecting said computer and said server; providing a group control software, said group control software installed into each said computer and said server; utilizing said group control software to establish said server as master in said master/slave network over said plurality of distributed energy storage device computers, whereby said server provides commands to said computers; utilizing said group control software to define and control said plurality of energy storage devices in user-defined groups, such that the groups of distributed energy storage units have centralized user-controlled dispatch for both charge and discharge of real and reactive power; 2. The method for controlling a network of distributed energy storage devices of claim 1 including the step of utilizing said group control software to form a group including all of said plurality of distributed energy storage devices such that the networked group of distributed energy storage devices will behave substantially in unison as one large virtual bulk energy storage unit. 3. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software provides the ability to establish user permissions for each user-defined group. 4. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software is configured by a user through the server to perform group assignment of distributed energy storage devices to the user-defined groups. 5. The method for controlling a network of distributed energy storage devices of claim 3 wherein said group control software provides device-level configuration of schedules defining operation and function of devices and systems within said distributed energy storage device. 6. The method for controlling a network of distributed energy storage devices of claim 5 wherein said schedules are downloaded from said centralized server and stored on a local memory within said distributed energy storage device. 7. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software provides real-time control of each said distributed energy storage device through frequent, periodic messaging between said centralized server and said distributed energy storage devices. 8. The method for controlling a network of distributed energy storage devices of claim 5 wherein said server is part of a distributed energy storage device. 9. The method for controlling a network of distributed energy storage devices of claim 7 wherein said device level configuration regulates the sequence of termination of controlled events within said schedule, in the event of a user schedule change from said server. 10. The method for controlling a network of distributed energy storage devices of claim 1 wherein said group control software requires each distributed energy storage device to power up as an independent device and master of its own group. 11. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software sends out a signal about every two seconds requesting other master groups to join together into a larger group, an algorithm determining which added independent group will be master. 12. The method for controlling a network of distributed energy storage devices of claim 11 wherein said algorithm utilizes a user assigned number to each said distributed energy storage device, whereby said user assigned number is utilized by said algorithm to determine which added independent group will be master. 13. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software includes a power level determination algorithm for controlling power distribution into and out of each said distributed energy storage device. 14. The method for controlling a network of distributed energy storage devices of claim 13 wherein said power level distribution algorithm within said server monitors the capabilities and state of charge of each said distributed energy storage device, whereby said server utilizes said capabilities and state of charge in combination with said algorithm to control the flow of power into and out of each said distributed energy storage device. 15. The method for controlling a network of distributed energy storage devices of claim 14 wherein said algorithm routes unutilized power to units with capacity. 16. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software depicts the distributed energy storage devices listed under each group as a device tree. 17. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software creates a graphical user interface in the form of monitors, charts, and dashboards to track metrics regarding location, energy available, AC meter information, renewable generation information, temperature, voltage, state of charge estimations, and real and reactive power information. 18. The method for controlling a network of distributed energy storage devices of claim 10 wherein said group control software is operable from a mobile device. 19. The method for controlling a network of distributed energy storage devices of claim 18 wherein said mobile device is a smartphone. 20. The method for controlling a network of distributed energy storage devices of claim 1 wherein said master/slave network is provided with at least one redundant master unit. | 2,100 |
4,652 | 14,560,083 | 2,122 | Aspects provide for event-driven behavior prediction and include mapping a first data input to a first event of a plurality of pre-defined events as a function of an effective date of the input and identification data that is unique to an individual and a role within an organization. In response to the mapping to the first event, aspects predict (as a function of the identification data, the role and the effective date) that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input. Said predicting triggers an automated process that prompts a user to enter the second data input | 1. A method for event-driven behavior prediction, the method comprising:
in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, mapping the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predicting, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, triggering an automated process in response to the predicting that the second event requires the additional, second data input; and the automated process prompting a user to enter the second data input. 2. The method of claim 1, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 3. The method of claim 2, further comprising:
mapping the first data input to the first event as a function of a relation of at least one of a salary level of the individual, a job title of the individual within the organization, and a length of time of the individual within the job title at the salary level, to corresponding data within the aggregated anonymized organizational data. 4. The method of claim 2, further comprising:
automatically revising a security setting of an application programming interface of the organization to enable a spouse of the individual to enter the second data input, as a function of recognizing that the aggregated anonymized organizational data indicates that it is likely that the spouse is able to provide a data input response that satisfies a satisfaction threshold of the automated process. 5. The method of claim 2, further comprising:
capturing an event pattern as a function of the identification data, the role and the effective date of the first data input, in view of the aggregated anonymized organizational data; and the automated process approving entry of the second data item by the user in response to determining that an entry of the second data item does not comprise an exception to the captured event pattern. 6. The method of claim 2, further comprising:
determining whether an entry of response data that is received in response to prompting the user to enter the second data input satisfies a satisfaction threshold specified by the automated process for the response data; in response to determining that the response data satisfies the satisfaction threshold, closing the linked second event; and in response to determining that the response data does not satisfy the satisfaction threshold, iteratively repeating the steps of predicting as a function of the identification data, the role and the effective date, that the second event requires an additional, second data input, triggering the automated process in response to the predicting that the second event requires the additional second data input and prompting the user to enter the second data input, until a response data input is received that satisfies the satisfaction threshold. 7. The method of claim 2, wherein the steps of mapping the first data input to the first event, and predicting that the second event requires the additional, second data input, are further a function of geographic indicia of at least one of the individual and the role of the individual within the organization. 8. The method of claim 2, further comprising:
integrating computer-readable program code into a computer system comprising a processor, a computer readable memory in circuit communication with the processor, and a computer readable storage medium in circuit communication with the processor; and wherein the processor executes program code instructions stored on the computer-readable storage medium via the computer readable memory and thereby performs the steps of mapping the first data input to the first event, predicting that the second event requires the additional second data input, triggering the automated process and prompting the user via the automated process to enter the second data input. 9. The method of claim 2, wherein the first data input further comprises temporal data that includes a date of another data input of another, different second data item that is linked to the effective date as a function of the mapping of the first event to the data input. 10. The method of claim 9, further comprising:
closing the second event in response to determining that the temporal data exceeds an expiration threshold of the second event. 11. A system, comprising:
a processor; a computer readable memory in circuit communication with the processor; and a computer readable storage medium in circuit communication with the processor; wherein the processor executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby: in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, maps the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predicts, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, triggers an automated process in response to the predicting that the second event requires the additional, second data input; and prompts a user via the automated process to enter the second data input. 12. The system of claim 11, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 13. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
maps the first data input to the first event as a function of a relation of at least one of a salary level of the individual, a job title of the individual within the organization, and a length of time of the individual within the job title at the salary level, to corresponding data within the aggregated anonymized organizational data. 14. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
automatically revises a security setting of an application programming interface of the organization to enable a spouse of the individual to enter the second data input, as a function of recognizing that the aggregated anonymized organizational data indicates that it is likely that the spouse is able to provide a data input response that satisfies a satisfaction threshold of the automated process. 15. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
captures an event pattern as a function of the identification data, the role and the effective date of the first data input, in view of the aggregated anonymized organizational data; and approves via the automated process entry of the second data item by the user in response to determining that an entry of the second data item does not comprise an exception to the captured event pattern. 16. A computer program product for event-driven behavior prediction, the computer program product comprising:
a computer readable hardware storage device having computer readable program code embodied therewith, wherein the computer readable hardware storage device is not a transitory signal per se, the computer readable program code comprising instructions for execution by a processor that cause the processor to: in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, map the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predict, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, trigger an automated process in response to the predicting that the second event requires the additional, second data input; and prompt a user via the automated process to enter the second data input. 17. The computer program product of claim 16, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 18. The computer program product of claim 17, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
determine whether an entry of response data that is received in response to prompting the user to enter the second data input satisfies a satisfaction threshold specified by the automated process for the response data; in response to determining that the response data satisfies the satisfaction threshold, close the linked second event; and in response to determining that the response data does not satisfy the satisfaction threshold, iteratively repeating steps of predicting as the function of the identification data, the role and the effective date, that the second event requires an additional, second data input, triggering the automated process, in response to predicting that the second event requires the additional second data input and prompting the user via the automated process to enter the second data input, until a response data input is received that satisfies the satisfaction threshold. 19. The computer program product of claim 17, wherein the computer readable program code instructions for execution by the processor further cause the processor to map the first data input to the first event and predict that the second event requires the additional, second data input as a function of geographic indicia of at least one of the individual and the role of the individual within the organization. 20. The computer program product of claim 17, wherein the first data input further comprises temporal data that includes a date of another data input of another, different second data item that is linked to the effective date as a function of the mapping of the first event to the data input; and
wherein the computer readable program code instructions for execution by the processor further cause the processor to close the second event in response to determining that the temporal data exceeds an expiration threshold of the second event. | Aspects provide for event-driven behavior prediction and include mapping a first data input to a first event of a plurality of pre-defined events as a function of an effective date of the input and identification data that is unique to an individual and a role within an organization. In response to the mapping to the first event, aspects predict (as a function of the identification data, the role and the effective date) that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input. Said predicting triggers an automated process that prompts a user to enter the second data input1. A method for event-driven behavior prediction, the method comprising:
in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, mapping the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predicting, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, triggering an automated process in response to the predicting that the second event requires the additional, second data input; and the automated process prompting a user to enter the second data input. 2. The method of claim 1, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 3. The method of claim 2, further comprising:
mapping the first data input to the first event as a function of a relation of at least one of a salary level of the individual, a job title of the individual within the organization, and a length of time of the individual within the job title at the salary level, to corresponding data within the aggregated anonymized organizational data. 4. The method of claim 2, further comprising:
automatically revising a security setting of an application programming interface of the organization to enable a spouse of the individual to enter the second data input, as a function of recognizing that the aggregated anonymized organizational data indicates that it is likely that the spouse is able to provide a data input response that satisfies a satisfaction threshold of the automated process. 5. The method of claim 2, further comprising:
capturing an event pattern as a function of the identification data, the role and the effective date of the first data input, in view of the aggregated anonymized organizational data; and the automated process approving entry of the second data item by the user in response to determining that an entry of the second data item does not comprise an exception to the captured event pattern. 6. The method of claim 2, further comprising:
determining whether an entry of response data that is received in response to prompting the user to enter the second data input satisfies a satisfaction threshold specified by the automated process for the response data; in response to determining that the response data satisfies the satisfaction threshold, closing the linked second event; and in response to determining that the response data does not satisfy the satisfaction threshold, iteratively repeating the steps of predicting as a function of the identification data, the role and the effective date, that the second event requires an additional, second data input, triggering the automated process in response to the predicting that the second event requires the additional second data input and prompting the user to enter the second data input, until a response data input is received that satisfies the satisfaction threshold. 7. The method of claim 2, wherein the steps of mapping the first data input to the first event, and predicting that the second event requires the additional, second data input, are further a function of geographic indicia of at least one of the individual and the role of the individual within the organization. 8. The method of claim 2, further comprising:
integrating computer-readable program code into a computer system comprising a processor, a computer readable memory in circuit communication with the processor, and a computer readable storage medium in circuit communication with the processor; and wherein the processor executes program code instructions stored on the computer-readable storage medium via the computer readable memory and thereby performs the steps of mapping the first data input to the first event, predicting that the second event requires the additional second data input, triggering the automated process and prompting the user via the automated process to enter the second data input. 9. The method of claim 2, wherein the first data input further comprises temporal data that includes a date of another data input of another, different second data item that is linked to the effective date as a function of the mapping of the first event to the data input. 10. The method of claim 9, further comprising:
closing the second event in response to determining that the temporal data exceeds an expiration threshold of the second event. 11. A system, comprising:
a processor; a computer readable memory in circuit communication with the processor; and a computer readable storage medium in circuit communication with the processor; wherein the processor executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby: in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, maps the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predicts, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, triggers an automated process in response to the predicting that the second event requires the additional, second data input; and prompts a user via the automated process to enter the second data input. 12. The system of claim 11, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 13. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
maps the first data input to the first event as a function of a relation of at least one of a salary level of the individual, a job title of the individual within the organization, and a length of time of the individual within the job title at the salary level, to corresponding data within the aggregated anonymized organizational data. 14. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
automatically revises a security setting of an application programming interface of the organization to enable a spouse of the individual to enter the second data input, as a function of recognizing that the aggregated anonymized organizational data indicates that it is likely that the spouse is able to provide a data input response that satisfies a satisfaction threshold of the automated process. 15. The system of claim 12, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
captures an event pattern as a function of the identification data, the role and the effective date of the first data input, in view of the aggregated anonymized organizational data; and approves via the automated process entry of the second data item by the user in response to determining that an entry of the second data item does not comprise an exception to the captured event pattern. 16. A computer program product for event-driven behavior prediction, the computer program product comprising:
a computer readable hardware storage device having computer readable program code embodied therewith, wherein the computer readable hardware storage device is not a transitory signal per se, the computer readable program code comprising instructions for execution by a processor that cause the processor to: in response a first data input that comprises an effective date of the input and identification data that is unique to an individual and a role within an organization, map the first data input to a first event of a plurality of pre-defined events as a function of the identification data, the role and the effective date; in response to the mapping to the first event, predict, as a function of the identification data, the role and the effective date, that a second event of the pre-defined events that is linked to the first event requires an additional, second data input for the individual that is different from the first data input, trigger an automated process in response to the predicting that the second event requires the additional, second data input; and prompt a user via the automated process to enter the second data input. 17. The computer program product of claim 16, wherein the second event of the pre-defined events is linked to the first event as a function of aggregated anonymized organizational data of a plurality of other individuals that are employed within other organizations that are analogous to the organization, wherein confidential data and identification data that identify the other individuals are removed from the aggregated anonymized data. 18. The computer program product of claim 17, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
determine whether an entry of response data that is received in response to prompting the user to enter the second data input satisfies a satisfaction threshold specified by the automated process for the response data; in response to determining that the response data satisfies the satisfaction threshold, close the linked second event; and in response to determining that the response data does not satisfy the satisfaction threshold, iteratively repeating steps of predicting as the function of the identification data, the role and the effective date, that the second event requires an additional, second data input, triggering the automated process, in response to predicting that the second event requires the additional second data input and prompting the user via the automated process to enter the second data input, until a response data input is received that satisfies the satisfaction threshold. 19. The computer program product of claim 17, wherein the computer readable program code instructions for execution by the processor further cause the processor to map the first data input to the first event and predict that the second event requires the additional, second data input as a function of geographic indicia of at least one of the individual and the role of the individual within the organization. 20. The computer program product of claim 17, wherein the first data input further comprises temporal data that includes a date of another data input of another, different second data item that is linked to the effective date as a function of the mapping of the first event to the data input; and
wherein the computer readable program code instructions for execution by the processor further cause the processor to close the second event in response to determining that the temporal data exceeds an expiration threshold of the second event. | 2,100 |
4,653 | 14,619,486 | 2,114 | A storage device with a memory may have an alternative safe mode boot loading process. Upon detecting a malfunction, the storage device may activate a safe mode in which a safe mode boot loader is stored in memory of the storage device that is not logically mapped. The safe mode allows for recovery and debugging by the host that may not otherwise be possible without the safe mode process. | 1. A method for alternative booting of a memory device, the method comprising:
detecting a malfunction on the device; accessing safe mode boot loader code from an area of memory on the memory device that is not logically addressed; and allowing for booting in safe mode by using the safe mode boot loader code. 2. The method of claim 1 wherein the alternative booting comprises a safe mode that is booted with the safe mode boot loader code, and further wherein a regular boot loader is stored in logically mapped memory for a regular booting process that is different from the alternative booting in the safe mode. 3. The method of claim 2 further comprising:
correcting the malfunction while in the safe mode; and
initiating the regular booting process after the malfunction is corrected. 4. The method of claim 1 wherein the accessing the safe mode boot loader code further comprises:
receiving an indication of entry into a safe mode upon the detection of the malfunction;
receiving a physical location of the safe mode boot loader code from the firmware on the read only memory (ROM); and
retrieving the safe mode boot loader code from the received physical location. 5. The method of claim 1 wherein the detecting a malfunction comprises:
counting a number of failed initializations; and
identifying the malfunction when the number exceeds a threshold. 6. The method of claim 1 wherein an operating system for a host is stored in the memory on the memory device. 7. The method of claim 6 wherein the booting in safe mode comprises:
transferring the safe mode boot loader code to random access memory (RAM); and
providing the safe mode boot loader code to a host. 8. The method of claim 6 wherein the detecting comprises identification by the memory device rather than a host. 9. The method of claim 1 wherein the memory comprises non-volatile memory, further wherein the non-volatile memory comprises flash memory. 10. The method of claim 9 wherein the flash memory comprises a three-dimensional (3D) memory configuration, and wherein a controller is associated with operation of and storing to the flash memory. 11. A storage device comprising:
a read access memory (RAM); a non-volatile memory with logically mapped storage that stores a regular boot loader and with un-mapped storage that stores a safe mode boot loader; a controller that accesses the RAM and non-volatile memory and is configured to trigger safe mode operation upon detection that regular booting is inoperable, wherein the safe mode operation comprises loading the safe mode boot loader into RAM. 12. The storage device of claim 11 further comprises:
a read only memory (ROM) with firmware that provides a location to the safe mode boot loader. 13. The storage device of claim 12 wherein the triggering of the safe mode operation further includes retrieving the location of the safe mode boot loader from the firmware. 14. The storage device of claim 13 wherein the controller provides the safe mode boot loader to a host for booting with the safe mode operation. 15. The storage device of claim 13 further comprising:
a malfunction detection module that detects a malfunction, wherein the regular booting is inoperable when the malfunction is detected, further wherein detection of the malfunction triggers the safe mode operation; and
a safe mode boot loader module that boots in the safe mode when the malfunction detection module detects the malfunction. 16. The storage device of claim 11 wherein the regular booting is inoperable when a host device coupled with the storage device fails to initialize properly. 17. A memory system for booting in a safe mode, the system comprising:
a non-volatile memory that stores regular boot loader code and a safe mode boot loader code, wherein the safe mode is established from booting with the safe mode boot loader code; a malfunction detection module that detects a malfunction with a regular booting process through the regular boot loader code; and a safe mode boot loader module that triggers, upon detection of the malfunction, the safe mode with the safe mode boot loader code. 18. The system of claim 17 further comprising:
a controller that manages the non-volatile memory, wherein the controller includes both the malfunction detection module and the safe mode boot loader. 19. The system of claim 17 wherein the safe mode boot loader code is stored in an area of the non-volatile memory that is not logically addressed. 20. The system of claim 19 wherein the safe mode boot loader code is accessed through firmware in the read only memory that provides a location for the safe mode boot loader code only when in the safe mode. | A storage device with a memory may have an alternative safe mode boot loading process. Upon detecting a malfunction, the storage device may activate a safe mode in which a safe mode boot loader is stored in memory of the storage device that is not logically mapped. The safe mode allows for recovery and debugging by the host that may not otherwise be possible without the safe mode process.1. A method for alternative booting of a memory device, the method comprising:
detecting a malfunction on the device; accessing safe mode boot loader code from an area of memory on the memory device that is not logically addressed; and allowing for booting in safe mode by using the safe mode boot loader code. 2. The method of claim 1 wherein the alternative booting comprises a safe mode that is booted with the safe mode boot loader code, and further wherein a regular boot loader is stored in logically mapped memory for a regular booting process that is different from the alternative booting in the safe mode. 3. The method of claim 2 further comprising:
correcting the malfunction while in the safe mode; and
initiating the regular booting process after the malfunction is corrected. 4. The method of claim 1 wherein the accessing the safe mode boot loader code further comprises:
receiving an indication of entry into a safe mode upon the detection of the malfunction;
receiving a physical location of the safe mode boot loader code from the firmware on the read only memory (ROM); and
retrieving the safe mode boot loader code from the received physical location. 5. The method of claim 1 wherein the detecting a malfunction comprises:
counting a number of failed initializations; and
identifying the malfunction when the number exceeds a threshold. 6. The method of claim 1 wherein an operating system for a host is stored in the memory on the memory device. 7. The method of claim 6 wherein the booting in safe mode comprises:
transferring the safe mode boot loader code to random access memory (RAM); and
providing the safe mode boot loader code to a host. 8. The method of claim 6 wherein the detecting comprises identification by the memory device rather than a host. 9. The method of claim 1 wherein the memory comprises non-volatile memory, further wherein the non-volatile memory comprises flash memory. 10. The method of claim 9 wherein the flash memory comprises a three-dimensional (3D) memory configuration, and wherein a controller is associated with operation of and storing to the flash memory. 11. A storage device comprising:
a read access memory (RAM); a non-volatile memory with logically mapped storage that stores a regular boot loader and with un-mapped storage that stores a safe mode boot loader; a controller that accesses the RAM and non-volatile memory and is configured to trigger safe mode operation upon detection that regular booting is inoperable, wherein the safe mode operation comprises loading the safe mode boot loader into RAM. 12. The storage device of claim 11 further comprises:
a read only memory (ROM) with firmware that provides a location to the safe mode boot loader. 13. The storage device of claim 12 wherein the triggering of the safe mode operation further includes retrieving the location of the safe mode boot loader from the firmware. 14. The storage device of claim 13 wherein the controller provides the safe mode boot loader to a host for booting with the safe mode operation. 15. The storage device of claim 13 further comprising:
a malfunction detection module that detects a malfunction, wherein the regular booting is inoperable when the malfunction is detected, further wherein detection of the malfunction triggers the safe mode operation; and
a safe mode boot loader module that boots in the safe mode when the malfunction detection module detects the malfunction. 16. The storage device of claim 11 wherein the regular booting is inoperable when a host device coupled with the storage device fails to initialize properly. 17. A memory system for booting in a safe mode, the system comprising:
a non-volatile memory that stores regular boot loader code and a safe mode boot loader code, wherein the safe mode is established from booting with the safe mode boot loader code; a malfunction detection module that detects a malfunction with a regular booting process through the regular boot loader code; and a safe mode boot loader module that triggers, upon detection of the malfunction, the safe mode with the safe mode boot loader code. 18. The system of claim 17 further comprising:
a controller that manages the non-volatile memory, wherein the controller includes both the malfunction detection module and the safe mode boot loader. 19. The system of claim 17 wherein the safe mode boot loader code is stored in an area of the non-volatile memory that is not logically addressed. 20. The system of claim 19 wherein the safe mode boot loader code is accessed through firmware in the read only memory that provides a location for the safe mode boot loader code only when in the safe mode. | 2,100 |
4,654 | 14,480,670 | 2,174 | A vehicle computer system comprising a wireless transceiver configured to send a nomadic device human machine interface to a nomadic device in a web browser format. The vehicle computer system further comprises a vehicle server utilizing a contextual data aggregator that utilizes vehicle data and off-board data to generate a dynamic human machine interface, the server further configured to generate an in-vehicle human machine interface for output on a vehicle display and generate the nomadic device human machine interface for the nomadic device to display. | 1-20. (canceled) 21. A vehicle computer system comprising:
a wireless transceiver configured to establish a connection with a nomadic device, wherein the wireless transceiver is further configured to send a nomadic device human machine interface (HMI) utilizing a web browser format; a vehicle display configured to output an in-vehicle HMI for controlling various vehicle functions, wherein the in-vehicle HMI utilizing the web browser format; and a vehicle server configured to generate the in-vehicle HMI for the vehicle display and generate the nomadic device HMI for the nomadic device. 22. The vehicle computer system of claim 21, wherein the wireless transceiver is further configured to communicate with an off-board server, wherein the off-board server is configured to utilize or provide the vehicle with off-board data for generating the nomadic device HMI or the in-vehicle HMI. 23. The vehicle computer system of claim 22, wherein the wireless transceiver is further configured to communicate with the off-board server via a mobile device. 24. The vehicle computer system of claim 23, wherein the mobile device is the nomadic device. 25. The vehicle computer system of claim 22, wherein the wireless transceiver is further configured to communicate with the off-board server via an embedded cellular connection. 26. The vehicle computer system of claim 21, wherein the in-vehicle HMI includes a different configuration than the nomadic device HMI. 27. The vehicle computer system of claim 21, wherein the web browser format includes HTML5. 28. The vehicle computer system of claim 21, wherein the in-vehicle HMI is based on a driver of the vehicle. 29. The vehicle computer system of claim 21, wherein the web browser format is configured to be chrome-less. 30. An nomadic device comprising:
a wireless transceiver communicating with a vehicle; and a processor configured to: receive data indicative of a human machine interface (HMI) via the wireless transceiver; and output on a display of the nomadic device a contextual HMI in a web browser format, wherein the contextual HMI is configured to control vehicle functions. 31. The nomadic device of claim 30, wherein the wireless transceiver is further capable of communicating with a server to receive off-board data and send the off-board data to the vehicle. 32. The nomadic device of claim 30, wherein the nomadic device further comprises a vehicle HMI application to facilitate the output of the contextual HMI utilizing the vehicle data. 33. The nomadic device of claim 32, wherein vehicle HMI application is configured to generate a web page to display the contextual HMI. 34. The nomadic device of claim 32, wherein the processor is further configured to receive the contextual HMI from a vehicle server. 35. The nomadic device of claim 32, wherein the off-board data includes media data received from a media server. 36. The nomadic device of claim 32, wherein the wireless transceiver is further configured to communicate with a query based system that utilizes spoken dialogue. 37. The nomadic device of claim 30, wherein the contextual HMI utilizes vehicle data and off-board data. 38. A vehicle computer system comprising:
a vehicle server configured to generate an in-vehicle human machine interface (HMI) for output on a vehicle display and generate a nomadic device (ND) HMI in a web browser format for a ND to display; and a wireless transceiver configured to send the ND HMI to a ND in a web browser format. 39. The vehicle computer system of claim 38, wherein the vehicle server includes a data manager in communication with vehicle modules to retrieve controller area network data from a vehicle bus. 40. The vehicle computer system of claim 38, wherein the vehicle server is further configured to generate the in-vehicle HMI in a web browser format. | A vehicle computer system comprising a wireless transceiver configured to send a nomadic device human machine interface to a nomadic device in a web browser format. The vehicle computer system further comprises a vehicle server utilizing a contextual data aggregator that utilizes vehicle data and off-board data to generate a dynamic human machine interface, the server further configured to generate an in-vehicle human machine interface for output on a vehicle display and generate the nomadic device human machine interface for the nomadic device to display.1-20. (canceled) 21. A vehicle computer system comprising:
a wireless transceiver configured to establish a connection with a nomadic device, wherein the wireless transceiver is further configured to send a nomadic device human machine interface (HMI) utilizing a web browser format; a vehicle display configured to output an in-vehicle HMI for controlling various vehicle functions, wherein the in-vehicle HMI utilizing the web browser format; and a vehicle server configured to generate the in-vehicle HMI for the vehicle display and generate the nomadic device HMI for the nomadic device. 22. The vehicle computer system of claim 21, wherein the wireless transceiver is further configured to communicate with an off-board server, wherein the off-board server is configured to utilize or provide the vehicle with off-board data for generating the nomadic device HMI or the in-vehicle HMI. 23. The vehicle computer system of claim 22, wherein the wireless transceiver is further configured to communicate with the off-board server via a mobile device. 24. The vehicle computer system of claim 23, wherein the mobile device is the nomadic device. 25. The vehicle computer system of claim 22, wherein the wireless transceiver is further configured to communicate with the off-board server via an embedded cellular connection. 26. The vehicle computer system of claim 21, wherein the in-vehicle HMI includes a different configuration than the nomadic device HMI. 27. The vehicle computer system of claim 21, wherein the web browser format includes HTML5. 28. The vehicle computer system of claim 21, wherein the in-vehicle HMI is based on a driver of the vehicle. 29. The vehicle computer system of claim 21, wherein the web browser format is configured to be chrome-less. 30. An nomadic device comprising:
a wireless transceiver communicating with a vehicle; and a processor configured to: receive data indicative of a human machine interface (HMI) via the wireless transceiver; and output on a display of the nomadic device a contextual HMI in a web browser format, wherein the contextual HMI is configured to control vehicle functions. 31. The nomadic device of claim 30, wherein the wireless transceiver is further capable of communicating with a server to receive off-board data and send the off-board data to the vehicle. 32. The nomadic device of claim 30, wherein the nomadic device further comprises a vehicle HMI application to facilitate the output of the contextual HMI utilizing the vehicle data. 33. The nomadic device of claim 32, wherein vehicle HMI application is configured to generate a web page to display the contextual HMI. 34. The nomadic device of claim 32, wherein the processor is further configured to receive the contextual HMI from a vehicle server. 35. The nomadic device of claim 32, wherein the off-board data includes media data received from a media server. 36. The nomadic device of claim 32, wherein the wireless transceiver is further configured to communicate with a query based system that utilizes spoken dialogue. 37. The nomadic device of claim 30, wherein the contextual HMI utilizes vehicle data and off-board data. 38. A vehicle computer system comprising:
a vehicle server configured to generate an in-vehicle human machine interface (HMI) for output on a vehicle display and generate a nomadic device (ND) HMI in a web browser format for a ND to display; and a wireless transceiver configured to send the ND HMI to a ND in a web browser format. 39. The vehicle computer system of claim 38, wherein the vehicle server includes a data manager in communication with vehicle modules to retrieve controller area network data from a vehicle bus. 40. The vehicle computer system of claim 38, wherein the vehicle server is further configured to generate the in-vehicle HMI in a web browser format. | 2,100 |
4,655 | 13,573,356 | 2,142 | A graphically depicted meter to show the status of a parent-child relationship. | 1. A method for graphically displaying the status of a child in a parent-child relationship comprising the steps of:
accessing a computer and a display device, using said computer to graphically depict a parent and a child in a parent-child relationship on said display device, using said computer to graphically depict on said display device, on said child, a meter which illustrates both
(a) the full potential of a parent-child relationship, and
(b) progress of said child toward or beyond said full potential of said parent-child relationship,
and causing said parent, said child and said meter to be visible to a human user. 2. A method as recited in claim 1 wherein each of said parent and said child are depicted as a bubble. 3. A method as recited in claim 1 wherein said parent and said child are depicted connected to each other. 4. A method as recited in claim 1 wherein said meter depicts a percentage completion that said child has reached toward said parent full potential. 5. A method as recited in claim 1 wherein said meter depicts a proportion of completion that said child has reached toward said parent full potential. 6. A method as recited in claim 1 wherein said parent is a budget, and wherein said child is a sub-budget. 7. A method as recited in claim 1 wherein said meter is a circular ring. 8. A method as recited in claim 1 wherein said meter depicts:
(a) portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential; and
(b) portion of a child that is within the full potential of the parent-child relationship; and
(c) portion of a child that exceeds the full potential of the parent-child relationship. 9. A method as recited in claim 1 wherein said meter depicts funds spent. 10. A meter for graphically representing status of a child in a parent-child relationship, comprising:
a graphically represented parent, the parent's totality being considered the full potential of the parent-child relationship, within said graphically represented parent, a metered depiction of a child of said parent, said metered depiction including visible demarcation between totality of the potential of the parent-child relationship and progress that said child has made within the parent-child relationship. 11. A meter as recited in claim 10 wherein said meter depicts:
(a) portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential; and
(b) portion of a child that is within the full potential of the parent-child relationship; and
(c) portion of a child that exceeds the full potential of the parent-child relationship. 12. A meter as recited in claim 10 wherein said meter depicts portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential. 13. A meter as recited in claim 10 wherein said meter depicts portion of a child that is within the full potential of the parent-child relationship. 14. A meter as recited in claim 10 wherein said meter depicts portion of a child that exceeds the full potential of the parent-child relationship. 15. A meter as recited in claim 10 wherein parent and child are graphically depicted as being adjacent each other. 16. A meter as recited in claim 10 where parent and child are graphically depicted as touching each other. 17. A meter as recited in claim 10 wherein said meter is circular. 18. A meter as recited in claim 10 wherein said meter depicts a percentage. 19. A meter as depicted in claim 19 wherein said meter includes shading depicting said percentage. 20. A meter as recited in claim 10 wherein said parent and said child are depicted as bubbles. | A graphically depicted meter to show the status of a parent-child relationship.1. A method for graphically displaying the status of a child in a parent-child relationship comprising the steps of:
accessing a computer and a display device, using said computer to graphically depict a parent and a child in a parent-child relationship on said display device, using said computer to graphically depict on said display device, on said child, a meter which illustrates both
(a) the full potential of a parent-child relationship, and
(b) progress of said child toward or beyond said full potential of said parent-child relationship,
and causing said parent, said child and said meter to be visible to a human user. 2. A method as recited in claim 1 wherein each of said parent and said child are depicted as a bubble. 3. A method as recited in claim 1 wherein said parent and said child are depicted connected to each other. 4. A method as recited in claim 1 wherein said meter depicts a percentage completion that said child has reached toward said parent full potential. 5. A method as recited in claim 1 wherein said meter depicts a proportion of completion that said child has reached toward said parent full potential. 6. A method as recited in claim 1 wherein said parent is a budget, and wherein said child is a sub-budget. 7. A method as recited in claim 1 wherein said meter is a circular ring. 8. A method as recited in claim 1 wherein said meter depicts:
(a) portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential; and
(b) portion of a child that is within the full potential of the parent-child relationship; and
(c) portion of a child that exceeds the full potential of the parent-child relationship. 9. A method as recited in claim 1 wherein said meter depicts funds spent. 10. A meter for graphically representing status of a child in a parent-child relationship, comprising:
a graphically represented parent, the parent's totality being considered the full potential of the parent-child relationship, within said graphically represented parent, a metered depiction of a child of said parent, said metered depiction including visible demarcation between totality of the potential of the parent-child relationship and progress that said child has made within the parent-child relationship. 11. A meter as recited in claim 10 wherein said meter depicts:
(a) portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential; and
(b) portion of a child that is within the full potential of the parent-child relationship; and
(c) portion of a child that exceeds the full potential of the parent-child relationship. 12. A meter as recited in claim 10 wherein said meter depicts portion of a child within the full potential of the parent-child relationship but that is close to exceeding that full potential. 13. A meter as recited in claim 10 wherein said meter depicts portion of a child that is within the full potential of the parent-child relationship. 14. A meter as recited in claim 10 wherein said meter depicts portion of a child that exceeds the full potential of the parent-child relationship. 15. A meter as recited in claim 10 wherein parent and child are graphically depicted as being adjacent each other. 16. A meter as recited in claim 10 where parent and child are graphically depicted as touching each other. 17. A meter as recited in claim 10 wherein said meter is circular. 18. A meter as recited in claim 10 wherein said meter depicts a percentage. 19. A meter as depicted in claim 19 wherein said meter includes shading depicting said percentage. 20. A meter as recited in claim 10 wherein said parent and said child are depicted as bubbles. | 2,100 |
4,656 | 14,066,421 | 2,165 | A method and system for generating a master clinical database from disparate sources, including public databases, private databases, and data from users, correlating the received data, determining a degree of confidence in and requesting and seeking confirmation of any data matched from the correlated data. The invention may identify key time points and users from whom to seek and receive confirmation of correlated data. The invention may be utilized to create a cross-trial, cross-sponsor, clinical master database that maintains appropriate user, subject and data confidentiality and privacy and which may be utilized to facilitate study design collaboration. | 1. A method for generating a clinical record in a clinical trial database for a clinical entity, comprising:
executing a matching algorithm to identify clinical data corresponding to the clinical entity, said clinical data being received from at least a first and a second database; receiving additional information concerning the clinical entity; requesting a user associated with the clinical entity to confirm the clinical data from the first database and the second database; and if such confirmation is received, adding to the clinical record clinical trial information about the clinical entity and training the matching algorithm based on the confirmation. 2. The method of claim 1, wherein the clinical trial information includes data related to performing clinical trials. 3. The method of claim 2, wherein said first database is a public database and wherein said second database is a private database, and wherein said public database and said private database are disparate. 4. The method of claim 1, wherein the additional information includes data related to the clinical entity's credentials. 5. The method of claim 1, wherein the additional information includes data related to the clinical entity's training. 6. The method of claim 1, wherein the additional information includes data related to the clinical entity's certification. 7. A method for generating a master clinical record in a master clinical database, comprising:
receiving at the master clinical database, utilizing a processor, data from at least a first database that comprises at least a record; executing a matching algorithm to identify the received data corresponding to data received from a second database that comprises at least a record; calculating a match for the corresponding data, wherein said calculation determines a degree of confidence; determining whether the degree of confidence is greater than or equal to a threshold confidence level; if the degree of confidence is less than the threshold confidence level, requesting, at a time point, from a user confirmation of the corresponding data; receiving said confirmation from the user at the time point; updating the received data from the first and second databases with said confirmation; repeating said steps of calculating, determining, and requesting, receiving, and correlating said confirmation until the degree of confidence is greater than or equal to the threshold confidence level; and if said degree of confidence is greater than or equal to the threshold confidence level, updating the master clinical database by confirming said updated data comprises a master clinical record. 8. The method of claim 7, wherein said requesting confirmation further comprises:
retrieving a workflow, said workflow consisting of users, tasks, and time points, wherein said tasks are executable at said time points; and identifying, based on the retrieved workflow, one or more users and time points, wherein said identified users can be requested at one or more of said time points. 9. The method of claim 7, wherein said threshold confidence level is predetermined and/or adjustable by a user. 10. The method of claim 8, wherein said time points are further associated with one or more incentives, and wherein said requesting confirmation is accompanied by said incentives. 11. The method of claim 10, wherein said identifying is further based on users having associated incentives. 12. The method of claim 8, wherein said first database is a public database and wherein said second database is a private database. 13. The method of claim 12, wherein said master clinical record is accessed while maintaining confidentiality requirements. 14. The method of claim 12, wherein said master clinical record is augmented by user curation. 15. A computer-enabled database system comprising clinical records, each clinical record comprising:
clinical data corresponding to a clinical entity, said clinical data received from:
at least one public database;
at least one private database; and
the clinical entity itself; and
clinical trial information about the entity, wherein, at a time point, a user associated with the clinical entity confirms information from the public and private databases. 16. The system of claim 15, further comprising clinical records received from multiple clinical trials across multiple sponsors. 17. The system of claim 15, wherein the system maintains confidentiality by limiting user access. 18. A computer readable storage medium, comprising computer executable instructions embodied therein, to be executed by a computer, for:
executing a matching algorithm to identify clinical data corresponding to a clinical entity, said clinical data being received from at least one public database and at least one private database; identifying, based on a retrieved workflow, at least one user associated with the clinical entity, wherein the workflow consists of users, tasks, and time points, wherein the tasks are executable at said time points; receiving additional information from said at least one user concerning the clinical entity; requesting, at one or more of the time points, said at least one user to confirm the corresponding clinical data; and adding to a clinical record clinical trial information about the clinical entity. 19. (canceled) 20. The computer readable storage medium of claim 18, further comprising computer executable instructions whereby said time points are further associated with one or more incentives, and wherein said identifying is accompanied by said incentives. 21. The method of claim 7, wherein the matching algorithm is trained based on said received confirmation. | A method and system for generating a master clinical database from disparate sources, including public databases, private databases, and data from users, correlating the received data, determining a degree of confidence in and requesting and seeking confirmation of any data matched from the correlated data. The invention may identify key time points and users from whom to seek and receive confirmation of correlated data. The invention may be utilized to create a cross-trial, cross-sponsor, clinical master database that maintains appropriate user, subject and data confidentiality and privacy and which may be utilized to facilitate study design collaboration.1. A method for generating a clinical record in a clinical trial database for a clinical entity, comprising:
executing a matching algorithm to identify clinical data corresponding to the clinical entity, said clinical data being received from at least a first and a second database; receiving additional information concerning the clinical entity; requesting a user associated with the clinical entity to confirm the clinical data from the first database and the second database; and if such confirmation is received, adding to the clinical record clinical trial information about the clinical entity and training the matching algorithm based on the confirmation. 2. The method of claim 1, wherein the clinical trial information includes data related to performing clinical trials. 3. The method of claim 2, wherein said first database is a public database and wherein said second database is a private database, and wherein said public database and said private database are disparate. 4. The method of claim 1, wherein the additional information includes data related to the clinical entity's credentials. 5. The method of claim 1, wherein the additional information includes data related to the clinical entity's training. 6. The method of claim 1, wherein the additional information includes data related to the clinical entity's certification. 7. A method for generating a master clinical record in a master clinical database, comprising:
receiving at the master clinical database, utilizing a processor, data from at least a first database that comprises at least a record; executing a matching algorithm to identify the received data corresponding to data received from a second database that comprises at least a record; calculating a match for the corresponding data, wherein said calculation determines a degree of confidence; determining whether the degree of confidence is greater than or equal to a threshold confidence level; if the degree of confidence is less than the threshold confidence level, requesting, at a time point, from a user confirmation of the corresponding data; receiving said confirmation from the user at the time point; updating the received data from the first and second databases with said confirmation; repeating said steps of calculating, determining, and requesting, receiving, and correlating said confirmation until the degree of confidence is greater than or equal to the threshold confidence level; and if said degree of confidence is greater than or equal to the threshold confidence level, updating the master clinical database by confirming said updated data comprises a master clinical record. 8. The method of claim 7, wherein said requesting confirmation further comprises:
retrieving a workflow, said workflow consisting of users, tasks, and time points, wherein said tasks are executable at said time points; and identifying, based on the retrieved workflow, one or more users and time points, wherein said identified users can be requested at one or more of said time points. 9. The method of claim 7, wherein said threshold confidence level is predetermined and/or adjustable by a user. 10. The method of claim 8, wherein said time points are further associated with one or more incentives, and wherein said requesting confirmation is accompanied by said incentives. 11. The method of claim 10, wherein said identifying is further based on users having associated incentives. 12. The method of claim 8, wherein said first database is a public database and wherein said second database is a private database. 13. The method of claim 12, wherein said master clinical record is accessed while maintaining confidentiality requirements. 14. The method of claim 12, wherein said master clinical record is augmented by user curation. 15. A computer-enabled database system comprising clinical records, each clinical record comprising:
clinical data corresponding to a clinical entity, said clinical data received from:
at least one public database;
at least one private database; and
the clinical entity itself; and
clinical trial information about the entity, wherein, at a time point, a user associated with the clinical entity confirms information from the public and private databases. 16. The system of claim 15, further comprising clinical records received from multiple clinical trials across multiple sponsors. 17. The system of claim 15, wherein the system maintains confidentiality by limiting user access. 18. A computer readable storage medium, comprising computer executable instructions embodied therein, to be executed by a computer, for:
executing a matching algorithm to identify clinical data corresponding to a clinical entity, said clinical data being received from at least one public database and at least one private database; identifying, based on a retrieved workflow, at least one user associated with the clinical entity, wherein the workflow consists of users, tasks, and time points, wherein the tasks are executable at said time points; receiving additional information from said at least one user concerning the clinical entity; requesting, at one or more of the time points, said at least one user to confirm the corresponding clinical data; and adding to a clinical record clinical trial information about the clinical entity. 19. (canceled) 20. The computer readable storage medium of claim 18, further comprising computer executable instructions whereby said time points are further associated with one or more incentives, and wherein said identifying is accompanied by said incentives. 21. The method of claim 7, wherein the matching algorithm is trained based on said received confirmation. | 2,100 |
4,657 | 12,756,798 | 2,177 | Various embodiments herein provide at least one of systems, methods, and software for visualization of content files within a package file. A package file is a data file that includes other files stored therein. Some embodiments include authoring a package file by adding a content file to the package file and associating the added content file with a data visualizer. When the content file is selected for viewing from the package file, the data visualizer associated with the content file is used to provide a view of data within the content file. Other embodiments are directed to viewing a content file of a package file utilizing an associated data visualizer. | 1. A system comprising:
a hardware memory; at least one hardware processor; an authoring module stored in the hardware memory and executable on the at least one hardware processor to perform actions comprising:
instantiating a package file;
receiving a first input to associate a presentation specification with the package file, the presentation specification to be rendered by a presentation application to present a representation of display elements of the package file;
receiving a second input to associate a content file with a display element of the presentation specification;
receiving a third input including a selection of a data visualizer and an association of the data visualizer with the content file, the data visualizer to be instantiated within one of an application or application plug-in to present a view of the content file associated therewith, the data visualizer including executable code to implement functionality and customize presentation of the content file; and
publishing the package file including data representative of the presentation specification, the content file, and the received first, second, and third inputs. 2. The system of claim 1, wherein the data visualizer includes instructions executable by the at least one hardware processor to render a view of the content file within the presentation application. 3. The system of claim 1, further comprising:
a presentation module stored in the hardware memory and executable on the at least one hardware processor to perform actions comprising:
presenting a view of the package file, the view to be generated as a function of the presentation specification and the second input associating the content file with the display element of the presentation specification;
receiving input selecting the display element associated with the content file; and
rendering a view of the content the as a function of the data visualizer. 4. The system of claim 1, wherein publishing the package file includes:
adding within the package file:
the content file,
the presentation specification,
the display elements and the association of the display element to the content file, and
the data visualizer and the association of the data visualizer to the content file; and
storing the package file. 5. The system of claim 4, wherein adding the data visualizer to the package file includes:
storing the data visualizer to a network location from which the data visualizer is downloadable; and adding to the package file a Universal Resource Identifier (URI) of the network location from which the data visualizer is downloadable. 6. The system of claim 1, wherein publishing the package file includes:
adding the content file, the presentation specification, the display elements and the association of the display element to the content file, a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable, and the association of the data visualizer to the content file; and storing the package file. 7. The system of claim 1, wherein:
the package file is a page description language document; and the content file is a data type other than a page description language document. 8. A method comprising:
receiving a first selection of a content file and adding the selected content file to a package file in a memory of a computing device; receiving a second selection of a data visualizer and adding the selected data visualizer to the package file; receiving input associating the content file with the data visualizer and adding data representative of the association to the package file such that when the content file is selected for viewing from the package file, a view of the content file is rendered through:
instantiation of the data visualizer within an application program environment an application providing a view of the package file, the data visualizer including executable code to implement functionality and customize presentation of the content file; and
execution of instructions of the data visualizer within the application program environment of the application providing the view of the package file; and
executing instructions on at least one processor of the computing device to publish the package file. 9. The method of claim 8, wherein the data visualizer includes instructions executable to render the view of the content file within a presentation application. 10. The method of claim 8, wherein, within a presentation application, upon receipt of selection input selecting a representation of the content file, calls executable instructions of the data visualizer to render the view of the content file. 11. The method of claim 8, wherein executing instructions on the at least one processor of the computing device to publish the package file includes executing instructions to:
store the package file on a data storage device of the computing device. 12. The method of claim 8, wherein the adding of the data visualizer to the package file includes:
storing the data visualizer to a network storage location from which the data visualizer is downloadable; and adding a Universal Resource Identifier (URI) to the package file of the network location from which the data visualizer is downloadable. 13. The method of claim 8, wherein the adding of the data visualizer to the package file includes:
adding a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable. 14. The method of claim 8 wherein:
the package file is a page description language document; and
the content file is a data type other than a page description language document. 15. A no transitory computer-readable storage medium, with instructions stored thereon, which when executed by at least one processor of a computer, cause the computer to perform a method comprising:
rendering, within a presentation application user interface on a display device of the computer, a view of a package file including a representation of a plurality of content files stored in the package file; receiving selection input selecting a representation of the one content file of the plurality of content files stored in the package file; determining, according to metadata stored within the package file, that a view of the selected content file is to be generated utilizing a data visualizer identified in the metadata, the data visualizer to be instantiated within one of the presentation application and an application plug-in of the presentation application to present a view of the selected content file associated therewith, the data visualizer including executable code to implement functionality and customize presentation of the selected content file, and the metadata associating the data visualizer to the selected content file and at least one other content file; retrieving the data visualizer identified in the metadata; and rendering a view, within the one of the presentation application and the application plug-in of the presentation application, of content file data as a function of the data visualizer. 16. The non-transitory computer-readable storage medium of claim 15, wherein the data visualizer identified in the metadata is identified by data including a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable. 17. The non-transitory computer-readable storage medium of claim 16, wherein retrieving the data visualizer identified in the metadata includes downloading the data visualizer from the network location identified by the URI. 18. The non-transitory computer-readable storage medium of claim 15, wherein the package file is a page description language document. 19. The non-transitory computer-readable storage medium of claim 18, wherein the selected content file is not a page description language document. 20. The non-transitory computer-readable storage medium of claim 15, the method further comprising:
receiving an additional selection input selecting a representation of a second content file of the plurality of content files; determining, according to metadata stored within the package file, that the metadata does not identify a data visualizer to be utilized in generating a view of the second content file; and submitting a file open command to an operating system of the computer to cause another program on the computer to open and render a view of the data within the second content file. | Various embodiments herein provide at least one of systems, methods, and software for visualization of content files within a package file. A package file is a data file that includes other files stored therein. Some embodiments include authoring a package file by adding a content file to the package file and associating the added content file with a data visualizer. When the content file is selected for viewing from the package file, the data visualizer associated with the content file is used to provide a view of data within the content file. Other embodiments are directed to viewing a content file of a package file utilizing an associated data visualizer.1. A system comprising:
a hardware memory; at least one hardware processor; an authoring module stored in the hardware memory and executable on the at least one hardware processor to perform actions comprising:
instantiating a package file;
receiving a first input to associate a presentation specification with the package file, the presentation specification to be rendered by a presentation application to present a representation of display elements of the package file;
receiving a second input to associate a content file with a display element of the presentation specification;
receiving a third input including a selection of a data visualizer and an association of the data visualizer with the content file, the data visualizer to be instantiated within one of an application or application plug-in to present a view of the content file associated therewith, the data visualizer including executable code to implement functionality and customize presentation of the content file; and
publishing the package file including data representative of the presentation specification, the content file, and the received first, second, and third inputs. 2. The system of claim 1, wherein the data visualizer includes instructions executable by the at least one hardware processor to render a view of the content file within the presentation application. 3. The system of claim 1, further comprising:
a presentation module stored in the hardware memory and executable on the at least one hardware processor to perform actions comprising:
presenting a view of the package file, the view to be generated as a function of the presentation specification and the second input associating the content file with the display element of the presentation specification;
receiving input selecting the display element associated with the content file; and
rendering a view of the content the as a function of the data visualizer. 4. The system of claim 1, wherein publishing the package file includes:
adding within the package file:
the content file,
the presentation specification,
the display elements and the association of the display element to the content file, and
the data visualizer and the association of the data visualizer to the content file; and
storing the package file. 5. The system of claim 4, wherein adding the data visualizer to the package file includes:
storing the data visualizer to a network location from which the data visualizer is downloadable; and adding to the package file a Universal Resource Identifier (URI) of the network location from which the data visualizer is downloadable. 6. The system of claim 1, wherein publishing the package file includes:
adding the content file, the presentation specification, the display elements and the association of the display element to the content file, a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable, and the association of the data visualizer to the content file; and storing the package file. 7. The system of claim 1, wherein:
the package file is a page description language document; and the content file is a data type other than a page description language document. 8. A method comprising:
receiving a first selection of a content file and adding the selected content file to a package file in a memory of a computing device; receiving a second selection of a data visualizer and adding the selected data visualizer to the package file; receiving input associating the content file with the data visualizer and adding data representative of the association to the package file such that when the content file is selected for viewing from the package file, a view of the content file is rendered through:
instantiation of the data visualizer within an application program environment an application providing a view of the package file, the data visualizer including executable code to implement functionality and customize presentation of the content file; and
execution of instructions of the data visualizer within the application program environment of the application providing the view of the package file; and
executing instructions on at least one processor of the computing device to publish the package file. 9. The method of claim 8, wherein the data visualizer includes instructions executable to render the view of the content file within a presentation application. 10. The method of claim 8, wherein, within a presentation application, upon receipt of selection input selecting a representation of the content file, calls executable instructions of the data visualizer to render the view of the content file. 11. The method of claim 8, wherein executing instructions on the at least one processor of the computing device to publish the package file includes executing instructions to:
store the package file on a data storage device of the computing device. 12. The method of claim 8, wherein the adding of the data visualizer to the package file includes:
storing the data visualizer to a network storage location from which the data visualizer is downloadable; and adding a Universal Resource Identifier (URI) to the package file of the network location from which the data visualizer is downloadable. 13. The method of claim 8, wherein the adding of the data visualizer to the package file includes:
adding a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable. 14. The method of claim 8 wherein:
the package file is a page description language document; and
the content file is a data type other than a page description language document. 15. A no transitory computer-readable storage medium, with instructions stored thereon, which when executed by at least one processor of a computer, cause the computer to perform a method comprising:
rendering, within a presentation application user interface on a display device of the computer, a view of a package file including a representation of a plurality of content files stored in the package file; receiving selection input selecting a representation of the one content file of the plurality of content files stored in the package file; determining, according to metadata stored within the package file, that a view of the selected content file is to be generated utilizing a data visualizer identified in the metadata, the data visualizer to be instantiated within one of the presentation application and an application plug-in of the presentation application to present a view of the selected content file associated therewith, the data visualizer including executable code to implement functionality and customize presentation of the selected content file, and the metadata associating the data visualizer to the selected content file and at least one other content file; retrieving the data visualizer identified in the metadata; and rendering a view, within the one of the presentation application and the application plug-in of the presentation application, of content file data as a function of the data visualizer. 16. The non-transitory computer-readable storage medium of claim 15, wherein the data visualizer identified in the metadata is identified by data including a Universal Resource Identifier (URI) of a network location from which the data visualizer is downloadable. 17. The non-transitory computer-readable storage medium of claim 16, wherein retrieving the data visualizer identified in the metadata includes downloading the data visualizer from the network location identified by the URI. 18. The non-transitory computer-readable storage medium of claim 15, wherein the package file is a page description language document. 19. The non-transitory computer-readable storage medium of claim 18, wherein the selected content file is not a page description language document. 20. The non-transitory computer-readable storage medium of claim 15, the method further comprising:
receiving an additional selection input selecting a representation of a second content file of the plurality of content files; determining, according to metadata stored within the package file, that the metadata does not identify a data visualizer to be utilized in generating a view of the second content file; and submitting a file open command to an operating system of the computer to cause another program on the computer to open and render a view of the data within the second content file. | 2,100 |
4,658 | 13,740,093 | 2,129 | One embodiment of the invention is a pop-up engine that generates a pop-up card from a sliced 3D graphics model. In operation, the pop-up engine processes a sliced 3D model to identify locations where the sliced 3D model is to attach to a plane surface of a pop-up card. For a given set of slices associated with a sliced 3D model, the pop-up engine identifies at least two slices that intersect at a folding line of the plane surface. The pop-up engine then identifies locations on the slices that are the farthest from the folding line. The pop-up engine marks the identified locations as connection points, where the 3D model is to attach to the plane surface. | 1. A computer-implemented method for generating a pop-up card based on a three-dimensional (3D) graphics model, the method comprising:
receiving an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds; slicing the 3D graphics model along at least two slice axes to generate a plurality of slices; identifying a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line; identifying a connection location along the first slice where the first slice is to attach to the plane surface; and causing an indication of the connection location to be generated on the first slice when the first slice is manufactured. 2. The method of claim 1, further comprising orienting the 3D graphics model on the fold line included on the plane surface. 3. The method of claim 2, further comprising determining that the 3D graphics model should be sliced along the at least two slice axes based on an orientation of the 3D graphics model on the plane surface. 4. The method of claim 2, wherein each slice axis included in the at least two slice axes is diagonal to the fold line. 5. The method of claim 1, wherein identifying the connection location comprises identifying a location along the first slice that is farthest from the fold line. 6. The method of claim 5, further comprising identifying a second connection location along the second slice where the second slice is to attach to the plane surface 7. The method of claim 6, wherein the connection location and the second connection location are equidistant from the fold line. 8. The method of claim 1, further comprising extending the first slice to include a tab portion positioned at the connection location. 9. The method of claim 8, further comprising identifying a surface connect location on the plane surface where the tab portion slides into the plane surface. 10. A computer readable medium storing instructions that, when executed by a processor, cause the processor to generate a pop-up card based on a three-dimensional (3D) graphics model, by performing the steps of:
receiving an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds; slicing the 3D graphics model along at least two slice axes to generate a plurality of slices; identifying a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line; identifying a connection location along the first slice where the first slice is to attach to the plane surface; and causing an indication of the connection location to be generated on the first slice when the first slice is manufactured. 11. The computer readable medium of claim 1, further comprising orienting the 3D graphics model on the fold line included on the plane surface. 12. The computer readable medium of claim 2, further comprising determining that the 3D graphics model should be sliced along the at least two slice axes based on an orientation of the 3D graphics model on the plane surface. 13. The computer readable medium of claim 2, wherein each slice axis included in the at least two slice axes is diagonal to the fold line. 14. The computer readable medium of claim 1, wherein identifying the connection location comprises identifying a location along the first slice that is farthest from the fold line. 15. The computer readable medium of claim 5, further comprising identifying a second connection location along the second slice where the second slice is to attach to the plane surface 16. The computer readable medium of claim 6, wherein the connection location and the second connection location are equidistant from the fold line. 17. The computer readable medium of claim 1, further comprising extending the first slice to include a tab portion positioned at the connection location. 18. The computer readable medium of claim 8, further comprising identifying a surface connect location on the plane surface where the tab portion slides into the plane surface. 19. A computer system, comprising:
a memory; and a processor configured with instructions stored in the memory to:
receive an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds,
slice the 3D graphics model along at least two slice axes to generate a plurality of slices,
identify a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line,
identify a connection location along the first slice where the first slice is to attach to the plane surface, and
cause an indication of the connection location to be generated on the first slice when the first slice is manufactured. 20. The computer system of claim 19, wherein the processor is further configured to orient the 3D graphics model on the fold line included on the plane surface | One embodiment of the invention is a pop-up engine that generates a pop-up card from a sliced 3D graphics model. In operation, the pop-up engine processes a sliced 3D model to identify locations where the sliced 3D model is to attach to a plane surface of a pop-up card. For a given set of slices associated with a sliced 3D model, the pop-up engine identifies at least two slices that intersect at a folding line of the plane surface. The pop-up engine then identifies locations on the slices that are the farthest from the folding line. The pop-up engine marks the identified locations as connection points, where the 3D model is to attach to the plane surface.1. A computer-implemented method for generating a pop-up card based on a three-dimensional (3D) graphics model, the method comprising:
receiving an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds; slicing the 3D graphics model along at least two slice axes to generate a plurality of slices; identifying a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line; identifying a connection location along the first slice where the first slice is to attach to the plane surface; and causing an indication of the connection location to be generated on the first slice when the first slice is manufactured. 2. The method of claim 1, further comprising orienting the 3D graphics model on the fold line included on the plane surface. 3. The method of claim 2, further comprising determining that the 3D graphics model should be sliced along the at least two slice axes based on an orientation of the 3D graphics model on the plane surface. 4. The method of claim 2, wherein each slice axis included in the at least two slice axes is diagonal to the fold line. 5. The method of claim 1, wherein identifying the connection location comprises identifying a location along the first slice that is farthest from the fold line. 6. The method of claim 5, further comprising identifying a second connection location along the second slice where the second slice is to attach to the plane surface 7. The method of claim 6, wherein the connection location and the second connection location are equidistant from the fold line. 8. The method of claim 1, further comprising extending the first slice to include a tab portion positioned at the connection location. 9. The method of claim 8, further comprising identifying a surface connect location on the plane surface where the tab portion slides into the plane surface. 10. A computer readable medium storing instructions that, when executed by a processor, cause the processor to generate a pop-up card based on a three-dimensional (3D) graphics model, by performing the steps of:
receiving an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds; slicing the 3D graphics model along at least two slice axes to generate a plurality of slices; identifying a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line; identifying a connection location along the first slice where the first slice is to attach to the plane surface; and causing an indication of the connection location to be generated on the first slice when the first slice is manufactured. 11. The computer readable medium of claim 1, further comprising orienting the 3D graphics model on the fold line included on the plane surface. 12. The computer readable medium of claim 2, further comprising determining that the 3D graphics model should be sliced along the at least two slice axes based on an orientation of the 3D graphics model on the plane surface. 13. The computer readable medium of claim 2, wherein each slice axis included in the at least two slice axes is diagonal to the fold line. 14. The computer readable medium of claim 1, wherein identifying the connection location comprises identifying a location along the first slice that is farthest from the fold line. 15. The computer readable medium of claim 5, further comprising identifying a second connection location along the second slice where the second slice is to attach to the plane surface 16. The computer readable medium of claim 6, wherein the connection location and the second connection location are equidistant from the fold line. 17. The computer readable medium of claim 1, further comprising extending the first slice to include a tab portion positioned at the connection location. 18. The computer readable medium of claim 8, further comprising identifying a surface connect location on the plane surface where the tab portion slides into the plane surface. 19. A computer system, comprising:
a memory; and a processor configured with instructions stored in the memory to:
receive an orientation of the 3D model on a plane surface having a fold line along which the plane surface folds,
slice the 3D graphics model along at least two slice axes to generate a plurality of slices,
identify a first slice included in the plurality of slices that intersects a second slice included in the plurality of slices at the fold line,
identify a connection location along the first slice where the first slice is to attach to the plane surface, and
cause an indication of the connection location to be generated on the first slice when the first slice is manufactured. 20. The computer system of claim 19, wherein the processor is further configured to orient the 3D graphics model on the fold line included on the plane surface | 2,100 |
4,659 | 14,105,992 | 2,179 | An apparatus receives information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other. The apparatus determines items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item. The same or another apparatus causes a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. | 1. A method performed by at least one apparatus, the method comprising:
receiving information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determining items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and causing a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. 2. The method according to claim 1, wherein one of:
a displayed item is replaced by a determined item such that the determined item is shown to fly into the display to a position of the displayed item on the display; a displayed item is replaced by a determined item such that the displayed item is turned around, with the determined item appearing arranged on a backside of the displayed item; and a displayed item that is replaced by a determined item is selected in response to a user input via the user interface. 3. The method according to claim 1, wherein the at least one singled out item is displayed at its original position when displayed as a part of the group of the determined items. 4. The method according to claim 1, wherein the at least one singled out item comprises a plurality of items and wherein determining items, which are related according to a given criterion to the at least one singled out item, comprises one of
determining items that are related to each of the singled out items; and determining items that are related to at least one of the singled out items. 5. The method according to claim 1, wherein an item comprises one of:
an image; a photographic image; an image representing a piece of music; a text entry; a text of a calendar entry; a key of a keyboard; and a waypoint or a point of interest. 6. The method according to claim 1, wherein the given criterion comprises one of:
a criterion that is predetermined for a particular type of items; and a criterion that is selected from one of a number of predetermined criteria for a particular type of items, depending on a manner of singling out the at least one item by the user via the user interface. 7. The method according to claim 1, wherein the criterion comprises one of:
the items to be determined being images of social contacts of a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same person as a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same date as an image corresponding to the at least one singled out item; the items to be determined being images of a same location as an image corresponding to the at least one singled out item; the items to be determined being images of a same topic as an image corresponding to the at least one singled out item; the items to be determined being images of a same color scheme as an image corresponding to the at least one singled out item; the items to be determined being calendar entries on a same topic as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same starting time as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same location as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same group of people as a calendar entry corresponding to the at least one singled out item; the items to be determined being representations of pieces of music having a characteristic in common with a piece of music represented by the at least one singled out item; the items to be determined being keys of keypad expected to be required by a user in view of a key corresponding to the at least one singled out item; the items to be determined being images of products of a same kind as a product in an image corresponding to the at least one singled out item; the items to be determined being images of products of a same manufacturer as a product in an image corresponding to the at least one singled out item; and the items to be determined being images of products that are interoperable with a product in an image corresponding to the at least one singled out item. 8. The method according to claim 1, wherein the given criterion comprises a degree of a relation between a singled out item and items to be determined. 9. 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 an apparatus at least to perform:
receive information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determine items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and cause a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. 10. The apparatus according to claim 9, wherein the computer program code is configured to, with the at least one processor, cause the apparatus to perform at least one of the following:
replace a displayed item by a determined item such that the determined item is shown to fly into the display to a position of the displayed item on the display; replace a displayed item by a determined item such that the displayed item is turned around, with the determined item appearing arranged on a backside of the displayed item; and select a displayed item that is replaced by a determined item in response to a user input via the user interface. 11. The apparatus according to claim 9, wherein the computer program code is configured to, with the at least one processor, cause the apparatus to display the at least one singled out item at its original position when displaying the at least one singled out item as a part of the group of the determined items. 12. The apparatus according to claim 9, wherein the at least one singled out item comprises a plurality of items and wherein determining items, which are related according to a given criterion to the at least one singled out item, comprises one of
determining items that are related to each of the singled out items; and determining items that are related to at least one of the singled out items. 13. The apparatus according to claim 9, wherein an item comprises one of:
an image; a photographic image; an image representing a piece of music; a text entry; a text of a calendar entry; a key of a keyboard; and a waypoint or a point of interest. 14. The apparatus according to claim 9, wherein the given criterion comprises one of:
a criterion that is predetermined for a particular type of items; and a criterion that is selected from one of a number of predetermined criteria for a particular type of items, depending on a manner of singling out the at least one item by the user via the user interface. 15. The apparatus according to claim 9, wherein the criterion comprises one of:
the items to be determined being images of social contacts of a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same person as a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same date as an image corresponding to the at least one singled out item; the items to be determined being images of a same location as an image corresponding to the at least one singled out item; the items to be determined being images of a same topic as an image corresponding to the at least one singled out item; the items to be determined being images of a same color scheme as an image corresponding to the at least one singled out item; the items to be determined being calendar entries on a same topic as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same starting time as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same location as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same group of people as a calendar entry corresponding to the at least one singled out item; the items to be determined being representations of pieces of music having a characteristic in common with a piece of music represented by the at least one singled out item; the items to be determined being keys of keypad expected to be required by a user in view of a key corresponding to the at least one singled out item; the items to be determined being images of products of a same kind as a product in an image corresponding to the at least one singled out item; the items to be determined being images of products of a same manufacturer as a product in an image corresponding to the at least one singled out item; and the items to be determined being images of products that are interoperable with a product in an image corresponding to the at least one singled out item. 16. The apparatus according to claim 9, wherein the given criterion comprises a degree of a relation between a singled out item and items to be determined. 17. The apparatus according to claim 9, wherein the apparatus is one of:
a server; a component for a server; a mobile device; and a component for a mobile device. 18. A non-transitory computer readable storage medium in which computer program code is stored, the computer program code when executed by a processor causing an apparatus to perform the following:
receiving information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determining items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and causing a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. | An apparatus receives information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other. The apparatus determines items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item. The same or another apparatus causes a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items.1. A method performed by at least one apparatus, the method comprising:
receiving information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determining items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and causing a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. 2. The method according to claim 1, wherein one of:
a displayed item is replaced by a determined item such that the determined item is shown to fly into the display to a position of the displayed item on the display; a displayed item is replaced by a determined item such that the displayed item is turned around, with the determined item appearing arranged on a backside of the displayed item; and a displayed item that is replaced by a determined item is selected in response to a user input via the user interface. 3. The method according to claim 1, wherein the at least one singled out item is displayed at its original position when displayed as a part of the group of the determined items. 4. The method according to claim 1, wherein the at least one singled out item comprises a plurality of items and wherein determining items, which are related according to a given criterion to the at least one singled out item, comprises one of
determining items that are related to each of the singled out items; and determining items that are related to at least one of the singled out items. 5. The method according to claim 1, wherein an item comprises one of:
an image; a photographic image; an image representing a piece of music; a text entry; a text of a calendar entry; a key of a keyboard; and a waypoint or a point of interest. 6. The method according to claim 1, wherein the given criterion comprises one of:
a criterion that is predetermined for a particular type of items; and a criterion that is selected from one of a number of predetermined criteria for a particular type of items, depending on a manner of singling out the at least one item by the user via the user interface. 7. The method according to claim 1, wherein the criterion comprises one of:
the items to be determined being images of social contacts of a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same person as a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same date as an image corresponding to the at least one singled out item; the items to be determined being images of a same location as an image corresponding to the at least one singled out item; the items to be determined being images of a same topic as an image corresponding to the at least one singled out item; the items to be determined being images of a same color scheme as an image corresponding to the at least one singled out item; the items to be determined being calendar entries on a same topic as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same starting time as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same location as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same group of people as a calendar entry corresponding to the at least one singled out item; the items to be determined being representations of pieces of music having a characteristic in common with a piece of music represented by the at least one singled out item; the items to be determined being keys of keypad expected to be required by a user in view of a key corresponding to the at least one singled out item; the items to be determined being images of products of a same kind as a product in an image corresponding to the at least one singled out item; the items to be determined being images of products of a same manufacturer as a product in an image corresponding to the at least one singled out item; and the items to be determined being images of products that are interoperable with a product in an image corresponding to the at least one singled out item. 8. The method according to claim 1, wherein the given criterion comprises a degree of a relation between a singled out item and items to be determined. 9. 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 an apparatus at least to perform:
receive information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determine items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and cause a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. 10. The apparatus according to claim 9, wherein the computer program code is configured to, with the at least one processor, cause the apparatus to perform at least one of the following:
replace a displayed item by a determined item such that the determined item is shown to fly into the display to a position of the displayed item on the display; replace a displayed item by a determined item such that the displayed item is turned around, with the determined item appearing arranged on a backside of the displayed item; and select a displayed item that is replaced by a determined item in response to a user input via the user interface. 11. The apparatus according to claim 9, wherein the computer program code is configured to, with the at least one processor, cause the apparatus to display the at least one singled out item at its original position when displaying the at least one singled out item as a part of the group of the determined items. 12. The apparatus according to claim 9, wherein the at least one singled out item comprises a plurality of items and wherein determining items, which are related according to a given criterion to the at least one singled out item, comprises one of
determining items that are related to each of the singled out items; and determining items that are related to at least one of the singled out items. 13. The apparatus according to claim 9, wherein an item comprises one of:
an image; a photographic image; an image representing a piece of music; a text entry; a text of a calendar entry; a key of a keyboard; and a waypoint or a point of interest. 14. The apparatus according to claim 9, wherein the given criterion comprises one of:
a criterion that is predetermined for a particular type of items; and a criterion that is selected from one of a number of predetermined criteria for a particular type of items, depending on a manner of singling out the at least one item by the user via the user interface. 15. The apparatus according to claim 9, wherein the criterion comprises one of:
the items to be determined being images of social contacts of a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same person as a person in an image corresponding to the at least one singled out item; the items to be determined being images of a same date as an image corresponding to the at least one singled out item; the items to be determined being images of a same location as an image corresponding to the at least one singled out item; the items to be determined being images of a same topic as an image corresponding to the at least one singled out item; the items to be determined being images of a same color scheme as an image corresponding to the at least one singled out item; the items to be determined being calendar entries on a same topic as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same starting time as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same location as a calendar entry corresponding to the at least one singled out item; the items to be determined being calendar entries for a same group of people as a calendar entry corresponding to the at least one singled out item; the items to be determined being representations of pieces of music having a characteristic in common with a piece of music represented by the at least one singled out item; the items to be determined being keys of keypad expected to be required by a user in view of a key corresponding to the at least one singled out item; the items to be determined being images of products of a same kind as a product in an image corresponding to the at least one singled out item; the items to be determined being images of products of a same manufacturer as a product in an image corresponding to the at least one singled out item; and the items to be determined being images of products that are interoperable with a product in an image corresponding to the at least one singled out item. 16. The apparatus according to claim 9, wherein the given criterion comprises a degree of a relation between a singled out item and items to be determined. 17. The apparatus according to claim 9, wherein the apparatus is one of:
a server; a component for a server; a mobile device; and a component for a mobile device. 18. A non-transitory computer readable storage medium in which computer program code is stored, the computer program code when executed by a processor causing an apparatus to perform the following:
receiving information about at least one item displayed on a display and singled out by a user via a user interface, wherein the at least one singled out item is a part of a group of items displayed on the display on a par with each other; determining items, which are displayable on a display and which are related according to a given criterion to the at least one singled out item; and causing a replacement of displayed items of the group of items that are not related according to the given criterion to the at least one singled out item by items determined to be related to the at least one singled out item such that the at least one singled out item is displayed as a part of a group of items displayed on the display on a par with each other and comprising the determined items. | 2,100 |
4,660 | 12,651,204 | 2,145 | A gravity menu management method can be provided. The method can include determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device. The method also can include rendering a menu bar with different drop down menus in a GUI of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. In an aspect of the embodiment, the method additionally can include determining an angle of inclination of the pervasive device by the tilt sensor and managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. For instance, managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, can include including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination. | 1. A pervasive device comprising:
a power source; a processor and memory powered by the power source; a display powered by the power source; an operating system executing in the memory by the processor and providing a graphical user interface (GUI) in the display; a tilt sensor coupled to the processor and configured to detect a tilt edge of the device above a reference position of the device; and, a gravity menu module comprising program code executing in the memory by the processor, the program code displaying a menu bar of drop down menus, each with a set of menu items, at a position in the GUI closest to the tilt edge. 2. The device of claim 1, wherein the tilt sensor is further configured to compute an angle of inclination of the device between the tilt edge and the reference position. 3. The device of claim 1, wherein the program code is further enabled to increase a number of menu items in the drop down menus responsive to different angles of inclination computed by the tilt sensor. 4. The device of claim 1, wherein the program code is further enabled to set a full set of menu items in the drop down menus responsive to a steep angle of inclination computed by the tilt sensor, and to set a reduced set of menu items in the drop down menus responsive to a shallow angle of inclination computed by the tilt sensor. 5. A gravity menu management method comprising:
determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device; and, rendering a menu bar with different drop down menus in a graphical user interface (GUI) of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. 6. The method of claim 5 further comprising:
additionally determining an angle of inclination of the pervasive device by the tilt sensor; and,
managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. 7. The method of claim 6, wherein managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, comprises including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination. 8. A computer program product comprising a computer usable medium embodying computer usable program code for gravity menu management, the computer program product comprising:
computer usable program code for determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device; and, computer usable program code for rendering a menu bar with different drop down menus in a graphical user interface (GUI) of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. 9. The computer program product of claim 8 further comprising:
computer usable program code for additionally determining an angle of inclination of the pervasive device by the tilt sensor; and,
computer usable program code for managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. 10. The computer program product of claim 9, wherein the computer usable program code for managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, comprises computer usable program code for including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination. | A gravity menu management method can be provided. The method can include determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device. The method also can include rendering a menu bar with different drop down menus in a GUI of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. In an aspect of the embodiment, the method additionally can include determining an angle of inclination of the pervasive device by the tilt sensor and managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. For instance, managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, can include including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination.1. A pervasive device comprising:
a power source; a processor and memory powered by the power source; a display powered by the power source; an operating system executing in the memory by the processor and providing a graphical user interface (GUI) in the display; a tilt sensor coupled to the processor and configured to detect a tilt edge of the device above a reference position of the device; and, a gravity menu module comprising program code executing in the memory by the processor, the program code displaying a menu bar of drop down menus, each with a set of menu items, at a position in the GUI closest to the tilt edge. 2. The device of claim 1, wherein the tilt sensor is further configured to compute an angle of inclination of the device between the tilt edge and the reference position. 3. The device of claim 1, wherein the program code is further enabled to increase a number of menu items in the drop down menus responsive to different angles of inclination computed by the tilt sensor. 4. The device of claim 1, wherein the program code is further enabled to set a full set of menu items in the drop down menus responsive to a steep angle of inclination computed by the tilt sensor, and to set a reduced set of menu items in the drop down menus responsive to a shallow angle of inclination computed by the tilt sensor. 5. A gravity menu management method comprising:
determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device; and, rendering a menu bar with different drop down menus in a graphical user interface (GUI) of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. 6. The method of claim 5 further comprising:
additionally determining an angle of inclination of the pervasive device by the tilt sensor; and,
managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. 7. The method of claim 6, wherein managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, comprises including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination. 8. A computer program product comprising a computer usable medium embodying computer usable program code for gravity menu management, the computer program product comprising:
computer usable program code for determining a tilt edge of a pervasive device by a tilt sensor disposed in the pervasive device; and, computer usable program code for rendering a menu bar with different drop down menus in a graphical user interface (GUI) of the pervasive device at a portion of the GUI adjacent to the determined tilt edge. 9. The computer program product of claim 8 further comprising:
computer usable program code for additionally determining an angle of inclination of the pervasive device by the tilt sensor; and,
computer usable program code for managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination. 10. The computer program product of claim 9, wherein the computer usable program code for managing a number of menu items in the drop down menus of the menu according to the determined angle of inclination, comprises computer usable program code for including a terse set of menu items in the drop down menus responsive to a shallow angle of inclination, and including a verbose set of menu items in the drop down menus responsive to a steep angle of inclination. | 2,100 |
4,661 | 13,863,369 | 2,177 | An application window divider control is shared by a first application window and a second application window in a user interface. Based on a received directional instruction that moves the application window divider control along an axis of the user interface, placement of the first application window and the second application window may be positioned across a range of consistently spaced points along an axis of the user interface. Placement adjustment can also impact other application windows in the user interface. The application window divider control may also snap to provide “magnetic” points along the axis when certain conditions are satisfied. | 1. A method comprising:
presenting an application window divider control shared by a first application window and a second application window in a user interface; and adjusting placement of the first application window and the second application window across a range of consistently spaced points along an axis of the user interface, responsive to a received directional instruction that moves the application window divider control along the axis. 2. The method of claim 1 wherein a minimum size condition is associated with the first application window and further comprising:
removing the first application window from the user interface when the adjusting operation decreases the placement of the first application window to satisfy the minimum size condition. 3. The method of claim 2 wherein the first application window is removed from the user interface with an animation that pushes the first application out of the user interface in the direction of the directional instruction. 4. The method of claim 1 wherein the presenting operation further presents a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, and the adjusting operation further comprises:
adjusting the placement of the first application window to satisfy a minimum size condition of the first application window, responsive to the directional instruction; and
adjusting placement of the third application window after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 5. The method of claim 4 wherein a minimum size condition is associated with the third application window and further comprising:
removing the third application window from the user interface when the operation of adjusting the third application window decreases the placement of the third application window to satisfy the minimum size condition of the third application window. 6. The method of claim 5 wherein the third application window is removed from the user interface with an animation that pushes the third application out of the user interface in the direction of the directional instruction. 7. The method of claim 1 further comprising:
snapping the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition or a distance condition relative to the point. 8. The method of claim 7 wherein the snapping operation comprises:
moving the application window divider control to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition and the distance condition relative to the point. 9. One or more tangible computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
presenting an application window divider control shared by a first application window and a second application window in a user interface; and adjusting placement of the first application window and the second application window across a range of consistently spaced points along an axis of the user interface, responsive to a received directional instruction that moves the application window divider control along the axis. 10. The one or more tangible computer-readable storage media of claim 9 wherein a minimum size condition is associated with the first application window and the computer process further comprises:
removing the first application window from the user interface when the adjusting operation decreases the placement of the first application window to satisfy the minimum size condition. 11. The one or more tangible computer-readable storage media of claim 9 wherein the presenting operation further presents a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, and the adjusting operation further comprises:
adjusting the placement of the first application window to satisfy a minimum size condition of the first application window, responsive to the directional instruction; and
adjusting placement of the third application window after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 12. The one or more tangible computer-readable storage media of claim 11 wherein a minimum size condition is associated with the third application window and the computer process further comprises:
removing the third application window from the user interface when the operation of adjusting the third application window decreases the placement of the third application window to satisfy the minimum size condition of the third application window. 13. The one or more tangible computer-readable storage media of claim 12 wherein the third application window is removed from the user interface with an animation that pushes the third application out of the user interface in the direction of the directional instruction. 14. The one or more tangible computer-readable storage media of claim 9 wherein the computer process further comprises:
snapping the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition or a distance condition relative to the point. 15. The one or more tangible computer-readable storage media of claim 14 wherein the snapping operation comprises:
moving the application window divider control to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition and the distance condition relative to the point. 16. The one or more tangible computer-readable storage media of claim 14 wherein the point is dynamically calculated during the directional instruction. 17. A system comprising:
a computing device presenting a user interface; a window management system configured to adjust placement of a first application window and the second application window across a range of consistently spaced points along an axis of a user interface, responsive to a received directional instruction that moves a visible application window divider control shared by the first application window and the second application along the axis. 18. The system of claim 17 wherein the window management system is further configured to remove the first application window from the user interface when the placement of the first application window decreases to satisfy the minimum size condition. 19. The system of claim 17 wherein the window management system is further configured to present a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, the placement of the first application window being adjusted to satisfy a minimum size condition of the first application window, responsive to the directional instruction, and placement of the third application window being adjusted after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 20. The system of claim 17 wherein the window management system is further configured to snap the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition and a distance condition relative to the point, the application windows divider control snapping to the point by moving to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition or the distance condition relative to the point. | An application window divider control is shared by a first application window and a second application window in a user interface. Based on a received directional instruction that moves the application window divider control along an axis of the user interface, placement of the first application window and the second application window may be positioned across a range of consistently spaced points along an axis of the user interface. Placement adjustment can also impact other application windows in the user interface. The application window divider control may also snap to provide “magnetic” points along the axis when certain conditions are satisfied.1. A method comprising:
presenting an application window divider control shared by a first application window and a second application window in a user interface; and adjusting placement of the first application window and the second application window across a range of consistently spaced points along an axis of the user interface, responsive to a received directional instruction that moves the application window divider control along the axis. 2. The method of claim 1 wherein a minimum size condition is associated with the first application window and further comprising:
removing the first application window from the user interface when the adjusting operation decreases the placement of the first application window to satisfy the minimum size condition. 3. The method of claim 2 wherein the first application window is removed from the user interface with an animation that pushes the first application out of the user interface in the direction of the directional instruction. 4. The method of claim 1 wherein the presenting operation further presents a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, and the adjusting operation further comprises:
adjusting the placement of the first application window to satisfy a minimum size condition of the first application window, responsive to the directional instruction; and
adjusting placement of the third application window after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 5. The method of claim 4 wherein a minimum size condition is associated with the third application window and further comprising:
removing the third application window from the user interface when the operation of adjusting the third application window decreases the placement of the third application window to satisfy the minimum size condition of the third application window. 6. The method of claim 5 wherein the third application window is removed from the user interface with an animation that pushes the third application out of the user interface in the direction of the directional instruction. 7. The method of claim 1 further comprising:
snapping the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition or a distance condition relative to the point. 8. The method of claim 7 wherein the snapping operation comprises:
moving the application window divider control to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition and the distance condition relative to the point. 9. One or more tangible computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
presenting an application window divider control shared by a first application window and a second application window in a user interface; and adjusting placement of the first application window and the second application window across a range of consistently spaced points along an axis of the user interface, responsive to a received directional instruction that moves the application window divider control along the axis. 10. The one or more tangible computer-readable storage media of claim 9 wherein a minimum size condition is associated with the first application window and the computer process further comprises:
removing the first application window from the user interface when the adjusting operation decreases the placement of the first application window to satisfy the minimum size condition. 11. The one or more tangible computer-readable storage media of claim 9 wherein the presenting operation further presents a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, and the adjusting operation further comprises:
adjusting the placement of the first application window to satisfy a minimum size condition of the first application window, responsive to the directional instruction; and
adjusting placement of the third application window after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 12. The one or more tangible computer-readable storage media of claim 11 wherein a minimum size condition is associated with the third application window and the computer process further comprises:
removing the third application window from the user interface when the operation of adjusting the third application window decreases the placement of the third application window to satisfy the minimum size condition of the third application window. 13. The one or more tangible computer-readable storage media of claim 12 wherein the third application window is removed from the user interface with an animation that pushes the third application out of the user interface in the direction of the directional instruction. 14. The one or more tangible computer-readable storage media of claim 9 wherein the computer process further comprises:
snapping the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition or a distance condition relative to the point. 15. The one or more tangible computer-readable storage media of claim 14 wherein the snapping operation comprises:
moving the application window divider control to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition and the distance condition relative to the point. 16. The one or more tangible computer-readable storage media of claim 14 wherein the point is dynamically calculated during the directional instruction. 17. A system comprising:
a computing device presenting a user interface; a window management system configured to adjust placement of a first application window and the second application window across a range of consistently spaced points along an axis of a user interface, responsive to a received directional instruction that moves a visible application window divider control shared by the first application window and the second application along the axis. 18. The system of claim 17 wherein the window management system is further configured to remove the first application window from the user interface when the placement of the first application window decreases to satisfy the minimum size condition. 19. The system of claim 17 wherein the window management system is further configured to present a third application window that does not share the application window divider control, the third application window being placed between the first window and an edge of the user interface in the direction of the directional instruction, the placement of the first application window being adjusted to satisfy a minimum size condition of the first application window, responsive to the directional instruction, and placement of the third application window being adjusted after the placement of the first application window satisfies the minimum size condition of the first application window, responsive to the directional instruction. 20. The system of claim 17 wherein the window management system is further configured to snap the application window divider control to a point along the axis of the user interface if movement of the application window divider control satisfies a speed condition and a distance condition relative to the point, the application windows divider control snapping to the point by moving to align with the point along the axis when the application window divider control is not aligned with the point but the movement of the application window divider control satisfies the speed condition or the distance condition relative to the point. | 2,100 |
4,662 | 12,490,413 | 2,152 | A content provider may provide public access to a content item set, but may be unable to achieve sufficient revenue to sustain the administrative costs and ongoing development of the content item set. Instead, the content provider may develop relationships with one or more referrers (e.g., search engines.) When a user requests a content item, the content provider may determine whether the request results from a referral by a sponsoring referrer, and based on this determination may provide either a full version or a limited version of the content item. The referrer benefits by providing its users with free access to the content item set, which may be unavailable from non-sponsoring competitors, and in exchange may share advertising revenue with the content provider. This arrangement achieves sustaining sponsorship of the content provider while extending full and free access to the content item set to users of sponsoring referrers. | 1. A method of fulfilling requests for content items of a content item set accessible to a computer having a processor, the method comprising:
establishing a sponsorship relationship with at least one sponsoring referrer, and upon receiving from a requester a request for a content item, executing on the processor instructions configured to:
identify a referrer of the content item to the requester;
upon identifying the referrer as a sponsoring referrer, provide the content item to the requester; and
upon failing to identify the referrer as a sponsoring referrer, provide a limited version of the content item to the requester. 2. The method of claim 1:
at least one sponsoring referrer comprising a search engine indexing at least a portion of the content item set; at least one requester comprising a search engine visitor referred to the content item through a search engine result provided by the search engine to the requester in response to a search query executed on the search engine on behalf of the requester. 3. The method of claim 1, at least two referrers comprising sponsoring referrers. 4. The method of claim 1, establishing a sponsorship relationship with a sponsoring referrer comprising: negotiating a sponsorship fee with the sponsoring referrer based on referrals of requests by requesters for at least one content item. 5. The method of claim 1:
at least one referrer comprising a search engine configured to explore the content item set, and the instructions configured to establish a sponsorship relationship with the search engine by notifying the search engine in a search metadata object. 6. The method of claim 1, the instructions configured to establish the relationship by:
exposing a sponsorship establishing interface configured to establish sponsorship relationships with referrers; and upon receiving through the sponsorship establishing interface from a referrer a request to establish a sponsorship relationship, establishing the sponsorship relationship with the referrer. 7. The method of claim 1:
the request received from the requester including a referrer identifier, and identifying the referrer comprising: detecting the referrer identifier in the request. 8. The method of claim 1:
the instructions configured to, upon detecting a request for at least one content item by a referrer, provide to the referrer a referrer identifying reference associated with the content item and identifying the referrer; and identifying the referrer comprising: detecting the referrer identifying reference received from the requester. 9. The method of claim 1, the instructions configured to:
identify the requester as a subscriber of the content item set, and upon identifying the requester as a subscriber of the content item set, provide the content item to the requester. 10. The method of claim 1, the instructions configured to:
identify the requester as a sponsoring referrer, and upon identifying the requester as a sponsoring referrer, provide the content item to the sponsoring referrer. 11. The method of claim 1, the limited version of the content item provided to the requester comprising at least one content item portion selected from a set of content item portions comprising:
a summary of the content item; a sample of the content item; a bibliographic reference to the content item; and a metadata descriptor of the content item. 12. The method of claim 1, providing the limited version of the content item to the requester comprising: providing the limited version of the content item with at least one sponsorship item selected from a set of sponsorship items comprising:
a referral to a sponsoring referrer; an advertisement for a subscription to the content item set; and an advertisement provided by an advertiser. 13. The method of claim 1, the instructions configured to:
record the fulfilling of the request of the requester, and charge the sponsoring referrer a sponsorship fee based on the content items provided to the requester. 14. The method of claim 13, the sponsorship fee computed according to at least one sponsorship factor selected from a set of sponsorship factors comprising:
a requested content items metric; a requester traffic metric; and a referrer revenue metric associated with revenue received by the sponsoring referrer for referring the requester to the content item. 15. The method of claim 13, the sponsorship fee computed by:
identifying a total sponsorship target, and computing the sponsorship fee as an allocation of the total sponsorship target over requests for the content items of the content item set. 16. The method of claim 1, providing the content item to the requester comprising: informing the requester of the sponsorship relationship with at least one sponsoring referrer. 17. The method of claim 1, the instructions configured to, upon receiving from a searcher a search query applicable to the content item set, refer the searcher to at least one sponsoring referrer. 18. The method of claim 1, the instructions configured to, upon receiving from a requester a request for a content item set search component, provide to the requester a content item set search component configured to:
identify the content item set and at least one sponsoring referrer, and refer search queries received from the requester to the at least one sponsoring referrer. 19. A system configured to fulfill a request from a requester for at least one content item of a content item set, the system comprising:
a referrer identifying component configured to identify a referrer of the content item to the requester; a content item providing component configured to, upon identifying the referrer as a sponsoring referrer, provide the content item to the requester; and a limited content item providing component configured to, upon failing to identify the referrer as a sponsoring referrer, provide a limited version of the content item to the requester. 20. A computer-implemented method comprising instructions that, when executed on a processor of a computer having access to a content item set, cause the processor to fulfill requests for content items of the content item set by:
exposing a sponsorship establishing interface configured to establish sponsorship relationships with referrers; upon receiving through the sponsorship establishing interface from a referrer a request to establish a sponsorship relationship, establishing the sponsorship relationship with the referrer as a sponsoring referrer; upon receiving from a requester a request for a content item:
identifying a referrer of the content item to the requester by detecting in the request a referrer identifier included in the request by the referrer;
upon identifying the referrer as a sponsoring referrer:
providing the content item to the requester;
recording the fulfilling of the request of the requester; and
charging the sponsoring referrer a sponsorship fee based on the content items provided to the requester, the sponsorship fee computed according to at least one sponsorship factor selected from a set of sponsorship factors comprising:
a requested content items metric;
a requester traffic metric; and
a referrer revenue metric associated with revenue received by the sponsoring referrer for referring the requester to the content item;
upon identifying the requester as a sponsoring referrer, provide the content item to the sponsoring referrer;
upon identifying the requester as a subscriber of the content item set, provide the content item to the requester; and
upon failing to identify the referrer as a sponsoring referrer, providing a limited version of the content item to the requester, the limited version comprising at least one content item portion selected from a set of content item portions comprising:
a summary of the content item;
a sample of the content item;
a bibliographic reference to the content item; and
a metadata descriptor of the content item;
upon receiving from a searcher a search query applicable to the content item set, refer the searcher to at least one sponsoring referrer; and upon receiving from a requester a request for a content item set search component, provide to the requester a content item set search component configured to:
identify the content item set and at least one sponsoring referrer, and
refer search queries received from the requester to the at least one sponsoring referrer. | A content provider may provide public access to a content item set, but may be unable to achieve sufficient revenue to sustain the administrative costs and ongoing development of the content item set. Instead, the content provider may develop relationships with one or more referrers (e.g., search engines.) When a user requests a content item, the content provider may determine whether the request results from a referral by a sponsoring referrer, and based on this determination may provide either a full version or a limited version of the content item. The referrer benefits by providing its users with free access to the content item set, which may be unavailable from non-sponsoring competitors, and in exchange may share advertising revenue with the content provider. This arrangement achieves sustaining sponsorship of the content provider while extending full and free access to the content item set to users of sponsoring referrers.1. A method of fulfilling requests for content items of a content item set accessible to a computer having a processor, the method comprising:
establishing a sponsorship relationship with at least one sponsoring referrer, and upon receiving from a requester a request for a content item, executing on the processor instructions configured to:
identify a referrer of the content item to the requester;
upon identifying the referrer as a sponsoring referrer, provide the content item to the requester; and
upon failing to identify the referrer as a sponsoring referrer, provide a limited version of the content item to the requester. 2. The method of claim 1:
at least one sponsoring referrer comprising a search engine indexing at least a portion of the content item set; at least one requester comprising a search engine visitor referred to the content item through a search engine result provided by the search engine to the requester in response to a search query executed on the search engine on behalf of the requester. 3. The method of claim 1, at least two referrers comprising sponsoring referrers. 4. The method of claim 1, establishing a sponsorship relationship with a sponsoring referrer comprising: negotiating a sponsorship fee with the sponsoring referrer based on referrals of requests by requesters for at least one content item. 5. The method of claim 1:
at least one referrer comprising a search engine configured to explore the content item set, and the instructions configured to establish a sponsorship relationship with the search engine by notifying the search engine in a search metadata object. 6. The method of claim 1, the instructions configured to establish the relationship by:
exposing a sponsorship establishing interface configured to establish sponsorship relationships with referrers; and upon receiving through the sponsorship establishing interface from a referrer a request to establish a sponsorship relationship, establishing the sponsorship relationship with the referrer. 7. The method of claim 1:
the request received from the requester including a referrer identifier, and identifying the referrer comprising: detecting the referrer identifier in the request. 8. The method of claim 1:
the instructions configured to, upon detecting a request for at least one content item by a referrer, provide to the referrer a referrer identifying reference associated with the content item and identifying the referrer; and identifying the referrer comprising: detecting the referrer identifying reference received from the requester. 9. The method of claim 1, the instructions configured to:
identify the requester as a subscriber of the content item set, and upon identifying the requester as a subscriber of the content item set, provide the content item to the requester. 10. The method of claim 1, the instructions configured to:
identify the requester as a sponsoring referrer, and upon identifying the requester as a sponsoring referrer, provide the content item to the sponsoring referrer. 11. The method of claim 1, the limited version of the content item provided to the requester comprising at least one content item portion selected from a set of content item portions comprising:
a summary of the content item; a sample of the content item; a bibliographic reference to the content item; and a metadata descriptor of the content item. 12. The method of claim 1, providing the limited version of the content item to the requester comprising: providing the limited version of the content item with at least one sponsorship item selected from a set of sponsorship items comprising:
a referral to a sponsoring referrer; an advertisement for a subscription to the content item set; and an advertisement provided by an advertiser. 13. The method of claim 1, the instructions configured to:
record the fulfilling of the request of the requester, and charge the sponsoring referrer a sponsorship fee based on the content items provided to the requester. 14. The method of claim 13, the sponsorship fee computed according to at least one sponsorship factor selected from a set of sponsorship factors comprising:
a requested content items metric; a requester traffic metric; and a referrer revenue metric associated with revenue received by the sponsoring referrer for referring the requester to the content item. 15. The method of claim 13, the sponsorship fee computed by:
identifying a total sponsorship target, and computing the sponsorship fee as an allocation of the total sponsorship target over requests for the content items of the content item set. 16. The method of claim 1, providing the content item to the requester comprising: informing the requester of the sponsorship relationship with at least one sponsoring referrer. 17. The method of claim 1, the instructions configured to, upon receiving from a searcher a search query applicable to the content item set, refer the searcher to at least one sponsoring referrer. 18. The method of claim 1, the instructions configured to, upon receiving from a requester a request for a content item set search component, provide to the requester a content item set search component configured to:
identify the content item set and at least one sponsoring referrer, and refer search queries received from the requester to the at least one sponsoring referrer. 19. A system configured to fulfill a request from a requester for at least one content item of a content item set, the system comprising:
a referrer identifying component configured to identify a referrer of the content item to the requester; a content item providing component configured to, upon identifying the referrer as a sponsoring referrer, provide the content item to the requester; and a limited content item providing component configured to, upon failing to identify the referrer as a sponsoring referrer, provide a limited version of the content item to the requester. 20. A computer-implemented method comprising instructions that, when executed on a processor of a computer having access to a content item set, cause the processor to fulfill requests for content items of the content item set by:
exposing a sponsorship establishing interface configured to establish sponsorship relationships with referrers; upon receiving through the sponsorship establishing interface from a referrer a request to establish a sponsorship relationship, establishing the sponsorship relationship with the referrer as a sponsoring referrer; upon receiving from a requester a request for a content item:
identifying a referrer of the content item to the requester by detecting in the request a referrer identifier included in the request by the referrer;
upon identifying the referrer as a sponsoring referrer:
providing the content item to the requester;
recording the fulfilling of the request of the requester; and
charging the sponsoring referrer a sponsorship fee based on the content items provided to the requester, the sponsorship fee computed according to at least one sponsorship factor selected from a set of sponsorship factors comprising:
a requested content items metric;
a requester traffic metric; and
a referrer revenue metric associated with revenue received by the sponsoring referrer for referring the requester to the content item;
upon identifying the requester as a sponsoring referrer, provide the content item to the sponsoring referrer;
upon identifying the requester as a subscriber of the content item set, provide the content item to the requester; and
upon failing to identify the referrer as a sponsoring referrer, providing a limited version of the content item to the requester, the limited version comprising at least one content item portion selected from a set of content item portions comprising:
a summary of the content item;
a sample of the content item;
a bibliographic reference to the content item; and
a metadata descriptor of the content item;
upon receiving from a searcher a search query applicable to the content item set, refer the searcher to at least one sponsoring referrer; and upon receiving from a requester a request for a content item set search component, provide to the requester a content item set search component configured to:
identify the content item set and at least one sponsoring referrer, and
refer search queries received from the requester to the at least one sponsoring referrer. | 2,100 |
4,663 | 14,674,979 | 2,122 | Technology is directed to text message based concierge services (“the technology”). A user interacts with a concierge service (CS) via text messages to obtain a specific concierge service. For example, the user can send a text message to the CS, e.g., to a contact number provided by the CS, requesting for a recommendation of a restaurant, and the CS can respond by sending the recommendation as a text message. The CS determines a context of the request and generates recommendations that are personalized to the user and is relevant to the context. The CS can use various techniques, e.g., artificial intelligence, machine learning, natural language processing, to determine a context of the request and generate the recommendations accordingly. The CS can also receive additional information from a person associated with the CS, such as a concierge, to further customize or personalize the recommendations to the user. | 1. A method performed by a computing system, comprising:
receiving, at a server, a request for a recommendation for a service from a first user, the request received as a first message from a mobile computing device associated with the first user via a messaging service provided by a wireless telecommunications network of the mobile computing device; analyzing, at the server, the first message to extract a first set of parameters to be used for performing a search for the service, the analyzing including:
determining, by the server, whether the first set of parameters satisfy a criterion for performing the search, and
responsive to a determination that the first set of parameters do not satisfy the criterion, exchanging a set of messages between the server and the mobile computing device to obtain the first set of parameters from the first user until the analyzing determines that the first set of parameters satisfy the criterion, the exchanging including:
receiving an input from a second user associated with the server regarding at least one of the first set of parameters to be obtained from the user, and
sending, by the server, at least one of the set of messages to the mobile computing device eliciting a response from the first user for the at least one of the first set of parameters;
performing, at the server, the search using the set of parameters to retrieve a plurality of recommendations for the service; generating, by the server, a second message including the plurality of recommendations; and sending, by the server, the second message to the mobile computing device via the messaging service. 2. The method of claim 1 further comprising:
receiving, at the server, a response from the first user regarding a selection of a first recommendation from the plurality of the recommendations via a third message from the mobile computing device; and
storing, by the server, at a storage system associated with the server, an indication that the first user accepted the first recommendation as part of user habit data. 3. The method of claim 2 further comprising:
analyzing, by the server, the third message from the first user to determine if the third message includes a reason for the selection of the first recommendation; and
responsive to a determination that the third message includes the reason for the selection of the first recommendation, storing the reason as part of the user habit data. 4. The method of claim 2 further comprising:
analyzing, by the server, the third message from the first user to determine if the third message includes a reason for rejecting any of the plurality of recommendations; and
responsive to a determination that the third message includes the reason for rejecting, storing the reason as part of the user habit data. 5. The method of claim 2, wherein performing the search using the set of parameters further includes:
analyzing, by the server, the user habit data to determine one or more of the set of parameters to generate the plurality of recommendations that is customized to the first user. 6. The method of claim 2 further comprising:
receiving, by the server, a request from the first user to perform a task associated with a service associated with the first recommendation, the request received via a fourth message from the mobile computing device; and
performing, by the server, the task using an application programming interface (API) associated with the service associated with the first recommendation. 7. The method of claim 1 further comprising:
receiving, at the server, a response from the first user regarding a rejection of a first recommendation from the plurality of the recommendations via a third message from the mobile computing device; and
storing, by the server, at a storage system associated with the server, an indication that the first user rejected the first recommendation as part of user habit data. 8. The method of claim 7 further comprising:
analyzing, by the server, the third message from the first user to determine a reason for the rejection; and
performing, by the server, a revised search using one or more parameters determined based on the reason for rejection to retrieve a second plurality of recommendations, the second plurality of recommendations excluding a first set of recommendations that match the reason for rejection and including a second set of recommendations that overcome the reason for rejection. 9. The method of claim 1, wherein performing the search to retrieve the plurality of recommendations for the service further includes:
determining, at the server, a second set of parameters to customize the plurality of recommendations to the first user, the second set of parameters determined based on at least one of a context of the request, user habits data, or user profile data, and performing, by the server, a second search based on the second set of parameters to generate a second plurality of recommendations that is customized to the first user. 10. The method of claim 9, wherein determining the second set of parameters includes receiving, at the server, one or more of the second set of parameters as input from the second user. 11. The method of claim 10, wherein the one or more of the second set of parameters received from the second user are determined by the second user based on user habits data generated by the server. 12. The method of claim 10, wherein the one or more of the second set of parameters received from the second user are determined by the second user based on the context of the request for the recommendation from the first user, the one or more parameters relating to the first user and/or an aspect of the service in the plurality of recommendations. 13. The method of claim 9, wherein the user habits data is generated by the server based on information regarding one or more recommendations accepted and/or rejected in the past by the first user and reasons for accepting and/or rejecting the one or more recommendations. 14. The method of claim 1, wherein the analyzing the first message to extract the first set of parameters includes analyzing the first message using artificial intelligence technique. 15. The method of claim 1, wherein the messaging service provided by the wireless telecommunications network of the mobile computing device is a short messaging service, and wherein the first message is a text message. 16. The method of claim 1, wherein exchanging the set of messages between the server and the mobile computing device includes:
sending, by the server, a first message of the set of messages to the first user requesting the first user to provide one or more parameters of the first set of parameters; receiving a response from the first user for the first message as a second message of the set of messages, the response including the one or more parameters; and sending, by the server, a third message of the set of messages forming a sequence, wherein a next message of the sequence sent to the first user is based on a response received from the user for a previous message of the sequence. 17. The method of claim 1, wherein performing the search includes:
performing, by the server, the search in at a plurality of computing devices accessible via a communication network. 18. A computer-readable storage medium storing computer-readable instructions, comprising:
instructions for receiving, at a server, a first set of messages from a mobile computing device associated with a first user, wherein at least one of the first set of messages contains a request for a recommendation for a service; instructions for sending, by the server, a second set of messages to the mobile computing device to elicit information from the first user that is to be used by the server in generating the recommendation, wherein at least some of the second set of messages are sent in response to at least some of the first set of messages received from the first user, wherein at least some of the first set of messages are responses to the at least some of the second set of messages, and includes information requested by the at least some the second set of messages; instructions for analyzing, at the server, the first set of messages using an artificial intelligence technique to determine a first set of parameters for generating the recommendation, the analyzing including:
extracting at least some of the first set of parameters provided by the first user in the first set of messages,
deriving at least some of the first set of parameters based on information provided in the first set of messages, and
deriving at least some of the first set of parameters based on user habits data of the first user;
instructions for performing, at the server, the search using the first set of parameters to retrieve a first recommendation for the service; and instructions for sending, by the server, the first recommendation to the first user as a first message to the mobile computing device. 19. The computer-readable storage medium of claim 18 further comprising:
instructions for receiving a second message from the mobile computing device including a response from the first user regarding a rejection of the first recommendation;
instructions for analyzing the second message to determine a reason for rejection;
instructions for generating a “not-preferred” parameter based on the reason for rejection that is used to identify a set of recommendations that match the reason for rejection;
instructions for performing a revised search using the “not-preferred” parameter to retrieve a plurality of recommendations, the plurality of recommendations excluding the set of recommendations that match the “not-preferred” parameter; and
instructions for sending one of the plurality of recommendations to the first user as a third message to the mobile computing device. 20. The computer-readable storage medium of claim 19 further comprising:
instructions for storing the rejection of the first recommendation and the reason for rejection as part of user habits data of the first user in a storage system associated with the server. 21. The computer-readable storage medium of claim 18, wherein the instructions for receiving the first set of messages from the mobile computing device includes instructions for receiving the first set of messages from the mobile computing device via a messaging service provided by a wireless telecommunications network of the mobile computing device. 22. The computer-readable storage medium of claim 21, wherein the instructions for receiving the first set of messages via the messaging service includes receiving the first set of messages via a short messaging service, and wherein the first set of messages are text messages. 23. The computer-readable storage medium of claim 18, wherein the instructions for receiving the first set of messages from the mobile computing device includes instructions for receiving the first set of messages from the mobile computing device via a social networking application executing at the mobile computing device. 24. The computer-readable storage medium of claim 18, wherein the instructions for deriving at least some of the first set of parameters based on information provided in the first set of messages includes:
instructions for receiving an input from a second user associated with the server regarding a context of the request, and instructions for deriving the at least some of the first set of parameters based on the context. 25. A system, comprising:
a first module to receive, at a server, a first set of messages from a mobile computing device associated with a first user, wherein at least one of the first set of messages contains a request for a recommendation for a service; a second module to send, by the server, a second set of messages to the mobile computing device to elicit information from the first user that is to be used by the server in generating the recommendation, wherein at least some of the first set of messages are responses to the at least some of the second set of messages, and includes information requested by the at least some the second set of messages; a third module to determine, at the server, a context of the request using an artificial intelligence technique, the context including explicit parameters and implicit parameters, which are used for performing a search to generate the recommendation, the third module further configured to determine the context by:
extracting the explicit parameters from the first set of messages, the explicit parameters provided by the first user in the first set of messages,
deriving at least some of the implicit parameters based on the information provided in the first set of messages and/or information received by a second user associated with the server, and
deriving at least some of the implicit parameters based on user habits data of the first user; and
a fourth module to perform, at the server, a search based on the context to retrieve a first recommendation for the service, wherein the second module is further configured to send the first recommendation to the first user as a first message to the mobile computing device. 26. The system of claim 25, wherein the second module is further configured to receive a second message from the mobile computing device including a rejection of the first recommendation, and wherein the fourth module is further configured to perform a revised search for retrieving a plurality of recommendations, the plurality of recommendations excluding a set of recommendations that match with a reason for the rejection. 27. The system of claim 26 further comprising:
a fifth module to store the rejection of the first recommendation and the reason for rejection as part of user habits data of the first user in a storage system associated with the server. 28. The system of claim 25, wherein the first module is configured to receive the first set of messages from the mobile computing device via a messaging service provided by a wireless telecommunications network of the mobile computing device. 29. The system of claim 28, wherein first module is configured to receive the first set of messages via a short messaging service, and wherein the first set of messages are text messages. | Technology is directed to text message based concierge services (“the technology”). A user interacts with a concierge service (CS) via text messages to obtain a specific concierge service. For example, the user can send a text message to the CS, e.g., to a contact number provided by the CS, requesting for a recommendation of a restaurant, and the CS can respond by sending the recommendation as a text message. The CS determines a context of the request and generates recommendations that are personalized to the user and is relevant to the context. The CS can use various techniques, e.g., artificial intelligence, machine learning, natural language processing, to determine a context of the request and generate the recommendations accordingly. The CS can also receive additional information from a person associated with the CS, such as a concierge, to further customize or personalize the recommendations to the user.1. A method performed by a computing system, comprising:
receiving, at a server, a request for a recommendation for a service from a first user, the request received as a first message from a mobile computing device associated with the first user via a messaging service provided by a wireless telecommunications network of the mobile computing device; analyzing, at the server, the first message to extract a first set of parameters to be used for performing a search for the service, the analyzing including:
determining, by the server, whether the first set of parameters satisfy a criterion for performing the search, and
responsive to a determination that the first set of parameters do not satisfy the criterion, exchanging a set of messages between the server and the mobile computing device to obtain the first set of parameters from the first user until the analyzing determines that the first set of parameters satisfy the criterion, the exchanging including:
receiving an input from a second user associated with the server regarding at least one of the first set of parameters to be obtained from the user, and
sending, by the server, at least one of the set of messages to the mobile computing device eliciting a response from the first user for the at least one of the first set of parameters;
performing, at the server, the search using the set of parameters to retrieve a plurality of recommendations for the service; generating, by the server, a second message including the plurality of recommendations; and sending, by the server, the second message to the mobile computing device via the messaging service. 2. The method of claim 1 further comprising:
receiving, at the server, a response from the first user regarding a selection of a first recommendation from the plurality of the recommendations via a third message from the mobile computing device; and
storing, by the server, at a storage system associated with the server, an indication that the first user accepted the first recommendation as part of user habit data. 3. The method of claim 2 further comprising:
analyzing, by the server, the third message from the first user to determine if the third message includes a reason for the selection of the first recommendation; and
responsive to a determination that the third message includes the reason for the selection of the first recommendation, storing the reason as part of the user habit data. 4. The method of claim 2 further comprising:
analyzing, by the server, the third message from the first user to determine if the third message includes a reason for rejecting any of the plurality of recommendations; and
responsive to a determination that the third message includes the reason for rejecting, storing the reason as part of the user habit data. 5. The method of claim 2, wherein performing the search using the set of parameters further includes:
analyzing, by the server, the user habit data to determine one or more of the set of parameters to generate the plurality of recommendations that is customized to the first user. 6. The method of claim 2 further comprising:
receiving, by the server, a request from the first user to perform a task associated with a service associated with the first recommendation, the request received via a fourth message from the mobile computing device; and
performing, by the server, the task using an application programming interface (API) associated with the service associated with the first recommendation. 7. The method of claim 1 further comprising:
receiving, at the server, a response from the first user regarding a rejection of a first recommendation from the plurality of the recommendations via a third message from the mobile computing device; and
storing, by the server, at a storage system associated with the server, an indication that the first user rejected the first recommendation as part of user habit data. 8. The method of claim 7 further comprising:
analyzing, by the server, the third message from the first user to determine a reason for the rejection; and
performing, by the server, a revised search using one or more parameters determined based on the reason for rejection to retrieve a second plurality of recommendations, the second plurality of recommendations excluding a first set of recommendations that match the reason for rejection and including a second set of recommendations that overcome the reason for rejection. 9. The method of claim 1, wherein performing the search to retrieve the plurality of recommendations for the service further includes:
determining, at the server, a second set of parameters to customize the plurality of recommendations to the first user, the second set of parameters determined based on at least one of a context of the request, user habits data, or user profile data, and performing, by the server, a second search based on the second set of parameters to generate a second plurality of recommendations that is customized to the first user. 10. The method of claim 9, wherein determining the second set of parameters includes receiving, at the server, one or more of the second set of parameters as input from the second user. 11. The method of claim 10, wherein the one or more of the second set of parameters received from the second user are determined by the second user based on user habits data generated by the server. 12. The method of claim 10, wherein the one or more of the second set of parameters received from the second user are determined by the second user based on the context of the request for the recommendation from the first user, the one or more parameters relating to the first user and/or an aspect of the service in the plurality of recommendations. 13. The method of claim 9, wherein the user habits data is generated by the server based on information regarding one or more recommendations accepted and/or rejected in the past by the first user and reasons for accepting and/or rejecting the one or more recommendations. 14. The method of claim 1, wherein the analyzing the first message to extract the first set of parameters includes analyzing the first message using artificial intelligence technique. 15. The method of claim 1, wherein the messaging service provided by the wireless telecommunications network of the mobile computing device is a short messaging service, and wherein the first message is a text message. 16. The method of claim 1, wherein exchanging the set of messages between the server and the mobile computing device includes:
sending, by the server, a first message of the set of messages to the first user requesting the first user to provide one or more parameters of the first set of parameters; receiving a response from the first user for the first message as a second message of the set of messages, the response including the one or more parameters; and sending, by the server, a third message of the set of messages forming a sequence, wherein a next message of the sequence sent to the first user is based on a response received from the user for a previous message of the sequence. 17. The method of claim 1, wherein performing the search includes:
performing, by the server, the search in at a plurality of computing devices accessible via a communication network. 18. A computer-readable storage medium storing computer-readable instructions, comprising:
instructions for receiving, at a server, a first set of messages from a mobile computing device associated with a first user, wherein at least one of the first set of messages contains a request for a recommendation for a service; instructions for sending, by the server, a second set of messages to the mobile computing device to elicit information from the first user that is to be used by the server in generating the recommendation, wherein at least some of the second set of messages are sent in response to at least some of the first set of messages received from the first user, wherein at least some of the first set of messages are responses to the at least some of the second set of messages, and includes information requested by the at least some the second set of messages; instructions for analyzing, at the server, the first set of messages using an artificial intelligence technique to determine a first set of parameters for generating the recommendation, the analyzing including:
extracting at least some of the first set of parameters provided by the first user in the first set of messages,
deriving at least some of the first set of parameters based on information provided in the first set of messages, and
deriving at least some of the first set of parameters based on user habits data of the first user;
instructions for performing, at the server, the search using the first set of parameters to retrieve a first recommendation for the service; and instructions for sending, by the server, the first recommendation to the first user as a first message to the mobile computing device. 19. The computer-readable storage medium of claim 18 further comprising:
instructions for receiving a second message from the mobile computing device including a response from the first user regarding a rejection of the first recommendation;
instructions for analyzing the second message to determine a reason for rejection;
instructions for generating a “not-preferred” parameter based on the reason for rejection that is used to identify a set of recommendations that match the reason for rejection;
instructions for performing a revised search using the “not-preferred” parameter to retrieve a plurality of recommendations, the plurality of recommendations excluding the set of recommendations that match the “not-preferred” parameter; and
instructions for sending one of the plurality of recommendations to the first user as a third message to the mobile computing device. 20. The computer-readable storage medium of claim 19 further comprising:
instructions for storing the rejection of the first recommendation and the reason for rejection as part of user habits data of the first user in a storage system associated with the server. 21. The computer-readable storage medium of claim 18, wherein the instructions for receiving the first set of messages from the mobile computing device includes instructions for receiving the first set of messages from the mobile computing device via a messaging service provided by a wireless telecommunications network of the mobile computing device. 22. The computer-readable storage medium of claim 21, wherein the instructions for receiving the first set of messages via the messaging service includes receiving the first set of messages via a short messaging service, and wherein the first set of messages are text messages. 23. The computer-readable storage medium of claim 18, wherein the instructions for receiving the first set of messages from the mobile computing device includes instructions for receiving the first set of messages from the mobile computing device via a social networking application executing at the mobile computing device. 24. The computer-readable storage medium of claim 18, wherein the instructions for deriving at least some of the first set of parameters based on information provided in the first set of messages includes:
instructions for receiving an input from a second user associated with the server regarding a context of the request, and instructions for deriving the at least some of the first set of parameters based on the context. 25. A system, comprising:
a first module to receive, at a server, a first set of messages from a mobile computing device associated with a first user, wherein at least one of the first set of messages contains a request for a recommendation for a service; a second module to send, by the server, a second set of messages to the mobile computing device to elicit information from the first user that is to be used by the server in generating the recommendation, wherein at least some of the first set of messages are responses to the at least some of the second set of messages, and includes information requested by the at least some the second set of messages; a third module to determine, at the server, a context of the request using an artificial intelligence technique, the context including explicit parameters and implicit parameters, which are used for performing a search to generate the recommendation, the third module further configured to determine the context by:
extracting the explicit parameters from the first set of messages, the explicit parameters provided by the first user in the first set of messages,
deriving at least some of the implicit parameters based on the information provided in the first set of messages and/or information received by a second user associated with the server, and
deriving at least some of the implicit parameters based on user habits data of the first user; and
a fourth module to perform, at the server, a search based on the context to retrieve a first recommendation for the service, wherein the second module is further configured to send the first recommendation to the first user as a first message to the mobile computing device. 26. The system of claim 25, wherein the second module is further configured to receive a second message from the mobile computing device including a rejection of the first recommendation, and wherein the fourth module is further configured to perform a revised search for retrieving a plurality of recommendations, the plurality of recommendations excluding a set of recommendations that match with a reason for the rejection. 27. The system of claim 26 further comprising:
a fifth module to store the rejection of the first recommendation and the reason for rejection as part of user habits data of the first user in a storage system associated with the server. 28. The system of claim 25, wherein the first module is configured to receive the first set of messages from the mobile computing device via a messaging service provided by a wireless telecommunications network of the mobile computing device. 29. The system of claim 28, wherein first module is configured to receive the first set of messages via a short messaging service, and wherein the first set of messages are text messages. | 2,100 |
4,664 | 13,595,266 | 2,141 | A visualization system computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components based on control component ontologies and knowledge bases. The visualization system includes an inspection agent configured to communicate with one or more autonomous control components of the manufacturing system to request control component information including a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component and a knowledge base including a listing of current states for the parameters and relations of the control component. The visualization system further includes a visualization editor configured to generate a visualization interface representative of control component information received based on the request and an electronic web server configured to display the visualization interface in response to a received web page request. | 1. A visualization system computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components in a manufacturing system, comprising:
an inspection agent configured to communicate with one or more autonomous control components of the manufacturing system to request control component information including
1) a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component, and
2) a knowledge base including a listing of current states for the parameters and relations of the control component;
a visualization editor configured to generate a visualization interface representative of control component information received based on the request; and an electronic web server configured to display the visualization interface in response to a received web page request. 2. The visualization system of claim 1, wherein the autonomous control components include a process component representative of a production plan for producing an article in the manufacturing system. 3. The visualization system of claim 1, wherein the visualization interface is a scalable vector display graph. 4. The visualization system of claim 1, wherein the visualization interface is configured to receive input from a user modify the displayed control component information. 5. The visualization system of claim 4, wherein received input to modify the displayed control component information is used to modify the control component ontology for at least one autonomous control component. 6. The visualization system of claim 5, wherein the operation of the autonomous control component within the manufacturing system is changed based on the received input. 7. The visualization system of claim 1 wherein the visualization editor is configured to modify the positioning of at least a second autonomous control component in a displayed graph based on received input modifying the control component ontology for a first autonomous control component. 8. The visualization system of claim 1, wherein the knowledge base includes a shop layout for the manufacturing system. 9. The visualization system of claim 1, wherein the visualization interface is configured to display messages transmitted between the autonomous control components based on information in the received knowledge base. 10. The visualization system of claim 1, wherein the control component ontology for a first autonomous control component includes ontology information received from at least a second autonomous control component. 11. A manufacturing control system, comprising:
a plurality of autonomous control components, each component configured to
implement a manufacturing process based on a control component ontology, and
store information describing a current state for the manufacturing control system in a knowledge base;
a visualization interface displaying control component information for the manufacturing system based on information received from the control components including the control component ontology and the knowledge base; and an electronic web server configured to display the visualization interface in response to a received web page request. 12. A computer implemented visualization method implemented by a computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components in a manufacturing system, the method comprising:
requesting control component information from one or more autonomous control components of the manufacturing system including
1) a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component, and
2) a knowledge base including a listing of current states for the parameters and relations of the control component;
generating a visualization interface representative of control component information received based on the request; and transmitting a web page including the visualization interface in response to a received web page request. 13. The visualization method of claim 12, wherein the autonomous control components include a process component representative of a production plan for producing an article in the manufacturing system. 14. The visualization method of claim 12, wherein the visualization interface is a scalable vector display graph. 15. The visualization method of claim 12, wherein the visualization interface is configured to receive input from a user modify the displayed control component information. 16. The visualization method of claim 15, wherein received input to modify the displayed control component information is used to modify the control component ontology for at least one autonomous control component. 17. The visualization method of claim 16, wherein the operation of the autonomous control component within the manufacturing system is changed based on the received input. 18. The visualization method of claim 12, wherein the visualization editor is configured to modify the positioning of at least a second autonomous control component in a displayed graph based on received input modifying the control component ontology for a first autonomous control component. 19. The visualization method of claim 12, wherein the visualization interface is configured to display messages transmitted between the autonomous control components based on information in the received knowledge base. 20. The visualization method of claim 12, wherein the control component ontology for a first autonomous control component includes ontology information received from at least a second autonomous control component. | A visualization system computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components based on control component ontologies and knowledge bases. The visualization system includes an inspection agent configured to communicate with one or more autonomous control components of the manufacturing system to request control component information including a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component and a knowledge base including a listing of current states for the parameters and relations of the control component. The visualization system further includes a visualization editor configured to generate a visualization interface representative of control component information received based on the request and an electronic web server configured to display the visualization interface in response to a received web page request.1. A visualization system computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components in a manufacturing system, comprising:
an inspection agent configured to communicate with one or more autonomous control components of the manufacturing system to request control component information including
1) a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component, and
2) a knowledge base including a listing of current states for the parameters and relations of the control component;
a visualization editor configured to generate a visualization interface representative of control component information received based on the request; and an electronic web server configured to display the visualization interface in response to a received web page request. 2. The visualization system of claim 1, wherein the autonomous control components include a process component representative of a production plan for producing an article in the manufacturing system. 3. The visualization system of claim 1, wherein the visualization interface is a scalable vector display graph. 4. The visualization system of claim 1, wherein the visualization interface is configured to receive input from a user modify the displayed control component information. 5. The visualization system of claim 4, wherein received input to modify the displayed control component information is used to modify the control component ontology for at least one autonomous control component. 6. The visualization system of claim 5, wherein the operation of the autonomous control component within the manufacturing system is changed based on the received input. 7. The visualization system of claim 1 wherein the visualization editor is configured to modify the positioning of at least a second autonomous control component in a displayed graph based on received input modifying the control component ontology for a first autonomous control component. 8. The visualization system of claim 1, wherein the knowledge base includes a shop layout for the manufacturing system. 9. The visualization system of claim 1, wherein the visualization interface is configured to display messages transmitted between the autonomous control components based on information in the received knowledge base. 10. The visualization system of claim 1, wherein the control component ontology for a first autonomous control component includes ontology information received from at least a second autonomous control component. 11. A manufacturing control system, comprising:
a plurality of autonomous control components, each component configured to
implement a manufacturing process based on a control component ontology, and
store information describing a current state for the manufacturing control system in a knowledge base;
a visualization interface displaying control component information for the manufacturing system based on information received from the control components including the control component ontology and the knowledge base; and an electronic web server configured to display the visualization interface in response to a received web page request. 12. A computer implemented visualization method implemented by a computer communicating with a memory to execute a stored program contained in a fixed medium of the memory to display information regarding control components in a manufacturing system, the method comprising:
requesting control component information from one or more autonomous control components of the manufacturing system including
1) a control component ontology including a listing of parameters and relations associated with the control component that define the operating characteristics of the control component, and
2) a knowledge base including a listing of current states for the parameters and relations of the control component;
generating a visualization interface representative of control component information received based on the request; and transmitting a web page including the visualization interface in response to a received web page request. 13. The visualization method of claim 12, wherein the autonomous control components include a process component representative of a production plan for producing an article in the manufacturing system. 14. The visualization method of claim 12, wherein the visualization interface is a scalable vector display graph. 15. The visualization method of claim 12, wherein the visualization interface is configured to receive input from a user modify the displayed control component information. 16. The visualization method of claim 15, wherein received input to modify the displayed control component information is used to modify the control component ontology for at least one autonomous control component. 17. The visualization method of claim 16, wherein the operation of the autonomous control component within the manufacturing system is changed based on the received input. 18. The visualization method of claim 12, wherein the visualization editor is configured to modify the positioning of at least a second autonomous control component in a displayed graph based on received input modifying the control component ontology for a first autonomous control component. 19. The visualization method of claim 12, wherein the visualization interface is configured to display messages transmitted between the autonomous control components based on information in the received knowledge base. 20. The visualization method of claim 12, wherein the control component ontology for a first autonomous control component includes ontology information received from at least a second autonomous control component. | 2,100 |
4,665 | 14,341,165 | 2,119 | A system for producing electrical power based on wind energy is capable of predicting its power output. The system includes a set of wind turbine units, a first plurality of sensors each adapted to sense at least one wind characteristic at some of the wind turbine units, and a second plurality of sensors remotely located. At least one wind characteristic is estimated at the wind turbines not having one of the first plurality of sensors based on sensing by the first plurality of sensors and an estimate of changes in wind characteristic at wind turbine units caused by presence of other wind turbine units. The magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future is predicted based on the estimated wind characteristics and sensed wind characteristics. | 1. A system for producing electrical power, comprising:
a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind; a first plurality of sensors, each sensor of the first plurality of sensors being adapted to sense at least one wind characteristic at a respective wind turbine unit of a proper subset of the set of wind turbine units; a second plurality of sensors, each sensor of the second plurality of sensors being arranged at a distance with respect to each of the wind turbine units in the set of wind turbine units and being adapted to sense at least one wind characteristic at a location at which the sensor is arranged; and a processing unit, wherein the processing unit and first and second plurality of sensors are communicatively coupled such that the processing unit is able to receive sensed wind characteristics from each of the first and second plurality of sensors; the processing unit being adapted to estimate at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units, based on:
the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units; and
an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units;
wherein each sensor of the first plurality of sensors is adapted to sense a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or each sensor of the second plurality of sensors is adapted to sense a plurality of successive values of the at least one wind characteristic at the location at which the sensor is arranged; the processing unit being adapted to predict a magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 2. The system according to claim 1, wherein each wind turbine unit of the set of wind turbine units is arranged at a distance from the other wind turbine units of the set of wind turbine units so as to form an assembly of wind turbine units, wherein the proper subset of the set of wind turbine units includes wind turbine units situated at a periphery of the wind turbine unit assembly. 3. The system according to claim 2, wherein the proper subset of the set of wind turbine units only includes wind turbine units situated at the periphery of the wind turbine unit assembly. 4. A system according to claim 1, further comprising:
a storage unit adapted to store the estimated wind characteristics and/or sensed wind characteristics; wherein the processing unit is adapted to predict the magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future further on basis of stored estimated wind characteristics and/or sensed wind characteristics by means of a machine learning algorithm. 5. The system according to claim 1, further comprising:
a reactive and/or active power compensation unit adapted to compensate output voltage supplied to a power grid to which the system is connected for reactive and/or active power consumption of the set of wind turbine units based on the predicted magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future. 6. The system according to claim 1, wherein the at least one wind characteristic comprises speed and/or direction of the wind and/or occurrence and/or level of turbulence. 7. A method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units; sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units; wherein a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed; based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 8. The method according to claim 7, further comprising:
storing the estimated wind characteristics and/or sensed wind characteristics; and predicting the magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future further on basis of stored estimated wind characteristics and/or sensed wind characteristics by means of a machine learning algorithm. 9. The method according to claim 7, further comprising:
compensating output voltage supplied to a power grid to which the system is connected for reactive and/or active power consumption of the set of wind turbine units based on the predicted magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future. 10. A computer program product adapted to, when executed in a processor unit, perform a method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units; sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units; wherein a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed; based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 11. A computer-readable storage medium on which there is stored a computer program product adapted to, when executed in a processor unit, perform a method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units;
sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units;
wherein of successive values of the at least one wind characteristic the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed;
based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and
predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. | A system for producing electrical power based on wind energy is capable of predicting its power output. The system includes a set of wind turbine units, a first plurality of sensors each adapted to sense at least one wind characteristic at some of the wind turbine units, and a second plurality of sensors remotely located. At least one wind characteristic is estimated at the wind turbines not having one of the first plurality of sensors based on sensing by the first plurality of sensors and an estimate of changes in wind characteristic at wind turbine units caused by presence of other wind turbine units. The magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future is predicted based on the estimated wind characteristics and sensed wind characteristics.1. A system for producing electrical power, comprising:
a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind; a first plurality of sensors, each sensor of the first plurality of sensors being adapted to sense at least one wind characteristic at a respective wind turbine unit of a proper subset of the set of wind turbine units; a second plurality of sensors, each sensor of the second plurality of sensors being arranged at a distance with respect to each of the wind turbine units in the set of wind turbine units and being adapted to sense at least one wind characteristic at a location at which the sensor is arranged; and a processing unit, wherein the processing unit and first and second plurality of sensors are communicatively coupled such that the processing unit is able to receive sensed wind characteristics from each of the first and second plurality of sensors; the processing unit being adapted to estimate at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units, based on:
the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units; and
an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units;
wherein each sensor of the first plurality of sensors is adapted to sense a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or each sensor of the second plurality of sensors is adapted to sense a plurality of successive values of the at least one wind characteristic at the location at which the sensor is arranged; the processing unit being adapted to predict a magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 2. The system according to claim 1, wherein each wind turbine unit of the set of wind turbine units is arranged at a distance from the other wind turbine units of the set of wind turbine units so as to form an assembly of wind turbine units, wherein the proper subset of the set of wind turbine units includes wind turbine units situated at a periphery of the wind turbine unit assembly. 3. The system according to claim 2, wherein the proper subset of the set of wind turbine units only includes wind turbine units situated at the periphery of the wind turbine unit assembly. 4. A system according to claim 1, further comprising:
a storage unit adapted to store the estimated wind characteristics and/or sensed wind characteristics; wherein the processing unit is adapted to predict the magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future further on basis of stored estimated wind characteristics and/or sensed wind characteristics by means of a machine learning algorithm. 5. The system according to claim 1, further comprising:
a reactive and/or active power compensation unit adapted to compensate output voltage supplied to a power grid to which the system is connected for reactive and/or active power consumption of the set of wind turbine units based on the predicted magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future. 6. The system according to claim 1, wherein the at least one wind characteristic comprises speed and/or direction of the wind and/or occurrence and/or level of turbulence. 7. A method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units; sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units; wherein a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed; based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 8. The method according to claim 7, further comprising:
storing the estimated wind characteristics and/or sensed wind characteristics; and predicting the magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future further on basis of stored estimated wind characteristics and/or sensed wind characteristics by means of a machine learning algorithm. 9. The method according to claim 7, further comprising:
compensating output voltage supplied to a power grid to which the system is connected for reactive and/or active power consumption of the set of wind turbine units based on the predicted magnitude of electrical power production by the set of wind turbine units at least at the predefined point in time in the future. 10. A computer program product adapted to, when executed in a processor unit, perform a method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units; sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units; wherein a plurality of successive values of the at least one wind characteristic at the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed; based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. 11. A computer-readable storage medium on which there is stored a computer program product adapted to, when executed in a processor unit, perform a method of predicting a magnitude of electrical power production by a system comprising a set of wind turbine units, each wind turbine unit of the set of wind turbine units being adapted to produce electrical power based on kinetic energy extracted from wind, the method comprising:
sensing at least one wind characteristic at respective wind turbine units of a proper subset of the set of wind turbine units;
sensing at least one wind characteristic at a plurality of locations, each of the plurality of locations being at a distance with respect to each of the wind turbine units in the set of wind turbine units;
wherein of successive values of the at least one wind characteristic the respective wind turbine unit of the proper subset of the set of wind turbine units, and/or a plurality of successive values of the at least one wind characteristic at the respective wind turbine units of the plurality of locations, are sensed;
based on the sensed at least one wind characteristic at the respective wind turbine units of the proper subset of the set of wind turbine units and an estimate of changes in wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units caused by presence of other wind turbine units of the set of wind turbine units, estimating at least one wind characteristic at each wind turbine unit that is not included in the proper subset of the set of wind turbine units; and
predicting the magnitude of electrical power production by the set of wind turbine units at at least one predefined point in time in the future based on the estimated wind characteristics and a statistical measure of a plurality of values of sensed wind characteristics obtained during at least one time period. | 2,100 |
4,666 | 13,803,015 | 2,132 | Apparatuses, systems, and methods for implementing fast resume from hibernate are disclosed. In one embodiment, an apparatus can include a data storage device having a circuit configured to determine a first memory location of hibernation data without receiving an indication of the first memory location from the host, and store the hibernation data to a second memory location of the DSD. | 1. An apparatus comprising:
a data storage device (DSD) including:
a circuit configured to:
determine a first memory location of hibernation data at a first nonvolatile memory in the DSD, without receiving an indication of the first memory location from a host, based on a hibernation partition of the DSD; and
store the hibernation data to a second memory location at a second nonvolatile memory in the DSD. 2. The apparatus of claim 1, further comprising an interface configured to allow the DSD to be physically removed from the host and to receive commands from the host when the interface is coupled to the host. 3. (canceled) 4. The apparatus of claim 1, further comprising the circuit configured to, after the hibernation data has been stored at the second memory location, receive additional hibernation data, and store the additional hibernation data to the second memory location. 5. The apparatus of claim 4, further comprising the second storage location has a faster access time than the first location. 6. The apparatus of claim 5, further comprising the first storage location is a disc data storage medium and the second storage location is a non-volatile solid state storage medium. 7. The apparatus of claim 4, further comprising the additional hibernation data includes an instruction to store data to the first memory location. 8. (canceled) 9. (canceled) 10. The apparatus of claim 1, further comprising a partition identification system including a partition table that identifies a hibernation partition type associated with the hibernation partition. 11. The apparatus of claim 10, further comprising the circuit is configured to:
determine if the partition table has been altered; and when the partition table has been altered, repeat determining a first memory location of hibernation data without receiving an indication of the first memory location from the host. 12. A method comprising:
determining, within a data storage device (DSD) that is removable from a host, a hibernation partition of a first nonvolatile memory location in the DSD without receiving an indication of the first memory location from a host; and storing data intended for the hibernation partition of the first nonvolatile memory to a second nonvolatile memory location of the DSD. 13. (canceled) 14. The method of claim 12, further comprising receiving additional data from the host intended for the first memory location, and updating the hibernation data at the second memory location with the additional data. 15. The method of claim 12, further comprising:
determining if a partition identification record has been altered; and when the partition identification record has been altered, repeating determining the location of the first memory location. 16. The method of claim 12, further comprising selecting a memory storage location for the second memory location that has a faster access time than the first memory location. 17. A device comprising:
a first nonvolatile memory; a second nonvolatile memory having at least one different property than the first memory; a controller configured to:
determine a first data storage location of hibernation data intended to be stored to a hibernation partition at the first nonvolatile memory without receiving an indication of the first data storage location from a host; and
store the hibernation data to a second data storage location of the second nonvolatile memory. 18. The device of claim 17 further comprising the at least one different property is an access speed of the second nonvolatile memory compared to an access speed of the first nonvolatile memory. 19. The device of claim 17 further comprising the at least one different property is a reliability of the second nonvolatile memory compared to a reliability of the first nonvolatile memory. 20. The device of claim 17 further comprising:
an interface configured to receive commands and data from a host, and also configured to allow the device to be separated from the host; and
the controller further configured to
receive additional hibernation data and store the additional hibernation data to the second data storage location. | Apparatuses, systems, and methods for implementing fast resume from hibernate are disclosed. In one embodiment, an apparatus can include a data storage device having a circuit configured to determine a first memory location of hibernation data without receiving an indication of the first memory location from the host, and store the hibernation data to a second memory location of the DSD.1. An apparatus comprising:
a data storage device (DSD) including:
a circuit configured to:
determine a first memory location of hibernation data at a first nonvolatile memory in the DSD, without receiving an indication of the first memory location from a host, based on a hibernation partition of the DSD; and
store the hibernation data to a second memory location at a second nonvolatile memory in the DSD. 2. The apparatus of claim 1, further comprising an interface configured to allow the DSD to be physically removed from the host and to receive commands from the host when the interface is coupled to the host. 3. (canceled) 4. The apparatus of claim 1, further comprising the circuit configured to, after the hibernation data has been stored at the second memory location, receive additional hibernation data, and store the additional hibernation data to the second memory location. 5. The apparatus of claim 4, further comprising the second storage location has a faster access time than the first location. 6. The apparatus of claim 5, further comprising the first storage location is a disc data storage medium and the second storage location is a non-volatile solid state storage medium. 7. The apparatus of claim 4, further comprising the additional hibernation data includes an instruction to store data to the first memory location. 8. (canceled) 9. (canceled) 10. The apparatus of claim 1, further comprising a partition identification system including a partition table that identifies a hibernation partition type associated with the hibernation partition. 11. The apparatus of claim 10, further comprising the circuit is configured to:
determine if the partition table has been altered; and when the partition table has been altered, repeat determining a first memory location of hibernation data without receiving an indication of the first memory location from the host. 12. A method comprising:
determining, within a data storage device (DSD) that is removable from a host, a hibernation partition of a first nonvolatile memory location in the DSD without receiving an indication of the first memory location from a host; and storing data intended for the hibernation partition of the first nonvolatile memory to a second nonvolatile memory location of the DSD. 13. (canceled) 14. The method of claim 12, further comprising receiving additional data from the host intended for the first memory location, and updating the hibernation data at the second memory location with the additional data. 15. The method of claim 12, further comprising:
determining if a partition identification record has been altered; and when the partition identification record has been altered, repeating determining the location of the first memory location. 16. The method of claim 12, further comprising selecting a memory storage location for the second memory location that has a faster access time than the first memory location. 17. A device comprising:
a first nonvolatile memory; a second nonvolatile memory having at least one different property than the first memory; a controller configured to:
determine a first data storage location of hibernation data intended to be stored to a hibernation partition at the first nonvolatile memory without receiving an indication of the first data storage location from a host; and
store the hibernation data to a second data storage location of the second nonvolatile memory. 18. The device of claim 17 further comprising the at least one different property is an access speed of the second nonvolatile memory compared to an access speed of the first nonvolatile memory. 19. The device of claim 17 further comprising the at least one different property is a reliability of the second nonvolatile memory compared to a reliability of the first nonvolatile memory. 20. The device of claim 17 further comprising:
an interface configured to receive commands and data from a host, and also configured to allow the device to be separated from the host; and
the controller further configured to
receive additional hibernation data and store the additional hibernation data to the second data storage location. | 2,100 |
4,667 | 14,865,955 | 2,185 | A system for sharing input/output using universal sleds includes a first universal sled that includes a first switch and a first universal node, and a second universal sled that includes a second switch and a second universal node, where the first universal sled and second universal sled have interchangeable physical dimensions. The midplane board includes a management processor and a midplane switch. The system further includes an input/output sled and a bus that connects the first universal sled, the second universal sled, the midplane board, and the input/output sled. | 1. A system for sharing input/output by universal sleds, comprising:
a first universal sled comprising a first switch and a first universal node; a second universal sled comprising a second switch and a second universal node, wherein the first universal sled and second universal sled have interchangeable physical dimensions; a midplane board comprising a management processor and a midplane switch; an input/output sled; and a bus connecting the first universal sled, the second universal sled, the midplane board, and the input/output sled. 2. The system of claim 1, wherein the first universal sled and second universal sled have equivalent communication ports at equivalent locations. 3. The system of claim 1, wherein the midplane switch is a top-of-rack network switch that supports data virtualization. 4. The system of claim 1, wherein the management processor is configured to initialize the midplane switch for routing, sharing, and virtualization of input/output signals. 5. The system of claim 1, wherein the first switch, the second switch, and the midplane switch are peripheral component interconnect express switches. 6. The system of claim 1, wherein the bus is a peripheral component interconnect express bus. 7. The system of claim 1, wherein the first universal node is a compute node comprising a system on chip. 8. The system of claim 1, wherein the first universal node is a compute node comprising a central processing unit. 9. The system of claim 1, wherein the first universal node is a storage node comprising a solid state drive. 10. The system of claim 1, wherein the first universal node is a storage node comprising a hard disk drive. 11. The system of claim 1, further comprising a power supply unit connected to the midplane board. 12. The system of claim 1, wherein the midplane switch is connected to at least one fan. 13. A method for sharing input/output by universal sleds, comprising:
communicating input/output between a first universal sled and a midplane board using a bus, wherein the first universal sled comprises a first switch and a first universal node; communicating input/output between a second universal sled and the midplane board using the bus, wherein the first universal sled and second universal sled have interchangeable physical dimensions; and communicating input/output between the midplane board and a input/output sled, wherein the midplane board comprises a management processor and a midplane switch. 14. The method of claim 13, wherein the first universal sled and second universal sled have equivalent communication ports at equivalent locations. 15. The method of claim 13, wherein the bus is a peripheral component interconnect express bus. 16. The method of claim 13, wherein the first universal node is a compute node comprising a system on chip. 17. The method of claim 13, wherein the first universal node is a compute node comprising a central processing unit. 18. A method for sharing input/output by universal sleds, comprising:
connecting a first universal sled, comprising a first switch and a first universal node, to a bus; connecting a second universal sled, comprising a second switch and a second universal node, to the bus, wherein the first universal sled and second universal sled have interchangeable physical dimensions; connecting a midplane board, comprising a management processor and a midplane switch, to the bus; and connecting an input/output sled to the midplane board. 19. The method of claim 18, further comprising connecting a power supply unit to the midplane board. 20. The method of claim 18, further comprising connecting the midplane switch to at least one fan. | A system for sharing input/output using universal sleds includes a first universal sled that includes a first switch and a first universal node, and a second universal sled that includes a second switch and a second universal node, where the first universal sled and second universal sled have interchangeable physical dimensions. The midplane board includes a management processor and a midplane switch. The system further includes an input/output sled and a bus that connects the first universal sled, the second universal sled, the midplane board, and the input/output sled.1. A system for sharing input/output by universal sleds, comprising:
a first universal sled comprising a first switch and a first universal node; a second universal sled comprising a second switch and a second universal node, wherein the first universal sled and second universal sled have interchangeable physical dimensions; a midplane board comprising a management processor and a midplane switch; an input/output sled; and a bus connecting the first universal sled, the second universal sled, the midplane board, and the input/output sled. 2. The system of claim 1, wherein the first universal sled and second universal sled have equivalent communication ports at equivalent locations. 3. The system of claim 1, wherein the midplane switch is a top-of-rack network switch that supports data virtualization. 4. The system of claim 1, wherein the management processor is configured to initialize the midplane switch for routing, sharing, and virtualization of input/output signals. 5. The system of claim 1, wherein the first switch, the second switch, and the midplane switch are peripheral component interconnect express switches. 6. The system of claim 1, wherein the bus is a peripheral component interconnect express bus. 7. The system of claim 1, wherein the first universal node is a compute node comprising a system on chip. 8. The system of claim 1, wherein the first universal node is a compute node comprising a central processing unit. 9. The system of claim 1, wherein the first universal node is a storage node comprising a solid state drive. 10. The system of claim 1, wherein the first universal node is a storage node comprising a hard disk drive. 11. The system of claim 1, further comprising a power supply unit connected to the midplane board. 12. The system of claim 1, wherein the midplane switch is connected to at least one fan. 13. A method for sharing input/output by universal sleds, comprising:
communicating input/output between a first universal sled and a midplane board using a bus, wherein the first universal sled comprises a first switch and a first universal node; communicating input/output between a second universal sled and the midplane board using the bus, wherein the first universal sled and second universal sled have interchangeable physical dimensions; and communicating input/output between the midplane board and a input/output sled, wherein the midplane board comprises a management processor and a midplane switch. 14. The method of claim 13, wherein the first universal sled and second universal sled have equivalent communication ports at equivalent locations. 15. The method of claim 13, wherein the bus is a peripheral component interconnect express bus. 16. The method of claim 13, wherein the first universal node is a compute node comprising a system on chip. 17. The method of claim 13, wherein the first universal node is a compute node comprising a central processing unit. 18. A method for sharing input/output by universal sleds, comprising:
connecting a first universal sled, comprising a first switch and a first universal node, to a bus; connecting a second universal sled, comprising a second switch and a second universal node, to the bus, wherein the first universal sled and second universal sled have interchangeable physical dimensions; connecting a midplane board, comprising a management processor and a midplane switch, to the bus; and connecting an input/output sled to the midplane board. 19. The method of claim 18, further comprising connecting a power supply unit to the midplane board. 20. The method of claim 18, further comprising connecting the midplane switch to at least one fan. | 2,100 |
4,668 | 13,921,834 | 2,169 | The present invention refers to a system, a method and product for automatically identifying quality defects in configuration parameters of a database system and for automatically correcting them according to predefined quality procedures. The method is executed on a central server ( 12 ) and on several satellite systems ( 10 ) as well. The method may be integral part of an enterprise resource planning system. | 1. In an enterprise resource planning (ERP) system, a computer system for transferring a database system with a central server and at least one satellite system in a secure and stable configuration state, comprising:
At least one central server and at least one satellite system with an engine for measuring a plurality of configuration parameters and for executing generated correction instructions a database internal network connection between the central server and the satellite systems, wherein the central server comprises:
A measurement input interface for measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters
A test input interface for receiving test data
An analyzer for centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects
A correction module for transferring the database system in a secure and stable configuration state by automatically generating correction instructions for correcting configuration parameters to be executed on the respective satellite,
wherein the measurement input interface, the analyzer and the correction module exchange data by the database internal interface (API). 2. Non-transitory computer program stored on a computer readable medium storing instructions for controlling operations of a computing device, wherein said instructions enable the computing device to transfer an enterprise resource planning (ERP) system as a database system with a central server and at least one satellite system in a secure and stable configuration state by performing processes comprising:
Measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters Providing a test input interface for receiving test data, Centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects and in case of at least one identified configuration quality defect:
Transferring the database system in a secure and stable configuration state by automatically generating correction instructions for correcting configuration parameters to be executed on the respective satellite
wherein the method is executed as integral part of the database system. 3. In an enterprise resource planning (ERP) system, a computer implemented method for transferring a database system with a central server and at least one satellite system in a secure and stable configuration state, comprising the steps of:
Measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters Providing a test input interface for receiving test data, Centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects and in case of at least one identified configuration quality defect:
Transferring the database system in a secure and stable configuration state by automatically generating correction instructions based on the identified configuration quality defect for correcting configuration parameters to be executed on the respective satellite
wherein the method is executed as integral part of the database system. 4. The computer implemented method according to claim 3, wherein the test data comprise a set of pre-defined test cases, which are dynamically adaptable to the specific use case or extendable. 5. The computer implemented method according to claim 3, wherein an intermediate result of the analysis is outputted, wherein the intermediate result comprises a list of findings. 6. The computer implemented method according to claim 3, wherein the method further comprises:
Providing a pre-checking module for evaluating a relevance of a specific test case for a specific satellite. 7. The computer implemented method according to claim 3, wherein the method further comprises:
Providing a post-checking module for identifying and rating interdependency issues that arise in case a combination of different individual findings creates a further problem. 8. The computer implemented method according to claim 3, wherein the test data comprise the tests to be executed, data to customize a test scope and a correction scope and pre-defined criteria, rules and target values for the configuration parameters. 9. The computer implemented method according to claim 3, wherein automatically correcting configuration parameters comprises generating concrete mitigation instructions for the respective configuration parameter to be performed on the satellite system. 10. The computer implemented method according to claim 3, wherein configuration parameters do not relate to custom ABAP code and are selected from the group consisting of:
Network connection parameters SAP graphical user interface parameters Password management parameters Encryption of network communication parameters, comprising SAP protocols and Web Protocols Service parameters Remote function call parameters User authorization parameters System setup parameters Log configuration parameters Operating system configuration parameters SAP security patch parameters. 11. The computer implemented method according to claim 3, wherein the intermediate result may be verified before being automatically executed on the respective satellite. 12. The computer implemented method according to claim 3, wherein the intermediate result may be evaluated and prioritized by a user or automatically based on the pre-defined criteria and rules before transferring the database software system in the secure configuration state. 13. The computer implemented method according to claim 3, wherein data exchange between the central server and the distributed satellites for analyzing and automatically correcting the configuration state is integrated in the database system, particularly in a standardized transport management system. 14. The computer implemented method according to claim 3, wherein a result of the secure configuration state transformation is outputted. 15. The computer implemented method according to claim 3, wherein a result of the secure configuration state transformation is sent as a result message to defined recipients. 16. The computer implemented method according to claim 3, wherein all processes with respect to the secure configuration state transformation are logged in at least one log file. 17. The computer implemented method according to claim 3, wherein the secure configuration state transformation or a result of the secure configuration state transformation is administered in a central monitoring module. 18. The computer implemented method according to claim 3, wherein the secure configuration state transformation or a result of the secure configuration state transformation is evaluated in a monitoring module. 19. The computer implemented method according to claim 3, wherein the result comprises a text file for manual correction instructions. 20. The computer implemented method according to claim 3, wherein identifiable quality defects are selected from the group consisting of:
Critical, inconsistent or incorrect configuration parameters, particularly critical configuration profile parameters or configuration parameters with respect to authorizations of users for specific functionalities and/or access to specific data; Critical interdependencies between individual configuration Configuration parameters negatively affecting security of the database software system Configuration parameters leading to a performance reduction lower than a pre-determined lower performance threshold; Configuration parameters affecting robustness of the database software system and Configuration parameters affecting maintenance of the database software system. 21. The computer implemented method according to claim 3, wherein measuring the plurality of configuration parameters is executed by processes selected from the group consisting of: reading out configuration parameters out of the main memory, using at least one application program interface (API) and using a communication protocol of an SAP system. 22. The computer implemented method according to claim 3, wherein the database is an SAP database and the method is integrated in the SAP system and uses SAP database infrastructure. 23. The computer implemented method according to claim 3, wherein the method interacts with a middleware platform, particularly with a SAP NetWeaver Platform. 24. The computer implemented method according to claim 3, wherein the method is implemented in ABAP or in Java. | The present invention refers to a system, a method and product for automatically identifying quality defects in configuration parameters of a database system and for automatically correcting them according to predefined quality procedures. The method is executed on a central server ( 12 ) and on several satellite systems ( 10 ) as well. The method may be integral part of an enterprise resource planning system.1. In an enterprise resource planning (ERP) system, a computer system for transferring a database system with a central server and at least one satellite system in a secure and stable configuration state, comprising:
At least one central server and at least one satellite system with an engine for measuring a plurality of configuration parameters and for executing generated correction instructions a database internal network connection between the central server and the satellite systems, wherein the central server comprises:
A measurement input interface for measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters
A test input interface for receiving test data
An analyzer for centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects
A correction module for transferring the database system in a secure and stable configuration state by automatically generating correction instructions for correcting configuration parameters to be executed on the respective satellite,
wherein the measurement input interface, the analyzer and the correction module exchange data by the database internal interface (API). 2. Non-transitory computer program stored on a computer readable medium storing instructions for controlling operations of a computing device, wherein said instructions enable the computing device to transfer an enterprise resource planning (ERP) system as a database system with a central server and at least one satellite system in a secure and stable configuration state by performing processes comprising:
Measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters Providing a test input interface for receiving test data, Centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects and in case of at least one identified configuration quality defect:
Transferring the database system in a secure and stable configuration state by automatically generating correction instructions for correcting configuration parameters to be executed on the respective satellite
wherein the method is executed as integral part of the database system. 3. In an enterprise resource planning (ERP) system, a computer implemented method for transferring a database system with a central server and at least one satellite system in a secure and stable configuration state, comprising the steps of:
Measuring a plurality of configuration parameters on the at least one satellite system, wherein the configuration parameters are stored in the database or in at least one configuration file or are measured online, and are accessed centrally by means of database internal interfaces (API) for consolidating the measured configuration parameters Providing a test input interface for receiving test data, Centrally analyzing the measured and consolidated configuration parameters with respect to the received test data in order to identify and rank configuration quality defects and in case of at least one identified configuration quality defect:
Transferring the database system in a secure and stable configuration state by automatically generating correction instructions based on the identified configuration quality defect for correcting configuration parameters to be executed on the respective satellite
wherein the method is executed as integral part of the database system. 4. The computer implemented method according to claim 3, wherein the test data comprise a set of pre-defined test cases, which are dynamically adaptable to the specific use case or extendable. 5. The computer implemented method according to claim 3, wherein an intermediate result of the analysis is outputted, wherein the intermediate result comprises a list of findings. 6. The computer implemented method according to claim 3, wherein the method further comprises:
Providing a pre-checking module for evaluating a relevance of a specific test case for a specific satellite. 7. The computer implemented method according to claim 3, wherein the method further comprises:
Providing a post-checking module for identifying and rating interdependency issues that arise in case a combination of different individual findings creates a further problem. 8. The computer implemented method according to claim 3, wherein the test data comprise the tests to be executed, data to customize a test scope and a correction scope and pre-defined criteria, rules and target values for the configuration parameters. 9. The computer implemented method according to claim 3, wherein automatically correcting configuration parameters comprises generating concrete mitigation instructions for the respective configuration parameter to be performed on the satellite system. 10. The computer implemented method according to claim 3, wherein configuration parameters do not relate to custom ABAP code and are selected from the group consisting of:
Network connection parameters SAP graphical user interface parameters Password management parameters Encryption of network communication parameters, comprising SAP protocols and Web Protocols Service parameters Remote function call parameters User authorization parameters System setup parameters Log configuration parameters Operating system configuration parameters SAP security patch parameters. 11. The computer implemented method according to claim 3, wherein the intermediate result may be verified before being automatically executed on the respective satellite. 12. The computer implemented method according to claim 3, wherein the intermediate result may be evaluated and prioritized by a user or automatically based on the pre-defined criteria and rules before transferring the database software system in the secure configuration state. 13. The computer implemented method according to claim 3, wherein data exchange between the central server and the distributed satellites for analyzing and automatically correcting the configuration state is integrated in the database system, particularly in a standardized transport management system. 14. The computer implemented method according to claim 3, wherein a result of the secure configuration state transformation is outputted. 15. The computer implemented method according to claim 3, wherein a result of the secure configuration state transformation is sent as a result message to defined recipients. 16. The computer implemented method according to claim 3, wherein all processes with respect to the secure configuration state transformation are logged in at least one log file. 17. The computer implemented method according to claim 3, wherein the secure configuration state transformation or a result of the secure configuration state transformation is administered in a central monitoring module. 18. The computer implemented method according to claim 3, wherein the secure configuration state transformation or a result of the secure configuration state transformation is evaluated in a monitoring module. 19. The computer implemented method according to claim 3, wherein the result comprises a text file for manual correction instructions. 20. The computer implemented method according to claim 3, wherein identifiable quality defects are selected from the group consisting of:
Critical, inconsistent or incorrect configuration parameters, particularly critical configuration profile parameters or configuration parameters with respect to authorizations of users for specific functionalities and/or access to specific data; Critical interdependencies between individual configuration Configuration parameters negatively affecting security of the database software system Configuration parameters leading to a performance reduction lower than a pre-determined lower performance threshold; Configuration parameters affecting robustness of the database software system and Configuration parameters affecting maintenance of the database software system. 21. The computer implemented method according to claim 3, wherein measuring the plurality of configuration parameters is executed by processes selected from the group consisting of: reading out configuration parameters out of the main memory, using at least one application program interface (API) and using a communication protocol of an SAP system. 22. The computer implemented method according to claim 3, wherein the database is an SAP database and the method is integrated in the SAP system and uses SAP database infrastructure. 23. The computer implemented method according to claim 3, wherein the method interacts with a middleware platform, particularly with a SAP NetWeaver Platform. 24. The computer implemented method according to claim 3, wherein the method is implemented in ABAP or in Java. | 2,100 |
4,669 | 14,508,264 | 2,158 | Systems and methods facilitate a search and identify documents and associated metadata reflecting content of the documents. In one implementation, a method receives a query comprising a set of search terms, identifies a stored document in response to the query, and determines a score value for the retrieved document based on a similarity between one or more of the query search terms and metadata associated with the identified document. The method locates the identified document in a citation network of baseline query results, the citation network comprising a first set of documents that cite to the identified document and a second set of documents cited to by the identified document. The method further determines a new score value of the identified document as a function of the score value and a quantity and a quality of documents within the first and second set of documents. | 1. A computerized method for calculating a normalized activity score value to rank an identified document, the method comprising:
determining a number of times an identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function; storing in computer memory a ranking of the identified document based on the activity score value; and outputting on a display device, a report reflecting the ranking of the identified document. 2. The method of claim 1, further comprising weighting the activity score value by an age of the identified document. 3. The method of claim 1, wherein the subject matter community comprises a jurisdiction of a legal community. 4. The method of claim 1, wherein the calculating the activity score further comprises:
generating an activity score vector; calculating an individual activity score value for dimensions of the activity score vector, wherein at least one of the dimensions is associated with the number of times the identified document was cited in a subject matter community of the identified document; weighing at least one of the individual activity score values by an age of the identified document; and adding the individual activity score values to obtain a total activity score value. 5. The method of claim 4, wherein the dimensions of the activity score vector comprise at least one of U.S. Supreme Court cites, law review articles, treatises, signal, or treatment in addition to the dimension associated with the number of times the identified document was cited in a subject matter community of the identified document. 6. The method of claim 1, wherein the activity score value of the identified document is normalized in relation to other documents in the subject matter community. 7. A non-transitory computer-readable medium comprising program instructions, which, when executed by a processor, cause the processor to perform a method for calculating a normalized activity score to rank an identified document, the method comprising:
identifying a stored document; determining a number of times the identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function; storing in computer memory a ranking of the identified document based on the activity score value; and outputting on a display device, a report reflecting the ranking of the identified document. 8. The non-transitory computer-readable medium of claim 7, the method further comprising weighing the activity score value by an age of the identified document. 9. The non-transitory computer-readable medium of claim 7, wherein the subject matter community comprises a jurisdiction of a legal community. 10. The non-transitory computer-readable medium of claim 9, wherein the calculating the activity score further comprises:
generating an activity score vector; calculating an individual activity score value for dimensions of the activity score vector, wherein at least one of the dimensions is associated with the number of times the identified document was cited in a subject matter community of the identified document; weighing at least one of the individual activity score values by an age of the identified document; and adding the individual activity score values to obtain a total activity score value. 11. The non-transitory computer-readable medium of claim 10, wherein the dimensions of the activity score vector comprise at least one of U.S. Supreme Court cites, law review articles, treatises, signal, or treatment in addition to the dimension associated with the number of times the identified document was cited in a subject matter community of the identified document. 12. The non-transitory computer-readable medium of claim 10, wherein the activity score value of the identified document is normalized in relation to other documents in the subject matter community. | Systems and methods facilitate a search and identify documents and associated metadata reflecting content of the documents. In one implementation, a method receives a query comprising a set of search terms, identifies a stored document in response to the query, and determines a score value for the retrieved document based on a similarity between one or more of the query search terms and metadata associated with the identified document. The method locates the identified document in a citation network of baseline query results, the citation network comprising a first set of documents that cite to the identified document and a second set of documents cited to by the identified document. The method further determines a new score value of the identified document as a function of the score value and a quantity and a quality of documents within the first and second set of documents.1. A computerized method for calculating a normalized activity score value to rank an identified document, the method comprising:
determining a number of times an identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function; storing in computer memory a ranking of the identified document based on the activity score value; and outputting on a display device, a report reflecting the ranking of the identified document. 2. The method of claim 1, further comprising weighting the activity score value by an age of the identified document. 3. The method of claim 1, wherein the subject matter community comprises a jurisdiction of a legal community. 4. The method of claim 1, wherein the calculating the activity score further comprises:
generating an activity score vector; calculating an individual activity score value for dimensions of the activity score vector, wherein at least one of the dimensions is associated with the number of times the identified document was cited in a subject matter community of the identified document; weighing at least one of the individual activity score values by an age of the identified document; and adding the individual activity score values to obtain a total activity score value. 5. The method of claim 4, wherein the dimensions of the activity score vector comprise at least one of U.S. Supreme Court cites, law review articles, treatises, signal, or treatment in addition to the dimension associated with the number of times the identified document was cited in a subject matter community of the identified document. 6. The method of claim 1, wherein the activity score value of the identified document is normalized in relation to other documents in the subject matter community. 7. A non-transitory computer-readable medium comprising program instructions, which, when executed by a processor, cause the processor to perform a method for calculating a normalized activity score to rank an identified document, the method comprising:
identifying a stored document; determining a number of times the identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function; storing in computer memory a ranking of the identified document based on the activity score value; and outputting on a display device, a report reflecting the ranking of the identified document. 8. The non-transitory computer-readable medium of claim 7, the method further comprising weighing the activity score value by an age of the identified document. 9. The non-transitory computer-readable medium of claim 7, wherein the subject matter community comprises a jurisdiction of a legal community. 10. The non-transitory computer-readable medium of claim 9, wherein the calculating the activity score further comprises:
generating an activity score vector; calculating an individual activity score value for dimensions of the activity score vector, wherein at least one of the dimensions is associated with the number of times the identified document was cited in a subject matter community of the identified document; weighing at least one of the individual activity score values by an age of the identified document; and adding the individual activity score values to obtain a total activity score value. 11. The non-transitory computer-readable medium of claim 10, wherein the dimensions of the activity score vector comprise at least one of U.S. Supreme Court cites, law review articles, treatises, signal, or treatment in addition to the dimension associated with the number of times the identified document was cited in a subject matter community of the identified document. 12. The non-transitory computer-readable medium of claim 10, wherein the activity score value of the identified document is normalized in relation to other documents in the subject matter community. | 2,100 |
4,670 | 12,907,986 | 2,143 | Providing a bridge interface for managing virtual workspaces is disclosed. A plurality of workspace images is presented in a user interface, each workspace image corresponding to a different virtual workspace available to a user of a computer system. A user input is received indicating a selection of a presented workspace image. The user interface is updated to display a plurality of application windows associated with the selected virtual workspace. The displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. | 1. A method performed by one or more processors executing on a computer system, the method comprising:
presenting a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system; receiving user input indicating a selection of a presented workspace image; and updating the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 2. The method of claim 1 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 3. The method of claim 1 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 4. The method of claim 3 wherein the common functionality of the different applications in a given cluster comprises at least one of word processing, electronic mail, web browsing, file browsing, system utility, spreadsheet manipulation, drawing, digital photo manipulation, system utility, and instant messaging. 5. The method of claim 1 further comprising displaying a common characteristic indicator for each cluster. 6. The method of claim 5 wherein the common characteristic indicator comprises a visual representation of an identity of an application that represents the common characteristic. 7. The method of claim 5 wherein the common characteristic indicator comprises a visual representation of a functionality that represents the common characteristic. 8. The method of claim 1 wherein each of a plurality of clusters is displayed such that no window of any cluster overlaps with any other window of any other cluster. 9. A computer program product tangibly embodied in a computer-readable storage medium, the computer program product including instructions that, when executed, generate on a display device a graphical user interface for presenting virtual workspaces and perform the following operations:
present a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system; receive user input indicating a selection of a presented workspace image; and update the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 10. The computer program product of claim 9 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 11. The computer program product of claim 9 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 12. The computer program product of claim 11 wherein the common functionality of the different applications in a given cluster comprises at least one of word processing, electronic mail, web browsing, file browsing, system utility, spreadsheet manipulation, drawing, digital photo manipulation, system utility, and instant messaging. 13. The computer program product of claim 9 further comprising displaying a common characteristic indicator for each cluster. 14. The computer program product of claim 13 wherein the common characteristic indicator comprises a visual representation of an identity of an application that represents the common characteristic. 15. The computer program product of claim 13 wherein the common characteristic indicator comprises a visual representation of a functionality that represents the common characteristic. 16. The computer program product of claim 9 wherein each of a plurality of clusters is displayed such that no window of any cluster overlaps with any other window of any other cluster. 17. A system comprising:
a display device; a computing device in communication with the display device, wherein the computing device is configured to perform at least the following:
present a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system;
receive user input indicating a selection of a presented workspace image; and update the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 18. The system of claim 17 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 19. The system of claim 17 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 20. The system of claim 17 further comprising displaying a common characteristic indicator for each cluster. | Providing a bridge interface for managing virtual workspaces is disclosed. A plurality of workspace images is presented in a user interface, each workspace image corresponding to a different virtual workspace available to a user of a computer system. A user input is received indicating a selection of a presented workspace image. The user interface is updated to display a plurality of application windows associated with the selected virtual workspace. The displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic.1. A method performed by one or more processors executing on a computer system, the method comprising:
presenting a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system; receiving user input indicating a selection of a presented workspace image; and updating the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 2. The method of claim 1 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 3. The method of claim 1 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 4. The method of claim 3 wherein the common functionality of the different applications in a given cluster comprises at least one of word processing, electronic mail, web browsing, file browsing, system utility, spreadsheet manipulation, drawing, digital photo manipulation, system utility, and instant messaging. 5. The method of claim 1 further comprising displaying a common characteristic indicator for each cluster. 6. The method of claim 5 wherein the common characteristic indicator comprises a visual representation of an identity of an application that represents the common characteristic. 7. The method of claim 5 wherein the common characteristic indicator comprises a visual representation of a functionality that represents the common characteristic. 8. The method of claim 1 wherein each of a plurality of clusters is displayed such that no window of any cluster overlaps with any other window of any other cluster. 9. A computer program product tangibly embodied in a computer-readable storage medium, the computer program product including instructions that, when executed, generate on a display device a graphical user interface for presenting virtual workspaces and perform the following operations:
present a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system; receive user input indicating a selection of a presented workspace image; and update the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 10. The computer program product of claim 9 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 11. The computer program product of claim 9 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 12. The computer program product of claim 11 wherein the common functionality of the different applications in a given cluster comprises at least one of word processing, electronic mail, web browsing, file browsing, system utility, spreadsheet manipulation, drawing, digital photo manipulation, system utility, and instant messaging. 13. The computer program product of claim 9 further comprising displaying a common characteristic indicator for each cluster. 14. The computer program product of claim 13 wherein the common characteristic indicator comprises a visual representation of an identity of an application that represents the common characteristic. 15. The computer program product of claim 13 wherein the common characteristic indicator comprises a visual representation of a functionality that represents the common characteristic. 16. The computer program product of claim 9 wherein each of a plurality of clusters is displayed such that no window of any cluster overlaps with any other window of any other cluster. 17. A system comprising:
a display device; a computing device in communication with the display device, wherein the computing device is configured to perform at least the following:
present a plurality of workspace images in a user interface, each workspace image corresponding to a different virtual workspace available to a user of the computer system;
receive user input indicating a selection of a presented workspace image; and update the user interface to display a plurality of application windows associated with the selected virtual workspace, wherein the displayed application windows are visually grouped into one or more clusters, each cluster corresponding to one or more application windows sharing a common characteristic. 18. The system of claim 17 wherein the shared common characteristic of at least one application windows cluster is that the application windows are different instances of a same application. 19. The system of claim 17 wherein the shared common characteristic of at least one applications windows cluster is that the applications windows are instances of different applications that share at least some common functionality. 20. The system of claim 17 further comprising displaying a common characteristic indicator for each cluster. | 2,100 |
4,671 | 13,375,824 | 2,118 | The invention relates to an electrical power distribution apparatus ( 100 ) connectible to one or more loads ( 119 ). The electrical power distribution apparatus ( 100 ) comprises inter alia one or more taps ( 112 ) for supplying the loads ( 119 ) with electrical power. On top of circuit breakers ( 108 ) to switch off the power supply in order to protect the loads against damage, there is also arranged a second layer of soft fuse switches ( 110 ) which are arranged to switch on or off the power supply at the taps ( 112 ) to control distribution of the power. The soft fuses ( 110 ) operate in dependence on and in response to commands issued from a controller ( 105 ) which in turn operates and issues those commands in response to and independence on the voltages and amperages monitored at those taps ( 112 ) by way of a monitoring module ( 111 ). Switching on/off occurs at amperage and voltages lower than the critical threshold values to which the circuit breakers ( 108 ) respond to. | 1. An electrical power distribution apparatus connectable to one or more loads, the apparatus comprising:
A mains transformer having a mains input for receiving electrical power to be distributed to one or more loads; one or more taps for supplying the loads with the electrical power so received; one or more circuit breakers operative to switch off the power supply at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage; a monitoring module arranged to monitor the voltage or amperage at the one or more loads; a programmable control module arranged to issue control commands in response to and in dependence on the monitored voltage or amperage; one more programmable fuses arranged to switch on or off in response to the issued control commands the supplied power at the one or more taps, the switching on or off the fuses occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. 2. The apparatus according to claim 1, wherein the control module or the fuses are programmable or re-programmable during operation of the power distribution apparatus. 3. The apparatus according to claim 1, wherein the fuses are programmable to change the switching time of the fuse or a time-current characteristic of the fuse. 4. The apparatus according to claim 1, wherein the monitoring module is further arranged to monitor the voltage or amperage at the mains input. 5. The apparatus according to claim 1, wherein one or more taps are arranged in groups, each one of the groups of taps being supplied with a group specific amount of electrical power, the specific amount of power corresponding to the power requirements of the loads connectable to the taps within any one of the groups of taps. 6. The apparatus according to claim 5, wherein the control module has a distributed architecture, comprising:
a master module arranged to control the group specific supply of the electric power from the main transformer to the groups of taps; one or more slave control modules each associated with one of the groups of the taps, the slave control modules arranged to switch on or off the fuses of the taps within the associated group of taps. 7. The apparatus according to claim 6, wherein the one or more slave control modules are arranged to receive configuration commands from the master control, the commands so received being suitable to re-program any one of the slave modules or to re-program any one of the fuses associated with any one of the one or more slave controllers. 8. The apparatus according to claim 1, further comprising an uninterruptible back-up power supply (UPS) suitable to supply mission critical ones of the one or more loads with electrical power in the event the apparatus, when in use, no longer receives electrical power at the mains input. 9. The apparatus according to claim 8, wherein, if the back-up power supply approaches a drained state, the fuses are switched off in a prioritized sequence so that mission critical loads having a higher priority are disconnected from the back-up power supply later than mission critical loads having a lower priority. 10. The apparatus according to claim 1, wherein, the loads are medical imaging equipment in a medical facility. 11. The apparatus according to claim 1, wherein the fuse are arranged as solid state switches such as thryistors. 12. The apparatus according to claim 1, wherein the control module is arranged to split a 3-phase power signal at the mains input into three single ones, so as to supply ones of the connectable loads with the single phase power signals so obtained. 13. The apparatus according to claim 12 where, based on the monitored amperages and voltage, the total load connected is load-balanced across the three input phases. 14. A method of distributing electrical power to one or more loads, the method comprising:
switching off power supplied at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage; monitoring a voltage or amperage at the one or more loads; issuing control commands in response to and in dependence on the monitored voltage or amperage; switching on or off in response to the issued control commands the supplied power at the one or more loads, the switching on or off occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. 15. A computer readable medium having stored thereon computer readable instructions suitable to cause a computer to perform the following steps in relation to distributing electrical power to one or more loads:
switching off power supplied at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage;
monitoring a voltage or amperage at the one or more loads;
issuing control commands in response to and in dependence on the monitored voltage or amperage;
switching on or off in response to the issued control commands the supplied power at the one or more taps, the switching on or off occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. | The invention relates to an electrical power distribution apparatus ( 100 ) connectible to one or more loads ( 119 ). The electrical power distribution apparatus ( 100 ) comprises inter alia one or more taps ( 112 ) for supplying the loads ( 119 ) with electrical power. On top of circuit breakers ( 108 ) to switch off the power supply in order to protect the loads against damage, there is also arranged a second layer of soft fuse switches ( 110 ) which are arranged to switch on or off the power supply at the taps ( 112 ) to control distribution of the power. The soft fuses ( 110 ) operate in dependence on and in response to commands issued from a controller ( 105 ) which in turn operates and issues those commands in response to and independence on the voltages and amperages monitored at those taps ( 112 ) by way of a monitoring module ( 111 ). Switching on/off occurs at amperage and voltages lower than the critical threshold values to which the circuit breakers ( 108 ) respond to.1. An electrical power distribution apparatus connectable to one or more loads, the apparatus comprising:
A mains transformer having a mains input for receiving electrical power to be distributed to one or more loads; one or more taps for supplying the loads with the electrical power so received; one or more circuit breakers operative to switch off the power supply at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage; a monitoring module arranged to monitor the voltage or amperage at the one or more loads; a programmable control module arranged to issue control commands in response to and in dependence on the monitored voltage or amperage; one more programmable fuses arranged to switch on or off in response to the issued control commands the supplied power at the one or more taps, the switching on or off the fuses occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. 2. The apparatus according to claim 1, wherein the control module or the fuses are programmable or re-programmable during operation of the power distribution apparatus. 3. The apparatus according to claim 1, wherein the fuses are programmable to change the switching time of the fuse or a time-current characteristic of the fuse. 4. The apparatus according to claim 1, wherein the monitoring module is further arranged to monitor the voltage or amperage at the mains input. 5. The apparatus according to claim 1, wherein one or more taps are arranged in groups, each one of the groups of taps being supplied with a group specific amount of electrical power, the specific amount of power corresponding to the power requirements of the loads connectable to the taps within any one of the groups of taps. 6. The apparatus according to claim 5, wherein the control module has a distributed architecture, comprising:
a master module arranged to control the group specific supply of the electric power from the main transformer to the groups of taps; one or more slave control modules each associated with one of the groups of the taps, the slave control modules arranged to switch on or off the fuses of the taps within the associated group of taps. 7. The apparatus according to claim 6, wherein the one or more slave control modules are arranged to receive configuration commands from the master control, the commands so received being suitable to re-program any one of the slave modules or to re-program any one of the fuses associated with any one of the one or more slave controllers. 8. The apparatus according to claim 1, further comprising an uninterruptible back-up power supply (UPS) suitable to supply mission critical ones of the one or more loads with electrical power in the event the apparatus, when in use, no longer receives electrical power at the mains input. 9. The apparatus according to claim 8, wherein, if the back-up power supply approaches a drained state, the fuses are switched off in a prioritized sequence so that mission critical loads having a higher priority are disconnected from the back-up power supply later than mission critical loads having a lower priority. 10. The apparatus according to claim 1, wherein, the loads are medical imaging equipment in a medical facility. 11. The apparatus according to claim 1, wherein the fuse are arranged as solid state switches such as thryistors. 12. The apparatus according to claim 1, wherein the control module is arranged to split a 3-phase power signal at the mains input into three single ones, so as to supply ones of the connectable loads with the single phase power signals so obtained. 13. The apparatus according to claim 12 where, based on the monitored amperages and voltage, the total load connected is load-balanced across the three input phases. 14. A method of distributing electrical power to one or more loads, the method comprising:
switching off power supplied at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage; monitoring a voltage or amperage at the one or more loads; issuing control commands in response to and in dependence on the monitored voltage or amperage; switching on or off in response to the issued control commands the supplied power at the one or more loads, the switching on or off occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. 15. A computer readable medium having stored thereon computer readable instructions suitable to cause a computer to perform the following steps in relation to distributing electrical power to one or more loads:
switching off power supplied at the one or more loads, if the voltage or amperage associated with the power supplied at the one or more loads exceeds a predetermined critical threshold values, thereby protecting the loads against damage;
monitoring a voltage or amperage at the one or more loads;
issuing control commands in response to and in dependence on the monitored voltage or amperage;
switching on or off in response to the issued control commands the supplied power at the one or more taps, the switching on or off occurring at voltages or amperages lower than the critical threshold value, thereby controlling the distribution of the electrical power throughout the one or more loads. | 2,100 |
4,672 | 14,416,309 | 2,157 | A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities (A, B, C) for storing data objects, includes requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities (A, B, C). The method further includes determining, by the client, a most recent value of the first data object based on the associated timestamps. The method additionally includes performing, by the client, a compare-and-swap procedure, so that the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities (A, B, C). | 1. A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities for storing data objects, the method comprising:
requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities, determining, by the client, a most recent value of the first data object based on the associated timestamps, and performing, by the client, a compare-and-swap procedure, so that)the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities. 2. The method according to claim 1, wherein the method further comprises, before the determining a most recent value of the first data object based on the associated timestamps,
checking whether a second data object with a value with a more recent timestamp than the most recent value of the first data object exists, and, if yes, using the value with the more recent timestamp, and the corresponding more recent timestamp for performing the compare-and-swap procedure. 3. The method according to claim 1, wherein the compare-and-swap procedure returns as a result old content of the first data object. 4. The method according to claim 1, wherein when the first data object is modified after the determining the most recent value of the first data object and before the performing the compare-and-swap procedure, performing the compare-and-swap procedure until at least one of: the first data object is not modified anymore between two consecutive performances of the compare-and-swap procedure, or a quorum of the object storing entities reports values for the first data object whose corresponding timestamps are greater or equal than the timestamp of the determined most recent value of the first data object. 5. The method according to claim 1, wherein during the compare-and-swap procedure, additional responses of object storing entities not associated with the first quorum are included. 6. A system for replicating data in a cloud storage system. supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities for storing data objects, the system comprising:
a client configured to: request values and associated timestamps for a first data object from a first quorum of object storing entities, determine a most recent value of the first data object based on the associated timestamps, and perform a compare-and-swap procedure, so that the determined most recent value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities. | A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities (A, B, C) for storing data objects, includes requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities (A, B, C). The method further includes determining, by the client, a most recent value of the first data object based on the associated timestamps. The method additionally includes performing, by the client, a compare-and-swap procedure, so that the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities (A, B, C).1. A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities for storing data objects, the method comprising:
requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities, determining, by the client, a most recent value of the first data object based on the associated timestamps, and performing, by the client, a compare-and-swap procedure, so that)the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities. 2. The method according to claim 1, wherein the method further comprises, before the determining a most recent value of the first data object based on the associated timestamps,
checking whether a second data object with a value with a more recent timestamp than the most recent value of the first data object exists, and, if yes, using the value with the more recent timestamp, and the corresponding more recent timestamp for performing the compare-and-swap procedure. 3. The method according to claim 1, wherein the compare-and-swap procedure returns as a result old content of the first data object. 4. The method according to claim 1, wherein when the first data object is modified after the determining the most recent value of the first data object and before the performing the compare-and-swap procedure, performing the compare-and-swap procedure until at least one of: the first data object is not modified anymore between two consecutive performances of the compare-and-swap procedure, or a quorum of the object storing entities reports values for the first data object whose corresponding timestamps are greater or equal than the timestamp of the determined most recent value of the first data object. 5. The method according to claim 1, wherein during the compare-and-swap procedure, additional responses of object storing entities not associated with the first quorum are included. 6. A system for replicating data in a cloud storage system. supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities for storing data objects, the system comprising:
a client configured to: request values and associated timestamps for a first data object from a first quorum of object storing entities, determine a most recent value of the first data object based on the associated timestamps, and perform a compare-and-swap procedure, so that the determined most recent value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities. | 2,100 |
4,673 | 14,966,802 | 2,198 | A mechanism is provided in a data processing system to improve ground truth in a question answering cognitive system. The mechanism trains a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model. The question and answer key comprises a list of question and answer specification pairs forming a ground truth for the question answering cognitive system. Each question is a text string and each answer specification references one or more text passages from a corpus of information. Responsive to a search event, the mechanism sends at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model, wherein the text input comprises a given question text string or a given text passage from the question and answer key, and receives from the similar passage cognitive system a response list of references to text passages from the corpus of information. Responsive to an answer acceptance event for at least one text passage from the response list, the mechanism supplements the question and answer key with the at least one text passage to form a supplemented question and answer key. The mechanism trains a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model. | 1. A method, in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to improve ground truth in a question answering cognitive system, the method comprising:
training by the data processing system, a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, sending at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the at least one processor of the data processing system, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receiving from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplementing, by the data processing system, the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and training a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model and executes on the at least one processor of the data processing system. 2. The method of claim 1, further comprising:
responsive to a rejection event for a given text passage from the response list, prompting a user to provide a distinguishing question; creating a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and adding the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 3. The method of claim 1, further comprising:
determining a question and answer specification pair for which the number of text passage references in the answer specification is less than a threshold value; prompting a user to provide at least one additional text passage reference; and amending the answer specification to include the at least one additional text passage reference. 4. The method of claim 1, further comprising:
receiving a question and answer pattern key comprising a list of question and answer pattern pairs; and converting the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 5. The method of claim 1, further comprising:
receiving a factoid question and answer key comprising a list of question and factoid answer specification pairs; and converting the factoid question and answer key to the question and answer key by resolving each factoid answer specification to an answer specification comprising a list of references to one or more text passages from the corpus of information. 6. The method of claim 1, further comprising automatically generating at least one search event upon completion of an ingestion operation that updates the corpus of information. 7. The method of claim 1, further comprising:
invoking at least one search event for at least one text passage of the question and answer key; and populating a user interface with at least one response list received from the at least one search event. 8. The method of claim 7, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text input sent to the search event that returned the response list. 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to improve ground truth in a question answering cognitive system, wherein the computer readable program causes the computing device to:
train, by the computing device, a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, send at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the at least one processor of the computing device, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receive from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplement, by the computing device., the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and train a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model and executes on the at least one processor of the computing device. 10. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
responsive to a rejection event for a given text passage from the response list, prompt a user to provide a distinguishing question; create a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and add the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 11. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 12. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
receive a factoid question and answer key comprising a list of question and factoid answer specification pairs; and convert the factoid question and answer key to the question and answer key by resolving each factoid answer specification to an answer specification comprising a list of references to one or more text passages from the corpus of information. 13. The computer program product of claim 9, wherein the computer readable program further causes the computing device to automatically generate at least one search event upon completion of an ingestion operation that updates the corpus of information. 14. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
invoke at least one search event for at least one text passage of the question and answer key; and populate a user interface with at least one response list received from the at least one search event. 15. The computer program product of claim 14, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text passage sent to the search event that returned the response list. 16. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to improve ground truth in a question answering cognitive system, wherein the instructions causes the processor to: train a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, send at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the processor, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receive from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplement the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and train a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model. 17. The apparatus of claim 16, wherein the instructions further causes the processor to:
responsive to a rejection event for a given text passage from the response list, prompt a user to provide a distinguishing question; create a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and add the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 18. The apparatus of claim 16, wherein the instructions further causes the processor to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 19. The apparatus of claim 16, wherein the instructions further causes the processor to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 20. The apparatus of claim 16, wherein the instructions further causes the processor to automatically generate at least one search event upon completion of an ingestion operation that updates the corpus of information. 21. The apparatus of claim 16, wherein the instructions further causes the processor to:
invoke at least one search event for at least one text passage of the question and answer key; and populate a user interface with at least one response list received from the at least one search event. 22. The apparatus of claim 21, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text passage sent to the search event that returned the response list. | A mechanism is provided in a data processing system to improve ground truth in a question answering cognitive system. The mechanism trains a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model. The question and answer key comprises a list of question and answer specification pairs forming a ground truth for the question answering cognitive system. Each question is a text string and each answer specification references one or more text passages from a corpus of information. Responsive to a search event, the mechanism sends at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model, wherein the text input comprises a given question text string or a given text passage from the question and answer key, and receives from the similar passage cognitive system a response list of references to text passages from the corpus of information. Responsive to an answer acceptance event for at least one text passage from the response list, the mechanism supplements the question and answer key with the at least one text passage to form a supplemented question and answer key. The mechanism trains a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model.1. A method, in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to improve ground truth in a question answering cognitive system, the method comprising:
training by the data processing system, a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, sending at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the at least one processor of the data processing system, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receiving from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplementing, by the data processing system, the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and training a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model and executes on the at least one processor of the data processing system. 2. The method of claim 1, further comprising:
responsive to a rejection event for a given text passage from the response list, prompting a user to provide a distinguishing question; creating a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and adding the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 3. The method of claim 1, further comprising:
determining a question and answer specification pair for which the number of text passage references in the answer specification is less than a threshold value; prompting a user to provide at least one additional text passage reference; and amending the answer specification to include the at least one additional text passage reference. 4. The method of claim 1, further comprising:
receiving a question and answer pattern key comprising a list of question and answer pattern pairs; and converting the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 5. The method of claim 1, further comprising:
receiving a factoid question and answer key comprising a list of question and factoid answer specification pairs; and converting the factoid question and answer key to the question and answer key by resolving each factoid answer specification to an answer specification comprising a list of references to one or more text passages from the corpus of information. 6. The method of claim 1, further comprising automatically generating at least one search event upon completion of an ingestion operation that updates the corpus of information. 7. The method of claim 1, further comprising:
invoking at least one search event for at least one text passage of the question and answer key; and populating a user interface with at least one response list received from the at least one search event. 8. The method of claim 7, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text input sent to the search event that returned the response list. 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to improve ground truth in a question answering cognitive system, wherein the computer readable program causes the computing device to:
train, by the computing device, a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, send at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the at least one processor of the computing device, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receive from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplement, by the computing device., the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and train a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model and executes on the at least one processor of the computing device. 10. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
responsive to a rejection event for a given text passage from the response list, prompt a user to provide a distinguishing question; create a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and add the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 11. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 12. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
receive a factoid question and answer key comprising a list of question and factoid answer specification pairs; and convert the factoid question and answer key to the question and answer key by resolving each factoid answer specification to an answer specification comprising a list of references to one or more text passages from the corpus of information. 13. The computer program product of claim 9, wherein the computer readable program further causes the computing device to automatically generate at least one search event upon completion of an ingestion operation that updates the corpus of information. 14. The computer program product of claim 9, wherein the computer readable program further causes the computing device to:
invoke at least one search event for at least one text passage of the question and answer key; and populate a user interface with at least one response list received from the at least one search event. 15. The computer program product of claim 14, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text passage sent to the search event that returned the response list. 16. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to improve ground truth in a question answering cognitive system, wherein the instructions causes the processor to: train a similar passage machine learning model for a similar passage cognitive system using a question and answer key to form a trained similar passage machine learning model, wherein the question and answer key comprises a list of question and answer specification pairs forming a ground truth for a question answering cognitive system, wherein each question is a text string and each answer specification references one or more text passages from a corpus of information; responsive to a search event, send at least one text input to the similar passage cognitive system operating in accordance with the trained similar passage machine learning model and executing on the processor, wherein the text input comprises a given text passage from a given answer specification of the question and answer key, and receive from the similar passage cognitive system configured with the trained similar passage machine learning model a response list of references to text passages from the corpus of information that are similar to the given text input; responsive to an acceptance event for at least one text passage from the response list, supplement the question and answer key by adding the at least one text passage to the given answer specification to form a supplemented question and answer key; and train a question answering machine learning model of the data processing system using the supplemented question and answer key such that the question answering cognitive system operates in accordance with the trained question answering machine learning model. 17. The apparatus of claim 16, wherein the instructions further causes the processor to:
responsive to a rejection event for a given text passage from the response list, prompt a user to provide a distinguishing question; create a new question and answer specification pair, wherein the new question and answer specification pair comprises the distinguishing question and an answer specification that references the given text passage; and add the new question and answer specification pair to the question and answer key to form a supplemented question and answer key. 18. The apparatus of claim 16, wherein the instructions further causes the processor to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 19. The apparatus of claim 16, wherein the instructions further causes the processor to:
receive a question and answer pattern key comprising a list of question and answer pattern pairs; and convert the question and answer pattern key to the question and answer key by resolving each answer pattern to an answer specification comprising a list of references to one or more text passages that match the answer pattern from the corpus of information. 20. The apparatus of claim 16, wherein the instructions further causes the processor to automatically generate at least one search event upon completion of an ingestion operation that updates the corpus of information. 21. The apparatus of claim 16, wherein the instructions further causes the processor to:
invoke at least one search event for at least one text passage of the question and answer key; and populate a user interface with at least one response list received from the at least one search event. 22. The apparatus of claim 21, wherein populating a user interface with at least one response list further comprises reordering the response list according to a text analytical proximity measure for each text passage in the response list relative to the text passage sent to the search event that returned the response list. | 2,100 |
4,674 | 15,144,165 | 2,121 | A server identifies, based on an originating address of a request from a vehicle for software updates, a regional software delivery network to serve the software updates to the vehicle. The server determines the software updates to apply to the vehicle based on an interrogator log included in the request, and sends a manifest to the vehicle including links to the software updates served by the regional software delivery network. A network address of an update request from a vehicle may be mapped to a geographic region. A regional software delivery network serving the geographic region may be identified. A manifest including links to software updates served by the regional software delivery network may be sent to the vehicle, the manifest generated based on an interrogator log included in the update request. | 1. A system comprising:
a server programmed to:
identify, based on an originating address of a request from a vehicle for software updates, a regional software delivery network to serve the software updates to the vehicle,
determine the software updates to apply to the vehicle based on the request, and
send a manifest to the vehicle including links to the software updates served by the regional software delivery network. 2. The system of claim 1, wherein the server is further programmed to:
derive a region of the vehicle based on the originating address of the request; and access data mapping originating addresses to identifiers of regions served by the regional software delivery networks to determine the regional software delivery network in the region of the vehicle. 3. The system of claim 2, wherein the region is a country, and each regional software delivery network is configured to serve software updates to a different country. 4. The system of claim 1, wherein the server is further programmed to:
receive the request from the vehicle over a secure hypertext protocol (HTTPS) connection, and identify the originating address of the connection as an Internet Protocol (IP) address of the vehicle. 5. The system of claim 1, wherein the request includes an interrogator log and is received by the server via a secure hypertext protocol (HTTPS) post. 6. The system of claim 1, wherein the links to the software updates are specified as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 7. The system of claim 1, wherein the links to the software updates are specified as a base universal resource locators (URL) of the regional software delivery network and relative links to the base URL. 8. A method comprising:
mapping a network address of an update request from a vehicle to a geographic region; identifying a regional software delivery network serving the geographic region; and sending a response including links to software updates served by the regional software delivery network to the vehicle, the response generated based on information included in the update request. 9. The method of claim 8, wherein the geographic region is a country, and further comprising serving software updates by the regional software delivery network only to vehicles identified as within the country. 10. The method of claim 8, further comprising:
receiving the update request from the vehicle over a secure hypertext protocol (HTTPS) connection, and identifying the network address as an originating Internet Protocol (IP) address of the connection. 11. The method of claim 8, further comprising receiving the information via a secure hypertext protocol (HTTPS) post. 12. The method of claim 8, further comprising specifying, in the response, the links to the software updates as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 13. The method of claim 8, further comprising specifying, in the response, the links to the software updates as a base universal resource locator (URL) of the regional software delivery network and relative links to the base URL. 14. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a server, cause the server to:
identify, based on an originating Internet Protocol (IP) address of a secure hypertext protocol (HTTPS) connection from a vehicle, a regional software delivery network to serve the software updates to the vehicle; determine the software updates to apply to the vehicle based on an interrogator log received from the vehicle over the connection; and send a manifest to the vehicle including web links to the software updates served by the regional software delivery network. 15. The computer readable medium of claim 14, further storing instructions that when executed cause the server to:
identify the regional software delivery network of the geographic region to serve the software updates based on the IP address. 16. The computer readable medium of claim 15, wherein the IP address identifies a country. 17. The computer readable medium of claim 14, wherein the web links to the software updates are specified as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 18. The computer readable medium of claim 14, wherein the web links to the software updated are specified in the manifest as a base universal resource locators (URL) of the regional software delivery network and relative links to the base URL. | A server identifies, based on an originating address of a request from a vehicle for software updates, a regional software delivery network to serve the software updates to the vehicle. The server determines the software updates to apply to the vehicle based on an interrogator log included in the request, and sends a manifest to the vehicle including links to the software updates served by the regional software delivery network. A network address of an update request from a vehicle may be mapped to a geographic region. A regional software delivery network serving the geographic region may be identified. A manifest including links to software updates served by the regional software delivery network may be sent to the vehicle, the manifest generated based on an interrogator log included in the update request.1. A system comprising:
a server programmed to:
identify, based on an originating address of a request from a vehicle for software updates, a regional software delivery network to serve the software updates to the vehicle,
determine the software updates to apply to the vehicle based on the request, and
send a manifest to the vehicle including links to the software updates served by the regional software delivery network. 2. The system of claim 1, wherein the server is further programmed to:
derive a region of the vehicle based on the originating address of the request; and access data mapping originating addresses to identifiers of regions served by the regional software delivery networks to determine the regional software delivery network in the region of the vehicle. 3. The system of claim 2, wherein the region is a country, and each regional software delivery network is configured to serve software updates to a different country. 4. The system of claim 1, wherein the server is further programmed to:
receive the request from the vehicle over a secure hypertext protocol (HTTPS) connection, and identify the originating address of the connection as an Internet Protocol (IP) address of the vehicle. 5. The system of claim 1, wherein the request includes an interrogator log and is received by the server via a secure hypertext protocol (HTTPS) post. 6. The system of claim 1, wherein the links to the software updates are specified as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 7. The system of claim 1, wherein the links to the software updates are specified as a base universal resource locators (URL) of the regional software delivery network and relative links to the base URL. 8. A method comprising:
mapping a network address of an update request from a vehicle to a geographic region; identifying a regional software delivery network serving the geographic region; and sending a response including links to software updates served by the regional software delivery network to the vehicle, the response generated based on information included in the update request. 9. The method of claim 8, wherein the geographic region is a country, and further comprising serving software updates by the regional software delivery network only to vehicles identified as within the country. 10. The method of claim 8, further comprising:
receiving the update request from the vehicle over a secure hypertext protocol (HTTPS) connection, and identifying the network address as an originating Internet Protocol (IP) address of the connection. 11. The method of claim 8, further comprising receiving the information via a secure hypertext protocol (HTTPS) post. 12. The method of claim 8, further comprising specifying, in the response, the links to the software updates as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 13. The method of claim 8, further comprising specifying, in the response, the links to the software updates as a base universal resource locator (URL) of the regional software delivery network and relative links to the base URL. 14. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a server, cause the server to:
identify, based on an originating Internet Protocol (IP) address of a secure hypertext protocol (HTTPS) connection from a vehicle, a regional software delivery network to serve the software updates to the vehicle; determine the software updates to apply to the vehicle based on an interrogator log received from the vehicle over the connection; and send a manifest to the vehicle including web links to the software updates served by the regional software delivery network. 15. The computer readable medium of claim 14, further storing instructions that when executed cause the server to:
identify the regional software delivery network of the geographic region to serve the software updates based on the IP address. 16. The computer readable medium of claim 15, wherein the IP address identifies a country. 17. The computer readable medium of claim 14, wherein the web links to the software updates are specified as universal resource locators (URLs) served by one or more web servers of the regional software delivery network. 18. The computer readable medium of claim 14, wherein the web links to the software updated are specified in the manifest as a base universal resource locators (URL) of the regional software delivery network and relative links to the base URL. | 2,100 |
4,675 | 14,577,611 | 2,158 | There is provided a computer-implemented method of optimizing a query. An exemplary method retrieves a subset of rows from a sample table based on a query for a table associated with the sample table. The query specifies the table. The sample table is generated in a previous optimization of the query. The sample table includes a scrambled, random selection of rows from the table. A cardinality of the table is determined based on the subset. A query plan is generated based on the query and the cardinality. | 1. A computer-implemented method of optimization, comprising:
retrieving a subset of rows from a sample table based on a query for a table associated with the sample table, the sample table being generated in a previous optimization, the sample table comprising a scrambled, random selection of rows from the table; determining a cardinality of the table based on the subset; and generating a query plan based on the query and the cardinality. 2. The method of claim 1, the query specifying a sample size smaller than or equal to a number of rows in the sample table, the sample size being based on a margin of error for estimating the cardinality. 3. The method of claim 2, wherein a number of rows of the subset equals the sample size. 4. The method of claim 1, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 5. The method of claim 1, wherein the sample table comprises a subset of columns of the table. 6. The method of claim 5, wherein the sample table comprises a clustering key, and wherein the sample table is scrambled based on the clustering key. 7. The method of claim 1, wherein the query specifies a predicate that does not comprise a range or equality comparison. 8. A computer system for optimization in a database management system (DBMS), the computer system comprising:
a processor that executes stored instructions; and a memory device that stores instructions and data, the memory device comprising:
a sample table generated in a previous optimization, the sample table comprising a scrambled, random subset of the rows of a source table, wherein the source table is associated with the sample table;
computer-implemented code that determines the sample table is to be replaced based on metadata and a specified threshold;
computer-implemented code that deletes the sample table;
computer-implemented code that generates a new sample table comprising:
all columns of the sample table; and
a new scrambled, random subset of rows from the source table;
computer-implemented code that retrieves a subset of rows from the new sample table based on a query;
computer-implemented code that determines a cardinality of the table based on the subset; and
computer-implemented code that generates a query plan based on the query and the cardinality. 9. The computer system of claim 8, wherein the query specifies the threshold as a sample size based on a margin of error for the cardinality, the metadata comprises a number of rows of the sample table, and wherein the threshold indicates the sample table has fewer rows than the sample size. 10. The computer system of claim 8, wherein the metadata specifies a number of row deletes, updates, and insertions to the source table, and wherein the threshold indicates the sample table is no longer current. 11. The computer system of claim 8, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 12. The computer system of claim 8, wherein the sample table and the new sample table comprise a subset of columns of the table. 13. The computer system of claim 12, wherein the new sample table comprises a clustering key, and wherein the new sample table is scrambled based on the clustering key. 14. The computer system of claim 8, wherein the query specifies a predicate that does not comprise a range or equality comparison. 15. A tangible, machine-readable medium that stores machine-readable instructions executable by a processor for optimization in a database management system (DBMS), the tangible, machine-readable medium comprising:
a sample table generated in a previous optimization in the DBMS, the sample table comprising a scrambled, random subset of the rows of a source table associated with the sample table; machine-readable instructions that, when executed by the processor, determines the sample table is to be replaced based on a specified threshold and metadata; machine-readable instructions that, when executed by the processor, deletes the sample table; machine-readable instructions that, when executed by the processor, generates a new sample table comprising:
all columns of the sample table; and
a scrambled, random selection of rows from the source table;
machine-readable instructions that, when executed by the processor, retrieves a subset of rows from the new sample table based on a query; machine-readable instructions that, when executed by the processor, determines a cardinality of the table based on the subset; and machine-readable instructions that, when executed by the processor, generates a query plan based on the query and the cardinality. 16. The tangible, machine-readable medium of claim 15 wherein the query specifies the threshold as a sample size based on a margin of error for the cardinality, the metadata comprises a number of rows of the sample table, and wherein the threshold indicates the sample table has fewer rows than the sample size. 17. The tangible, machine-readable medium of claim 15, wherein the metadata specifies a number of row deletes, updates, and insertions to the source table, and wherein the threshold indicates the sample table is no longer current. 18. The tangible, machine-readable medium of claim 15, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 19. The tangible, machine-readable medium of claim 15, wherein the sample table and the new sample table comprise a subset of columns of the table. 20. The tangible, machine-readable medium of claim 19, wherein the new sample table comprises a clustering key, and wherein the new sample table is scrambled based on the clustering key. | There is provided a computer-implemented method of optimizing a query. An exemplary method retrieves a subset of rows from a sample table based on a query for a table associated with the sample table. The query specifies the table. The sample table is generated in a previous optimization of the query. The sample table includes a scrambled, random selection of rows from the table. A cardinality of the table is determined based on the subset. A query plan is generated based on the query and the cardinality.1. A computer-implemented method of optimization, comprising:
retrieving a subset of rows from a sample table based on a query for a table associated with the sample table, the sample table being generated in a previous optimization, the sample table comprising a scrambled, random selection of rows from the table; determining a cardinality of the table based on the subset; and generating a query plan based on the query and the cardinality. 2. The method of claim 1, the query specifying a sample size smaller than or equal to a number of rows in the sample table, the sample size being based on a margin of error for estimating the cardinality. 3. The method of claim 2, wherein a number of rows of the subset equals the sample size. 4. The method of claim 1, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 5. The method of claim 1, wherein the sample table comprises a subset of columns of the table. 6. The method of claim 5, wherein the sample table comprises a clustering key, and wherein the sample table is scrambled based on the clustering key. 7. The method of claim 1, wherein the query specifies a predicate that does not comprise a range or equality comparison. 8. A computer system for optimization in a database management system (DBMS), the computer system comprising:
a processor that executes stored instructions; and a memory device that stores instructions and data, the memory device comprising:
a sample table generated in a previous optimization, the sample table comprising a scrambled, random subset of the rows of a source table, wherein the source table is associated with the sample table;
computer-implemented code that determines the sample table is to be replaced based on metadata and a specified threshold;
computer-implemented code that deletes the sample table;
computer-implemented code that generates a new sample table comprising:
all columns of the sample table; and
a new scrambled, random subset of rows from the source table;
computer-implemented code that retrieves a subset of rows from the new sample table based on a query;
computer-implemented code that determines a cardinality of the table based on the subset; and
computer-implemented code that generates a query plan based on the query and the cardinality. 9. The computer system of claim 8, wherein the query specifies the threshold as a sample size based on a margin of error for the cardinality, the metadata comprises a number of rows of the sample table, and wherein the threshold indicates the sample table has fewer rows than the sample size. 10. The computer system of claim 8, wherein the metadata specifies a number of row deletes, updates, and insertions to the source table, and wherein the threshold indicates the sample table is no longer current. 11. The computer system of claim 8, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 12. The computer system of claim 8, wherein the sample table and the new sample table comprise a subset of columns of the table. 13. The computer system of claim 12, wherein the new sample table comprises a clustering key, and wherein the new sample table is scrambled based on the clustering key. 14. The computer system of claim 8, wherein the query specifies a predicate that does not comprise a range or equality comparison. 15. A tangible, machine-readable medium that stores machine-readable instructions executable by a processor for optimization in a database management system (DBMS), the tangible, machine-readable medium comprising:
a sample table generated in a previous optimization in the DBMS, the sample table comprising a scrambled, random subset of the rows of a source table associated with the sample table; machine-readable instructions that, when executed by the processor, determines the sample table is to be replaced based on a specified threshold and metadata; machine-readable instructions that, when executed by the processor, deletes the sample table; machine-readable instructions that, when executed by the processor, generates a new sample table comprising:
all columns of the sample table; and
a scrambled, random selection of rows from the source table;
machine-readable instructions that, when executed by the processor, retrieves a subset of rows from the new sample table based on a query; machine-readable instructions that, when executed by the processor, determines a cardinality of the table based on the subset; and machine-readable instructions that, when executed by the processor, generates a query plan based on the query and the cardinality. 16. The tangible, machine-readable medium of claim 15 wherein the query specifies the threshold as a sample size based on a margin of error for the cardinality, the metadata comprises a number of rows of the sample table, and wherein the threshold indicates the sample table has fewer rows than the sample size. 17. The tangible, machine-readable medium of claim 15, wherein the metadata specifies a number of row deletes, updates, and insertions to the source table, and wherein the threshold indicates the sample table is no longer current. 18. The tangible, machine-readable medium of claim 15, the subset of rows being retrieved by performing a single disk head seek and a sequential scan. 19. The tangible, machine-readable medium of claim 15, wherein the sample table and the new sample table comprise a subset of columns of the table. 20. The tangible, machine-readable medium of claim 19, wherein the new sample table comprises a clustering key, and wherein the new sample table is scrambled based on the clustering key. | 2,100 |
4,676 | 14,546,195 | 2,144 | A system includes reception of first Web application code for a first Web page from a first Web server, reception of second Web application code for the first Web page from a second Web server, execution of the first Web application code to register a first data model in a container of the first Web page, and execution of the second Web application to query the container of the first Web page for data models, request the first data model from the container, receive the first data model from the container, extract first data from the first data model, and present the first data in the first Web page. | 1. A system comprising:
a memory storing processor-executable program code; and a processor to execute the processor-executable program code in order to cause the computing system to: receive first Web application code for a first Web page; receive second Web application code for the first Web page; execute the first Web application code to:
register a first data model in a container of the first Web page; and
execute the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 2. A system according to claim 1, wherein the processor is to further execute the first Web application code to:
receive the first data to populate the first data model. 3. A system according to claim 1, wherein the processor is to further execute the second Web application to:
register a second data model in the container. 4. A system according to claim 3, wherein the processor is to further execute the first Web application code to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 5. A system according to claim 4, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. 6. A system according to claim 1, wherein the first Web application code is received from a first Web server, and the second Web application code is received from a second Web server. 7. A method executed by a computing system, the method comprising:
receiving first Web application code for a first Web page; receiving second Web application code for the first Web page; executing the first Web application code to register a first data model in a container of the first Web page; and executing the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 8. A method according to claim 7, further comprising executing the first Web application code to:
receive the first data to populate the first data model. 9. A method according to claim 7, further comprising executing the second Web application to:
register a second data model in the container. 10. A method according to claim 9, further comprising executing the first Web application code to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 11. A method according to claim 10, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. 12. A method according to claim 7, wherein the first Web application code is received from a first Web server, and the second Web application code is received from a second Web server. 13. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive first Web application code for a first Web page from a first Web server; receive second Web application code for the first Web page from a second Web server; execute the first Web application code to:
register a first data model in a container of the first Web page; and
execute the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 14. A medium according to claim 13, wherein execution of the first Web application code comprises:
reception of the first data to populate the first data model. 15. A medium according to claim 13, execution of the second Web application comprises:
registration of a second data model in the container. 16. A medium according to claim 15, the program code further executable by a processor of a computing system to cause the computing system to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 17. A medium according to claim 16, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. | A system includes reception of first Web application code for a first Web page from a first Web server, reception of second Web application code for the first Web page from a second Web server, execution of the first Web application code to register a first data model in a container of the first Web page, and execution of the second Web application to query the container of the first Web page for data models, request the first data model from the container, receive the first data model from the container, extract first data from the first data model, and present the first data in the first Web page.1. A system comprising:
a memory storing processor-executable program code; and a processor to execute the processor-executable program code in order to cause the computing system to: receive first Web application code for a first Web page; receive second Web application code for the first Web page; execute the first Web application code to:
register a first data model in a container of the first Web page; and
execute the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 2. A system according to claim 1, wherein the processor is to further execute the first Web application code to:
receive the first data to populate the first data model. 3. A system according to claim 1, wherein the processor is to further execute the second Web application to:
register a second data model in the container. 4. A system according to claim 3, wherein the processor is to further execute the first Web application code to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 5. A system according to claim 4, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. 6. A system according to claim 1, wherein the first Web application code is received from a first Web server, and the second Web application code is received from a second Web server. 7. A method executed by a computing system, the method comprising:
receiving first Web application code for a first Web page; receiving second Web application code for the first Web page; executing the first Web application code to register a first data model in a container of the first Web page; and executing the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 8. A method according to claim 7, further comprising executing the first Web application code to:
receive the first data to populate the first data model. 9. A method according to claim 7, further comprising executing the second Web application to:
register a second data model in the container. 10. A method according to claim 9, further comprising executing the first Web application code to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 11. A method according to claim 10, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. 12. A method according to claim 7, wherein the first Web application code is received from a first Web server, and the second Web application code is received from a second Web server. 13. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive first Web application code for a first Web page from a first Web server; receive second Web application code for the first Web page from a second Web server; execute the first Web application code to:
register a first data model in a container of the first Web page; and
execute the second Web application to:
query the container of the first Web page for data models;
request the first data model from the container;
receive the first data model from the container;
extract first data from the first data model; and
present the first data in the first Web page. 14. A medium according to claim 13, wherein execution of the first Web application code comprises:
reception of the first data to populate the first data model. 15. A medium according to claim 13, execution of the second Web application comprises:
registration of a second data model in the container. 16. A medium according to claim 15, the program code further executable by a processor of a computing system to cause the computing system to:
query the container of the first Web page for data models; request the second data model from the container; receive the second data model from the container; extract second data from the second data model; and present the second data in the first Web page. 17. A medium according to claim 16, wherein the first data is presented in a first portion of the first Web page associated with the second Web application and the second data is presented in a second portion of the first Web page associated with the first Web application. | 2,100 |
4,677 | 12,191,428 | 2,169 | An apparatus and method modify a saved query based on a change in a query value meaning that changes over time. In preferred embodiments a graphical query interface displays an option to adjust query values of a saved database query. A query adjustment mechanism then adjusts the value of the query to compensate for the change in the meaning of the query value since the query was created such that the adjusted query will have the same basic meaning as when the query was originally created. Preferred Embodiments allow the user to specify to adjust the query to the current date or to a specified date in the past. | 1) A computer-implemented method for a user to modify a query to a database, the method comprising the steps of:
displaying an option to a user of the database to time adjust a query; and in response to a user selection, modifying the query based on the change in a meaning of a query value over time such that the query will have the same meaning as when the query was originally created and stored. 2) The method of claim 8 wherein the query is modified by adjusting the query value that has changed in meaning. 3) The method of claim 9 wherein the query value is adjusted to the product of an original query value and the historical value returned by the query divided by a current value returned by the query. 4) The method of claim 10 wherein the query is done regarding other query values in the query 5) The method of claim 8 wherein the query is done disregarding other query values in the query. 6) The method of claim 8 wherein the time sensitive query is a stored query. | An apparatus and method modify a saved query based on a change in a query value meaning that changes over time. In preferred embodiments a graphical query interface displays an option to adjust query values of a saved database query. A query adjustment mechanism then adjusts the value of the query to compensate for the change in the meaning of the query value since the query was created such that the adjusted query will have the same basic meaning as when the query was originally created. Preferred Embodiments allow the user to specify to adjust the query to the current date or to a specified date in the past.1) A computer-implemented method for a user to modify a query to a database, the method comprising the steps of:
displaying an option to a user of the database to time adjust a query; and in response to a user selection, modifying the query based on the change in a meaning of a query value over time such that the query will have the same meaning as when the query was originally created and stored. 2) The method of claim 8 wherein the query is modified by adjusting the query value that has changed in meaning. 3) The method of claim 9 wherein the query value is adjusted to the product of an original query value and the historical value returned by the query divided by a current value returned by the query. 4) The method of claim 10 wherein the query is done regarding other query values in the query 5) The method of claim 8 wherein the query is done disregarding other query values in the query. 6) The method of claim 8 wherein the time sensitive query is a stored query. | 2,100 |
4,678 | 14,258,449 | 2,122 | A method for autonomic group decision making may include presenting a plurality of decision options and receiving at least one decision option selected by each decision maker. A decision result may be presented including an indication of the preference for each option. Each decision maker may be allowed to revise the previously selected option for convergence to a single decision option for the group. An impedance score is determined for each decision maker in response to a decision maker selecting a different decision option. The impedance score may be based on one or more actions by the decision maker regarding selecting the decision option. A level of the impedance score indicates either progress toward or away from convergence. The impedance score may be revised each time a revised option is selected. The single decision option may be presented in response to the decision makers converging on the single decision option. | 1.-10. (canceled) 11. A system for autonomic group decision making, comprising:
a processor; a group decision making module operating on the processor, the group decision making module being configured to perform a set of functions comprising:
presenting a plurality of decision options to each decision maker of a group of decision makers;
receiving at least one decision option selected by each decision maker from the plurality of decision options;
presenting a decision making result to each decision maker, the decision making result comprising an indication of the preference for each of the decision options by the group of decision makers;
allowing, each decision maker to revise the at least one decision option previously selected by the decision maker for convergence to a single decision option by the group of decision makers;
determining an impedance score for each decision maker in response to at least one decision maker selecting a different at least one decision option from one previously selected, the impedance score of each decision maker being based on at least one action of a set of actions by the decision maker regarding selecting the at least one decision option, wherein a level of the impedance score indicates either a progression toward convergence to the single decision option or away from convergence to the single decision option by the decision maker associated with the impedance score;
revising the impedance score for a particular decision maker each time the particular decision maker selects a revised at least one decision option; and
presenting the single decision option in response to the decision makers converging on the single decision option. 12. The system of claim 11, wherein a lower impedance score indicates the at least one action of the set of actions by the decision maker progressing toward convergence to the single decision option and a higher impedance score indicates the at least one action of the set actions by the decision maker moving away from convergence to the single decision option, the set of actions for lowering the impedance score comprising:
changing to the at least one decision option selected by a greater number of decision makers; a shorter time duration between selecting the revised at least one decision option than selecting a previous at least one decision option in progression toward convergence of the single decision option; selecting a larger number of preferred decision options than previously selected; foregoing an option to rank preferred selections of a group of decision options; and modifying the at least one decision option to accommodate the selection of other decision makers for converging on the single decision option in less than a preset time period. 13. The system of claim 12, further comprising an impedance engine for determining and revising the impedance scores. 14. The system of claim 11, wherein the decision module is further configured to perform a set of functions comprising:
presenting a revised decision making result each time at least one decision maker selects a different at least one decision option from one previously selected until the group of decision makers converge on the single decision option or expiration or a preset time period before the decision makers converge on the single decision option; determining a revised impedance score for affected decision makers in response to the at least one decision maker selecting the different at least one decision option; and presenting the revised impedance score for each affected decision maker to at least the affected decision maker. 15. The system of claim 14, further comprising selection engine, the selection engine being configured to select the single decision option in response to the expiration of the preset time period, the single decision option being selected based on the at least one decision option selected last by each decision maker and the impedance score of each decision maker, wherein the impedance score of the decision maker is used to weight the last at least one decision option by the decision maker to provide a score, the lower impedance score corresponding to higher weight, the at least one decision option with the highest score being selected as the single decision option. 16. The system of claim 14, further comprising a selection engine, wherein the at least one decision option selected by each decision maker comprises a multiplicity of decision options selected by each decision maker, and wherein the single decision option is selected in response to expiration of the preset time period the selection engine being configured to perform a set of functions comprising:
determining a weighting associated with each decision maker based on the impedance score of each decision maker; assigning a value to each of the multiplicity of decision options based on a preference for a particular decision option by each decision maker, a highest preferred decision option being assigned a highest value and a lowest preferred decision option being assigned a lowest value; calculating to score for each of the multiplicity of decision options selected by each decision maker by multiplying the weighting associated with the decision maker by the value of each of the multiplicity of decision options selected by the decision maker; and adding the scores from each decision maker for each respective decision option of the multiplicity of decision options selected by each decision maker, wherein the decision option having the highest score is selected as the decision option. 17. The system of claim 11, wherein a new impedance score is dynamically determined during a decision making process based on the convergence to the single decision option in response to a different at least one decision option being selected by at least one decision maker of the group of decision makers. 18. A computer program product for autonomic group decision making, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
presenting a plurality of decision options to each decision maker of a group of decision makers; receiving at least one decision option selected by each decision maker from the plurality of decision options; presenting a decision making result to each decision maker, the decision making result comprising an indication of the preference for each of the decision options by the group of decision makers; allowing each decision maker to revise the at least one decision option previously selected by the decision maker for convergence to a single decision option by the group of decision makers; determining an impedance score for each decision maker in response to at least one decision maker selecting a different at least one decision option from one previously selected, the impedance score of each decision maker being based on at least one action of a set of actions by the decision maker regarding selecting the at least one decision option, wherein a level of the impedance score indicates either a progression toward convergence to the single decision option or away from convergence to the single decision option by the decision maker associated with the impedance score; revising the impedance score for a particular decision maker each time the particular decision maker selects a revised at least one decision option; and presenting the single decision option in response to the decision makers converging on the single decision option. 19. The computer program product of claim 18, wherein the method further comprises:
presenting a revised decision making result each time at least one decision maker selects a different at least one decision option from one previously selected until the group of decision makers converge on the single decision option or expiration of a preset time period before the decision makers converge on the single decision option; determining a revised impedance score for affected decision makers in response to the at least one decision maker selecting the different at least one decision option; and presenting the revised impedance score for each affected decision maker to at least the affected decision maker. 20. The computer program product of claim 18, wherein the at least one decision option selected by each decision maker comprises a multiplicity of decision options selected by each decision maker, and wherein selecting the single decision option in response to expiration of the preset time period comprises:
determining a weighting associated with each decision maker based on the impedance score of each decision maker; assigning a value to each of the multiplicity of decision options based on a preference for a particular decision option by each decision maker, a highest preferred decision option being assigned a highest value and a lowest preferred decision option being assigned a lowest value; calculating a score for each of the multiplicity of decision options selected by each decision maker by multiplying the weighting associated with the decision maker by the value of each of the multiplicity of decision options selected by the decision maker; and adding the scores from each decision maker for each respective decision option of the multiplicity of decision options selected by each decision maker, wherein the decision option having the highest score is selected as the single decision option. 21. The system of claim 11, wherein the decision making module is configured to perform a further set of functions comprising:
receiving a multiplicity of decision options selected by each decision maker, wherein the multiplicity of decision options are ranked by each decision maker based on a preference for each of the multiplicity of decision options; assigning a value to each of the multiplicity of decision options from each decision maker based on the preference for each of the multiplicity of decision options by each decision maker; and determining the single decision option based on the impedance score for each decision maker and the assigned value of each of the multiplicity of decision options of each decision maker. 22. The system of claim 21, wherein assigning the value to each of the multiplicity of decision options from each decision maker comprises assigning a highest preference value to a highest preferred decision option by each decision maker and assigning a lowest preference value to each lowest preferred decision option. 23. The system of claim 11, wherein allowing each decision maker to revise the at least one decision option selected by the decision maker for convergence to the single decision option comprises presenting a graphical user interface to each decision maker comprising:
a number of decision makers that selected each decision option; the impedance score for at least the decision maker; and a feature for selecting a different at least one decision option from the at least one decision option previously selected by the decision maker. 24. The system of claim 16, wherein the weighting for a particular decision maker is determined by 1−(Idm−Imin/Irange), wherein Idm is the impedance score of the particular decision maker, Imin is a minimum impedance score and Irange is a range from a lowest impedance score to a highest impedance score for the group of decision makers. | A method for autonomic group decision making may include presenting a plurality of decision options and receiving at least one decision option selected by each decision maker. A decision result may be presented including an indication of the preference for each option. Each decision maker may be allowed to revise the previously selected option for convergence to a single decision option for the group. An impedance score is determined for each decision maker in response to a decision maker selecting a different decision option. The impedance score may be based on one or more actions by the decision maker regarding selecting the decision option. A level of the impedance score indicates either progress toward or away from convergence. The impedance score may be revised each time a revised option is selected. The single decision option may be presented in response to the decision makers converging on the single decision option.1.-10. (canceled) 11. A system for autonomic group decision making, comprising:
a processor; a group decision making module operating on the processor, the group decision making module being configured to perform a set of functions comprising:
presenting a plurality of decision options to each decision maker of a group of decision makers;
receiving at least one decision option selected by each decision maker from the plurality of decision options;
presenting a decision making result to each decision maker, the decision making result comprising an indication of the preference for each of the decision options by the group of decision makers;
allowing, each decision maker to revise the at least one decision option previously selected by the decision maker for convergence to a single decision option by the group of decision makers;
determining an impedance score for each decision maker in response to at least one decision maker selecting a different at least one decision option from one previously selected, the impedance score of each decision maker being based on at least one action of a set of actions by the decision maker regarding selecting the at least one decision option, wherein a level of the impedance score indicates either a progression toward convergence to the single decision option or away from convergence to the single decision option by the decision maker associated with the impedance score;
revising the impedance score for a particular decision maker each time the particular decision maker selects a revised at least one decision option; and
presenting the single decision option in response to the decision makers converging on the single decision option. 12. The system of claim 11, wherein a lower impedance score indicates the at least one action of the set of actions by the decision maker progressing toward convergence to the single decision option and a higher impedance score indicates the at least one action of the set actions by the decision maker moving away from convergence to the single decision option, the set of actions for lowering the impedance score comprising:
changing to the at least one decision option selected by a greater number of decision makers; a shorter time duration between selecting the revised at least one decision option than selecting a previous at least one decision option in progression toward convergence of the single decision option; selecting a larger number of preferred decision options than previously selected; foregoing an option to rank preferred selections of a group of decision options; and modifying the at least one decision option to accommodate the selection of other decision makers for converging on the single decision option in less than a preset time period. 13. The system of claim 12, further comprising an impedance engine for determining and revising the impedance scores. 14. The system of claim 11, wherein the decision module is further configured to perform a set of functions comprising:
presenting a revised decision making result each time at least one decision maker selects a different at least one decision option from one previously selected until the group of decision makers converge on the single decision option or expiration or a preset time period before the decision makers converge on the single decision option; determining a revised impedance score for affected decision makers in response to the at least one decision maker selecting the different at least one decision option; and presenting the revised impedance score for each affected decision maker to at least the affected decision maker. 15. The system of claim 14, further comprising selection engine, the selection engine being configured to select the single decision option in response to the expiration of the preset time period, the single decision option being selected based on the at least one decision option selected last by each decision maker and the impedance score of each decision maker, wherein the impedance score of the decision maker is used to weight the last at least one decision option by the decision maker to provide a score, the lower impedance score corresponding to higher weight, the at least one decision option with the highest score being selected as the single decision option. 16. The system of claim 14, further comprising a selection engine, wherein the at least one decision option selected by each decision maker comprises a multiplicity of decision options selected by each decision maker, and wherein the single decision option is selected in response to expiration of the preset time period the selection engine being configured to perform a set of functions comprising:
determining a weighting associated with each decision maker based on the impedance score of each decision maker; assigning a value to each of the multiplicity of decision options based on a preference for a particular decision option by each decision maker, a highest preferred decision option being assigned a highest value and a lowest preferred decision option being assigned a lowest value; calculating to score for each of the multiplicity of decision options selected by each decision maker by multiplying the weighting associated with the decision maker by the value of each of the multiplicity of decision options selected by the decision maker; and adding the scores from each decision maker for each respective decision option of the multiplicity of decision options selected by each decision maker, wherein the decision option having the highest score is selected as the decision option. 17. The system of claim 11, wherein a new impedance score is dynamically determined during a decision making process based on the convergence to the single decision option in response to a different at least one decision option being selected by at least one decision maker of the group of decision makers. 18. A computer program product for autonomic group decision making, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
presenting a plurality of decision options to each decision maker of a group of decision makers; receiving at least one decision option selected by each decision maker from the plurality of decision options; presenting a decision making result to each decision maker, the decision making result comprising an indication of the preference for each of the decision options by the group of decision makers; allowing each decision maker to revise the at least one decision option previously selected by the decision maker for convergence to a single decision option by the group of decision makers; determining an impedance score for each decision maker in response to at least one decision maker selecting a different at least one decision option from one previously selected, the impedance score of each decision maker being based on at least one action of a set of actions by the decision maker regarding selecting the at least one decision option, wherein a level of the impedance score indicates either a progression toward convergence to the single decision option or away from convergence to the single decision option by the decision maker associated with the impedance score; revising the impedance score for a particular decision maker each time the particular decision maker selects a revised at least one decision option; and presenting the single decision option in response to the decision makers converging on the single decision option. 19. The computer program product of claim 18, wherein the method further comprises:
presenting a revised decision making result each time at least one decision maker selects a different at least one decision option from one previously selected until the group of decision makers converge on the single decision option or expiration of a preset time period before the decision makers converge on the single decision option; determining a revised impedance score for affected decision makers in response to the at least one decision maker selecting the different at least one decision option; and presenting the revised impedance score for each affected decision maker to at least the affected decision maker. 20. The computer program product of claim 18, wherein the at least one decision option selected by each decision maker comprises a multiplicity of decision options selected by each decision maker, and wherein selecting the single decision option in response to expiration of the preset time period comprises:
determining a weighting associated with each decision maker based on the impedance score of each decision maker; assigning a value to each of the multiplicity of decision options based on a preference for a particular decision option by each decision maker, a highest preferred decision option being assigned a highest value and a lowest preferred decision option being assigned a lowest value; calculating a score for each of the multiplicity of decision options selected by each decision maker by multiplying the weighting associated with the decision maker by the value of each of the multiplicity of decision options selected by the decision maker; and adding the scores from each decision maker for each respective decision option of the multiplicity of decision options selected by each decision maker, wherein the decision option having the highest score is selected as the single decision option. 21. The system of claim 11, wherein the decision making module is configured to perform a further set of functions comprising:
receiving a multiplicity of decision options selected by each decision maker, wherein the multiplicity of decision options are ranked by each decision maker based on a preference for each of the multiplicity of decision options; assigning a value to each of the multiplicity of decision options from each decision maker based on the preference for each of the multiplicity of decision options by each decision maker; and determining the single decision option based on the impedance score for each decision maker and the assigned value of each of the multiplicity of decision options of each decision maker. 22. The system of claim 21, wherein assigning the value to each of the multiplicity of decision options from each decision maker comprises assigning a highest preference value to a highest preferred decision option by each decision maker and assigning a lowest preference value to each lowest preferred decision option. 23. The system of claim 11, wherein allowing each decision maker to revise the at least one decision option selected by the decision maker for convergence to the single decision option comprises presenting a graphical user interface to each decision maker comprising:
a number of decision makers that selected each decision option; the impedance score for at least the decision maker; and a feature for selecting a different at least one decision option from the at least one decision option previously selected by the decision maker. 24. The system of claim 16, wherein the weighting for a particular decision maker is determined by 1−(Idm−Imin/Irange), wherein Idm is the impedance score of the particular decision maker, Imin is a minimum impedance score and Irange is a range from a lowest impedance score to a highest impedance score for the group of decision makers. | 2,100 |
4,679 | 14,606,217 | 2,182 | Processing circuitry 2 is provided for comparing a number of adjacent widths having a common value and extending from a starting position within an input number with a runlength specified by a variable number. The circuitry includes a mask generator 22 for generating a mask value in dependence upon the variable number, combination circuitry 24 for performing a logical combination operation upon respective bits within the input number starting from the starting position and corresponding bits within the mask value so as to generate an intermediate value. Result circuitry 26 then generates a result indicative of whether or not the number of adjacent bits is less than or equal to the run length in dependence upon a determination if any bits within the intermediate value have a predetermined value. | 1. Apparatus for comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said apparatus comprising:
a mask generator configured to generate a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; combination circuitry configured to perform a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a 2(N+1)-bit intermediate value; and result circuitry configured to generate a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. 2. Apparatus as claimed in claim 1, wherein said logical combination is a bitwise logical combination of said input number and said 2(N+1)-bit mask value. 3. Apparatus as claimed in claim 2, wherein said logical combination is an AND operation. 4. Apparatus as claimed in claim 1, wherein said result circuitry performs an 2(N+1)-bit OR operation upon bits of said 2(N+1)-bit intermediate value. 5. Apparatus as claimed in claim 1, wherein said starting bit position is a most significant bit within said input number. 6. Apparatus as claimed in claim 5, wherein said result indicates if said input value has a number of leading zeros less than said runlength. 7. Apparatus as claimed in claim 5, wherein said mask generator is configured to generate a said 2N+1-bit mask value having a number of consecutive leading bit values of 1 given by said (N+1)-bit variable number plus 1 followed by all 0 bit values. 8. Apparatus as claimed in claim 5, wherein
said (N+1)-bit variable number comprises bit values n[i], where i is a value between N and 0; and said mask generator comprises combinatorial logic configured to generate said 2N+1-bit mask value in accordance with: said 2N+1-bit mask value comprises bit values mN[j], where j is a value between 2N+1−1 and 0; m0[1]=1 and m0[0] is given by said (N+1)-bit variable number when N=0; mN[p]=n[N] OR mNN−1[p−2N], where p is a value between 2N and 2N+1−1; and mN[p]=n[N] AND mN−1[p], where p is a value between 0 and 2N−1. 9. Apparatus as claimed in claim 5, wherein said mask generator is configured to generate a said 2N+1-bit mask value having a number of consecutive leading bit values of 1 given by said (N+1)-bit variable number followed by all 0 bit values. 10. Apparatus as claimed in claim 5, wherein
said (N+1)-bit variable number comprises bit values n[i], where i is a value between N and 0; and said mask generator comprises combinatorial logic configured to generate said 2N+1-bit mask value in accordance with: said 2N+1-bit mask value comprises bit values mN[j], where j is a value between 2N+1−1 and 0; m0[1] is given by said (N+1)-bit variable number when N=0 and m0[0]=0; mN[p]=n[N] OR mN−1[p−2N], where p is a value between 2N and 2N+1−1; and mN[p]=n[N] AND mN−1[p], where p is a value between 0 and 2N−1. 11. Apparatus as claimed in claim 1, wherein said starting bit position is a least significant bit within said input number. 12. Apparatus as claimed in claim 1, wherein said combination circuitry is configured to generate different bits of said 2(N+1)-bit intermediate value at different times and said result circuitry is connected to said combination circuitry to receive and start processing some bits of said 2(N+1)-bit intermediate value that have been generated while other bits of said 2(N+1)-bit intermediate value have yet to be generated. 13. Apparatus as claimed in claim 1, comprising floating point arithmetic unit configured to performing arithmetic operations upon floating point numbers having an exponent value and a mantissa value and wherein said input number is a mantissa value and said (N+1)-bit variable number is an exponent value. 14. Apparatus a claimed in claim 13, wherein said result is used to control whether to shift said mantissa a shift amount given by one of:
a number of leading zeros of said mantissa; and said exponent value. 15. Apparatus for comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said apparatus comprising:
mask generator means for generating a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; combination means for performing a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a 2(N+1)-bit intermediate value; and result means for generating a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. 16. A method of comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said method comprising the steps of:
generating a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; performing a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a2(N+1)-bit intermediate value; and generating a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. | Processing circuitry 2 is provided for comparing a number of adjacent widths having a common value and extending from a starting position within an input number with a runlength specified by a variable number. The circuitry includes a mask generator 22 for generating a mask value in dependence upon the variable number, combination circuitry 24 for performing a logical combination operation upon respective bits within the input number starting from the starting position and corresponding bits within the mask value so as to generate an intermediate value. Result circuitry 26 then generates a result indicative of whether or not the number of adjacent bits is less than or equal to the run length in dependence upon a determination if any bits within the intermediate value have a predetermined value.1. Apparatus for comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said apparatus comprising:
a mask generator configured to generate a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; combination circuitry configured to perform a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a 2(N+1)-bit intermediate value; and result circuitry configured to generate a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. 2. Apparatus as claimed in claim 1, wherein said logical combination is a bitwise logical combination of said input number and said 2(N+1)-bit mask value. 3. Apparatus as claimed in claim 2, wherein said logical combination is an AND operation. 4. Apparatus as claimed in claim 1, wherein said result circuitry performs an 2(N+1)-bit OR operation upon bits of said 2(N+1)-bit intermediate value. 5. Apparatus as claimed in claim 1, wherein said starting bit position is a most significant bit within said input number. 6. Apparatus as claimed in claim 5, wherein said result indicates if said input value has a number of leading zeros less than said runlength. 7. Apparatus as claimed in claim 5, wherein said mask generator is configured to generate a said 2N+1-bit mask value having a number of consecutive leading bit values of 1 given by said (N+1)-bit variable number plus 1 followed by all 0 bit values. 8. Apparatus as claimed in claim 5, wherein
said (N+1)-bit variable number comprises bit values n[i], where i is a value between N and 0; and said mask generator comprises combinatorial logic configured to generate said 2N+1-bit mask value in accordance with: said 2N+1-bit mask value comprises bit values mN[j], where j is a value between 2N+1−1 and 0; m0[1]=1 and m0[0] is given by said (N+1)-bit variable number when N=0; mN[p]=n[N] OR mNN−1[p−2N], where p is a value between 2N and 2N+1−1; and mN[p]=n[N] AND mN−1[p], where p is a value between 0 and 2N−1. 9. Apparatus as claimed in claim 5, wherein said mask generator is configured to generate a said 2N+1-bit mask value having a number of consecutive leading bit values of 1 given by said (N+1)-bit variable number followed by all 0 bit values. 10. Apparatus as claimed in claim 5, wherein
said (N+1)-bit variable number comprises bit values n[i], where i is a value between N and 0; and said mask generator comprises combinatorial logic configured to generate said 2N+1-bit mask value in accordance with: said 2N+1-bit mask value comprises bit values mN[j], where j is a value between 2N+1−1 and 0; m0[1] is given by said (N+1)-bit variable number when N=0 and m0[0]=0; mN[p]=n[N] OR mN−1[p−2N], where p is a value between 2N and 2N+1−1; and mN[p]=n[N] AND mN−1[p], where p is a value between 0 and 2N−1. 11. Apparatus as claimed in claim 1, wherein said starting bit position is a least significant bit within said input number. 12. Apparatus as claimed in claim 1, wherein said combination circuitry is configured to generate different bits of said 2(N+1)-bit intermediate value at different times and said result circuitry is connected to said combination circuitry to receive and start processing some bits of said 2(N+1)-bit intermediate value that have been generated while other bits of said 2(N+1)-bit intermediate value have yet to be generated. 13. Apparatus as claimed in claim 1, comprising floating point arithmetic unit configured to performing arithmetic operations upon floating point numbers having an exponent value and a mantissa value and wherein said input number is a mantissa value and said (N+1)-bit variable number is an exponent value. 14. Apparatus a claimed in claim 13, wherein said result is used to control whether to shift said mantissa a shift amount given by one of:
a number of leading zeros of said mantissa; and said exponent value. 15. Apparatus for comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said apparatus comprising:
mask generator means for generating a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; combination means for performing a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a 2(N+1)-bit intermediate value; and result means for generating a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. 16. A method of comparing a number of adjacent bits having a common value and extending from a starting bit position within an input number with a runlength specified by a (N+1)-bit variable number, where N is a positive integer, said method comprising the steps of:
generating a 2(N+1)-bit mask value in dependence upon said (N+1)-bit variable number; performing a logical combination operation upon respective bits within said input number starting from said starting bit position and corresponding bits within said 2(N+1)-bit mask value to generate a2(N+1)-bit intermediate value; and generating a result indicative of whether or not said number of adjacent bits is less than or equal to said runlength in dependence upon a determination if any bits within said 2(N+1)-bit intermediate value have a predetermined value. | 2,100 |
4,680 | 12,891,493 | 2,199 | This disclosure provides various embodiments for modeling a first business process as a sub-process of a second business process, the first business process less than fully compatible with a particular business process management system. The first business process is compatible with a first system adapted to execute the first business process. The first business process is identified and a user input received requesting modeling of the first business process as a sub-process of the second business process. A modeled sub-process is generated including a reference to the first system, callable from the modeled sub-process, and an interface definition defining an interface between the modeled sub-process and the first system. A modeled interface between a model of the second business process and the modeled sub-process is generated defining inputs and outputs between first and second business processes. In some aspects, the modeled sub-process can be deployed in a runtime environment. | 1. A computer-implemented method for modeling a business process, the method comprising:
identifying at least one first business process from a plurality of business processes compatible with at least a first system, the first process less than fully compatible with a particular business process management system modeling at least one second business process compatible with the particular business process management system; receiving a user input requesting modeling of the first business process as a sub-process of the second business process; generating a modeled sub-process modeling the first process as a sub-process of the second business process, the modeled sub-process including:
a reference, callable from the modeled sub-process, to the first system; and
an interface definition defining an interface between the modeled sub-process and the first system; and
generating a modeled interface between a model of the second business process and the modeled sub-process, the interface defining inputs from the second business process to the first business process and outputs from the first business process to the second business process. 2. The method of claim 1, wherein the generated modeled sub-process further includes a process flow including at least a start event and an end event. 3. The method of claim 2, wherein the inputs correspond to the start event and the outputs correspond to the end event. 4. The method of claim 2, wherein events in the process flow correspond to events in the first business process. 5. The method of claim 1, wherein modeling of the second business process includes presenting a graphical representation of a model to a user. 6. The method of claim 5, wherein the modeled sub-process is integrated in the model. 7. The method of claim 6, further comprising deploying the model in a runtime environment. 8. The method of claim 5, wherein the model comprises a business process modeling notation (BPMN) model. 9. The method of claim 1, wherein the modeled sub-process further includes an asynchronous event adapted, when executed, to:
request the first system to execute the first business process; and translate input data from the second process for use by the first system in executing the first business process; and translate output data returned by the executed first business process for use by the second business process. 10. The method of claim 9, wherein the asynchronous event further identifies the callable reference. 11. The method of claim 1, wherein the first business process is a legacy process and the first system is a legacy version of the particular business process management system. 12. The method of claim 1, wherein the first business process is associated with a third-party source. 13. The method of claim 1, further comprising receiving a search query from a user to search a plurality of processes including the plurality of processes compatible with the first system, wherein identifying the first business process includes providing a set of search results to the user based at least on the search query, the set including the first business process. 14. The method of claim 1, wherein the first business process is identified in response to a user request for the first business process. 15. The method of claim 1, wherein generating the modeled sub-process includes generating an intermediate catch event in a model of the first process pointing to an asynchronous operation to be called by the first system. 16. The method of claim 1, further comprising receiving dependency data specifying at least one dependency between the first process and the second process. 17. The method of claim 16, further comprising prompting a user for dependency data in response to the user input requesting modeling of the first business process, wherein the received dependency data is received from the user. 18. A computer-implemented method for deploying a modeled business process, the method comprising:
identifying a business process model modeling a first business process, the first business process compatible with a particular business process management system and including at least one sub-process, wherein the sub-process modeled in the business process model corresponds to at least one second business process less than fully compatible with the particular business process management system and capable of execution on at least one second system; and deploying the business process model in a runtime environment, wherein deploying the business process model includes:
identifying a reference to the second system;
invoking the second business process through a remote function call to the second system;
passing input data to the second system for use in executing the second business process, wherein the input data is passed through at least one interface adapted to translate data fro use by the second system;
receiving processed data from the second business process through the at least one interface; and
using the processed data in the first business process. 19. The method of claim 18, wherein the particular business process is hosted by at least one remote server, wherein data is passed to and processed data received from the remote server. 20. The method of claim 18, wherein the business process model defines a modeled interface between the first business process and the second business process, the modeled interface defining inputs to the second business process from the first business process and outputs from the second business process to the first business process. 21. The method of claim 20, wherein inputs to the second business process corresponding to a start event of the second business process and outputs from the second business process correspond to an end event of the second business process. 22. The method of claim 18 wherein the at least one interface is further adapted to translate processed data for use by the first business process. 23. The method of claim 18, wherein the modeled sub-process includes:
at least one intermediate event identifying the reference to the second business process, wherein the reference is callable through the remote function call, and defining the at least one interface. 24. The method of claim 18, wherein the business process model is a business process modeling notation (BPMN) model. 25. An article comprising a non-transitory, machine-readable storage device storing instructions operable to cause at least one processor to perform operations comprising:
identifying at least one first business process from a plurality of business processes compatible with at least a first system, the first process less than fully compatible with a particular business process management system modeling at least one second business process compatible with the particular business process management system; receiving a user input requesting modeling of the first business process as a sub-process of the second business process; generating a modeled sub-process modeling the first process as a sub-process of the second business process, the modeled sub-process including:
a reference, callable from the modeled sub-process, to the first system; and
an interface definition defining an interface between the modeled sub-process and the first system; and
generating a modeled interface between a model of the second business process and the modeled sub-process, the interface defining inputs from the second business process to the first business process and outputs from the first business process to the second business process. 26. An article comprising a non-transitory, machine-readable storage device storing instructions operable to cause at least one processor to perform operations comprising:
identifying a business process model modeling a first business process, the first business process compatible with a particular business process management system and including at least one sub-process, wherein the sub-process modeled in the business process model corresponds to at least one second business process less than fully compatible with the particular business process management system and capable of execution on at least one second system; and deploying the business process model in a runtime environment, wherein deploying the business process model includes:
identifying a reference to the second system;
invoking the second business process through a remote function call to the second system;
passing input data to the second system for use in executing the second business process, wherein the input data is passed through at least one interface adapted to translate data for use by the second system;
receiving processed data from the second business process through the at least one interface; and
using the processed data in the first business process. | This disclosure provides various embodiments for modeling a first business process as a sub-process of a second business process, the first business process less than fully compatible with a particular business process management system. The first business process is compatible with a first system adapted to execute the first business process. The first business process is identified and a user input received requesting modeling of the first business process as a sub-process of the second business process. A modeled sub-process is generated including a reference to the first system, callable from the modeled sub-process, and an interface definition defining an interface between the modeled sub-process and the first system. A modeled interface between a model of the second business process and the modeled sub-process is generated defining inputs and outputs between first and second business processes. In some aspects, the modeled sub-process can be deployed in a runtime environment.1. A computer-implemented method for modeling a business process, the method comprising:
identifying at least one first business process from a plurality of business processes compatible with at least a first system, the first process less than fully compatible with a particular business process management system modeling at least one second business process compatible with the particular business process management system; receiving a user input requesting modeling of the first business process as a sub-process of the second business process; generating a modeled sub-process modeling the first process as a sub-process of the second business process, the modeled sub-process including:
a reference, callable from the modeled sub-process, to the first system; and
an interface definition defining an interface between the modeled sub-process and the first system; and
generating a modeled interface between a model of the second business process and the modeled sub-process, the interface defining inputs from the second business process to the first business process and outputs from the first business process to the second business process. 2. The method of claim 1, wherein the generated modeled sub-process further includes a process flow including at least a start event and an end event. 3. The method of claim 2, wherein the inputs correspond to the start event and the outputs correspond to the end event. 4. The method of claim 2, wherein events in the process flow correspond to events in the first business process. 5. The method of claim 1, wherein modeling of the second business process includes presenting a graphical representation of a model to a user. 6. The method of claim 5, wherein the modeled sub-process is integrated in the model. 7. The method of claim 6, further comprising deploying the model in a runtime environment. 8. The method of claim 5, wherein the model comprises a business process modeling notation (BPMN) model. 9. The method of claim 1, wherein the modeled sub-process further includes an asynchronous event adapted, when executed, to:
request the first system to execute the first business process; and translate input data from the second process for use by the first system in executing the first business process; and translate output data returned by the executed first business process for use by the second business process. 10. The method of claim 9, wherein the asynchronous event further identifies the callable reference. 11. The method of claim 1, wherein the first business process is a legacy process and the first system is a legacy version of the particular business process management system. 12. The method of claim 1, wherein the first business process is associated with a third-party source. 13. The method of claim 1, further comprising receiving a search query from a user to search a plurality of processes including the plurality of processes compatible with the first system, wherein identifying the first business process includes providing a set of search results to the user based at least on the search query, the set including the first business process. 14. The method of claim 1, wherein the first business process is identified in response to a user request for the first business process. 15. The method of claim 1, wherein generating the modeled sub-process includes generating an intermediate catch event in a model of the first process pointing to an asynchronous operation to be called by the first system. 16. The method of claim 1, further comprising receiving dependency data specifying at least one dependency between the first process and the second process. 17. The method of claim 16, further comprising prompting a user for dependency data in response to the user input requesting modeling of the first business process, wherein the received dependency data is received from the user. 18. A computer-implemented method for deploying a modeled business process, the method comprising:
identifying a business process model modeling a first business process, the first business process compatible with a particular business process management system and including at least one sub-process, wherein the sub-process modeled in the business process model corresponds to at least one second business process less than fully compatible with the particular business process management system and capable of execution on at least one second system; and deploying the business process model in a runtime environment, wherein deploying the business process model includes:
identifying a reference to the second system;
invoking the second business process through a remote function call to the second system;
passing input data to the second system for use in executing the second business process, wherein the input data is passed through at least one interface adapted to translate data fro use by the second system;
receiving processed data from the second business process through the at least one interface; and
using the processed data in the first business process. 19. The method of claim 18, wherein the particular business process is hosted by at least one remote server, wherein data is passed to and processed data received from the remote server. 20. The method of claim 18, wherein the business process model defines a modeled interface between the first business process and the second business process, the modeled interface defining inputs to the second business process from the first business process and outputs from the second business process to the first business process. 21. The method of claim 20, wherein inputs to the second business process corresponding to a start event of the second business process and outputs from the second business process correspond to an end event of the second business process. 22. The method of claim 18 wherein the at least one interface is further adapted to translate processed data for use by the first business process. 23. The method of claim 18, wherein the modeled sub-process includes:
at least one intermediate event identifying the reference to the second business process, wherein the reference is callable through the remote function call, and defining the at least one interface. 24. The method of claim 18, wherein the business process model is a business process modeling notation (BPMN) model. 25. An article comprising a non-transitory, machine-readable storage device storing instructions operable to cause at least one processor to perform operations comprising:
identifying at least one first business process from a plurality of business processes compatible with at least a first system, the first process less than fully compatible with a particular business process management system modeling at least one second business process compatible with the particular business process management system; receiving a user input requesting modeling of the first business process as a sub-process of the second business process; generating a modeled sub-process modeling the first process as a sub-process of the second business process, the modeled sub-process including:
a reference, callable from the modeled sub-process, to the first system; and
an interface definition defining an interface between the modeled sub-process and the first system; and
generating a modeled interface between a model of the second business process and the modeled sub-process, the interface defining inputs from the second business process to the first business process and outputs from the first business process to the second business process. 26. An article comprising a non-transitory, machine-readable storage device storing instructions operable to cause at least one processor to perform operations comprising:
identifying a business process model modeling a first business process, the first business process compatible with a particular business process management system and including at least one sub-process, wherein the sub-process modeled in the business process model corresponds to at least one second business process less than fully compatible with the particular business process management system and capable of execution on at least one second system; and deploying the business process model in a runtime environment, wherein deploying the business process model includes:
identifying a reference to the second system;
invoking the second business process through a remote function call to the second system;
passing input data to the second system for use in executing the second business process, wherein the input data is passed through at least one interface adapted to translate data for use by the second system;
receiving processed data from the second business process through the at least one interface; and
using the processed data in the first business process. | 2,100 |
4,681 | 14,319,729 | 2,112 | The present invention discloses a coding and decoding method, apparatus, and system for forward error correction, and pertains to the field of communications. The method includes: determining check matrix parameters of time-varying periodic LDPC convolutional code according to performance a transmission system, complexity of the transmission system, and a synchronization manner for code word alignment, constructing a QC-LDPC check matrix according to the determined check matrix parameters, and obtaining a check matrix (H c ) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; de-blocking, according to requirements of the H c , data to be coded, and coding data of each sub-block according to the H c , so as to obtain multiple code words of the LDPC convolutional code; and adding the multiple code words of the LDPC convolutional code in a data frame and sending the data frame. | 1. A coding method for forward error correction, comprising:
determining check matrix parameters of a time-varying periodic low density parity check (LDPC) convolutional code according to performance of a transmission system, complexity of the transmission system, and a synchronization manner for code word alignment; constructing a quasi-cyclic low density parity check (QC-LDPC) check matrix according to the determined check matrix parameters, and obtaining a check matrix (Hc) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; de-blocking, according to requirements of the Hc, data to be coded, and coding data of each sub-block according to the Hc to obtain multiple code words of the LDPC convolutional code; and adding the multiple code words of the LDPC convolutional code in a data frame and sending the data frame. 2. The method according to claim 1, wherein determining the check matrix parameters of the time-varying periodic LDPC convolutional code according to the performance of the transmission system, the complexity of the transmission system, and the synchronization manner for code word alignment comprises:
determining a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to the performance and the complexity of the transmission system, where the MS is the number of sub-matrixes in the Hc in each T; and determining a length (C) of each code word block according to the synchronization manner for code word alignment, and determining a parity bit length (P) according to the R and the C, and wherein constructing the QC-LDPC check matrix according to the determined check matrix parameters, and obtaining the check matrix Hc of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix comprises:
constructing the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P;
splitting the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and
filling, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the Hc. 3. The method according to claim 1, wherein before the adding the multiple code words of the LDPC convolutional code in the data frame and sending the data frame, the method further comprises:
adding an identity signal in the data frame, wherein the identity signal is used to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc to prompt a receiving end to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal, and decodes the multiple LDCP convolutional code words according to the H. 4. The method according to claim 3, wherein adding the identity signal in the data frame comprises:
adding either a frame header (FAS) of the data frame or a training sequence used at the time of transmitting the data frame in the data frame as the identity signal. 5. The method according to claim 3, wherein adding the identity signal in the data frame comprises:
inserting an identity of the correspondence between the code words and the Hc in an start position of the code words in the data frame, wherein the inserted identity of the correspondence is used as the added identity signal. 6. A decoding method for forward error correction, comprising:
receiving a data frame containing multiple low density parity check (LDPC) convolutional code words, wherein the multiple code words of the LDPC convolutional code are obtained by performing coding according to a check matrix (Hc) of time-varying periodic LDPC convolutional code, and wherein the Hc is obtained according to a quasi-cyclic low density parity check (QC-LDPC) check matrix; and obtaining the Hc that is used when the multiple code words of the LDPC convolutional code are obtained by performing coding, determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc and decoding the multiple code words of the LDPC convolutional code according to the correspondence. 7. The method according to claim 6, wherein the Hc is determined by using the following manners:
determining a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to performance and complexity of a transmission system, where the MS is the number of sub-matrixes in the Hc in each T; determining a length C of each code word block according to a synchronization manner for code word alignment, and determining a parity bit length P according to the R and C; constructing the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P; splitting the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and filling, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the Hc. 8. The method according to claim 6, wherein determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc comprises:
shifting the multiple code words of the LDPC convolutional code, and calculating a syndrome(S) in accordance with S=r*Hc t once in each shift, and until the maximum number of check relationships is met, obtaining the correspondence between the multiple code words of the LDPC convolutional code and the Hc, where r is a code stream containing the multiple code words of the LDPC convolutional code. 9. The method according to claim 6, wherein an identity signal is added in the data frame, and the identity signal is used to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc, and
wherein determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc comprises: identifying the identity signal added in the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal. 10. The method according to claim 9, wherein the identity signal is a frame header (FAS) of the data frame, and wherein identifying the identity signal added in the data frame and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the frame header (FAS) of the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the frame header FAS of the data frame. 11. The method according to claim 9, wherein the identity signal is a training sequence used at the time of transmitting the data frame, and wherein identifying the identity signal added in the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the training sequence used at the time of transmitting the data frame, and identifying the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the training sequence. 12. The method according to claim 9, wherein the identity signal is an identity of the correspondence between the code words and the Hc inserted in an initial position of the code words in the data frame, and wherein identifying the identity signal added in the data frame and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the identity of the correspondence between the code words and the Hc, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity of the correspondence. 13. A coding apparatus for forward error correction, comprising:
a determining module, configured to determine check matrix parameters of time-varying periodic low density parity check (LDPC) convolutional code according to performance of a transmission system, complexity of the transmission system, and a synchronization manner for codeword alignment; a construction module, configured to construct a quasi-cyclic low density parity check (QC-LDPC) check matrix according to the check matrix parameters determined by the determining module, and to obtain a check matrix (Hc) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; a coding module, configured to de-block, according to requirements of the Hc obtained by the construction module, data to be coded, and to code data of each sub-block according to the Hc to obtain multiple code words of the LDPC convolutional code; and a sending module, configured to add the multiple code words of the LDPC convolutional code obtained by the coding module through coding in a data frame and send the data frame. 14. The apparatus according to claim 13, wherein the determining module comprises:
a first determining unit, configured to determine a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to the performance and the complexity of the transmission system, where the MS is the number of sub-matrixes in the Hc in each T; a second determining unit, configured to determine a length (C) of each code word block according to the synchronization manner for code word alignment; and a third determining unit, configured to determine a parity bit length (P) according to the R and the C, wherein the construction module comprises:
a construction unit, configured to construct the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P;
a splitting unit, configured to split the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and
a filling unit, configured to fill, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the H. 15. The apparatus according to claim 13, further comprising:
an adding module, configured to add an identity signal in the data frame sent by the sending module, wherein the identity signal is configured to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc to prompt a receiving end to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal, and decodes the multiple LDCP convolutional code words according to the Hc. 16. The apparatus according to claim 15, wherein the adding module is configured to add a frame header FAS of the data frame in the data frame as an identity signal, or to add a training sequence used at the time of transmitting the data frame in the data frame as an identity signal, or to insert an identity of the correspondence between the code words and the Hc in an initial position of the code words in the data frame, and
wherein the inserted identity of the correspondence is used as the added identity signal. 17. A decoding apparatus for forward error correction, comprising:
a receiving module, configured to receive a data frame containing multiple low density parity check (LDPC) convolutional code words, wherein the multiple code words of the LDPC convolutional code are obtained by performing coding according to a check matrix (Hc) of time-varying periodic LDPC convolutional code, and wherein the Hc is obtained according to a quasi-cyclic low density parity check (QC-LDPC) check matrix; and an obtaining module, configured to obtain the Hc that is used when the multiple code words of the LDPC convolutional code are obtained by performing coding; a determining module, configured to determine the correspondence between the multiple code words of the LDPC convolutional code in the data frame received by the receiving module and the Hc obtained by the obtaining module; and a decoding module, configured to decode the multiple code words of the LDPC convolutional code according to the correspondence determined by the determining module. 18. The apparatus according to claim 17, wherein the determining module comprises:
a shifting unit, configured to shift the multiple code words of the LDPC convolutional code; and a calculation unit, configured to calculate a syndrome (S) in accordance with S=r*Hc t once in each shift of the shifting unit, and until the maximum number of check relationships is met, obtain the correspondence between the multiple code words of the LDPC convolutional code and the Hc, where r is a code stream containing the multiple code words of the LDPC convolutional code. 19. The apparatus according to claim 17, wherein an identity signal is added in the data frame received by the receiving module, and the identity signal is used to identify an initial position of the code words in the data frame, the number of layers corresponding to the Hc matrix, and the number of paths of coded data flows; and
wherein the determining module comprises:
an identification unit, configured to identify the identity signal added in the data frame received by the receiving module; and
a determining unit, configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal identified by the identification unit. 20. The apparatus according to claim 19, wherein the identity signal is a frame header (FAS) of the data frame, and the identification unit is configured to identify the frame header FAS of the data frame; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the FAS within the frame header of the data frame identified by the identification unit; or,
the identity signal is a training sequence used at the time of transmitting the data frame, and the identification unit is configured to identify the training sequence used at the time of transmitting the data frame; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the training sequence identified by the identification unit; or, the identity signal is an identity of the correspondence between the code words and the Hc inserted in the initial position of the code words of the data frame, and the identification unit is configured to identify the identity of the correspondence between the code words and the Hc; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity of the correspondence identified by the identification unit. | The present invention discloses a coding and decoding method, apparatus, and system for forward error correction, and pertains to the field of communications. The method includes: determining check matrix parameters of time-varying periodic LDPC convolutional code according to performance a transmission system, complexity of the transmission system, and a synchronization manner for code word alignment, constructing a QC-LDPC check matrix according to the determined check matrix parameters, and obtaining a check matrix (H c ) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; de-blocking, according to requirements of the H c , data to be coded, and coding data of each sub-block according to the H c , so as to obtain multiple code words of the LDPC convolutional code; and adding the multiple code words of the LDPC convolutional code in a data frame and sending the data frame.1. A coding method for forward error correction, comprising:
determining check matrix parameters of a time-varying periodic low density parity check (LDPC) convolutional code according to performance of a transmission system, complexity of the transmission system, and a synchronization manner for code word alignment; constructing a quasi-cyclic low density parity check (QC-LDPC) check matrix according to the determined check matrix parameters, and obtaining a check matrix (Hc) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; de-blocking, according to requirements of the Hc, data to be coded, and coding data of each sub-block according to the Hc to obtain multiple code words of the LDPC convolutional code; and adding the multiple code words of the LDPC convolutional code in a data frame and sending the data frame. 2. The method according to claim 1, wherein determining the check matrix parameters of the time-varying periodic LDPC convolutional code according to the performance of the transmission system, the complexity of the transmission system, and the synchronization manner for code word alignment comprises:
determining a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to the performance and the complexity of the transmission system, where the MS is the number of sub-matrixes in the Hc in each T; and determining a length (C) of each code word block according to the synchronization manner for code word alignment, and determining a parity bit length (P) according to the R and the C, and wherein constructing the QC-LDPC check matrix according to the determined check matrix parameters, and obtaining the check matrix Hc of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix comprises:
constructing the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P;
splitting the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and
filling, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the Hc. 3. The method according to claim 1, wherein before the adding the multiple code words of the LDPC convolutional code in the data frame and sending the data frame, the method further comprises:
adding an identity signal in the data frame, wherein the identity signal is used to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc to prompt a receiving end to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal, and decodes the multiple LDCP convolutional code words according to the H. 4. The method according to claim 3, wherein adding the identity signal in the data frame comprises:
adding either a frame header (FAS) of the data frame or a training sequence used at the time of transmitting the data frame in the data frame as the identity signal. 5. The method according to claim 3, wherein adding the identity signal in the data frame comprises:
inserting an identity of the correspondence between the code words and the Hc in an start position of the code words in the data frame, wherein the inserted identity of the correspondence is used as the added identity signal. 6. A decoding method for forward error correction, comprising:
receiving a data frame containing multiple low density parity check (LDPC) convolutional code words, wherein the multiple code words of the LDPC convolutional code are obtained by performing coding according to a check matrix (Hc) of time-varying periodic LDPC convolutional code, and wherein the Hc is obtained according to a quasi-cyclic low density parity check (QC-LDPC) check matrix; and obtaining the Hc that is used when the multiple code words of the LDPC convolutional code are obtained by performing coding, determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc and decoding the multiple code words of the LDPC convolutional code according to the correspondence. 7. The method according to claim 6, wherein the Hc is determined by using the following manners:
determining a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to performance and complexity of a transmission system, where the MS is the number of sub-matrixes in the Hc in each T; determining a length C of each code word block according to a synchronization manner for code word alignment, and determining a parity bit length P according to the R and C; constructing the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P; splitting the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and filling, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the Hc. 8. The method according to claim 6, wherein determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc comprises:
shifting the multiple code words of the LDPC convolutional code, and calculating a syndrome(S) in accordance with S=r*Hc t once in each shift, and until the maximum number of check relationships is met, obtaining the correspondence between the multiple code words of the LDPC convolutional code and the Hc, where r is a code stream containing the multiple code words of the LDPC convolutional code. 9. The method according to claim 6, wherein an identity signal is added in the data frame, and the identity signal is used to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc, and
wherein determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc comprises: identifying the identity signal added in the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal. 10. The method according to claim 9, wherein the identity signal is a frame header (FAS) of the data frame, and wherein identifying the identity signal added in the data frame and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the frame header (FAS) of the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the frame header FAS of the data frame. 11. The method according to claim 9, wherein the identity signal is a training sequence used at the time of transmitting the data frame, and wherein identifying the identity signal added in the data frame, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the training sequence used at the time of transmitting the data frame, and identifying the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the training sequence. 12. The method according to claim 9, wherein the identity signal is an identity of the correspondence between the code words and the Hc inserted in an initial position of the code words in the data frame, and wherein identifying the identity signal added in the data frame and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal comprises:
identifying the identity of the correspondence between the code words and the Hc, and determining the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity of the correspondence. 13. A coding apparatus for forward error correction, comprising:
a determining module, configured to determine check matrix parameters of time-varying periodic low density parity check (LDPC) convolutional code according to performance of a transmission system, complexity of the transmission system, and a synchronization manner for codeword alignment; a construction module, configured to construct a quasi-cyclic low density parity check (QC-LDPC) check matrix according to the check matrix parameters determined by the determining module, and to obtain a check matrix (Hc) of the time-varying periodic LDPC convolutional code according to the QC-LDPC check matrix; a coding module, configured to de-block, according to requirements of the Hc obtained by the construction module, data to be coded, and to code data of each sub-block according to the Hc to obtain multiple code words of the LDPC convolutional code; and a sending module, configured to add the multiple code words of the LDPC convolutional code obtained by the coding module through coding in a data frame and send the data frame. 14. The apparatus according to claim 13, wherein the determining module comprises:
a first determining unit, configured to determine a rate (R), a time-varying period (T), and a number of sub-matrixes (MS) according to the performance and the complexity of the transmission system, where the MS is the number of sub-matrixes in the Hc in each T; a second determining unit, configured to determine a length (C) of each code word block according to the synchronization manner for code word alignment; and a third determining unit, configured to determine a parity bit length (P) according to the R and the C, wherein the construction module comprises:
a construction unit, configured to construct the QC-LDPC check matrix with a preset girth according to the T, the MS, the C, and the P;
a splitting unit, configured to split the QC-LDPC check matrix into the MS number of sub-matrixes based on columns, and into the T number of sub-matrixes based on rows to obtain MS*T sub-matrixes; and
a filling unit, configured to fill, in a preset order, the MS*T sub-matrixes into MS*T positions in each period to obtain the H. 15. The apparatus according to claim 13, further comprising:
an adding module, configured to add an identity signal in the data frame sent by the sending module, wherein the identity signal is configured to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc to prompt a receiving end to identify the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal, and decodes the multiple LDCP convolutional code words according to the Hc. 16. The apparatus according to claim 15, wherein the adding module is configured to add a frame header FAS of the data frame in the data frame as an identity signal, or to add a training sequence used at the time of transmitting the data frame in the data frame as an identity signal, or to insert an identity of the correspondence between the code words and the Hc in an initial position of the code words in the data frame, and
wherein the inserted identity of the correspondence is used as the added identity signal. 17. A decoding apparatus for forward error correction, comprising:
a receiving module, configured to receive a data frame containing multiple low density parity check (LDPC) convolutional code words, wherein the multiple code words of the LDPC convolutional code are obtained by performing coding according to a check matrix (Hc) of time-varying periodic LDPC convolutional code, and wherein the Hc is obtained according to a quasi-cyclic low density parity check (QC-LDPC) check matrix; and an obtaining module, configured to obtain the Hc that is used when the multiple code words of the LDPC convolutional code are obtained by performing coding; a determining module, configured to determine the correspondence between the multiple code words of the LDPC convolutional code in the data frame received by the receiving module and the Hc obtained by the obtaining module; and a decoding module, configured to decode the multiple code words of the LDPC convolutional code according to the correspondence determined by the determining module. 18. The apparatus according to claim 17, wherein the determining module comprises:
a shifting unit, configured to shift the multiple code words of the LDPC convolutional code; and a calculation unit, configured to calculate a syndrome (S) in accordance with S=r*Hc t once in each shift of the shifting unit, and until the maximum number of check relationships is met, obtain the correspondence between the multiple code words of the LDPC convolutional code and the Hc, where r is a code stream containing the multiple code words of the LDPC convolutional code. 19. The apparatus according to claim 17, wherein an identity signal is added in the data frame received by the receiving module, and the identity signal is used to identify an initial position of the code words in the data frame, the number of layers corresponding to the Hc matrix, and the number of paths of coded data flows; and
wherein the determining module comprises:
an identification unit, configured to identify the identity signal added in the data frame received by the receiving module; and
a determining unit, configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity signal identified by the identification unit. 20. The apparatus according to claim 19, wherein the identity signal is a frame header (FAS) of the data frame, and the identification unit is configured to identify the frame header FAS of the data frame; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the FAS within the frame header of the data frame identified by the identification unit; or,
the identity signal is a training sequence used at the time of transmitting the data frame, and the identification unit is configured to identify the training sequence used at the time of transmitting the data frame; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the training sequence identified by the identification unit; or, the identity signal is an identity of the correspondence between the code words and the Hc inserted in the initial position of the code words of the data frame, and the identification unit is configured to identify the identity of the correspondence between the code words and the Hc; and the determining unit is configured to determine the correspondence between the multiple code words of the LDPC convolutional code and the Hc according to the identity of the correspondence identified by the identification unit. | 2,100 |
4,682 | 14,699,395 | 2,162 | A method for generating indices of activity for geographic areas includes: receiving a plurality of activity values, each associated with an entity and geographic location; identifying a geographic grid, the grid including a plurality of geographic areas area of equal size and including zero or at least two geographic locations associated with an activity value; calculating a weight value for each geographic area, the weight value being based on at least (i) a first weight factor applied to each activity value in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location in an adjacent geographic area; calculating an index value for each geographic area, the index value being based on the calculated weight value and an average weight value for each geographic area; and transmitting at least the calculated index value for one or more geographic areas. | 1. A method for generating indices of activity for geographic areas, comprising:
receiving, by a receiving device, a plurality of activity values, wherein each activity value is associated with an entity and a geographic location; identifying, by a processing device, a geographic grid, wherein the geographic grid includes a plurality of geographic areas, each geographic area being of an equal size and including (i) no geographic locations associated with an activity value or (ii) two or more geographic locations associated with an activity value; calculating, by the processing device, a weight value for each geographic area in the identified geographic grid, wherein the weight value is based on at least (i) a first weight factor applied to each activity value associated with a geographic location included in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location included in an adjacent geographic area; calculating, by the processing device, an index value for each geographic area in the identified geographic grid, wherein the index value is based on at least the calculated weight value for the respective geographic area and an average weight value for each geographic area in the identified geographic grid; and transmitting, by a transmitting device, at least the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid. 2. The method of claim 1, further comprising:
storing, in a memory, the first weight factor and the second weight factor. 3. The method of claim 1, further comprising:
storing, in a memory, one or more rules or algorithms; and identifying, by the processing device, the first weight factor and the second weight factor based on the stored one or more rules or algorithms. 4. The method of claim 3, wherein the first weight factor and the second weight factor are further based on a density of geographic locations associated with activity values included in each geographic area included in the geographic grid. 5. The method of claim 1, further comprising:
receiving, by the receiving device, the first weight factor and the second weight factor. 6. The method of claim 1, wherein the weight value calculated for each geographic area in the identified geographic grid is further based on a third weight factor applied to each activity value associated with a geographic location included in a tertiary geographic area adjacent to an adjacent geographic area. 7. The method of claim 1, wherein each geographic area included in the geographic grid is a square. 8. The method of claim 1, further comprising:
generating, by the processing device, a map, wherein the map illustrates each geographic area included in the geographic grid and indicates the respective calculated index value. 9. The method of claim 8, wherein the calculated index value is indicated via shading of the respective geographic area and wherein an intensity or color of the shading is based on the calculated index value. 10. The method of claim 8, wherein transmitting the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid includes transmitting the generated map. 11. A system for generating indices of activity for geographic areas, comprising:
a receiving device configured to receive a plurality of activity values, wherein each activity value is associated with an entity and a geographic location; a processing device configured to
identify a geographic grid, wherein the geographic grid includes a plurality of geographic areas, each geographic area being of an equal size and including (i) no geographic locations associated with an activity value or (ii) two or more geographic locations associated with an activity value,
calculate a weight value for each geographic area in the identified geographic grid, wherein the weight value is based on at least (i) a first weight factor applied to each activity value associated with a geographic location included in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location included in an adjacent geographic area, and
calculate an index value for each geographic area in the identified geographic grid, wherein the index value is based on at least the calculated weight value for the respective geographic area and an average weight value for each geographic area in the identified geographic grid, and
a transmitting device configured to transmit at least the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid. 12. The system of claim 11, further comprising:
a memory configured to store the first weight factor and the second weight factor. 13. The system of claim 11, further comprising:
a memory configured to store one or more rules or algorithms, wherein the processing device is further configured to identify the first weight factor and the second weight factor based on the stored one or more rules or algorithms. 14. The system of claim 13, wherein the first weight factor and the second weight factor are further based on a density of geographic locations associated with activity values included in each geographic area included in the geographic grid. 15. The system of claim 11, wherein the receiving device is further configured to receive the first weight factor and the second weight factor. 16. The system of claim 11, wherein the weight value calculated for each geographic area in the identified geographic grid is further based on a third weight factor applied to each activity value associated with a geographic location included in a tertiary geographic area adjacent to an adjacent geographic area. 17. The system of claim 11, wherein each geographic area included in the geographic grid is a square. 18. The system of claim 11, wherein the processing device is further configured to generate a map, wherein the map illustrates each geographic area included in the geographic grid and indicates the respective calculated index value. 19. The system of claim 18, wherein the calculated index value is indicated via shading of the respective geographic area and wherein an intensity or color of the shading is based on the calculated index value. 20. The system of claim 18, wherein transmitting the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid includes transmitting the generated map. | A method for generating indices of activity for geographic areas includes: receiving a plurality of activity values, each associated with an entity and geographic location; identifying a geographic grid, the grid including a plurality of geographic areas area of equal size and including zero or at least two geographic locations associated with an activity value; calculating a weight value for each geographic area, the weight value being based on at least (i) a first weight factor applied to each activity value in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location in an adjacent geographic area; calculating an index value for each geographic area, the index value being based on the calculated weight value and an average weight value for each geographic area; and transmitting at least the calculated index value for one or more geographic areas.1. A method for generating indices of activity for geographic areas, comprising:
receiving, by a receiving device, a plurality of activity values, wherein each activity value is associated with an entity and a geographic location; identifying, by a processing device, a geographic grid, wherein the geographic grid includes a plurality of geographic areas, each geographic area being of an equal size and including (i) no geographic locations associated with an activity value or (ii) two or more geographic locations associated with an activity value; calculating, by the processing device, a weight value for each geographic area in the identified geographic grid, wherein the weight value is based on at least (i) a first weight factor applied to each activity value associated with a geographic location included in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location included in an adjacent geographic area; calculating, by the processing device, an index value for each geographic area in the identified geographic grid, wherein the index value is based on at least the calculated weight value for the respective geographic area and an average weight value for each geographic area in the identified geographic grid; and transmitting, by a transmitting device, at least the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid. 2. The method of claim 1, further comprising:
storing, in a memory, the first weight factor and the second weight factor. 3. The method of claim 1, further comprising:
storing, in a memory, one or more rules or algorithms; and identifying, by the processing device, the first weight factor and the second weight factor based on the stored one or more rules or algorithms. 4. The method of claim 3, wherein the first weight factor and the second weight factor are further based on a density of geographic locations associated with activity values included in each geographic area included in the geographic grid. 5. The method of claim 1, further comprising:
receiving, by the receiving device, the first weight factor and the second weight factor. 6. The method of claim 1, wherein the weight value calculated for each geographic area in the identified geographic grid is further based on a third weight factor applied to each activity value associated with a geographic location included in a tertiary geographic area adjacent to an adjacent geographic area. 7. The method of claim 1, wherein each geographic area included in the geographic grid is a square. 8. The method of claim 1, further comprising:
generating, by the processing device, a map, wherein the map illustrates each geographic area included in the geographic grid and indicates the respective calculated index value. 9. The method of claim 8, wherein the calculated index value is indicated via shading of the respective geographic area and wherein an intensity or color of the shading is based on the calculated index value. 10. The method of claim 8, wherein transmitting the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid includes transmitting the generated map. 11. A system for generating indices of activity for geographic areas, comprising:
a receiving device configured to receive a plurality of activity values, wherein each activity value is associated with an entity and a geographic location; a processing device configured to
identify a geographic grid, wherein the geographic grid includes a plurality of geographic areas, each geographic area being of an equal size and including (i) no geographic locations associated with an activity value or (ii) two or more geographic locations associated with an activity value,
calculate a weight value for each geographic area in the identified geographic grid, wherein the weight value is based on at least (i) a first weight factor applied to each activity value associated with a geographic location included in the respective geographic area and (ii) a second weight factor applied to each activity value associated with a geographic location included in an adjacent geographic area, and
calculate an index value for each geographic area in the identified geographic grid, wherein the index value is based on at least the calculated weight value for the respective geographic area and an average weight value for each geographic area in the identified geographic grid, and
a transmitting device configured to transmit at least the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid. 12. The system of claim 11, further comprising:
a memory configured to store the first weight factor and the second weight factor. 13. The system of claim 11, further comprising:
a memory configured to store one or more rules or algorithms, wherein the processing device is further configured to identify the first weight factor and the second weight factor based on the stored one or more rules or algorithms. 14. The system of claim 13, wherein the first weight factor and the second weight factor are further based on a density of geographic locations associated with activity values included in each geographic area included in the geographic grid. 15. The system of claim 11, wherein the receiving device is further configured to receive the first weight factor and the second weight factor. 16. The system of claim 11, wherein the weight value calculated for each geographic area in the identified geographic grid is further based on a third weight factor applied to each activity value associated with a geographic location included in a tertiary geographic area adjacent to an adjacent geographic area. 17. The system of claim 11, wherein each geographic area included in the geographic grid is a square. 18. The system of claim 11, wherein the processing device is further configured to generate a map, wherein the map illustrates each geographic area included in the geographic grid and indicates the respective calculated index value. 19. The system of claim 18, wherein the calculated index value is indicated via shading of the respective geographic area and wherein an intensity or color of the shading is based on the calculated index value. 20. The system of claim 18, wherein transmitting the calculated index value for one or more geographic areas of the plurality of geographic areas included in the identified geographic grid includes transmitting the generated map. | 2,100 |
4,683 | 13,604,402 | 2,169 | A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory. | 1. A computer-implemented method comprising:
storing an XML document in a persistent database of a database system; generating an XML tree index on said XML document, wherein the XML tree index comprises a set of fixed-sized index entries, each index entry of the set of fixed-sized index entries having a one-to-one correspondence with a node of said XML document; wherein said database system is configured to only generate entries in said set that have the fixed-size; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein
a first index entry of the set of fixed-sized index entries corresponds to a particular node of said XML document; and said first index entry comprises at least: a) a first link to a second index entry in said XML tree index, wherein the second index entry corresponds to a parent node of the particular node of said XML document; b) a second link to a third index entry in said XML tree index, wherein the third index entry corresponds to a first child node of the particular node of said XML document; and c) a third link to a fourth index entry in said XML tree index, wherein the fourth index entry corresponds to a next sibling node of the particular node of said XML document. 3. The method of claim 2, wherein the index entry further comprises:
d) a fourth link to a fifth index entry in said XML tree index, wherein the fifth index entry corresponds to a previous sibling node of the particular node of said XML document; or e) a fifth link to a sixth index entry in said XML tree index, wherein the sixth index entry corresponds to an attribute node of the particular node of said XML document. 4. The method of claim 2, wherein said first index entry further comprises:
an element type of the particular node and a content link into XML document content; wherein the element type is one of:
a) an element node
b) a text node
c) a comment node
e) a processing instruction node
f) an attribute node; and
wherein the content link into said XML document content points to a location within the XML document content that contains one of:
a) an element name of an element node;
b) an attribute name of attribute node;
c) a text value of a text node;
d) comment content of a comment node; or
e) processing instruction content of a processing instruction node. 5. The method of claim 2, further comprising:
receiving a path-based expression requiring navigation of a node hierarchy within said XML document and a starting index entry; retrieving at least one link from the first link, the second link, the third link, in the starting index entry, and traversing said at least one link to navigate a corresponding hierarchy of index entries; and determining a final index entry that corresponds to an XML document node represented by the path-based expression. 6. The method of claim 5, wherein said traversing of one or more of the links contained in the index entries of said portion of said set of fixed-sized index entries includes calling a function through an abstract XML content interface to obtain the content of an XML node identified by the path-based expression, wherein implementation of the function depends on underlying storage of XML content that is being navigated by the path-based expression. 7. The method of claim 5, further comprising:
accessing a fixed location within the XML tree index to find a link to a root index entry; and using the link to the root index entry to access an index entry corresponding to a root node of the node hierarchy. 8. The method of claim 1, further comprising,
in response to receiving a certain XML document, building the XML tree index for said certain XML document without changing content of said certain XML document. 9. The method of claim 1, wherein each XML document is stored as one of:
a) a CLOB stored in a database table; b) binary XML stored in the database table; c) an XML file stored persistently in a file system of a non-volatile storage device; d) the XML file stored in volatile memory; or e) a sequence of XML tokens stored in volatile memory. 10. The method of claim 1, wherein the XML tree index for said XML document is stored as one of:
a) a BLOB column in a database table; b) a file in a file system that references positions of elements found within a file of XML content; or c) an array stored in volatile memory pointing to memory addresses in a sequence of XML tokens comprising XML content. 11. The method of claim 1, wherein size of said each index entry is 2m bytes of space, wherein m is a positive integer. 12. The method of claim 11 wherein the size of said each index entry is one of 32 bytes or 64 bytes. 13. The method of claim 1, wherein generating said XML tree index is performed in response to a request to generate said XML tree index on said XML document. 14. The method of claim 1, further comprising creating a path table index over nodes of said XML document; and
storing in said path table index one or more path table index entries, each path table index entry comprising an XML tree index entry address corresponding to each node of the nodes of said XML document. 15. The method of claim 1, wherein the XML tree index on said XML document is converted into an in-memory DOM object. 16. The method of claim 1, further comprising storing said XML tree index persistently in said database, wherein storing the XML tree index persistently in said database further comprises using semantic-aware compression to compress the XML tree index based on knowledge of a structure of said each index entry. 17. The method of claim 1, wherein said XML tree index is comprised of a set of index pages;
wherein an XML tree index page of said set of index pages is comprised of one or more index entries; wherein an index page has a one-to-one correspondence to a virtual memory page that is managed by an operating system; and controlling a working set size of virtual memory pages, wherein said virtual memory page contains one or more index pages. 18. The method of claim 17, further comprising:
receiving a request to add a new node to an existing XML document; retrieving a bitmap located on a page in the XML tree index for said existing XML document; using the bitmap to find a location within the page of an empty index entry; and inserting a new index entry into said location that corresponds to the new node. | A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.1. A computer-implemented method comprising:
storing an XML document in a persistent database of a database system; generating an XML tree index on said XML document, wherein the XML tree index comprises a set of fixed-sized index entries, each index entry of the set of fixed-sized index entries having a one-to-one correspondence with a node of said XML document; wherein said database system is configured to only generate entries in said set that have the fixed-size; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein
a first index entry of the set of fixed-sized index entries corresponds to a particular node of said XML document; and said first index entry comprises at least: a) a first link to a second index entry in said XML tree index, wherein the second index entry corresponds to a parent node of the particular node of said XML document; b) a second link to a third index entry in said XML tree index, wherein the third index entry corresponds to a first child node of the particular node of said XML document; and c) a third link to a fourth index entry in said XML tree index, wherein the fourth index entry corresponds to a next sibling node of the particular node of said XML document. 3. The method of claim 2, wherein the index entry further comprises:
d) a fourth link to a fifth index entry in said XML tree index, wherein the fifth index entry corresponds to a previous sibling node of the particular node of said XML document; or e) a fifth link to a sixth index entry in said XML tree index, wherein the sixth index entry corresponds to an attribute node of the particular node of said XML document. 4. The method of claim 2, wherein said first index entry further comprises:
an element type of the particular node and a content link into XML document content; wherein the element type is one of:
a) an element node
b) a text node
c) a comment node
e) a processing instruction node
f) an attribute node; and
wherein the content link into said XML document content points to a location within the XML document content that contains one of:
a) an element name of an element node;
b) an attribute name of attribute node;
c) a text value of a text node;
d) comment content of a comment node; or
e) processing instruction content of a processing instruction node. 5. The method of claim 2, further comprising:
receiving a path-based expression requiring navigation of a node hierarchy within said XML document and a starting index entry; retrieving at least one link from the first link, the second link, the third link, in the starting index entry, and traversing said at least one link to navigate a corresponding hierarchy of index entries; and determining a final index entry that corresponds to an XML document node represented by the path-based expression. 6. The method of claim 5, wherein said traversing of one or more of the links contained in the index entries of said portion of said set of fixed-sized index entries includes calling a function through an abstract XML content interface to obtain the content of an XML node identified by the path-based expression, wherein implementation of the function depends on underlying storage of XML content that is being navigated by the path-based expression. 7. The method of claim 5, further comprising:
accessing a fixed location within the XML tree index to find a link to a root index entry; and using the link to the root index entry to access an index entry corresponding to a root node of the node hierarchy. 8. The method of claim 1, further comprising,
in response to receiving a certain XML document, building the XML tree index for said certain XML document without changing content of said certain XML document. 9. The method of claim 1, wherein each XML document is stored as one of:
a) a CLOB stored in a database table; b) binary XML stored in the database table; c) an XML file stored persistently in a file system of a non-volatile storage device; d) the XML file stored in volatile memory; or e) a sequence of XML tokens stored in volatile memory. 10. The method of claim 1, wherein the XML tree index for said XML document is stored as one of:
a) a BLOB column in a database table; b) a file in a file system that references positions of elements found within a file of XML content; or c) an array stored in volatile memory pointing to memory addresses in a sequence of XML tokens comprising XML content. 11. The method of claim 1, wherein size of said each index entry is 2m bytes of space, wherein m is a positive integer. 12. The method of claim 11 wherein the size of said each index entry is one of 32 bytes or 64 bytes. 13. The method of claim 1, wherein generating said XML tree index is performed in response to a request to generate said XML tree index on said XML document. 14. The method of claim 1, further comprising creating a path table index over nodes of said XML document; and
storing in said path table index one or more path table index entries, each path table index entry comprising an XML tree index entry address corresponding to each node of the nodes of said XML document. 15. The method of claim 1, wherein the XML tree index on said XML document is converted into an in-memory DOM object. 16. The method of claim 1, further comprising storing said XML tree index persistently in said database, wherein storing the XML tree index persistently in said database further comprises using semantic-aware compression to compress the XML tree index based on knowledge of a structure of said each index entry. 17. The method of claim 1, wherein said XML tree index is comprised of a set of index pages;
wherein an XML tree index page of said set of index pages is comprised of one or more index entries; wherein an index page has a one-to-one correspondence to a virtual memory page that is managed by an operating system; and controlling a working set size of virtual memory pages, wherein said virtual memory page contains one or more index pages. 18. The method of claim 17, further comprising:
receiving a request to add a new node to an existing XML document; retrieving a bitmap located on a page in the XML tree index for said existing XML document; using the bitmap to find a location within the page of an empty index entry; and inserting a new index entry into said location that corresponds to the new node. | 2,100 |
4,684 | 13,062,787 | 2,135 | The present invention provides a method and an apparatus to manage non-volatile (NV) memory as cache on a hard drive disk for data storage. | 1. A method to use a hard disk drive for data storage, comprising:
receiving commands from an operating system on a computer; storing, in non-volatile (NV) memory of the hard disk drive, at least a portion of the data corresponding to a file in use by the computer; tracking, on the hard disk drive, which part of the data stored in the NV memory has been modified by the operating system on the computer; and flushing, in response to a command received from the operating system on the computer, the data in the NV memory to commit the modified data to rotating hard disk media. 2. The method as set forth in claim 1, wherein the tracking is performed by at least one of internal controller hardware and embedded firmware on the hard disk drive. 3. The method as set forth in claim 1, wherein the flushing comprises clearing the data in the NV memory of the hard disk drive after committing the modified data to the rotating hard disk media. 4. The method as set forth in claim 1, wherein the flushing comprises keeping the data in the NV memory of the hard disk drive after committing the modified data to the rotating hard disk media. 5. A hard disk drive for data storage used by a computer comprising:
at least one non-volatile (NV) memory to store at least a portion of the data corresponding to a file in use by the computer; a plurality of rotating hard disk media; a controller in communication with the NV memory, the rotating hard disk media, and the computer, wherein the controller is configured to receive and respond to interface commands from an operating system on the computer which enable the computer to use the hard disk drive, the interface commands comprising a Flush Cache command that is compatible in syntax with the Flush Cache command from a hard disk drive without NV memory; and a hardware interface to implement standardized protocols to connect storage devices. 6. The hard disk drive as set forth in claim 5, further comprises at least one of internal controller hardware and embedded firmware that track which part of the data in the NV memory of the hard disk drive has been modified. 7. The hard disk drive as set forth in claim 5, wherein the controller is further adapted to flush the data in the NV memory of the hard disk drive in response to a command received from the operating system to commit data to permanent storage. 8. The hard disk drive as set forth in claim 7, wherein the controller is further adapted to commit modified data in the NV memory of the hard disk drive to the rotating hard disk media. 9. The hard disk drive as set forth in claim 5, wherein the Flush Cache command further includes an option to clear the data in the NV memory of the hard disk drive after committing modified data to the rotating hard disk media. 10. The hard disk drive as set forth in claim 5, wherein the Flush Cache command further includes an option to keep the data in the NV memory of the hard disk drive after committing modified data to the rotating hard disk media. 11. A computer or computer system comprising:
a hard disk drive that further comprises:
at least one non-volatile (NV) memory to store at least a portion of the data corresponding to a file in use by the computer;
a plurality of rotating hard disk media;
a controller in communication with the NV memory, the rotating hard disk media, and the computer, wherein the controller is configured to receive and respond to interface commands from an operating system on the computer which enable the computer to use the hard disk drive, the interface commands comprising a Flush Cache command that is compatible in syntax with the Flush Cache command from a hard disk drive without NV memory; and
a hardware interface to implement standardized protocols to connect storage devices. 12. The computer or computer system as set forth in claim 11, wherein of the hard disk drive is delegated by the computer with the task of tracking modification status of the data in the NV memory of the hard disk drive 13. The computer or computer system as set forth in claim 12, wherein the task of tracking modification status of the data in the NV memory of the hard disk drive is accomplished by at least one of internal controller hardware and embedded firmware on the hard disk drive. 14. The computer or computer system as set forth in claim 11, wherein an operating system on the computer sends the Flush Disk command to the hard disk drive to commit data in the NV memory of the hard disk drive to the rotating hard disk media. 15. The computer or computer system as set forth in claim 14, wherein the Flush Disk command causes the data in the NV memory of the hard disk drive that is modified by the operating system to be committed to the rotating hard disk media. | The present invention provides a method and an apparatus to manage non-volatile (NV) memory as cache on a hard drive disk for data storage.1. A method to use a hard disk drive for data storage, comprising:
receiving commands from an operating system on a computer; storing, in non-volatile (NV) memory of the hard disk drive, at least a portion of the data corresponding to a file in use by the computer; tracking, on the hard disk drive, which part of the data stored in the NV memory has been modified by the operating system on the computer; and flushing, in response to a command received from the operating system on the computer, the data in the NV memory to commit the modified data to rotating hard disk media. 2. The method as set forth in claim 1, wherein the tracking is performed by at least one of internal controller hardware and embedded firmware on the hard disk drive. 3. The method as set forth in claim 1, wherein the flushing comprises clearing the data in the NV memory of the hard disk drive after committing the modified data to the rotating hard disk media. 4. The method as set forth in claim 1, wherein the flushing comprises keeping the data in the NV memory of the hard disk drive after committing the modified data to the rotating hard disk media. 5. A hard disk drive for data storage used by a computer comprising:
at least one non-volatile (NV) memory to store at least a portion of the data corresponding to a file in use by the computer; a plurality of rotating hard disk media; a controller in communication with the NV memory, the rotating hard disk media, and the computer, wherein the controller is configured to receive and respond to interface commands from an operating system on the computer which enable the computer to use the hard disk drive, the interface commands comprising a Flush Cache command that is compatible in syntax with the Flush Cache command from a hard disk drive without NV memory; and a hardware interface to implement standardized protocols to connect storage devices. 6. The hard disk drive as set forth in claim 5, further comprises at least one of internal controller hardware and embedded firmware that track which part of the data in the NV memory of the hard disk drive has been modified. 7. The hard disk drive as set forth in claim 5, wherein the controller is further adapted to flush the data in the NV memory of the hard disk drive in response to a command received from the operating system to commit data to permanent storage. 8. The hard disk drive as set forth in claim 7, wherein the controller is further adapted to commit modified data in the NV memory of the hard disk drive to the rotating hard disk media. 9. The hard disk drive as set forth in claim 5, wherein the Flush Cache command further includes an option to clear the data in the NV memory of the hard disk drive after committing modified data to the rotating hard disk media. 10. The hard disk drive as set forth in claim 5, wherein the Flush Cache command further includes an option to keep the data in the NV memory of the hard disk drive after committing modified data to the rotating hard disk media. 11. A computer or computer system comprising:
a hard disk drive that further comprises:
at least one non-volatile (NV) memory to store at least a portion of the data corresponding to a file in use by the computer;
a plurality of rotating hard disk media;
a controller in communication with the NV memory, the rotating hard disk media, and the computer, wherein the controller is configured to receive and respond to interface commands from an operating system on the computer which enable the computer to use the hard disk drive, the interface commands comprising a Flush Cache command that is compatible in syntax with the Flush Cache command from a hard disk drive without NV memory; and
a hardware interface to implement standardized protocols to connect storage devices. 12. The computer or computer system as set forth in claim 11, wherein of the hard disk drive is delegated by the computer with the task of tracking modification status of the data in the NV memory of the hard disk drive 13. The computer or computer system as set forth in claim 12, wherein the task of tracking modification status of the data in the NV memory of the hard disk drive is accomplished by at least one of internal controller hardware and embedded firmware on the hard disk drive. 14. The computer or computer system as set forth in claim 11, wherein an operating system on the computer sends the Flush Disk command to the hard disk drive to commit data in the NV memory of the hard disk drive to the rotating hard disk media. 15. The computer or computer system as set forth in claim 14, wherein the Flush Disk command causes the data in the NV memory of the hard disk drive that is modified by the operating system to be committed to the rotating hard disk media. | 2,100 |
4,685 | 14,061,740 | 2,176 | Systems and methods are provided for populating user information onto an electronic form such as a word processing document, template, application-specific form or web page. Fields are identified on the electronic form and matched with fields stored in a continuously-updated user profile before the content of the matching fields are populated onto the electronic form. The electronic form may be stored within a central forms library and selected by the user for completion, while a third-party form presented as a word processing document, template, application-specific form or web page may be populated using an application extension which communicates with an application, browser or third-party service to identify and populate the form fields. Additionally, a mobile application provides for physical forms to be captured by a camera on a smartphone or tablet, after which the fields are identified and populated onto the captured image of the form. | 1. A system for populating user information on an electronic form, comprising:
a profile creation unit which creates a user profile of user information including a plurality of fields and a plurality of values for the plurality of fields which stores the user information; and an information populating unit which is configured to:
identify at least one field on the electronic form;
match the identified at least one field on the electronic form with at least one corresponding field in the user profile; and
populate the identified at least one field on the electronic form with the value of the matched corresponding field in the user profile. 2. The system of claim 1, wherein the electronic form is stored in a central forms library of a server. 3. The system of claim 1, wherein the electronic form is stored in a remote database. 4. The system of claim 1, wherein the electronic form is provided by one of: an application, an internet browser and a third-party service. 5. The system of claim 4, wherein the information populating unit interfaces with the application, internet browser or third-party service via an application programming interface (API), browser extension or plugin. 6. The system of claim 1, wherein the electronic form is selected from at least one of: a word processing document, a template, an application-specific form and a webpage. 7. The system of claim 1, wherein the matched corresponding field in the user profile contains a plurality of values, and wherein the information populating unit selects one of the plurality of values to populate into the matching at least one field based on other fields in the electronic form. 8. The system of claim 1, wherein the electronic form is created by capturing an image of a physical form from a portable electronic device and identifying the at least one field based on an optical character recognition. 9. The system of claim 1, wherein the electronic form populated with the value of the matched corresponding field, a name of the electronic form and a date the electronic form was populated is stored in a user profile archive. 10. The system of claim 1, wherein the information populating unit provides a form completion indicator which displays a visual indication of a number of the at least one field which can be populated on the electronic form. 11. A method of populating user information on an electronic form, comprising the steps of:
creating a user profile of user information including a plurality of fields and a plurality of values for the plurality of fields which stores the user information; identifying at least one field on the electronic form; matching the identified at least one field on the electronic form with at least one corresponding field in the user profile; and populating the identified at least one field on the electronic form with the value of the matched corresponding field in the user profile. 12. The method of claim 11, further comprising storing the electronic form in a central forms library of a server. 13. The method of claim 11, further comprising storing the electronic form in a remote database. 14. The method of claim 11, wherein the electronic form is provided by one of: an application, an internet browser and a third-party service. 15. The method of claim 14, wherein the information populating unit interfaces with the application, internet browser or third-party service via an application programming interface (API), browser extension or plugin. 16. The method of claim 11, wherein the electronic form is selected from at least one of:
a word processing document, a template, an application-specific form and a webpage. 17. The method of claim 11, wherein the matched corresponding field in the user profile contains a plurality of values, and wherein one of the plurality of values is selected to populate into the matching at least one field based on other fields in the electronic form. 18. The method of claim 11, further comprising capturing an image of a physical form from a portable electronic device to create the electronic form and identifying the at least one field based on an optical character recognition. 19. The method of claim 11, further comprising storing the electronic form populated with the value of the matched corresponding field in a user profile archive along with a name of the electronic form and a date the electronic form was populated. 20. The method of claim 10, wherein the information populating unit displays a form completion indicator which displays a visual indication of a number of the at least one field which can be populated on the electronic form. | Systems and methods are provided for populating user information onto an electronic form such as a word processing document, template, application-specific form or web page. Fields are identified on the electronic form and matched with fields stored in a continuously-updated user profile before the content of the matching fields are populated onto the electronic form. The electronic form may be stored within a central forms library and selected by the user for completion, while a third-party form presented as a word processing document, template, application-specific form or web page may be populated using an application extension which communicates with an application, browser or third-party service to identify and populate the form fields. Additionally, a mobile application provides for physical forms to be captured by a camera on a smartphone or tablet, after which the fields are identified and populated onto the captured image of the form.1. A system for populating user information on an electronic form, comprising:
a profile creation unit which creates a user profile of user information including a plurality of fields and a plurality of values for the plurality of fields which stores the user information; and an information populating unit which is configured to:
identify at least one field on the electronic form;
match the identified at least one field on the electronic form with at least one corresponding field in the user profile; and
populate the identified at least one field on the electronic form with the value of the matched corresponding field in the user profile. 2. The system of claim 1, wherein the electronic form is stored in a central forms library of a server. 3. The system of claim 1, wherein the electronic form is stored in a remote database. 4. The system of claim 1, wherein the electronic form is provided by one of: an application, an internet browser and a third-party service. 5. The system of claim 4, wherein the information populating unit interfaces with the application, internet browser or third-party service via an application programming interface (API), browser extension or plugin. 6. The system of claim 1, wherein the electronic form is selected from at least one of: a word processing document, a template, an application-specific form and a webpage. 7. The system of claim 1, wherein the matched corresponding field in the user profile contains a plurality of values, and wherein the information populating unit selects one of the plurality of values to populate into the matching at least one field based on other fields in the electronic form. 8. The system of claim 1, wherein the electronic form is created by capturing an image of a physical form from a portable electronic device and identifying the at least one field based on an optical character recognition. 9. The system of claim 1, wherein the electronic form populated with the value of the matched corresponding field, a name of the electronic form and a date the electronic form was populated is stored in a user profile archive. 10. The system of claim 1, wherein the information populating unit provides a form completion indicator which displays a visual indication of a number of the at least one field which can be populated on the electronic form. 11. A method of populating user information on an electronic form, comprising the steps of:
creating a user profile of user information including a plurality of fields and a plurality of values for the plurality of fields which stores the user information; identifying at least one field on the electronic form; matching the identified at least one field on the electronic form with at least one corresponding field in the user profile; and populating the identified at least one field on the electronic form with the value of the matched corresponding field in the user profile. 12. The method of claim 11, further comprising storing the electronic form in a central forms library of a server. 13. The method of claim 11, further comprising storing the electronic form in a remote database. 14. The method of claim 11, wherein the electronic form is provided by one of: an application, an internet browser and a third-party service. 15. The method of claim 14, wherein the information populating unit interfaces with the application, internet browser or third-party service via an application programming interface (API), browser extension or plugin. 16. The method of claim 11, wherein the electronic form is selected from at least one of:
a word processing document, a template, an application-specific form and a webpage. 17. The method of claim 11, wherein the matched corresponding field in the user profile contains a plurality of values, and wherein one of the plurality of values is selected to populate into the matching at least one field based on other fields in the electronic form. 18. The method of claim 11, further comprising capturing an image of a physical form from a portable electronic device to create the electronic form and identifying the at least one field based on an optical character recognition. 19. The method of claim 11, further comprising storing the electronic form populated with the value of the matched corresponding field in a user profile archive along with a name of the electronic form and a date the electronic form was populated. 20. The method of claim 10, wherein the information populating unit displays a form completion indicator which displays a visual indication of a number of the at least one field which can be populated on the electronic form. | 2,100 |
4,686 | 14,729,579 | 2,191 | An automation framework for providing updates in a distributed environment includes various elements. The framework provides tasks to a client environment, such as a software update. An update can be developed and tested for one client environment. That update can be reduced to a set of data that can be used to create updates for other client environments that include a same version of the program. In addition, a respective script can be generated for each client environment based on the specific client environment. | 1. Computer-readable storage media storing information that, when executed by one or more computing devices, performs operations for updating software in a distributed computing environment comprising:
receiving by a secure network-accessible server a task that is tailored for a client environment; storing the task in a secure account dedicated to the client environment; receiving a request from an automated task manager running on a client device in the client environment, which is authenticated to the secure account, to send the task; transmitting the task to the automated task manager; and updating a status of the task. 2. The computer-readable storage media of claim 1, wherein the operations further comprise monitoring the secure account by a task-monitoring module to determine both when the task is queued up in the secure account and when the task is transmitted to the automated task manager. 3. The computer-readable storage media of claim 2, wherein the operations further comprise, rendering a task-monitor user interface that communicates with the task-monitoring module and that presents the status. 4. The computer-readable storage media of claim 3, wherein updating the status of the task includes changing the status from a pending status to an active status by the task-monitoring module when the task is transmitted to the automated task manager. 5. The computer-readable media of claim 3, wherein the operations further comprise receiving a message from the automated task manager that the task is successfully completed, and wherein updating the status of the task includes picking up the message by the task-monitoring module and transforming the status from active to a successful-completion status. 6. The computer-readable storage media of claim 5, wherein the task-monitor user interface provides a selectable link that, when selected, presents contents of the message that was received from the automated task manager. 7. The computer-readable storage media of claim 1, wherein the operations further comprise receiving a message from the task manager indicating that the task was not successfully completed, wherein a task-monitoring module pulls the message from the secure account and updates the status to include a failed status, and wherein content of the message is viewable in a task-monitor user interface. 8. Computer-readable storage media storing information that, when executed by one or more computing devices, performs operations for updating software in a distributed computing environment comprising:
automatically determining whether a task is queued up by sending a request to a secure account stored on a secure network-accessible server in a server environment; receiving the task from the secure network-accessible server hosting the secure account, wherein the task is received by a task manager running in a client environment; routing the task to a handler program that is running in the client environment and that carries out the task; generating by the handler program a message that describes whether the task was successfully completed; communicating the message from the handler program to the task manager; and sending the message to the secure network-accessible server to provide a status of the task. 9. The computer-readable storage media of claim 8, wherein the task includes updating a software program running in the client environment, and wherein the handler program performs the task by transforming the software program to include an update. 10. The computer-readable media of claim 9, wherein updating the software program running in the client environment includes creating a before-update folder in the client environment and populating the before-update folder with a first version of the software program that is to be updated. 11. The computer-readable media of claim 10 further comprising, calculating a hash value for the first version of the software program and transmitting the hash value to the server running in the server environment. 12. The computer-readable media of claim 9 further comprising, creating an after-update folder in the client environment and populating the after-update folder with a second version of the software program that is to be updated and that is substantially similar to the first version of the software program. 13. The computer-readable media of claim 12, wherein updating the software program running in the client environment includes transforming the second version of the software program in the after-update folder to include the update, thereby transforming the software program into an updated software program. 14. The computer-readable media of claim 13, wherein the operations further comprise
generating a data set by comparing the first version of the software program in the before-update folder to the updated software program in the after-update folder and by identifying one or more differences between the first version and the second version, the one or more differences being included in the data set, and transmitting the data set to the secure network-accessible server in the server environment. 15. The computer-readable media of claim 14, wherein the operations further comprise encoding the data set to create an encoded data set, which is transmitted to the secure network-accessible server. 16. A system of computing components that automatically updates a computer software program in a distributed environment comprising:
a server-side computing device having a processor coupled to computer-readable storage media, which stores a secure account that is maintained in a server environment and that stores a task to be carried out in a client environment; an automatic task manager that runs on a client-side computing device in the client environment and that automatically retrieves the task by sending a request to the secure account; a handler running in the client environment that receives the task from the automatic task manager and that carries out the task in the client environment, wherein the handler provides a message that indicates whether task was successfully completed and that is provided to the secure account; and a task-monitor module running in the server environment that picks up the message from the secure account. 17. The system of claim 16 further comprising, a task-monitor user interface that presents a status update indicating whether the task was successfully completed in the client environment, wherein the status update is presented together with a client identifier, which is unique to the client environment. 18. The system of claim 16 further comprising, a client-side program file structure that is maintained in the client environment and that stores one or more code files, which include program code executed to run a program. 19. The system of claim 18 further comprising, a server-side program file structure that is maintained in a file share of the server environment and that substantially mirrors an organization of the client-side program file structure. 20. The system of claim 19, wherein the server-side program file structure stores one or more hash files that represent the program code. | An automation framework for providing updates in a distributed environment includes various elements. The framework provides tasks to a client environment, such as a software update. An update can be developed and tested for one client environment. That update can be reduced to a set of data that can be used to create updates for other client environments that include a same version of the program. In addition, a respective script can be generated for each client environment based on the specific client environment.1. Computer-readable storage media storing information that, when executed by one or more computing devices, performs operations for updating software in a distributed computing environment comprising:
receiving by a secure network-accessible server a task that is tailored for a client environment; storing the task in a secure account dedicated to the client environment; receiving a request from an automated task manager running on a client device in the client environment, which is authenticated to the secure account, to send the task; transmitting the task to the automated task manager; and updating a status of the task. 2. The computer-readable storage media of claim 1, wherein the operations further comprise monitoring the secure account by a task-monitoring module to determine both when the task is queued up in the secure account and when the task is transmitted to the automated task manager. 3. The computer-readable storage media of claim 2, wherein the operations further comprise, rendering a task-monitor user interface that communicates with the task-monitoring module and that presents the status. 4. The computer-readable storage media of claim 3, wherein updating the status of the task includes changing the status from a pending status to an active status by the task-monitoring module when the task is transmitted to the automated task manager. 5. The computer-readable media of claim 3, wherein the operations further comprise receiving a message from the automated task manager that the task is successfully completed, and wherein updating the status of the task includes picking up the message by the task-monitoring module and transforming the status from active to a successful-completion status. 6. The computer-readable storage media of claim 5, wherein the task-monitor user interface provides a selectable link that, when selected, presents contents of the message that was received from the automated task manager. 7. The computer-readable storage media of claim 1, wherein the operations further comprise receiving a message from the task manager indicating that the task was not successfully completed, wherein a task-monitoring module pulls the message from the secure account and updates the status to include a failed status, and wherein content of the message is viewable in a task-monitor user interface. 8. Computer-readable storage media storing information that, when executed by one or more computing devices, performs operations for updating software in a distributed computing environment comprising:
automatically determining whether a task is queued up by sending a request to a secure account stored on a secure network-accessible server in a server environment; receiving the task from the secure network-accessible server hosting the secure account, wherein the task is received by a task manager running in a client environment; routing the task to a handler program that is running in the client environment and that carries out the task; generating by the handler program a message that describes whether the task was successfully completed; communicating the message from the handler program to the task manager; and sending the message to the secure network-accessible server to provide a status of the task. 9. The computer-readable storage media of claim 8, wherein the task includes updating a software program running in the client environment, and wherein the handler program performs the task by transforming the software program to include an update. 10. The computer-readable media of claim 9, wherein updating the software program running in the client environment includes creating a before-update folder in the client environment and populating the before-update folder with a first version of the software program that is to be updated. 11. The computer-readable media of claim 10 further comprising, calculating a hash value for the first version of the software program and transmitting the hash value to the server running in the server environment. 12. The computer-readable media of claim 9 further comprising, creating an after-update folder in the client environment and populating the after-update folder with a second version of the software program that is to be updated and that is substantially similar to the first version of the software program. 13. The computer-readable media of claim 12, wherein updating the software program running in the client environment includes transforming the second version of the software program in the after-update folder to include the update, thereby transforming the software program into an updated software program. 14. The computer-readable media of claim 13, wherein the operations further comprise
generating a data set by comparing the first version of the software program in the before-update folder to the updated software program in the after-update folder and by identifying one or more differences between the first version and the second version, the one or more differences being included in the data set, and transmitting the data set to the secure network-accessible server in the server environment. 15. The computer-readable media of claim 14, wherein the operations further comprise encoding the data set to create an encoded data set, which is transmitted to the secure network-accessible server. 16. A system of computing components that automatically updates a computer software program in a distributed environment comprising:
a server-side computing device having a processor coupled to computer-readable storage media, which stores a secure account that is maintained in a server environment and that stores a task to be carried out in a client environment; an automatic task manager that runs on a client-side computing device in the client environment and that automatically retrieves the task by sending a request to the secure account; a handler running in the client environment that receives the task from the automatic task manager and that carries out the task in the client environment, wherein the handler provides a message that indicates whether task was successfully completed and that is provided to the secure account; and a task-monitor module running in the server environment that picks up the message from the secure account. 17. The system of claim 16 further comprising, a task-monitor user interface that presents a status update indicating whether the task was successfully completed in the client environment, wherein the status update is presented together with a client identifier, which is unique to the client environment. 18. The system of claim 16 further comprising, a client-side program file structure that is maintained in the client environment and that stores one or more code files, which include program code executed to run a program. 19. The system of claim 18 further comprising, a server-side program file structure that is maintained in a file share of the server environment and that substantially mirrors an organization of the client-side program file structure. 20. The system of claim 19, wherein the server-side program file structure stores one or more hash files that represent the program code. | 2,100 |
4,687 | 13,610,761 | 2,177 | A technique involves allowing use of content only if the content has been approved for the use. The content can be stored in a universal content format to facilitate cross-platform approval in a single approval transaction. The content can include granular content items incorporated into larger documents. In a specific implementation, it is possible to grant approval for one or more of the granular content items. | 1. A system comprising:
a presentation building engine; a utility engine coupled to the presentation building engine; a presentation viewing engine coupled to the presentation building engine; a presentation management engine coupled to the presentation building engine; wherein, in operation,
the utility engine transcodes a deck having one of a set of import formats to a universal slide format (USF);
the presentation building engine modifies the deck;
the presentation viewing engine presents the modified deck to a user;
the presentation management engine controls use of content included in the modified deck. 2. The system of claim 1, wherein the presentation building engine comprises:
a USF deck building engine; a source catalog datastore coupled to the USF deck builder; a USF decks datastore coupled to the USF deck builder; wherein, in operation:
the USF deck building engine receives input from a user, the source catalog datastore, and the utility engine;
the USF deck building engine uses the input to generate a deck that the USF deck building engine stores in the USF decks datastore. 3. The system of claim 1, wherein the utility engine comprises:
an export utility engine to transcode the deck stored in the USF to one of a set of export formats for export from the presentation building engine; a synchronize utility engine to transcode and synchronize the deck into the USF from the one of the set of import formats for import into the presentation building engine. 4. The system of claim 1, wherein the presentation viewing engine presents controlled content in accordance with the presentation management engine, further comprising a presentation history datastore coupled to the presentation viewing engine, wherein, in operation, the presentation viewing engine stores data associated with a presentation in the presentation history datastore. 5. The system of claim 1, wherein the presentation management engine includes a speaker assistance engine and a calendaring events engine. 6. The system of claim 1, further comprising:
a witness datastore coupled to the presentation manager; a witness cataloging engine coupled to the witness datastore; wherein, in operation:
the witness cataloging engine populates the witness datastore;
the presentation manager associates relevant portions of the populated witness datastore with the deck. 7. The system of claim 1, further comprising a client-approval-controlled locked content server, wherein the presentation management engine enforces the client-approval controlled locking of content in association with presentations of the deck. 8. The system of claim 7, further comprising a client-approval-controlled locked granular content server, wherein the utility engine facilitates entry of granular content from an import deck and consolidation of granular content into an export deck from the presentation building engine, and wherein the presentation building engine facilitates use of granular content in the deck. 9. The system of claim 1, further comprising an approvals datastore, wherein, in operation:
the presentation building engine indicates the deck is ready to be approved; when the approvals datastore is modified to include an approval for the deck, the presentation manager allows use of the deck in presentations. 10. The system of claim 9, wherein approval includes a Medical Regulatory Board (MedReg) approval. 11. The system of claim 1, wherein the USF comprises:
a layer super-structure; a slide super-structure hierarchically located above the layer super-structure; a group super-structure hierarchically located above the slide super-structure; a deck super-structure hierarchically located above the group super-structure. 12. The system of claim 11, wherein the layer super-structure comprises:
a layer media structure; a layer action structure, hierarchically located above the layer media structure, identifying an action associated with media of the layer media structure; a layer data structure, hierarchically located above the layer action structure, identifying a Z-ordered set of layers. 13. The system of claim 11, wherein the slide super-structure comprises:
a slide template structure identifying a layout basis for slides; a slide transition structure, hierarchically located above the slide template structure, identifying how a first slide transitions to a second slide; a slide data structure, hierarchically located above the slide transition structure, identifying slide characteristics or presentation notes associated with the slide; a slide relationship structure, hierarchically located above the slide data structure, identifying how the first slide and the second slide are ordered with relation to one another. 14. The system of claim 11, wherein the group super-structure comprises:
a bucket type structure identifying a set of rules applicable to a bucket; a bucket data structure, hierarchically located above the bucket type structure, identifying the bucket; a bucket interdependency structure, hierarchically located above the bucket data structure, identifying how slides are presented with respect to one another. 15. The system of claim 11, wherein the deck super-structure comprises:
a deck template structure identifying a design shared by the deck; a deck data structure, hierarchically located above the deck template structure, identifying the deck and an approval of the deck. 16. The system of claim 1, wherein a presentation customization engine comprises the presentation building engine, the utility engine the presentation viewing engine, and the presentation management engine, further comprising:
a site administration engine to facilitate management of users of the system; a deck creation engine to facilitate authoring of decks; a deck assignment engine to facilitate management of decks; wherein the presentation customization engine is configured to facilitate customization of decks. 17. A method comprising:
obtaining a document in a first standardized format; transcoding the document to a universal format structure; associating rights with content items of the document; receiving an open request for the document from an engine; checking out the document in a second standardized format in accordance with a lowest common denominator of associated rights; transcoding the universal format structure to the second standardized; providing the document to the engine in the second standardized format. 18. The method of claim 17, wherein the engine is a content editor, further comprising:
obtaining ingested content associated with the document in the content editor; modifying an item of the ingested content within the content editor; storing the item of ingested content in an individual datastore; when the item of ingested content in the individual datastore is approved:
publishing the item of ingested content to a group datastore;
incorporating the item of ingested content into the document. 19. The method of claim 17, wherein the document includes a deck, further comprising:
when a save command is received, incrementing a first subfield of a version field of the deck and saving a version of the deck in association with the version field having the incremented first subfield; when a clone command is received, incrementing a second subfield of the version field, resetting the first subfield, and saving a clone of the deck in association with the version field having the incremented second subfield and the reset first subfield; when an approval is received for the deck, incrementing a third subfield of the version field, resetting the first subfield and the second subfield, and saving an approved version of the deck in association with the version field having the incremented third subfield and the reset first subfield and second subfield. 20. A system comprising:
a means for obtaining a document in a first standardized format; a means for transcoding the document to a universal format structure; a means for associating rights with content items of the document; a means for receiving an open request for the document from an engine; a means for checking out the document in a second standardized format in accordance with a lowest common denominator of associated rights; a means for transcoding the universal format structure to the second standardized; a means for providing the document to the engine in the second standardized format. | A technique involves allowing use of content only if the content has been approved for the use. The content can be stored in a universal content format to facilitate cross-platform approval in a single approval transaction. The content can include granular content items incorporated into larger documents. In a specific implementation, it is possible to grant approval for one or more of the granular content items.1. A system comprising:
a presentation building engine; a utility engine coupled to the presentation building engine; a presentation viewing engine coupled to the presentation building engine; a presentation management engine coupled to the presentation building engine; wherein, in operation,
the utility engine transcodes a deck having one of a set of import formats to a universal slide format (USF);
the presentation building engine modifies the deck;
the presentation viewing engine presents the modified deck to a user;
the presentation management engine controls use of content included in the modified deck. 2. The system of claim 1, wherein the presentation building engine comprises:
a USF deck building engine; a source catalog datastore coupled to the USF deck builder; a USF decks datastore coupled to the USF deck builder; wherein, in operation:
the USF deck building engine receives input from a user, the source catalog datastore, and the utility engine;
the USF deck building engine uses the input to generate a deck that the USF deck building engine stores in the USF decks datastore. 3. The system of claim 1, wherein the utility engine comprises:
an export utility engine to transcode the deck stored in the USF to one of a set of export formats for export from the presentation building engine; a synchronize utility engine to transcode and synchronize the deck into the USF from the one of the set of import formats for import into the presentation building engine. 4. The system of claim 1, wherein the presentation viewing engine presents controlled content in accordance with the presentation management engine, further comprising a presentation history datastore coupled to the presentation viewing engine, wherein, in operation, the presentation viewing engine stores data associated with a presentation in the presentation history datastore. 5. The system of claim 1, wherein the presentation management engine includes a speaker assistance engine and a calendaring events engine. 6. The system of claim 1, further comprising:
a witness datastore coupled to the presentation manager; a witness cataloging engine coupled to the witness datastore; wherein, in operation:
the witness cataloging engine populates the witness datastore;
the presentation manager associates relevant portions of the populated witness datastore with the deck. 7. The system of claim 1, further comprising a client-approval-controlled locked content server, wherein the presentation management engine enforces the client-approval controlled locking of content in association with presentations of the deck. 8. The system of claim 7, further comprising a client-approval-controlled locked granular content server, wherein the utility engine facilitates entry of granular content from an import deck and consolidation of granular content into an export deck from the presentation building engine, and wherein the presentation building engine facilitates use of granular content in the deck. 9. The system of claim 1, further comprising an approvals datastore, wherein, in operation:
the presentation building engine indicates the deck is ready to be approved; when the approvals datastore is modified to include an approval for the deck, the presentation manager allows use of the deck in presentations. 10. The system of claim 9, wherein approval includes a Medical Regulatory Board (MedReg) approval. 11. The system of claim 1, wherein the USF comprises:
a layer super-structure; a slide super-structure hierarchically located above the layer super-structure; a group super-structure hierarchically located above the slide super-structure; a deck super-structure hierarchically located above the group super-structure. 12. The system of claim 11, wherein the layer super-structure comprises:
a layer media structure; a layer action structure, hierarchically located above the layer media structure, identifying an action associated with media of the layer media structure; a layer data structure, hierarchically located above the layer action structure, identifying a Z-ordered set of layers. 13. The system of claim 11, wherein the slide super-structure comprises:
a slide template structure identifying a layout basis for slides; a slide transition structure, hierarchically located above the slide template structure, identifying how a first slide transitions to a second slide; a slide data structure, hierarchically located above the slide transition structure, identifying slide characteristics or presentation notes associated with the slide; a slide relationship structure, hierarchically located above the slide data structure, identifying how the first slide and the second slide are ordered with relation to one another. 14. The system of claim 11, wherein the group super-structure comprises:
a bucket type structure identifying a set of rules applicable to a bucket; a bucket data structure, hierarchically located above the bucket type structure, identifying the bucket; a bucket interdependency structure, hierarchically located above the bucket data structure, identifying how slides are presented with respect to one another. 15. The system of claim 11, wherein the deck super-structure comprises:
a deck template structure identifying a design shared by the deck; a deck data structure, hierarchically located above the deck template structure, identifying the deck and an approval of the deck. 16. The system of claim 1, wherein a presentation customization engine comprises the presentation building engine, the utility engine the presentation viewing engine, and the presentation management engine, further comprising:
a site administration engine to facilitate management of users of the system; a deck creation engine to facilitate authoring of decks; a deck assignment engine to facilitate management of decks; wherein the presentation customization engine is configured to facilitate customization of decks. 17. A method comprising:
obtaining a document in a first standardized format; transcoding the document to a universal format structure; associating rights with content items of the document; receiving an open request for the document from an engine; checking out the document in a second standardized format in accordance with a lowest common denominator of associated rights; transcoding the universal format structure to the second standardized; providing the document to the engine in the second standardized format. 18. The method of claim 17, wherein the engine is a content editor, further comprising:
obtaining ingested content associated with the document in the content editor; modifying an item of the ingested content within the content editor; storing the item of ingested content in an individual datastore; when the item of ingested content in the individual datastore is approved:
publishing the item of ingested content to a group datastore;
incorporating the item of ingested content into the document. 19. The method of claim 17, wherein the document includes a deck, further comprising:
when a save command is received, incrementing a first subfield of a version field of the deck and saving a version of the deck in association with the version field having the incremented first subfield; when a clone command is received, incrementing a second subfield of the version field, resetting the first subfield, and saving a clone of the deck in association with the version field having the incremented second subfield and the reset first subfield; when an approval is received for the deck, incrementing a third subfield of the version field, resetting the first subfield and the second subfield, and saving an approved version of the deck in association with the version field having the incremented third subfield and the reset first subfield and second subfield. 20. A system comprising:
a means for obtaining a document in a first standardized format; a means for transcoding the document to a universal format structure; a means for associating rights with content items of the document; a means for receiving an open request for the document from an engine; a means for checking out the document in a second standardized format in accordance with a lowest common denominator of associated rights; a means for transcoding the universal format structure to the second standardized; a means for providing the document to the engine in the second standardized format. | 2,100 |
4,688 | 14,085,052 | 2,168 | Repairing a link based on an issue includes associating at least one metadata segment with a link, identifying, in a resource repository, at least one resource that matches the at least one metadata segment, determining if there is an issue between the link and the at least one resource, and repairing the link based on the issue between the link and at least one resource. | 1-11. (canceled) 12. A system for repairing a link based on an issue, the system comprising:
an associating engine to associate at least one metadata segment with a link; an identifying engine to identify, in a resource repository, at least one resource that matches the at least one metadata segment; a matching engine to match the at least one resource to the at least one metadata segment; a determining engine to determine if there is an issue between the link and the at least one resource; and a repairing engine to repair the link based on the issue between the link and at least one resource. 13. The system of claim 12, in which the determining engine further determines if the issue between the link and the at least one resource is a result of the link becoming a broken link, if the issue between the link and the at least one resource is a result of the link being moved to a new platform, or combinations thereof. 14. The system of claim 12, in which the repairing engine further:
identifies, in the resource repository, a second resource that matches the at least one metadata segment; matches the second resource to the at least one metadata segment; and associates the link to the second resource. 15. The system of claim 12, in which the matching engine further:
determines a match score based on a comparison of the at least one metadata segment and the at least one resource; and matches the at least one resource to the at least one metadata segment if the match score exceeds a threshold. 16. The system of claim 12, in which the associating engine further:
defines a resource type for the at least one resource; presents, to a user, a list of metadata segments based on the resource type; and associates, from the list of metadata segments, the at least one metadata segment with the link. 17. A computer program product for repairing a link based on an issue, 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: associate at least one metadata segment with a link; identify, in a resource repository, at least one resource that matches the at least one metadata segment; and repair the link based on an issue between the link and at least one resource. 18. The product of claim 17, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to determine the issue between the link and the at least one resource. 19. The product of claim 17, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to match the at least one resource to the at least one metadata segment. 20. The product of claim 17, in which associating the at least one metadata segment with the link further comprises computer readable program code comprising program instructions that, when executed, cause said processor to:
define a resource type for the at least one resource; present, to a user, a list of metadata segments based on the resource type; and associate, from the list of metadata segments, the at least one metadata segment with the link. | Repairing a link based on an issue includes associating at least one metadata segment with a link, identifying, in a resource repository, at least one resource that matches the at least one metadata segment, determining if there is an issue between the link and the at least one resource, and repairing the link based on the issue between the link and at least one resource.1-11. (canceled) 12. A system for repairing a link based on an issue, the system comprising:
an associating engine to associate at least one metadata segment with a link; an identifying engine to identify, in a resource repository, at least one resource that matches the at least one metadata segment; a matching engine to match the at least one resource to the at least one metadata segment; a determining engine to determine if there is an issue between the link and the at least one resource; and a repairing engine to repair the link based on the issue between the link and at least one resource. 13. The system of claim 12, in which the determining engine further determines if the issue between the link and the at least one resource is a result of the link becoming a broken link, if the issue between the link and the at least one resource is a result of the link being moved to a new platform, or combinations thereof. 14. The system of claim 12, in which the repairing engine further:
identifies, in the resource repository, a second resource that matches the at least one metadata segment; matches the second resource to the at least one metadata segment; and associates the link to the second resource. 15. The system of claim 12, in which the matching engine further:
determines a match score based on a comparison of the at least one metadata segment and the at least one resource; and matches the at least one resource to the at least one metadata segment if the match score exceeds a threshold. 16. The system of claim 12, in which the associating engine further:
defines a resource type for the at least one resource; presents, to a user, a list of metadata segments based on the resource type; and associates, from the list of metadata segments, the at least one metadata segment with the link. 17. A computer program product for repairing a link based on an issue, 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: associate at least one metadata segment with a link; identify, in a resource repository, at least one resource that matches the at least one metadata segment; and repair the link based on an issue between the link and at least one resource. 18. The product of claim 17, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to determine the issue between the link and the at least one resource. 19. The product of claim 17, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to match the at least one resource to the at least one metadata segment. 20. The product of claim 17, in which associating the at least one metadata segment with the link further comprises computer readable program code comprising program instructions that, when executed, cause said processor to:
define a resource type for the at least one resource; present, to a user, a list of metadata segments based on the resource type; and associate, from the list of metadata segments, the at least one metadata segment with the link. | 2,100 |
4,689 | 14,468,623 | 2,121 | An artificial neural network is used to manage software bundling. During a training phase, the artificial neural network is trained using previously bundled software components having known values for identification attributes and known software bundle asociations. Once trained, the artifical neural network can be used to identify the proper software bundles for newly discovered sofware components. In this process, a newly discovered software component having known values for the identification attributes is identified. An input vector is derived from the known values. The input vector is loaded into input neurons of the artificial neural network. A yielded output vector is then obtained from an output neuron of the artificial neural network. Based on the composition of the output vector, the software bundle associated with this newly discovered software component is determined. | 1. A method comprising:
identifying a software component having a first value for a first identification attribute and a second value for a second identification attribute; generating an input vector derived from the first value and the second value; loading the input vector into an at least one input neuron of an artificial neural network; and obtaining a yielded output vector from an at least one output neuron of the artificial neural network. 2. The method of claim 1, wherein at least one of the first identification attribute and the second identification attribute include at least one of network domain, installation path, installation date, user Internet Protocol (IP) address, start date, and modification date. 3. The method of claim 1, wherein the yielded output vector corresponds to a software bundle of a plurality of software bundles, the method further comprising:
determining, based on the yielded output vector, that the software component is associated with the software bundle. 4. The method of claim 3, wherein the association between the software component and the software bundle is unknown prior to the obtaining the yielded output vector from the at least one output neuron of the artificial neural network, and wherein the association comprises a relationship between the software component and the software bundle such that the software component is licensed with other software components as part of the software bundle. 5. The method of claim 1, wherein the software component is associated with a software bundle of a plurality of software bundles, the method further comprising:
generating a test output vector derived from the software bundle; comparing the yielded output vector with the test output vector; and adjusting parameters of the artificial neural network based on the comparison of the yielded output vector with the test output vector. 6. The method of claim 5, wherein the association between the software component and the software bundle is known prior to the obtaining the yielded output vector from the at least one output neuron of the artificial neural network. 7. The method of claim 5, further comprising:
identifying a second software component having a third value for the first identification attribute and a fourth value for the second identification attribute; generating a second input vector derived from the third value and the fourth value; loading the second input vector into the at least one input neuron of the artificial neural network; obtaining a second yielded output vector from the at least one output neuron of the artificial neural network, the second yielded output vector corresponding to a second software bundle of the plurality of software bundles; and determining, based on the second yielded output vector, that the second software component is associated with the second software bundle. 8. The method of claim 7, wherein the software component and the second software component are licensed to a same entity. 9. The method of claim 7, wherein the software component and the second software component are licensed to different entities. 10. The method of claim 7, wherein the software component is identical to the second software component, and wherein the software component is installed on a first computer and the second software component is installed on a second computer on a same network as the first computer. 11. The method of claim 7, further comprising:
subsequent to the adjusting parameters of the artificial neural network based on the comparison of the yielded output vector with the test output vector, installing the second software component. 12. The method of claim 7, further comprising:
identifying a third software component that is associated with a third software bundle of the plurality of software bundles, the third software component having a fifth value for the first identification attribute and a sixth value for the second identification attribute; generating a third input vector derived from the fifth value and a second dimension derived from the sixth value; generating a second test output vector derived from the third software bundle; loading the second test input vector into the at least one input neuron of the artificial neural network; obtaining a third yielded output vector from the output neuron of the artificial neural network; comparing the third yielded output vector with the second test output vector; and readjusting parameters of the artificial neural network based on the comparison of the third yielded output vector with the second test output vector. | An artificial neural network is used to manage software bundling. During a training phase, the artificial neural network is trained using previously bundled software components having known values for identification attributes and known software bundle asociations. Once trained, the artifical neural network can be used to identify the proper software bundles for newly discovered sofware components. In this process, a newly discovered software component having known values for the identification attributes is identified. An input vector is derived from the known values. The input vector is loaded into input neurons of the artificial neural network. A yielded output vector is then obtained from an output neuron of the artificial neural network. Based on the composition of the output vector, the software bundle associated with this newly discovered software component is determined.1. A method comprising:
identifying a software component having a first value for a first identification attribute and a second value for a second identification attribute; generating an input vector derived from the first value and the second value; loading the input vector into an at least one input neuron of an artificial neural network; and obtaining a yielded output vector from an at least one output neuron of the artificial neural network. 2. The method of claim 1, wherein at least one of the first identification attribute and the second identification attribute include at least one of network domain, installation path, installation date, user Internet Protocol (IP) address, start date, and modification date. 3. The method of claim 1, wherein the yielded output vector corresponds to a software bundle of a plurality of software bundles, the method further comprising:
determining, based on the yielded output vector, that the software component is associated with the software bundle. 4. The method of claim 3, wherein the association between the software component and the software bundle is unknown prior to the obtaining the yielded output vector from the at least one output neuron of the artificial neural network, and wherein the association comprises a relationship between the software component and the software bundle such that the software component is licensed with other software components as part of the software bundle. 5. The method of claim 1, wherein the software component is associated with a software bundle of a plurality of software bundles, the method further comprising:
generating a test output vector derived from the software bundle; comparing the yielded output vector with the test output vector; and adjusting parameters of the artificial neural network based on the comparison of the yielded output vector with the test output vector. 6. The method of claim 5, wherein the association between the software component and the software bundle is known prior to the obtaining the yielded output vector from the at least one output neuron of the artificial neural network. 7. The method of claim 5, further comprising:
identifying a second software component having a third value for the first identification attribute and a fourth value for the second identification attribute; generating a second input vector derived from the third value and the fourth value; loading the second input vector into the at least one input neuron of the artificial neural network; obtaining a second yielded output vector from the at least one output neuron of the artificial neural network, the second yielded output vector corresponding to a second software bundle of the plurality of software bundles; and determining, based on the second yielded output vector, that the second software component is associated with the second software bundle. 8. The method of claim 7, wherein the software component and the second software component are licensed to a same entity. 9. The method of claim 7, wherein the software component and the second software component are licensed to different entities. 10. The method of claim 7, wherein the software component is identical to the second software component, and wherein the software component is installed on a first computer and the second software component is installed on a second computer on a same network as the first computer. 11. The method of claim 7, further comprising:
subsequent to the adjusting parameters of the artificial neural network based on the comparison of the yielded output vector with the test output vector, installing the second software component. 12. The method of claim 7, further comprising:
identifying a third software component that is associated with a third software bundle of the plurality of software bundles, the third software component having a fifth value for the first identification attribute and a sixth value for the second identification attribute; generating a third input vector derived from the fifth value and a second dimension derived from the sixth value; generating a second test output vector derived from the third software bundle; loading the second test input vector into the at least one input neuron of the artificial neural network; obtaining a third yielded output vector from the output neuron of the artificial neural network; comparing the third yielded output vector with the second test output vector; and readjusting parameters of the artificial neural network based on the comparison of the third yielded output vector with the second test output vector. | 2,100 |
4,690 | 14,290,498 | 2,168 | Repairing a link based on an issue includes associating at least one metadata segment with a link, identifying, in a resource repository, at least one resource that matches the at least one metadata segment, determining if there is an issue between the link and the at least one resource, and repairing the link based on the issue between the link and at least one resource. | 1. A method for repairing a link based on an issue, the method comprising:
associating at least one metadata segment with a link; identifying, in a resource repository, at least one resource that matches the at least one metadata segment; determining if there is an issue between the link and the at least one resource; and repairing the link based on the issue between the link and at least one resource. 2. The method of claim 1, in which determining if there is an issue between the link and the at least one resource comprises determining if the issue between the link and the at least one resource is a result of the link becoming a broken link, determining if the issue between the link and the at least one resource is a result of the link being moved to a new platform, or combinations thereof. 3. The method of claim 1, in which repairing the link based on the issue between the link and the at least one resource comprises:
identifying, in the resource repository, a second resource that matches the at least one metadata segment; matching the second resource to the at least one metadata segment; and associating the link to the second resource. 4. The method of claim 1, in which associating at least one metadata segment with a link further comprises creating a record indicating the at least one metadata segment is associated with the link. 5. The method of claim 1, in which associating the at least one metadata segment with the link further comprises analyzing the at least one resource to generate the at least one metadata segment about the at least one resource. 6. The method of claim 5, in which associating the at least one metadata segment with the link further comprises:
defining a resource type for the at least one resource; presenting, to a user, a list of metadata segments based on the resource type; and associating, from the list of metadata segments, the at least one metadata segment with the link. 7. The method of claim 1, further comprising matching the at least one resource to the at least one metadata segment. 8. The method of claim 7, in which matching the at least one resource to the at least one metadata segment comprises:
determining a match score based on a comparison of the at least one metadata segment and the at least one resource; and matching the at least one resource to the at least one metadata segment if the match score exceeds a threshold. 9. The method of claim 8, in which determining the match score based on the comparison of the at least one metadata segment to the at least one resource further comprises multiplying the match score by a weight. 10. The method of claim 3, in which matching the second resource to the at least one metadata segment comprises:
determining a match score based on a comparison of the at least one metadata segment and the second resource; and matching the second resource to the at least one metadata segment if the match score exceeds a threshold. 11. The method of claim 10, in which determining a match score based on the comparison of the at least one metadata segment and the second resource further comprises multiplying the match score by a weight. | Repairing a link based on an issue includes associating at least one metadata segment with a link, identifying, in a resource repository, at least one resource that matches the at least one metadata segment, determining if there is an issue between the link and the at least one resource, and repairing the link based on the issue between the link and at least one resource.1. A method for repairing a link based on an issue, the method comprising:
associating at least one metadata segment with a link; identifying, in a resource repository, at least one resource that matches the at least one metadata segment; determining if there is an issue between the link and the at least one resource; and repairing the link based on the issue between the link and at least one resource. 2. The method of claim 1, in which determining if there is an issue between the link and the at least one resource comprises determining if the issue between the link and the at least one resource is a result of the link becoming a broken link, determining if the issue between the link and the at least one resource is a result of the link being moved to a new platform, or combinations thereof. 3. The method of claim 1, in which repairing the link based on the issue between the link and the at least one resource comprises:
identifying, in the resource repository, a second resource that matches the at least one metadata segment; matching the second resource to the at least one metadata segment; and associating the link to the second resource. 4. The method of claim 1, in which associating at least one metadata segment with a link further comprises creating a record indicating the at least one metadata segment is associated with the link. 5. The method of claim 1, in which associating the at least one metadata segment with the link further comprises analyzing the at least one resource to generate the at least one metadata segment about the at least one resource. 6. The method of claim 5, in which associating the at least one metadata segment with the link further comprises:
defining a resource type for the at least one resource; presenting, to a user, a list of metadata segments based on the resource type; and associating, from the list of metadata segments, the at least one metadata segment with the link. 7. The method of claim 1, further comprising matching the at least one resource to the at least one metadata segment. 8. The method of claim 7, in which matching the at least one resource to the at least one metadata segment comprises:
determining a match score based on a comparison of the at least one metadata segment and the at least one resource; and matching the at least one resource to the at least one metadata segment if the match score exceeds a threshold. 9. The method of claim 8, in which determining the match score based on the comparison of the at least one metadata segment to the at least one resource further comprises multiplying the match score by a weight. 10. The method of claim 3, in which matching the second resource to the at least one metadata segment comprises:
determining a match score based on a comparison of the at least one metadata segment and the second resource; and matching the second resource to the at least one metadata segment if the match score exceeds a threshold. 11. The method of claim 10, in which determining a match score based on the comparison of the at least one metadata segment and the second resource further comprises multiplying the match score by a weight. | 2,100 |
4,691 | 14,556,593 | 2,174 | Systems and methods allow a user to interact with an augmented reality device. In one implementation, a wearable device for controlling operation of an on-board component includes a display; at least one sensor configured to provide an output indicative of a viewing direction of a user; and at least one processing device. The at least one processing device is configured to cause at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on the display; determine, based on the output of the at least one sensor, whether the user is looking in a direction of the at least one graphical icon; and initiate the control of the at least one aspect of the on-board component when the user is determined to be looking in the direction of the at least one graphical icon. | 1. A wearable device for controlling operation of an on-board component, the wearable device comprising:
a display; at least one sensor configured to provide an output indicative of a viewing direction of a user; and at least one processing device configured to:
cause at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on the display such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location;
cause a reticle to be displayed on the display;
move, based on the output of the at least one sensor, the reticle to intercept a portion of the at least one graphical icon;
change, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time;
select the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and cause the on-board component to capture an image of a field of view of the user when the at least one graphical icon is selected. 2. The wearable device of claim 1, wherein the on-board component includes a camera. 3. The wearable device of claim 2, wherein the at least one graphical icon is associated with a power-on function of the on-board camera. 4. The wearable device of claim 2, wherein the at least one graphical icon is associated with an image capture function of the on-board camera. 5. The wearable device of claim 2, wherein the at least one processing device is configured to show a menu of camera control icons on the display. 6. The wearable device of claim 5, wherein the menu of camera control icons comprises icons associated with one or more of shutter speed, aperture, ISO, and flash. 7. The wearable device of claim 1, wherein the at least one processing device is configured to update a position at which the at least one graphical icon is shown on the display based on the output of the at least one sensor. 8. The wearable device of claim 1, wherein the at least one sensor is configured to provide an output indicative of the viewing direction of the user by tracking a pattern of movement of an orientation of a head of the user. 9. The wearable device of claim 1, wherein the at least one sensor is configured to provide an output indicative of the viewing direction of the user by tracking a gaze of the user's eyes. 10. A method for controlling operation of an on-board component of a wearable device, the method comprising:
causing at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on a display of the wearable device such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location; causing a reticle to be displayed on the display; moving, based on an output of at least one sensor of the wearable device configured to provide an output indicative of a viewing direction of the user of the wearable device, the reticle to intercept a portion of the at least one graphical icon; changing, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time; selecting the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and causing the on-board component to capture an image of a field of view of the user when at least one graphical icon is selected. 11. The method of claim 10, wherein the on-board component includes a camera. 12. The method of claim 11, wherein the at least one graphical icon is associated with a power on function of the on-board camera. 13. The method of claim 11, wherein the at least one graphical icon is associated with an image capture function of the on-board camera. 14. The method of claim 11, wherein a menu of camera control icons is shown on the display. 15. The method of claim 14, wherein the menu of camera control icons comprises icons associated with one or more of shutter speed, aperture, ISO, and flash. 16. The method of claim 10, further comprising updating a position at which the at least one graphical icon is shown on the display based on the output of the at least one sensor. 17. The method of claim 10, further comprising monitoring a pattern of movement of an orientation of a head of the user. 18. The method of claim 10, further comprising monitoring a gaze of the user's eyes. 19. A non-transitory computer-readable storage medium storing program instructions executable by at least one processor to perform a method for controlling operation of an on-board component of a wearable device, the method comprising:
causing at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on a display of the wearable device such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location; causing a reticle to be displayed on the display; moving, based on an output of at least one sensor of the wearable device configured to provide an output indicative of head orientation of the user of the wearable device, the reticle to intercept a portion of the at least one graphical icon; changing, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time; selecting the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and causing the on-board component to capture an image of a field of view of the user when the at least one graphical icon is selected. | Systems and methods allow a user to interact with an augmented reality device. In one implementation, a wearable device for controlling operation of an on-board component includes a display; at least one sensor configured to provide an output indicative of a viewing direction of a user; and at least one processing device. The at least one processing device is configured to cause at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on the display; determine, based on the output of the at least one sensor, whether the user is looking in a direction of the at least one graphical icon; and initiate the control of the at least one aspect of the on-board component when the user is determined to be looking in the direction of the at least one graphical icon.1. A wearable device for controlling operation of an on-board component, the wearable device comprising:
a display; at least one sensor configured to provide an output indicative of a viewing direction of a user; and at least one processing device configured to:
cause at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on the display such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location;
cause a reticle to be displayed on the display;
move, based on the output of the at least one sensor, the reticle to intercept a portion of the at least one graphical icon;
change, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time;
select the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and cause the on-board component to capture an image of a field of view of the user when the at least one graphical icon is selected. 2. The wearable device of claim 1, wherein the on-board component includes a camera. 3. The wearable device of claim 2, wherein the at least one graphical icon is associated with a power-on function of the on-board camera. 4. The wearable device of claim 2, wherein the at least one graphical icon is associated with an image capture function of the on-board camera. 5. The wearable device of claim 2, wherein the at least one processing device is configured to show a menu of camera control icons on the display. 6. The wearable device of claim 5, wherein the menu of camera control icons comprises icons associated with one or more of shutter speed, aperture, ISO, and flash. 7. The wearable device of claim 1, wherein the at least one processing device is configured to update a position at which the at least one graphical icon is shown on the display based on the output of the at least one sensor. 8. The wearable device of claim 1, wherein the at least one sensor is configured to provide an output indicative of the viewing direction of the user by tracking a pattern of movement of an orientation of a head of the user. 9. The wearable device of claim 1, wherein the at least one sensor is configured to provide an output indicative of the viewing direction of the user by tracking a gaze of the user's eyes. 10. A method for controlling operation of an on-board component of a wearable device, the method comprising:
causing at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on a display of the wearable device such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location; causing a reticle to be displayed on the display; moving, based on an output of at least one sensor of the wearable device configured to provide an output indicative of a viewing direction of the user of the wearable device, the reticle to intercept a portion of the at least one graphical icon; changing, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time; selecting the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and causing the on-board component to capture an image of a field of view of the user when at least one graphical icon is selected. 11. The method of claim 10, wherein the on-board component includes a camera. 12. The method of claim 11, wherein the at least one graphical icon is associated with a power on function of the on-board camera. 13. The method of claim 11, wherein the at least one graphical icon is associated with an image capture function of the on-board camera. 14. The method of claim 11, wherein a menu of camera control icons is shown on the display. 15. The method of claim 14, wherein the menu of camera control icons comprises icons associated with one or more of shutter speed, aperture, ISO, and flash. 16. The method of claim 10, further comprising updating a position at which the at least one graphical icon is shown on the display based on the output of the at least one sensor. 17. The method of claim 10, further comprising monitoring a pattern of movement of an orientation of a head of the user. 18. The method of claim 10, further comprising monitoring a gaze of the user's eyes. 19. A non-transitory computer-readable storage medium storing program instructions executable by at least one processor to perform a method for controlling operation of an on-board component of a wearable device, the method comprising:
causing at least one graphical icon associated with a control of at least one aspect of the on-board component to be shown on a display of the wearable device such that the user perceives the at least one graphical icon to be located at a location in the real world and fixed relative to coordinates of the real world location; causing a reticle to be displayed on the display; moving, based on an output of at least one sensor of the wearable device configured to provide an output indicative of head orientation of the user of the wearable device, the reticle to intercept a portion of the at least one graphical icon; changing, based on the reticle having intercepted the portion of the at least one graphical icon, at least one aspect of the reticle to provide a visual indication to the user that the at least one graphical icon can be selected by looking in the direction of the at least one graphical icon for a predetermined period of time; selecting the at least one graphical icon when it is determined that the user has been looking in the direction of the at least one graphical icon for the predetermined period of time; and causing the on-board component to capture an image of a field of view of the user when the at least one graphical icon is selected. | 2,100 |
4,692 | 14,326,352 | 2,167 | Disclosed is a system and method for improving database memory consumption and performance using compression of time stamp columns. A number of time stamps of a time series is received. The time stamps have a start time, and are separated by an equal increment of time that defines an interval. The start time and interval are stored in a dictionary of a column store of a database. An index is generated in the column store of the database, the index having a number of index vectors. Using the index vectors, each time stamp of the number of time stamps can be calculated from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. | 1. A computer-implemented method comprising:
receiving a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; storing, by one or more processors of the data platform, the start time and interval in a dictionary of a column store of the database; generating, by the one or more processors, an index in the column store of the database, the index having a plurality of index vectors; and calculating, by the one or more processors using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 2. The computer implemented method in accordance with claim 1, further comprising:
dividing, by the one or more processors, the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 3. The computer implemented method in accordance with claim 2, further comprising:
storing, by one or more processors of the data platform, the subseries start time and interval in the dictionary of the column store of the database for each time series block. 4. The computer implemented method in accordance with claim 3, further comprising:
calculating, by the one or more processors, the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 5. The computer implemented method in accordance with claim 1, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. 6. 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:
receive a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; store the start time and interval in a dictionary of a column store of the database; generate an index in the column store of the database, the index having a plurality of index vectors; and calculate, using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 7. The computer program product in accordance with claim 6, wherein the operations further comprise an operation to divide the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 8. The computer program product in accordance with claim 7, wherein the operations further comprise an operation to store the subseries start time and interval in the dictionary of the column store of the database for each time series block. 9. The computer program product in accordance with claim 8, wherein the operations further comprise an operation to calculate the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 10. The computer program product in accordance with claim 6, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. 11. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising: receive a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; store the start time and interval in a dictionary of a column store of the database; generate an index in the column store of the database, the index having a plurality of index vectors; and calculate, using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 12. The system in accordance with claim 11, wherein the operations further comprise an operation to divide the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 13. The system in accordance with claim 12, wherein the operations further comprise an operation to store the subseries start time and interval in the dictionary of the column store of the database for each time series block. 14. The system in accordance with claim 13, wherein the operations further comprise an operation to calculate the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 15. The system in accordance with claim 11, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. | Disclosed is a system and method for improving database memory consumption and performance using compression of time stamp columns. A number of time stamps of a time series is received. The time stamps have a start time, and are separated by an equal increment of time that defines an interval. The start time and interval are stored in a dictionary of a column store of a database. An index is generated in the column store of the database, the index having a number of index vectors. Using the index vectors, each time stamp of the number of time stamps can be calculated from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary.1. A computer-implemented method comprising:
receiving a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; storing, by one or more processors of the data platform, the start time and interval in a dictionary of a column store of the database; generating, by the one or more processors, an index in the column store of the database, the index having a plurality of index vectors; and calculating, by the one or more processors using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 2. The computer implemented method in accordance with claim 1, further comprising:
dividing, by the one or more processors, the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 3. The computer implemented method in accordance with claim 2, further comprising:
storing, by one or more processors of the data platform, the subseries start time and interval in the dictionary of the column store of the database for each time series block. 4. The computer implemented method in accordance with claim 3, further comprising:
calculating, by the one or more processors, the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 5. The computer implemented method in accordance with claim 1, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. 6. 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:
receive a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; store the start time and interval in a dictionary of a column store of the database; generate an index in the column store of the database, the index having a plurality of index vectors; and calculate, using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 7. The computer program product in accordance with claim 6, wherein the operations further comprise an operation to divide the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 8. The computer program product in accordance with claim 7, wherein the operations further comprise an operation to store the subseries start time and interval in the dictionary of the column store of the database for each time series block. 9. The computer program product in accordance with claim 8, wherein the operations further comprise an operation to calculate the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 10. The computer program product in accordance with claim 6, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. 11. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising: receive a plurality of time stamps of a time series for operations executed on a database of a data platform, the plurality of time stamps having a start time, and each successive pair of time stamps of the plurality of time stamps being separated by an equal increment of time that defines an interval, each interval defining a position in the time series for each time stamp of the plurality of time stamps; store the start time and interval in a dictionary of a column store of the database; generate an index in the column store of the database, the index having a plurality of index vectors; and calculate, using the plurality of index vectors, the time stamp of the plurality of time stamps from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary. 12. The system in accordance with claim 11, wherein the operations further comprise an operation to divide the time series into a plurality of time series block according to a gap in the interval between a pair of successive time stamps, each time series block providing a subseries of one or more time stamps having a subseries start time and the interval. 13. The system in accordance with claim 12, wherein the operations further comprise an operation to store the subseries start time and interval in the dictionary of the column store of the database for each time series block. 14. The system in accordance with claim 13, wherein the operations further comprise an operation to calculate the time stamp of the plurality of time stamps from the subseries start time stored in the dictionary and the position in the time series block based on the interval stored in the dictionary for each time series block. 15. The system in accordance with claim 11, wherein the database includes an in-memory database having a hybrid store structure, the hybrid store structure comprising the column store and a row store. | 2,100 |
4,693 | 14,450,437 | 2,131 | A computer readable storage medium embodies program instructions executable by a processor to perform a method including identifying a product warranty for each of a plurality of flash memory devices within a system, wherein the product warranty includes a maximum number of writes and a maximum age, and tracking the number of writes and the age of each flash memory device. The method further includes determining, for each flash memory device, a number of pro rata writes remaining in the product warranty, which is determined as a number of writes remaining until the flash memory device reaches the maximum number of writes divided by an amount of time remaining until the flash memory reaches the maximum age. The method then causes data to be written to the flash memory device having the greatest number of pro rata writes remaining in the product warranty. | 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying a product warranty for each of a plurality of flash memory devices within a system, wherein the product warranty includes a maximum number of writes and a maximum age; tracking the number of writes made to each flash memory device and the age of each flash memory device; determining, for each flash memory device, a number of pro rata writes remaining in the product warranty, wherein the number of pro rata writes remaining in the product warranty is determined as a number of writes remaining until the flash memory device reaches the maximum number of writes identified in the product warranty divided by an amount of time remaining until the flash memory reaches the maximum age identified in the product warranty; and causing data to be written to the flash memory device having the greatest number of pro rata writes remaining in the product warranty. 2. The computer program product of claim 1, the method further comprising:
identifying one of the flash memory devices having the least amount of time remaining until the flash memory reaches the product age identified in the product warranty; and increasing a rate of writing data to the identified flash memory device so that the number of writes made to the identified flash memory device reaches the maximum number of writes identified in the product warranty at approximately the same time as the age of the identified flash memory device reaches the maximum age identified in the product warranty. 3. The computer program product of claim 1, wherein the flash memory is a component of a device selected from a solid state drive, a serial bus attached data storage device, and a flash memory module card. 4. The computer program product of claim 1, wherein the plurality of flash memory devices form a single logical memory device. 5. The computer program product of claim 1, wherein the plurality of flash memory devices are cache memory for a plurality of hard disk drives. 6. The computer program product of claim 1, wherein the step of determining, for each flash memory device, a number of pro rata writes remaining in the product warranty is performed by an operating system of a computer in communication with the plurality of flash memory devices. 7. The computer program product of claim 1, wherein the step of determining, for each flash memory device, a number of pro rata writes remaining in the product warranty is performed by a controller coupled to the plurality of flash memory devices. 8. The computer program product of claim 1, the method further comprising:
wear leveling data stored on each flash memory device. 9. The computer program product of claim 1, wherein wear leveling data stored on each flash memory device is performed by a controller within each flash memory device. | A computer readable storage medium embodies program instructions executable by a processor to perform a method including identifying a product warranty for each of a plurality of flash memory devices within a system, wherein the product warranty includes a maximum number of writes and a maximum age, and tracking the number of writes and the age of each flash memory device. The method further includes determining, for each flash memory device, a number of pro rata writes remaining in the product warranty, which is determined as a number of writes remaining until the flash memory device reaches the maximum number of writes divided by an amount of time remaining until the flash memory reaches the maximum age. The method then causes data to be written to the flash memory device having the greatest number of pro rata writes remaining in the product warranty.1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying a product warranty for each of a plurality of flash memory devices within a system, wherein the product warranty includes a maximum number of writes and a maximum age; tracking the number of writes made to each flash memory device and the age of each flash memory device; determining, for each flash memory device, a number of pro rata writes remaining in the product warranty, wherein the number of pro rata writes remaining in the product warranty is determined as a number of writes remaining until the flash memory device reaches the maximum number of writes identified in the product warranty divided by an amount of time remaining until the flash memory reaches the maximum age identified in the product warranty; and causing data to be written to the flash memory device having the greatest number of pro rata writes remaining in the product warranty. 2. The computer program product of claim 1, the method further comprising:
identifying one of the flash memory devices having the least amount of time remaining until the flash memory reaches the product age identified in the product warranty; and increasing a rate of writing data to the identified flash memory device so that the number of writes made to the identified flash memory device reaches the maximum number of writes identified in the product warranty at approximately the same time as the age of the identified flash memory device reaches the maximum age identified in the product warranty. 3. The computer program product of claim 1, wherein the flash memory is a component of a device selected from a solid state drive, a serial bus attached data storage device, and a flash memory module card. 4. The computer program product of claim 1, wherein the plurality of flash memory devices form a single logical memory device. 5. The computer program product of claim 1, wherein the plurality of flash memory devices are cache memory for a plurality of hard disk drives. 6. The computer program product of claim 1, wherein the step of determining, for each flash memory device, a number of pro rata writes remaining in the product warranty is performed by an operating system of a computer in communication with the plurality of flash memory devices. 7. The computer program product of claim 1, wherein the step of determining, for each flash memory device, a number of pro rata writes remaining in the product warranty is performed by a controller coupled to the plurality of flash memory devices. 8. The computer program product of claim 1, the method further comprising:
wear leveling data stored on each flash memory device. 9. The computer program product of claim 1, wherein wear leveling data stored on each flash memory device is performed by a controller within each flash memory device. | 2,100 |
4,694 | 13,870,165 | 2,136 | A system and method for autonomic data storage and movement for big data analytics. A cost, such as storing cost and a processing cost are calculated for received data. The processing type associated with the received data is determined in response to the calculated costs. The received data is classified as one of a set of hierarchical storage classes based upon the determined processing type. The hierarchical storage classes include no data store, memory, HDFS, database, disk archive, external clouds, and data removal. The received data is then stored in the storage location associated with that class. In the event that insufficient capacity is available in the location, the priority of the received data and the priority of previously stored data is determined and compared. The priority is calculated based on potential usage, privacy, estimated cost, frequency of usages and the age of data. The lower priority data is then moved to the next lower hierarchical class for storage. | 1. A method for autonomic data storage and movement, comprising:
calculating at least one cost associated with received data; responsive to at least one calculated cost, determining a processing type associated with the received data; classifying the received data as one of a set of hierarchical storage classes in accordance with the determined processing type; identifying a storage location associated with the one of the set of hierarchical storage classes in which the received data was classified; and storing the received data in the identified storage location, wherein at least one of the calculating, classifying, identifying, and storing is performed with a computer processor. 2. The method of claim 1, wherein calculating the at least one cost further comprises:
estimating a storing cost associated with storage of the received data; and estimating a processing cost associated with processing of the received data, wherein the received data is classified in a no storage hierarchical storage class when the estimated storing cost is greater than the estimated processing cost. 3. The method of claim 2, wherein estimating the storing cost includes calculating a storage cost and a data transfer delay, and wherein estimating the processing cost includes calculating a computer node cost and a computation time. 4. The method of claim 3, further comprising:
determining a capacity associated with the identified storage location; and responsive to determining a sufficient capacity, storing the received data in the identified storage location. 5. The method of claim 4, further comprising:
calculating a priority of the received data responsive to determining an insufficient capacity of the identified storage location; calculating a priority of data in the identified storage location; and storing the received data in accordance with a comparison of the priority of the received data and the priority of the data in the identified storage location. 6. The method of claim 5, further comprising moving the data in the identified storage location to a storage location associated with a next lower hierarchical class responsive to the priority of the received data being greater than the priority of the data in the identified storage location. 7. The method of claim 5, further comprising:
identifying a storage location associated with a next lower hierarchical class responsive to the priority of the received data being less than the priority of the data in the identified storage location; classifying the received data as the next lower hierarchical class; and storing the received data in the storage location associated with the next lower hierarchical class. 8. The method of claim 7, wherein the hierarchical storage class is selected from the group consisting of no data storage class, memory storage class, HDFS storage class, database storage class, disk archive storage class, external cloud storage class, and data removal storage class. 9. The method of claim 5, wherein the priority is calculated in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. 10. The method of claim 9, wherein determining a processing type is determined in accordance with at least one of a data type, a user preference, and a previous usage of a similar data type. 11. A system for autonomic data storage and movement, comprising:
a data analytics platform, including:
a cost calculator configured to calculate a storing cost and a processing cost associated with received data;
a plurality of hierarchical storage locations, each storage location corresponding to a hierarchical storage class;
memory which stores instructions for:
classifying the received data as one of the plurality of hierarchical storage classes,
identifying a storage location associated with the one of the plurality of hierarchical storage classes, and
storing the received data in the identified storage location; and
a processor in communication with the memory which executes the instructions. 12. The system of claim 11, wherein the cost calculator includes at least one storing cost metric and at least one processing cost metric. 13. The system of claim 12, wherein the memory further stores instructions for:
estimating a storing cost associated with storage of the received data in accordance with the at least one storing cost metric; and estimating a processing cost associated with processing of the received data in accordance with the at least one processing cost metric, wherein the received data is classified in a no storage hierarchical storage class when the estimated storing cost is greater than the estimated processing cost. 14. The system of claim 13, wherein estimating the storing cost includes calculating a storage cost and a data transfer delay, and wherein estimating the processing cost includes calculating a computer node cost and a computation time. 15. The system of claim 14, wherein the memory further stores instructions for:
determining a processing type associated with the received data in accordance with at least one of a data type, a user preference, and a previous usage of a similar data type; and classifying the received data in accordance with the determined processing type. 16. The system of claim 15, further comprising:
a priority calculator configured to calculate a priority associated with the received data and data stored in the plurality of hierarchical storage locations; wherein the memory further stores instructions for:
calculating a priority of the received data responsive to determining an insufficient capacity of the identified storage location,
calculating a priority of data in the identified storage location, and
storing the received data in accordance with a comparison of the priority of the received data and the priority of the data in the identified storage location. 17. The system of claim 16, wherein the priority is calculated in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. 18. A computer-implemented method for autonomic data storage and movement, comprising:
determining a processing type associated with received data; classifying the received data as one of a set of hierarchical storage classes in accordance with the determined processing type; determining a priority associated with the received data in accordance with at least one priority metric; and storing the received data in storage location associated with the one of the set of hierarchical storage classes in accordance with a determined priority of the received data. 19. The computer-implemented method of claim 18, further comprising:
determining a capacity of the storage location relative to a size of the received data; comparing the determined priority of the received data with a priority of data already in the storage location; and moving the received data or the data already in the storage location to a storage location associated with a next lower hierarchical storage class in accordance with a result of the priority comparison. 20. The computer-implemented method of claim 19, wherein the priority is determined in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. | A system and method for autonomic data storage and movement for big data analytics. A cost, such as storing cost and a processing cost are calculated for received data. The processing type associated with the received data is determined in response to the calculated costs. The received data is classified as one of a set of hierarchical storage classes based upon the determined processing type. The hierarchical storage classes include no data store, memory, HDFS, database, disk archive, external clouds, and data removal. The received data is then stored in the storage location associated with that class. In the event that insufficient capacity is available in the location, the priority of the received data and the priority of previously stored data is determined and compared. The priority is calculated based on potential usage, privacy, estimated cost, frequency of usages and the age of data. The lower priority data is then moved to the next lower hierarchical class for storage.1. A method for autonomic data storage and movement, comprising:
calculating at least one cost associated with received data; responsive to at least one calculated cost, determining a processing type associated with the received data; classifying the received data as one of a set of hierarchical storage classes in accordance with the determined processing type; identifying a storage location associated with the one of the set of hierarchical storage classes in which the received data was classified; and storing the received data in the identified storage location, wherein at least one of the calculating, classifying, identifying, and storing is performed with a computer processor. 2. The method of claim 1, wherein calculating the at least one cost further comprises:
estimating a storing cost associated with storage of the received data; and estimating a processing cost associated with processing of the received data, wherein the received data is classified in a no storage hierarchical storage class when the estimated storing cost is greater than the estimated processing cost. 3. The method of claim 2, wherein estimating the storing cost includes calculating a storage cost and a data transfer delay, and wherein estimating the processing cost includes calculating a computer node cost and a computation time. 4. The method of claim 3, further comprising:
determining a capacity associated with the identified storage location; and responsive to determining a sufficient capacity, storing the received data in the identified storage location. 5. The method of claim 4, further comprising:
calculating a priority of the received data responsive to determining an insufficient capacity of the identified storage location; calculating a priority of data in the identified storage location; and storing the received data in accordance with a comparison of the priority of the received data and the priority of the data in the identified storage location. 6. The method of claim 5, further comprising moving the data in the identified storage location to a storage location associated with a next lower hierarchical class responsive to the priority of the received data being greater than the priority of the data in the identified storage location. 7. The method of claim 5, further comprising:
identifying a storage location associated with a next lower hierarchical class responsive to the priority of the received data being less than the priority of the data in the identified storage location; classifying the received data as the next lower hierarchical class; and storing the received data in the storage location associated with the next lower hierarchical class. 8. The method of claim 7, wherein the hierarchical storage class is selected from the group consisting of no data storage class, memory storage class, HDFS storage class, database storage class, disk archive storage class, external cloud storage class, and data removal storage class. 9. The method of claim 5, wherein the priority is calculated in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. 10. The method of claim 9, wherein determining a processing type is determined in accordance with at least one of a data type, a user preference, and a previous usage of a similar data type. 11. A system for autonomic data storage and movement, comprising:
a data analytics platform, including:
a cost calculator configured to calculate a storing cost and a processing cost associated with received data;
a plurality of hierarchical storage locations, each storage location corresponding to a hierarchical storage class;
memory which stores instructions for:
classifying the received data as one of the plurality of hierarchical storage classes,
identifying a storage location associated with the one of the plurality of hierarchical storage classes, and
storing the received data in the identified storage location; and
a processor in communication with the memory which executes the instructions. 12. The system of claim 11, wherein the cost calculator includes at least one storing cost metric and at least one processing cost metric. 13. The system of claim 12, wherein the memory further stores instructions for:
estimating a storing cost associated with storage of the received data in accordance with the at least one storing cost metric; and estimating a processing cost associated with processing of the received data in accordance with the at least one processing cost metric, wherein the received data is classified in a no storage hierarchical storage class when the estimated storing cost is greater than the estimated processing cost. 14. The system of claim 13, wherein estimating the storing cost includes calculating a storage cost and a data transfer delay, and wherein estimating the processing cost includes calculating a computer node cost and a computation time. 15. The system of claim 14, wherein the memory further stores instructions for:
determining a processing type associated with the received data in accordance with at least one of a data type, a user preference, and a previous usage of a similar data type; and classifying the received data in accordance with the determined processing type. 16. The system of claim 15, further comprising:
a priority calculator configured to calculate a priority associated with the received data and data stored in the plurality of hierarchical storage locations; wherein the memory further stores instructions for:
calculating a priority of the received data responsive to determining an insufficient capacity of the identified storage location,
calculating a priority of data in the identified storage location, and
storing the received data in accordance with a comparison of the priority of the received data and the priority of the data in the identified storage location. 17. The system of claim 16, wherein the priority is calculated in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. 18. A computer-implemented method for autonomic data storage and movement, comprising:
determining a processing type associated with received data; classifying the received data as one of a set of hierarchical storage classes in accordance with the determined processing type; determining a priority associated with the received data in accordance with at least one priority metric; and storing the received data in storage location associated with the one of the set of hierarchical storage classes in accordance with a determined priority of the received data. 19. The computer-implemented method of claim 18, further comprising:
determining a capacity of the storage location relative to a size of the received data; comparing the determined priority of the received data with a priority of data already in the storage location; and moving the received data or the data already in the storage location to a storage location associated with a next lower hierarchical storage class in accordance with a result of the priority comparison. 20. The computer-implemented method of claim 19, wherein the priority is determined in accordance with a type of applicable analytics services, a potential usage of the received data, a usage frequency, and an age of the received data. | 2,100 |
4,695 | 14,332,573 | 2,122 | A method for expanding an answer key to verify a question and answer system is provided in the illustrative embodiments. A definition is constructed of an extended answer type. The extended answer type represents an answer type of an unrepresented answer. The unrepresented answer is unrepresented in the answer key as a valid response to a question in a set of valid responses to the question in the answer key. The extended answer type is created in the answer key according to the definition. The extended answer type is populated such that the unrepresented answer becomes as additional valid response to the question, the creating and the populating extending the answer key to form an extended answer key. The populated extended answer type in the extended answer key is used to verify that a generated answer from the Q and A system is correct. | 1. A method for expanding an answer key to verify a question and answer (Q and A) system, the method comprising:
constructing a definition of an extended answer type, wherein the extended answer type represents an answer type of an unrepresented answer, wherein the unrepresented answer is unrepresented in the answer key as a valid response to a question in a set of valid responses to the question in the answer key; creating, using a processor and a memory, the extended answer type in the answer key according to the definition; populating the extended answer type such that the unrepresented answer becomes as additional valid response to the question, the creating and the populating extending the answer key to form an extended answer key; and using the populated extended answer type in the extended answer key to verify that a generated answer from the Q and A system is correct. 2. The method of claim 1, wherein the generated answer is incorrect according to an existing answer type in the answer key. 3. The method of claim 1, further comprising:
forming the definition by modifying an abstract definition; constructing a second definition of a second extended answer type, wherein the second extended answer type represents an answer type of a second unrepresented answer. 4. The method of claim 3, wherein the abstract definition is used as a placeholder in the extended answer key for a third extended answer type. 5. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer because a computation using the populated extended answer type results in the additional valid response. 6. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer because a logic described in a metadata of the extended answer key computes to make the unrepresented answer the additional valid response. 7. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer by being a member of a range of values specified in the populated extended answer type. 8. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer by being a member of a range of values, wherein the range of values is computed using logic in a metadata of the extended answer key. 9. The method of claim 1, further comprising:
configuring the extended answer type with a changeable condition, wherein a value of the additional valid answer changes when the condition changes. 10. The method of claim 1, wherein the extended answer key in an Extensible Markup Language (XML) document, wherein the definition is an XML structure. 11. The method of claim 1, wherein the question comprise a sentence in natural language, wherein the Q and A system is configured to respond to the natural language question. 12. The method of claim 1, wherein the question comprise a sentence in natural language, wherein the Q and A system is configured to respond to the natural language question using another extended answer type to represent answers one of (i) based on a cultural reference, (ii) in a particular language, and (iii) from a set of synonyms. | A method for expanding an answer key to verify a question and answer system is provided in the illustrative embodiments. A definition is constructed of an extended answer type. The extended answer type represents an answer type of an unrepresented answer. The unrepresented answer is unrepresented in the answer key as a valid response to a question in a set of valid responses to the question in the answer key. The extended answer type is created in the answer key according to the definition. The extended answer type is populated such that the unrepresented answer becomes as additional valid response to the question, the creating and the populating extending the answer key to form an extended answer key. The populated extended answer type in the extended answer key is used to verify that a generated answer from the Q and A system is correct.1. A method for expanding an answer key to verify a question and answer (Q and A) system, the method comprising:
constructing a definition of an extended answer type, wherein the extended answer type represents an answer type of an unrepresented answer, wherein the unrepresented answer is unrepresented in the answer key as a valid response to a question in a set of valid responses to the question in the answer key; creating, using a processor and a memory, the extended answer type in the answer key according to the definition; populating the extended answer type such that the unrepresented answer becomes as additional valid response to the question, the creating and the populating extending the answer key to form an extended answer key; and using the populated extended answer type in the extended answer key to verify that a generated answer from the Q and A system is correct. 2. The method of claim 1, wherein the generated answer is incorrect according to an existing answer type in the answer key. 3. The method of claim 1, further comprising:
forming the definition by modifying an abstract definition; constructing a second definition of a second extended answer type, wherein the second extended answer type represents an answer type of a second unrepresented answer. 4. The method of claim 3, wherein the abstract definition is used as a placeholder in the extended answer key for a third extended answer type. 5. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer because a computation using the populated extended answer type results in the additional valid response. 6. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer because a logic described in a metadata of the extended answer key computes to make the unrepresented answer the additional valid response. 7. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer by being a member of a range of values specified in the populated extended answer type. 8. The method of claim 1, wherein the unrepresented answer becomes the additional valid answer by being a member of a range of values, wherein the range of values is computed using logic in a metadata of the extended answer key. 9. The method of claim 1, further comprising:
configuring the extended answer type with a changeable condition, wherein a value of the additional valid answer changes when the condition changes. 10. The method of claim 1, wherein the extended answer key in an Extensible Markup Language (XML) document, wherein the definition is an XML structure. 11. The method of claim 1, wherein the question comprise a sentence in natural language, wherein the Q and A system is configured to respond to the natural language question. 12. The method of claim 1, wherein the question comprise a sentence in natural language, wherein the Q and A system is configured to respond to the natural language question using another extended answer type to represent answers one of (i) based on a cultural reference, (ii) in a particular language, and (iii) from a set of synonyms. | 2,100 |
4,696 | 13,976,691 | 2,184 | According to various embodiments, apparatuses and methods to communicate buffer allocation information are presented. The disclosed apparatuses and methods may include transmitting a buffer message by a wireless USB device to a wireless USB host, which may indicate an available storage space in a buffer of the USB device to store data from the USB host. The buffer message may be transmitted independent of whether or not the USB device has received a request message (e.g., from the USB host) for information relating the available storage space in the buffer. Additionally, the buffer message may be transmitted independent of any data exchange mechanism between the USB host and the USB device. The USB device may receive a data packet from the USB host, and transmit a data packet acknowledgement message including data packet status information, and information regarding the available storage space in the buffer. | 1. A method to communicate buffer information in universal serial bus (USB) communications, the method comprising:
transmitting, by a USB device configured to communicate with a USB host, a buffer message to the USB host, the buffer message indicating an available storage space in a buffer of the USB device to store data received from the USB host, wherein the buffer message is transmitted independent of whether or not the USB device has received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the USB device. 2. The method of claim 1, further comprising receiving, at the USB device, an acknowledgement message indicating that the buffer message has been received at the USB host. 3. The method of claim 2, further comprising receiving the acknowledgement message from the USB host. 4. The method of claim 1, further comprising transmitting, by the USB device, initialization information to the USB host to establish a connection therewith prior to said transmitting the buffer message. 5. The method of claim 1, further comprising:
receiving, at the USB device, a data packet from the USB host; and transmitting, by the USB device, a data packet acknowledgement message including status information indicating whether or not the data packet has been successfully received at the USB device, and updated information regarding the available storage space in the buffer. 6. The method of claim 1, wherein the USB device is configured to wirelessly communicate with the USB host in accordance with a wireless protocol, the wireless protocol based on at least one of the IEEE 802.11 standard, or WiGig specification. 7. The method of claim 1, further comprising receiving, by the USB device, the request message from the USB host. 8. The method of claim 7, wherein the request message includes an estimate of a size of an intended data transfer from the USB host to the USB device. 9. A method to communicate buffer information in universal serial bus (USB) communications, the method comprising:
receiving, by a USB device configured to communicate with a USB host, at least one data packet from the USB host, the USB device including a buffer to store data including the at least one data packet; and transmitting, by the USB device, a data packet acknowledgement message to the USB host, the data packet acknowledgement message including status information indicating whether or not the at least one data packet has been successfully received at the USB device, and information regarding a current available storage space in the buffer. 10. The method of claim 9, wherein the USB device is configured to wirelessly communicate with the USB host in accordance with a wireless protocol, the wireless protocol based on at least one of the IEEE 802.11 standard, or WiGig specification. 11. The method of claim 9, further comprising:
transmitting, by the USB device, a buffer message indicating an available storage space in the buffer of the USB device to store data received from the USB host, wherein the buffer message is transmitted independent of whether or not the USB device has received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the USB device, the data exchange mechanism including at least said receiving the at least one data packet and said transmitting the data packet acknowledgement message. 12. An apparatus to communicate buffer information in universal serial bus (USB) communications, the apparatus comprising:
a buffer configured to store data received from a USB host; a buffer controller to manage the buffer, the buffer controller configured to generate a buffer message indicating an available storage space in the buffer; and a transceiver to transmit and receive radio frequency signals, the transceiver being communicatively coupled to the buffer controller, and configured to transmit the buffer message to the USB host, wherein the buffer message is generated independent of whether or not the buffer controller, the transceiver, or both have received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the apparatus. 13. The apparatus of claim 12, wherein the transceiver is further configured to receive an acknowledgement message from the USB host indicating that the buffer message has been received at the USB host. 14. The apparatus of claim 12, wherein the transceiver is configured to communicate wirelessly based on at least one of the IEEE 802.11 standard, or WiGig specification. 15. The apparatus of claim 12, wherein the buffer controller, the transceiver, or both are further configured to receive the request message from the USB host. 16. The apparatus of claim 15, wherein the request message includes an estimate of a size of an intended data transfer from the USB host to the apparatus. 17. The apparatus of claim 12, wherein the transceiver is configured to receive a data packet from the USB host, and
wherein, responsive to said reception of the data packet, the buffer controller is further configured to generate a data packet acknowledgement message including status information indicating whether or not the data packet has been successfully received, and updated information regarding the available storage space in the buffer, wherein the transceiver is further configured to transmit the data packet acknowledgement message to the USB host. 18. An apparatus to communicate buffer information in universal serial bus (USB) communications, the apparatus comprising:
a buffer configured to store data from a USB host; a transceiver to transmit and receive radio frequency signals, the transceiver configured to receive at least one data packet from the USB host; a buffer controller to manage the buffer, the buffer controller being communicatively coupled to the transceiver, and responsive to said reception of the at least one data packet, the buffer controller being configured to generate a data packet acknowledgement message including status information indicating whether or not the at least one data packet has been successfully received, and information regarding a current available storage space in the buffer, wherein the transceiver is further configured to transmit the data packet acknowledgement message to the USB host. 19. The apparatus of claim 18, wherein the transceiver is configured to communicate wirelessly based on at least one of the IEEE 802.11 standard, or WiGig specification. 20. The apparatus of claim 18, wherein the buffer controller is further configured to generate a buffer message indicating an available storage space in the buffer, wherein the buffer message is generated independent of whether or not the buffer controller, the transceiver, or both have received a request message for information relating the available storage space in the buffer, and independent of said reception of the at least one data packet, and
wherein, the transceiver is further configured to transmit the buffer message to the USB host independent of a data exchange mechanism between the USB host and the apparatus including at least said reception of the at least one data packet and said transmission of the data packet acknowledgement message by the transceiver. | According to various embodiments, apparatuses and methods to communicate buffer allocation information are presented. The disclosed apparatuses and methods may include transmitting a buffer message by a wireless USB device to a wireless USB host, which may indicate an available storage space in a buffer of the USB device to store data from the USB host. The buffer message may be transmitted independent of whether or not the USB device has received a request message (e.g., from the USB host) for information relating the available storage space in the buffer. Additionally, the buffer message may be transmitted independent of any data exchange mechanism between the USB host and the USB device. The USB device may receive a data packet from the USB host, and transmit a data packet acknowledgement message including data packet status information, and information regarding the available storage space in the buffer.1. A method to communicate buffer information in universal serial bus (USB) communications, the method comprising:
transmitting, by a USB device configured to communicate with a USB host, a buffer message to the USB host, the buffer message indicating an available storage space in a buffer of the USB device to store data received from the USB host, wherein the buffer message is transmitted independent of whether or not the USB device has received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the USB device. 2. The method of claim 1, further comprising receiving, at the USB device, an acknowledgement message indicating that the buffer message has been received at the USB host. 3. The method of claim 2, further comprising receiving the acknowledgement message from the USB host. 4. The method of claim 1, further comprising transmitting, by the USB device, initialization information to the USB host to establish a connection therewith prior to said transmitting the buffer message. 5. The method of claim 1, further comprising:
receiving, at the USB device, a data packet from the USB host; and transmitting, by the USB device, a data packet acknowledgement message including status information indicating whether or not the data packet has been successfully received at the USB device, and updated information regarding the available storage space in the buffer. 6. The method of claim 1, wherein the USB device is configured to wirelessly communicate with the USB host in accordance with a wireless protocol, the wireless protocol based on at least one of the IEEE 802.11 standard, or WiGig specification. 7. The method of claim 1, further comprising receiving, by the USB device, the request message from the USB host. 8. The method of claim 7, wherein the request message includes an estimate of a size of an intended data transfer from the USB host to the USB device. 9. A method to communicate buffer information in universal serial bus (USB) communications, the method comprising:
receiving, by a USB device configured to communicate with a USB host, at least one data packet from the USB host, the USB device including a buffer to store data including the at least one data packet; and transmitting, by the USB device, a data packet acknowledgement message to the USB host, the data packet acknowledgement message including status information indicating whether or not the at least one data packet has been successfully received at the USB device, and information regarding a current available storage space in the buffer. 10. The method of claim 9, wherein the USB device is configured to wirelessly communicate with the USB host in accordance with a wireless protocol, the wireless protocol based on at least one of the IEEE 802.11 standard, or WiGig specification. 11. The method of claim 9, further comprising:
transmitting, by the USB device, a buffer message indicating an available storage space in the buffer of the USB device to store data received from the USB host, wherein the buffer message is transmitted independent of whether or not the USB device has received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the USB device, the data exchange mechanism including at least said receiving the at least one data packet and said transmitting the data packet acknowledgement message. 12. An apparatus to communicate buffer information in universal serial bus (USB) communications, the apparatus comprising:
a buffer configured to store data received from a USB host; a buffer controller to manage the buffer, the buffer controller configured to generate a buffer message indicating an available storage space in the buffer; and a transceiver to transmit and receive radio frequency signals, the transceiver being communicatively coupled to the buffer controller, and configured to transmit the buffer message to the USB host, wherein the buffer message is generated independent of whether or not the buffer controller, the transceiver, or both have received a request message for information relating the available storage space in the buffer, and wherein the buffer message is transmitted independent of a data exchange mechanism between the USB host and the apparatus. 13. The apparatus of claim 12, wherein the transceiver is further configured to receive an acknowledgement message from the USB host indicating that the buffer message has been received at the USB host. 14. The apparatus of claim 12, wherein the transceiver is configured to communicate wirelessly based on at least one of the IEEE 802.11 standard, or WiGig specification. 15. The apparatus of claim 12, wherein the buffer controller, the transceiver, or both are further configured to receive the request message from the USB host. 16. The apparatus of claim 15, wherein the request message includes an estimate of a size of an intended data transfer from the USB host to the apparatus. 17. The apparatus of claim 12, wherein the transceiver is configured to receive a data packet from the USB host, and
wherein, responsive to said reception of the data packet, the buffer controller is further configured to generate a data packet acknowledgement message including status information indicating whether or not the data packet has been successfully received, and updated information regarding the available storage space in the buffer, wherein the transceiver is further configured to transmit the data packet acknowledgement message to the USB host. 18. An apparatus to communicate buffer information in universal serial bus (USB) communications, the apparatus comprising:
a buffer configured to store data from a USB host; a transceiver to transmit and receive radio frequency signals, the transceiver configured to receive at least one data packet from the USB host; a buffer controller to manage the buffer, the buffer controller being communicatively coupled to the transceiver, and responsive to said reception of the at least one data packet, the buffer controller being configured to generate a data packet acknowledgement message including status information indicating whether or not the at least one data packet has been successfully received, and information regarding a current available storage space in the buffer, wherein the transceiver is further configured to transmit the data packet acknowledgement message to the USB host. 19. The apparatus of claim 18, wherein the transceiver is configured to communicate wirelessly based on at least one of the IEEE 802.11 standard, or WiGig specification. 20. The apparatus of claim 18, wherein the buffer controller is further configured to generate a buffer message indicating an available storage space in the buffer, wherein the buffer message is generated independent of whether or not the buffer controller, the transceiver, or both have received a request message for information relating the available storage space in the buffer, and independent of said reception of the at least one data packet, and
wherein, the transceiver is further configured to transmit the buffer message to the USB host independent of a data exchange mechanism between the USB host and the apparatus including at least said reception of the at least one data packet and said transmission of the data packet acknowledgement message by the transceiver. | 2,100 |
4,697 | 13,920,736 | 2,161 | A remote storage digital video recording system ( 300 ) comprises a storage server ( 310 ). The storage server can include a memory( 412 ) and a control circuit ( 410 ) operable with the memory. The storage server can be in communication across a network ( 311 ) with one or more client devices ( 306,307,308 ). The control circuit can be configured to create a file allocation table ( 314 ) to organize clusters ( 330 ) of a computer readable medium ( 308 ). The file allocation table can include a plurality of distinguishable file entries ( 320,321,322 ). Each of the distinguishable file entries can index clusters of the computer readable medium. At least two of the plurality of distinguishable file entries can index selfsame clusters ( 331 ) of the computer readable medium. | 1. A system, comprising:
a storage server comprising a memory and a control circuit operable with the memory, the storage server in communication across a network with one or more client devices, the control circuit to:
create a file allocation table to organize clusters of a computer readable medium;
the file allocation table comprising a plurality of distinguishable file entries, each of the distinguishable file entries indexing clusters of the computer readable medium;
at least two of the plurality of distinguishable file entries indexing selfsame clusters of the computer readable medium. 2. The system of claim 1, the control circuit to create a second distinguishable file entry while the selfsame clusters indexed by a first distinguishable file entry are written. 3. The system of claim 1, the selfsame clusters of the computer readable medium comprising data different from any other clusters of the computer readable medium. 4. The system of claim 1, the at least two of the plurality of distinguishable file entries comprising a set of distinguishable files, the control circuit to delete the selfsame clusters when a last member of the set accesses the selfsame clusters. 5. The system of claim 1, further comprising a communication interface in communication with one or more remote devices, the communication interface to cause the one or more remote devices to perceive the at least two of the plurality of distinguishable file entries to index different clusters. 6. The system of claim 1, the storage server comprising a video recording device. 7. The system of claim 6, the selfsame clusters comprising a video content offering. 8. The system of claim 7, the control circuit to create entries of the file allocation table in response to received requests to record the video content offering. 9. The system of claim 1, the at least two of the plurality of distinguishable file entries comprising metadata identifying owners of data represented by the selfsame clusters. 10. The system of claim 9, the owners being different. 11. The system of claim 9, the control circuit to erase the data when the metadata is changed to identify no owners of the data. 12. A method, comprising:
storing data in one or more clusters of a computer readable medium in a memory operable with a storage server comprising a control circuit operable with the memory; creating a first distinguishable file entry in a file allocation table indexing the one or more clusters; and creating a second distinguishable file entry in the file allocation table also indexing the one or more clusters. 13. The method of claim 12, further comprising creating a third distinguishable file entry in the file allocation table also indexing the one or more clusters. 14. The method of claim 12, the creating the second distinguishable file entry while the storing occurs. 15. The method of claim 12, further comprising determining the one or more clusters are stored on the computer readable medium prior to creating the second distinguishable file entry. 16. The method of claim 15, the determining comprising referencing the first distinguishable file entry. 17. The method of claim 12, further comprising creating metadata for each distinguishable file entry, the metadata defining an owner of the data. 18. The method of claim 17, further comprising removing owners from the metadata after they have accessed the data. 19. The method of claim 18, further comprising removing the data from the one or more clusters after all owners have accessed the data. 20. The method of claim 12, further comprising causing at least one remote device in communication with the control circuit to perceive the first distinguishable file entry and the second distinguishable file entry to index different clusters. | A remote storage digital video recording system ( 300 ) comprises a storage server ( 310 ). The storage server can include a memory( 412 ) and a control circuit ( 410 ) operable with the memory. The storage server can be in communication across a network ( 311 ) with one or more client devices ( 306,307,308 ). The control circuit can be configured to create a file allocation table ( 314 ) to organize clusters ( 330 ) of a computer readable medium ( 308 ). The file allocation table can include a plurality of distinguishable file entries ( 320,321,322 ). Each of the distinguishable file entries can index clusters of the computer readable medium. At least two of the plurality of distinguishable file entries can index selfsame clusters ( 331 ) of the computer readable medium.1. A system, comprising:
a storage server comprising a memory and a control circuit operable with the memory, the storage server in communication across a network with one or more client devices, the control circuit to:
create a file allocation table to organize clusters of a computer readable medium;
the file allocation table comprising a plurality of distinguishable file entries, each of the distinguishable file entries indexing clusters of the computer readable medium;
at least two of the plurality of distinguishable file entries indexing selfsame clusters of the computer readable medium. 2. The system of claim 1, the control circuit to create a second distinguishable file entry while the selfsame clusters indexed by a first distinguishable file entry are written. 3. The system of claim 1, the selfsame clusters of the computer readable medium comprising data different from any other clusters of the computer readable medium. 4. The system of claim 1, the at least two of the plurality of distinguishable file entries comprising a set of distinguishable files, the control circuit to delete the selfsame clusters when a last member of the set accesses the selfsame clusters. 5. The system of claim 1, further comprising a communication interface in communication with one or more remote devices, the communication interface to cause the one or more remote devices to perceive the at least two of the plurality of distinguishable file entries to index different clusters. 6. The system of claim 1, the storage server comprising a video recording device. 7. The system of claim 6, the selfsame clusters comprising a video content offering. 8. The system of claim 7, the control circuit to create entries of the file allocation table in response to received requests to record the video content offering. 9. The system of claim 1, the at least two of the plurality of distinguishable file entries comprising metadata identifying owners of data represented by the selfsame clusters. 10. The system of claim 9, the owners being different. 11. The system of claim 9, the control circuit to erase the data when the metadata is changed to identify no owners of the data. 12. A method, comprising:
storing data in one or more clusters of a computer readable medium in a memory operable with a storage server comprising a control circuit operable with the memory; creating a first distinguishable file entry in a file allocation table indexing the one or more clusters; and creating a second distinguishable file entry in the file allocation table also indexing the one or more clusters. 13. The method of claim 12, further comprising creating a third distinguishable file entry in the file allocation table also indexing the one or more clusters. 14. The method of claim 12, the creating the second distinguishable file entry while the storing occurs. 15. The method of claim 12, further comprising determining the one or more clusters are stored on the computer readable medium prior to creating the second distinguishable file entry. 16. The method of claim 15, the determining comprising referencing the first distinguishable file entry. 17. The method of claim 12, further comprising creating metadata for each distinguishable file entry, the metadata defining an owner of the data. 18. The method of claim 17, further comprising removing owners from the metadata after they have accessed the data. 19. The method of claim 18, further comprising removing the data from the one or more clusters after all owners have accessed the data. 20. The method of claim 12, further comprising causing at least one remote device in communication with the control circuit to perceive the first distinguishable file entry and the second distinguishable file entry to index different clusters. | 2,100 |
4,698 | 12,983,575 | 2,141 | One implementation provides monitoring a user's activity within a first window that is visible to the user in a graphical user interface (GUI), receiving notification of an incoming message intended for the user, and, upon receipt, opening a second window that is visible to the user in the GUI, the second window being distinct from any other window currently open in the GUI. When a predetermined condition is satisfied based upon the user's activity being monitored in the first window, the implementation further provides deactivating the first window in the GUI and activating the second window to provide the user with notification of the incoming message. | 1-25. (canceled) 26. A computer-implemented method comprising:
monitoring activity of a user; receiving a notification of an incoming message addressed to the user; determining, based on an identity associated with a sender of the incoming message, whether to interrupt the activity of the user in view of the incoming message from the sender; and if it is determined, based on the identity associated with the sender of the incoming message, that the activity of the user is to be interrupted in view of the incoming message from the sender, notifying the user of the incoming message. 27. The computer-implemented method of claim 26, wherein notifying the user of the incoming message comprises automatically causing a window to become active and presenting the incoming message in the window. 28. The computer-implement method of claim 27, wherein the method is performed by a client-side application. 29. The computer-implement method of claim 27, wherein the method is performed by a web application. 30. The computer-implemented method of claim 27, wherein the window comprises a browser window. 31. A non-transitory computer-readable medium storing a set of instructions that, when executed by a processor, perform a method comprising:
monitoring activity of a user; receiving a notification of an incoming message addressed to the user; determining, based on an identity associated with a sender of the incoming message, whether to interrupt the activity of the user in view of the incoming message from the sender; and if it is determined, based on the identity associated with the sender of the incoming message, that the activity of the user is to be interrupted in view of the incoming message from the sender, notifying the user of the incoming message. 32. The non-transitory computer-readable medium of claim 31, wherein notifying the user of the incoming message comprises automatically causing a window to become active and presenting the incoming message in the window. 33. The non-transitory computer-readable medium of claim 31, wherein the method is performed by a client-side application. 34. The non-transitory computer-readable medium of claim 31, wherein the method is performed by a web application. 35. The non-transitory computer-readable medium of claim 31, wherein the window comprises a browser window. 36. The non-transitory computer-readable medium of claim 31, wherein monitoring the activity of the user comprises monitoring a user's activity within a first window in a graphical user interface (GUI). 37. The non-transitory computer-readable medium of claim 36, wherein notifying the user of the incoming message comprises:
determining if the user's activity in the first window in the GUI satisfies a predetermined condition, and when it is determined that the user's activity in the first window in the GUI has satisfied the predetermined condition:
automatically causing the first window in the GUI to transition from being active to being inactive, and
automatically causing a second window to become active in the GUI to provide the user with a notification of the incoming message. 38. The non-transitory computer-medium of claim 37, wherein the method further comprises:
determining that the user's activity in the first window in the GUI satisfies the predetermined condition if there has been no user activity in the first window for a predetermined amount of time. 39. A computer-implemented method, comprising:
receiving a notification of an incoming message that is intended for a user and that is from another user; determining that a predetermined amount of time has elapsed since receiving the notification of the incoming message without a predetermined condition having been satisfied; and in response to determining that the predetermined amount of time has elapsed since receiving the notification of the incoming message without the predetermined condition having been satisfied, automatically providing an indication to the another user that the user has not yet received notification of the incoming message. 40. The computer-implement method of claim 39, wherein the method is performed by a client-side application. 41. The computer-implement method of claim 39, wherein the method is performed by a web application. 42. The computer-implemented method of claim 39, wherein the window comprises a browser window. 43. A non-transitory computer-readable medium storing a set of instructions that, when executed by a processor, perform a method, the method comprising:
receiving a notification of an incoming message that is intended for a user and that is from another user; determining that a predetermined amount of time has elapsed since receiving the notification of the incoming message without a predetermined condition having been satisfied; and in response to determining that the predetermined amount of time has elapsed since receiving the notification of the incoming message without the predetermined condition having been satisfied, automatically providing an indication to the another user that the user has not yet received notification of the incoming message. 44. The non-transitory computer-readable medium of claim 43 wherein the method further comprises:
determining that a first window that is visible to the user in a graphical user interface (GUI) is active; and
after receiving the notification of the incoming message, delaying notification of the incoming message until the user's interaction with the presently active first window satisfies the predetermined condition. 45. The non-transitory computer-readable medium of claim 44 wherein the method further comprises:
monitoring the user's interaction with the presently active first window;
after providing the indication to the another user that the user has not yet received notification of the incoming message and based on monitoring the user's interaction with the presently active first window, determining that the user's interaction with the presently active first window has satisfied the predetermined condition; and
in response to determining that the user's interaction with the presently active first window has satisfied the predetermined condition:
automatically causing the presently active first window to transition from being active to being inactive, and
automatically causing a second window to become active in the GUI to provide the user with notification of the incoming message. 46. The non-transitory computer-readable medium of claim 43, wherein the method is performed by a client-side application. 47. The non-transitory computer-readable medium of claim 43, wherein the method is performed by a web application. 48. The non-transitory computer-readable medium of claim 43, wherein the window comprises a browser window. | One implementation provides monitoring a user's activity within a first window that is visible to the user in a graphical user interface (GUI), receiving notification of an incoming message intended for the user, and, upon receipt, opening a second window that is visible to the user in the GUI, the second window being distinct from any other window currently open in the GUI. When a predetermined condition is satisfied based upon the user's activity being monitored in the first window, the implementation further provides deactivating the first window in the GUI and activating the second window to provide the user with notification of the incoming message.1-25. (canceled) 26. A computer-implemented method comprising:
monitoring activity of a user; receiving a notification of an incoming message addressed to the user; determining, based on an identity associated with a sender of the incoming message, whether to interrupt the activity of the user in view of the incoming message from the sender; and if it is determined, based on the identity associated with the sender of the incoming message, that the activity of the user is to be interrupted in view of the incoming message from the sender, notifying the user of the incoming message. 27. The computer-implemented method of claim 26, wherein notifying the user of the incoming message comprises automatically causing a window to become active and presenting the incoming message in the window. 28. The computer-implement method of claim 27, wherein the method is performed by a client-side application. 29. The computer-implement method of claim 27, wherein the method is performed by a web application. 30. The computer-implemented method of claim 27, wherein the window comprises a browser window. 31. A non-transitory computer-readable medium storing a set of instructions that, when executed by a processor, perform a method comprising:
monitoring activity of a user; receiving a notification of an incoming message addressed to the user; determining, based on an identity associated with a sender of the incoming message, whether to interrupt the activity of the user in view of the incoming message from the sender; and if it is determined, based on the identity associated with the sender of the incoming message, that the activity of the user is to be interrupted in view of the incoming message from the sender, notifying the user of the incoming message. 32. The non-transitory computer-readable medium of claim 31, wherein notifying the user of the incoming message comprises automatically causing a window to become active and presenting the incoming message in the window. 33. The non-transitory computer-readable medium of claim 31, wherein the method is performed by a client-side application. 34. The non-transitory computer-readable medium of claim 31, wherein the method is performed by a web application. 35. The non-transitory computer-readable medium of claim 31, wherein the window comprises a browser window. 36. The non-transitory computer-readable medium of claim 31, wherein monitoring the activity of the user comprises monitoring a user's activity within a first window in a graphical user interface (GUI). 37. The non-transitory computer-readable medium of claim 36, wherein notifying the user of the incoming message comprises:
determining if the user's activity in the first window in the GUI satisfies a predetermined condition, and when it is determined that the user's activity in the first window in the GUI has satisfied the predetermined condition:
automatically causing the first window in the GUI to transition from being active to being inactive, and
automatically causing a second window to become active in the GUI to provide the user with a notification of the incoming message. 38. The non-transitory computer-medium of claim 37, wherein the method further comprises:
determining that the user's activity in the first window in the GUI satisfies the predetermined condition if there has been no user activity in the first window for a predetermined amount of time. 39. A computer-implemented method, comprising:
receiving a notification of an incoming message that is intended for a user and that is from another user; determining that a predetermined amount of time has elapsed since receiving the notification of the incoming message without a predetermined condition having been satisfied; and in response to determining that the predetermined amount of time has elapsed since receiving the notification of the incoming message without the predetermined condition having been satisfied, automatically providing an indication to the another user that the user has not yet received notification of the incoming message. 40. The computer-implement method of claim 39, wherein the method is performed by a client-side application. 41. The computer-implement method of claim 39, wherein the method is performed by a web application. 42. The computer-implemented method of claim 39, wherein the window comprises a browser window. 43. A non-transitory computer-readable medium storing a set of instructions that, when executed by a processor, perform a method, the method comprising:
receiving a notification of an incoming message that is intended for a user and that is from another user; determining that a predetermined amount of time has elapsed since receiving the notification of the incoming message without a predetermined condition having been satisfied; and in response to determining that the predetermined amount of time has elapsed since receiving the notification of the incoming message without the predetermined condition having been satisfied, automatically providing an indication to the another user that the user has not yet received notification of the incoming message. 44. The non-transitory computer-readable medium of claim 43 wherein the method further comprises:
determining that a first window that is visible to the user in a graphical user interface (GUI) is active; and
after receiving the notification of the incoming message, delaying notification of the incoming message until the user's interaction with the presently active first window satisfies the predetermined condition. 45. The non-transitory computer-readable medium of claim 44 wherein the method further comprises:
monitoring the user's interaction with the presently active first window;
after providing the indication to the another user that the user has not yet received notification of the incoming message and based on monitoring the user's interaction with the presently active first window, determining that the user's interaction with the presently active first window has satisfied the predetermined condition; and
in response to determining that the user's interaction with the presently active first window has satisfied the predetermined condition:
automatically causing the presently active first window to transition from being active to being inactive, and
automatically causing a second window to become active in the GUI to provide the user with notification of the incoming message. 46. The non-transitory computer-readable medium of claim 43, wherein the method is performed by a client-side application. 47. The non-transitory computer-readable medium of claim 43, wherein the method is performed by a web application. 48. The non-transitory computer-readable medium of claim 43, wherein the window comprises a browser window. | 2,100 |
4,699 | 13,229,397 | 2,191 | One or more techniques and/or systems are provided for deploying an application within a computing environment. In particular, an application that is requested for deployment may be identified (e.g., an application to be downloaded, installed, updated, registered and/or removed during deployment). A set of deployment rules may be executed upon deployment parameters within a manifest (e.g., metadata describing how the application is to be deployed) to detect whether a conflict (e.g., issues that may arise from concurrent deployment) may exist between the deployment parameters and a second application currently being deployed within the computing environment. For example, resource access conflicts, file access conflicts, and/or registry access conflicts may be identified. If no conflicts exist, then the application may be concurrently deployed with the second application. In this way, applications associated with users may be concurrently deployed within the computing environment, while mitigating conflicts to achieve deployment parallelization. | 1. A method for deploying an application, comprising:
identifying an application that is requested for deployment within a computing environment; extracting deployment parameters from a manifest associated with the application; executing a set of deployment rules upon the deployment parameters to determine whether a conflict exists between the deployment parameters and a second application being deployed within the computing environment; and upon determining no conflict exists, deploying the application concurrently with the second application. 2. The method of claim 1, comprising:
iteratively traversing a queue of applications queued for deployment to deploy an optionally set threshold number of non-conflicting applications within the computing environment concurrently. 3. The method of claim 1, the executing a set of deployment rules comprising:
comparing the deployment parameters within the manifest of the first application with deployment parameters within a second manifest of the second application. 4. The method of claim 1, the conflict corresponding to:
a conflicting change to the computing environment during deployment of the application and the second application, the conflicting change associated with at least one of a resource access conflict, a file access conflict, and a registry access conflict. 5. The method of claim 1, the set of deployment rules corresponding to at least one of:
a threshold of allowable concurrent deployments; no concurrent deployment of applications from a similar application family, unless respective applications are deployed for registration; no concurrent deployment of applications creating a conflicting change to the computing environment; no concurrent deployment of applications creating a resource exhaustion; and no concurrent deployment of applications creating a resource conflict. 6. The method of claim 1, the executing a set of deployment rules comprising:
identifying, within the manifest, one or more dependent application packages associated with the application; and executing the set of deployment rules upon the one or more dependent application packages. 7. The method of claim 1, the deployment parameters within the manifest comprising at least one of:
a deployment action corresponding to at least one of: a download, an installation, a removal, and an update; one or more target resources to be utilized during deployment; one or more files to be utilized during deployment; one or more registry entries to be utilized during deployment; identification of the application; a version of the application; and an application family identification with which the application is associated. 8. The method of claim 1, comprising:
obtaining the manifest from an application store; and obtaining an application deployment package from the application store, the application deployment package comprising data used for deployment. 9. The method of claim 1, the computing environment comprising a multi-user environment, the application associated with a first user and the second application associated with a second user. 10. The method of claim 2, comprising:
removing an undeployed application from the queue based upon a deployment cancellation request. 11. The method of claim 2, comprising:
persisting the queue during a reboot of the computing environment. 12. The method of claim 12, comprising at least one of:
resuming the deployment of the application upon reboot; and rolling back the deployment of the application upon reboot. 13. A system for deploying an application, comprising:
a queue management component configured to:
identify an application that is queued within a queue for deployment within a computing environment; and
a deployment component configured to:
extract deployment parameters from a manifest associated with the application;
execute a set of deployment rules upon the deployment parameters to determine whether a conflict exists between the deployment parameters and a second application being deployed within the computing environment; and
upon determining no conflict exists, deploy the application concurrently with the second application. 14. The system of claim 13, the queue management component configured to:
iteratively traverse the queue of applications queued for deployment to deploy an optionally set threshold number of non-conflicting applications within the computing environment concurrently. 15. The system of claim 13, the computing environment comprising a multi-user environment, the application associated with a first user and the second application associated with a second user. 16. The system of claim 13, the conflict corresponding to:
a conflicting change to the computing environment during deployment of the application and the second application, the conflicting change associated with at least one of a resource access conflict, a file access conflict, and a registry access conflict. 17. The system of claim 13, the set of deployment rules corresponding to at least one of:
a threshold of allowable concurrent deployments; no concurrent deployment of applications from a similar application family, unless respective applications are deployed for registration; and no concurrent deployment of applications creating a conflicting change to the computing environment; no concurrent deployment of applications creating a resource exhaustion; and no concurrent deployment of applications creating a resource conflict. 18. The system of claim 13, the executing a set of deployment rules comprising:
identifying, within the manifest, one or more dependent application packages associated with the application; and executing the set of deployment rules upon the one or more dependent application packages. 19. The system of claim 13, the deployment parameters within the manifest comprising at least one of:
a deployment action corresponding to at least one of: a download, an installation, a removal, and an update; one or more target resources that are be utilized during deployment; one or more files that are be utilized during deployment; one or more registry entries that are be utilized during deployment; identification of the application; a version of the application; and an application family identification with which the application is associated. 20. A computer readable medium comprising computer executable instructions that when executed via a processing unit perform a method for deploying an application comprising:
receiving a request to deploy an application associated with a first user within a computing environment; obtaining a manifest associated with the application from an application store; executing a set of deployment rules upon deployment parameters within the manifest to determine whether a conflict exists between the deployment parameters and a second application being deployed by a second user within the computing environment, the executing comprising comparing the deployment parameters within the manifest associated with the application with deployment parameters within a second manifest of the second application; and upon determining no conflict exists:
obtaining an application deployment package from the application store, the application deployment package comprising data used for deployment of the application; and
deploying the application concurrently with the second application using the application deployment package. | One or more techniques and/or systems are provided for deploying an application within a computing environment. In particular, an application that is requested for deployment may be identified (e.g., an application to be downloaded, installed, updated, registered and/or removed during deployment). A set of deployment rules may be executed upon deployment parameters within a manifest (e.g., metadata describing how the application is to be deployed) to detect whether a conflict (e.g., issues that may arise from concurrent deployment) may exist between the deployment parameters and a second application currently being deployed within the computing environment. For example, resource access conflicts, file access conflicts, and/or registry access conflicts may be identified. If no conflicts exist, then the application may be concurrently deployed with the second application. In this way, applications associated with users may be concurrently deployed within the computing environment, while mitigating conflicts to achieve deployment parallelization.1. A method for deploying an application, comprising:
identifying an application that is requested for deployment within a computing environment; extracting deployment parameters from a manifest associated with the application; executing a set of deployment rules upon the deployment parameters to determine whether a conflict exists between the deployment parameters and a second application being deployed within the computing environment; and upon determining no conflict exists, deploying the application concurrently with the second application. 2. The method of claim 1, comprising:
iteratively traversing a queue of applications queued for deployment to deploy an optionally set threshold number of non-conflicting applications within the computing environment concurrently. 3. The method of claim 1, the executing a set of deployment rules comprising:
comparing the deployment parameters within the manifest of the first application with deployment parameters within a second manifest of the second application. 4. The method of claim 1, the conflict corresponding to:
a conflicting change to the computing environment during deployment of the application and the second application, the conflicting change associated with at least one of a resource access conflict, a file access conflict, and a registry access conflict. 5. The method of claim 1, the set of deployment rules corresponding to at least one of:
a threshold of allowable concurrent deployments; no concurrent deployment of applications from a similar application family, unless respective applications are deployed for registration; no concurrent deployment of applications creating a conflicting change to the computing environment; no concurrent deployment of applications creating a resource exhaustion; and no concurrent deployment of applications creating a resource conflict. 6. The method of claim 1, the executing a set of deployment rules comprising:
identifying, within the manifest, one or more dependent application packages associated with the application; and executing the set of deployment rules upon the one or more dependent application packages. 7. The method of claim 1, the deployment parameters within the manifest comprising at least one of:
a deployment action corresponding to at least one of: a download, an installation, a removal, and an update; one or more target resources to be utilized during deployment; one or more files to be utilized during deployment; one or more registry entries to be utilized during deployment; identification of the application; a version of the application; and an application family identification with which the application is associated. 8. The method of claim 1, comprising:
obtaining the manifest from an application store; and obtaining an application deployment package from the application store, the application deployment package comprising data used for deployment. 9. The method of claim 1, the computing environment comprising a multi-user environment, the application associated with a first user and the second application associated with a second user. 10. The method of claim 2, comprising:
removing an undeployed application from the queue based upon a deployment cancellation request. 11. The method of claim 2, comprising:
persisting the queue during a reboot of the computing environment. 12. The method of claim 12, comprising at least one of:
resuming the deployment of the application upon reboot; and rolling back the deployment of the application upon reboot. 13. A system for deploying an application, comprising:
a queue management component configured to:
identify an application that is queued within a queue for deployment within a computing environment; and
a deployment component configured to:
extract deployment parameters from a manifest associated with the application;
execute a set of deployment rules upon the deployment parameters to determine whether a conflict exists between the deployment parameters and a second application being deployed within the computing environment; and
upon determining no conflict exists, deploy the application concurrently with the second application. 14. The system of claim 13, the queue management component configured to:
iteratively traverse the queue of applications queued for deployment to deploy an optionally set threshold number of non-conflicting applications within the computing environment concurrently. 15. The system of claim 13, the computing environment comprising a multi-user environment, the application associated with a first user and the second application associated with a second user. 16. The system of claim 13, the conflict corresponding to:
a conflicting change to the computing environment during deployment of the application and the second application, the conflicting change associated with at least one of a resource access conflict, a file access conflict, and a registry access conflict. 17. The system of claim 13, the set of deployment rules corresponding to at least one of:
a threshold of allowable concurrent deployments; no concurrent deployment of applications from a similar application family, unless respective applications are deployed for registration; and no concurrent deployment of applications creating a conflicting change to the computing environment; no concurrent deployment of applications creating a resource exhaustion; and no concurrent deployment of applications creating a resource conflict. 18. The system of claim 13, the executing a set of deployment rules comprising:
identifying, within the manifest, one or more dependent application packages associated with the application; and executing the set of deployment rules upon the one or more dependent application packages. 19. The system of claim 13, the deployment parameters within the manifest comprising at least one of:
a deployment action corresponding to at least one of: a download, an installation, a removal, and an update; one or more target resources that are be utilized during deployment; one or more files that are be utilized during deployment; one or more registry entries that are be utilized during deployment; identification of the application; a version of the application; and an application family identification with which the application is associated. 20. A computer readable medium comprising computer executable instructions that when executed via a processing unit perform a method for deploying an application comprising:
receiving a request to deploy an application associated with a first user within a computing environment; obtaining a manifest associated with the application from an application store; executing a set of deployment rules upon deployment parameters within the manifest to determine whether a conflict exists between the deployment parameters and a second application being deployed by a second user within the computing environment, the executing comprising comparing the deployment parameters within the manifest associated with the application with deployment parameters within a second manifest of the second application; and upon determining no conflict exists:
obtaining an application deployment package from the application store, the application deployment package comprising data used for deployment of the application; and
deploying the application concurrently with the second application using the application deployment package. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.